/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/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_unwindbound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 12:35:52,781 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 12:35:52,782 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 12:35:52,803 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 12:35:52,805 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 12:35:52,806 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 12:35:52,809 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 12:35:52,816 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 12:35:52,818 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 12:35:52,821 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 12:35:52,821 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 12:35:52,822 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 12:35:52,822 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 12:35:52,824 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 12:35:52,824 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 12:35:52,825 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 12:35:52,826 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 12:35:52,826 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 12:35:52,829 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 12:35:52,833 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 12:35:52,834 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 12:35:52,835 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 12:35:52,835 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 12:35:52,836 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 12:35:52,836 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 12:35:52,841 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 12:35:52,841 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 12:35:52,841 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 12:35:52,842 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 12:35:52,842 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 12:35:52,843 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 12:35:52,843 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 12:35:52,844 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 12:35:52,845 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 12:35:52,845 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 12:35:52,845 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 12:35:52,846 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 12:35:52,846 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 12:35:52,846 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 12:35:52,846 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 12:35:52,847 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 12:35:52,848 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 12:35:52,848 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 12:35:52,856 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 12:35:52,856 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 12:35:52,857 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 12:35:52,857 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 12:35:52,857 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 12:35:52,857 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 12:35:52,858 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 12:35:52,858 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 12:35:52,858 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 12:35:52,858 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 12:35:52,858 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 12:35:52,858 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 12:35:52,859 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 12:35:52,859 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 12:35:52,859 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 12:35:52,859 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 12:35:52,859 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 12:35:52,859 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 12:35:52,859 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 12:35:52,859 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 12:35:52,859 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 12:35:52,859 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 12:35:52,859 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-08 12:35:53,058 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 12:35:53,076 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 12:35:53,078 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 12:35:53,079 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 12:35:53,079 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 12:35:53,080 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-08 12:35:53,129 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24ccda011/46a73b9d51374be093883272abd5bc86/FLAG5da314d74 [2022-04-08 12:35:53,496 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 12:35:53,497 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_unwindbound20.c [2022-04-08 12:35:53,503 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24ccda011/46a73b9d51374be093883272abd5bc86/FLAG5da314d74 [2022-04-08 12:35:53,513 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24ccda011/46a73b9d51374be093883272abd5bc86 [2022-04-08 12:35:53,514 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 12:35:53,516 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 12:35:53,518 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 12:35:53,518 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 12:35:53,521 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 12:35:53,524 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 12:35:53" (1/1) ... [2022-04-08 12:35:53,525 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fdfc30c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:35:53, skipping insertion in model container [2022-04-08 12:35:53,526 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 12:35:53" (1/1) ... [2022-04-08 12:35:53,530 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 12:35:53,540 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 12:35:53,678 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-08 12:35:53,704 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 12:35:53,709 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 12:35:53,720 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-08 12:35:53,726 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 12:35:53,737 INFO L208 MainTranslator]: Completed translation [2022-04-08 12:35:53,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:35:53 WrapperNode [2022-04-08 12:35:53,737 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 12:35:53,738 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 12:35:53,738 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 12:35:53,739 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 12:35:53,746 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:35:53" (1/1) ... [2022-04-08 12:35:53,746 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:35:53" (1/1) ... [2022-04-08 12:35:53,755 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:35:53" (1/1) ... [2022-04-08 12:35:53,756 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:35:53" (1/1) ... [2022-04-08 12:35:53,769 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:35:53" (1/1) ... [2022-04-08 12:35:53,772 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:35:53" (1/1) ... [2022-04-08 12:35:53,773 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:35:53" (1/1) ... [2022-04-08 12:35:53,774 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 12:35:53,775 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 12:35:53,775 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 12:35:53,775 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 12:35:53,778 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:35:53" (1/1) ... [2022-04-08 12:35:53,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 12:35:53,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:35:53,798 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-08 12:35:53,815 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-08 12:35:53,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 12:35:53,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 12:35:53,831 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 12:35:53,831 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 12:35:53,831 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 12:35:53,832 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 12:35:53,832 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 12:35:53,832 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 12:35:53,832 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 12:35:53,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 12:35:53,832 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 12:35:53,832 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 12:35:53,833 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 12:35:53,833 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 12:35:53,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 12:35:53,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 12:35:53,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 12:35:53,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 12:35:53,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 12:35:53,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 12:35:53,879 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 12:35:53,880 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 12:35:54,053 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 12:35:54,058 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 12:35:54,058 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-08 12:35:54,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 12:35:54 BoogieIcfgContainer [2022-04-08 12:35:54,059 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 12:35:54,061 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 12:35:54,061 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 12:35:54,066 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 12:35:54,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 12:35:53" (1/3) ... [2022-04-08 12:35:54,067 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f6eaee2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 12:35:54, skipping insertion in model container [2022-04-08 12:35:54,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:35:53" (2/3) ... [2022-04-08 12:35:54,067 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f6eaee2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 12:35:54, skipping insertion in model container [2022-04-08 12:35:54,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 12:35:54" (3/3) ... [2022-04-08 12:35:54,069 INFO L111 eAbstractionObserver]: Analyzing ICFG fermat1-ll_unwindbound20.c [2022-04-08 12:35:54,073 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 12:35:54,073 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 12:35:54,106 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 12:35:54,113 INFO L340 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 [2022-04-08 12:35:54,114 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 12:35:54,132 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-08 12:35:54,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 12:35:54,139 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:35:54,140 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:35:54,140 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:35:54,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:35:54,147 INFO L85 PathProgramCache]: Analyzing trace with hash 928708300, now seen corresponding path program 1 times [2022-04-08 12:35:54,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:35:54,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1205072244] [2022-04-08 12:35:54,161 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:35:54,162 INFO L85 PathProgramCache]: Analyzing trace with hash 928708300, now seen corresponding path program 2 times [2022-04-08 12:35:54,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:35:54,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500530817] [2022-04-08 12:35:54,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:35:54,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:35:54,260 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:35:54,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [460234692] [2022-04-08 12:35:54,260 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:35:54,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:35:54,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:35:54,262 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-08 12:35:54,262 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-08 12:35:54,319 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 12:35:54,319 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:35:54,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 1 conjunts are in the unsatisfiable core [2022-04-08 12:35:54,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:35:54,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:35:54,429 INFO L272 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {40#true} is VALID [2022-04-08 12:35:54,429 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-08 12:35:54,430 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-08 12:35:54,430 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #102#return; {40#true} is VALID [2022-04-08 12:35:54,430 INFO L272 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret9 := main(); {40#true} is VALID [2022-04-08 12:35:54,431 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-08 12:35:54,433 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-08 12:35:54,433 INFO L290 TraceCheckUtils]: 7: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-08 12:35:54,433 INFO L290 TraceCheckUtils]: 8: Hoare triple {40#true} assume 0 == ~cond;assume false; {40#true} is VALID [2022-04-08 12:35:54,434 INFO L290 TraceCheckUtils]: 9: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-08 12:35:54,434 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {40#true} {40#true} #90#return; {40#true} is VALID [2022-04-08 12:35:54,434 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-08 12:35:54,434 INFO L290 TraceCheckUtils]: 12: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-08 12:35:54,435 INFO L290 TraceCheckUtils]: 13: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-08 12:35:54,435 INFO L290 TraceCheckUtils]: 14: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-08 12:35:54,435 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {41#false} {40#true} #92#return; {41#false} is VALID [2022-04-08 12:35:54,435 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-08 12:35:54,436 INFO L290 TraceCheckUtils]: 17: Hoare triple {41#false} assume !true; {41#false} is VALID [2022-04-08 12:35:54,437 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-08 12:35:54,438 INFO L290 TraceCheckUtils]: 19: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2022-04-08 12:35:54,438 INFO L290 TraceCheckUtils]: 20: Hoare triple {41#false} assume 0 == ~cond; {41#false} is VALID [2022-04-08 12:35:54,438 INFO L290 TraceCheckUtils]: 21: Hoare triple {41#false} assume !false; {41#false} is VALID [2022-04-08 12:35:54,439 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-08 12:35:54,439 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 12:35:54,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:35:54,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500530817] [2022-04-08 12:35:54,440 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:35:54,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460234692] [2022-04-08 12:35:54,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460234692] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:35:54,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:35:54,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-08 12:35:54,443 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:35:54,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1205072244] [2022-04-08 12:35:54,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1205072244] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:35:54,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:35:54,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-08 12:35:54,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080163828] [2022-04-08 12:35:54,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:35:54,449 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-08 12:35:54,450 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:35:54,452 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-08 12:35:54,473 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-08 12:35:54,473 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-08 12:35:54,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:35:54,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-08 12:35:54,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-08 12:35:54,493 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-08 12:35:54,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:35:54,567 INFO L93 Difference]: Finished difference Result 67 states and 100 transitions. [2022-04-08 12:35:54,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-08 12:35:54,568 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-08 12:35:54,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:35:54,569 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-08 12:35:54,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 100 transitions. [2022-04-08 12:35:54,574 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-08 12:35:54,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 100 transitions. [2022-04-08 12:35:54,579 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2 states and 100 transitions. [2022-04-08 12:35:54,667 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-08 12:35:54,673 INFO L225 Difference]: With dead ends: 67 [2022-04-08 12:35:54,673 INFO L226 Difference]: Without dead ends: 32 [2022-04-08 12:35:54,675 INFO L912 BasicCegarLoop]: 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-08 12:35:54,677 INFO L913 BasicCegarLoop]: 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-08 12:35:54,678 INFO L914 BasicCegarLoop]: 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-08 12:35:54,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-08 12:35:54,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-08 12:35:54,696 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:35:54,696 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-08 12:35:54,697 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-08 12:35:54,697 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-08 12:35:54,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:35:54,701 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-08 12:35:54,701 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-08 12:35:54,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:35:54,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:35:54,702 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-08 12:35:54,702 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-08 12:35:54,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:35:54,705 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-08 12:35:54,705 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-08 12:35:54,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:35:54,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:35:54,706 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:35:54,706 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:35:54,706 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-08 12:35:54,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-04-08 12:35:54,726 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 22 [2022-04-08 12:35:54,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:35:54,726 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-04-08 12:35:54,726 INFO L479 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-08 12:35:54,726 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 41 transitions. [2022-04-08 12:35:54,757 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-08 12:35:54,758 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-08 12:35:54,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 12:35:54,758 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:35:54,758 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:35:54,782 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-08 12:35:54,960 WARN L460 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-08 12:35:54,961 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:35:54,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:35:54,961 INFO L85 PathProgramCache]: Analyzing trace with hash -155606603, now seen corresponding path program 1 times [2022-04-08 12:35:54,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:35:54,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1890863356] [2022-04-08 12:35:54,962 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:35:54,962 INFO L85 PathProgramCache]: Analyzing trace with hash -155606603, now seen corresponding path program 2 times [2022-04-08 12:35:54,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:35:54,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382911480] [2022-04-08 12:35:54,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:35:54,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:35:54,991 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:35:54,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [228204774] [2022-04-08 12:35:54,991 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:35:54,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:35:54,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:35:54,995 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-08 12:35:54,996 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-08 12:35:55,040 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 12:35:55,040 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:35:55,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 12:35:55,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:35:55,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:35:55,208 INFO L272 TraceCheckUtils]: 0: Hoare triple {369#true} call ULTIMATE.init(); {369#true} is VALID [2022-04-08 12:35:55,209 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-08 12:35:55,209 INFO L290 TraceCheckUtils]: 2: Hoare triple {377#(<= ~counter~0 0)} assume true; {377#(<= ~counter~0 0)} is VALID [2022-04-08 12:35:55,210 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {377#(<= ~counter~0 0)} {369#true} #102#return; {377#(<= ~counter~0 0)} is VALID [2022-04-08 12:35:55,210 INFO L272 TraceCheckUtils]: 4: Hoare triple {377#(<= ~counter~0 0)} call #t~ret9 := main(); {377#(<= ~counter~0 0)} is VALID [2022-04-08 12:35:55,211 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-08 12:35:55,212 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-08 12:35:55,212 INFO L290 TraceCheckUtils]: 7: Hoare triple {377#(<= ~counter~0 0)} ~cond := #in~cond; {377#(<= ~counter~0 0)} is VALID [2022-04-08 12:35:55,213 INFO L290 TraceCheckUtils]: 8: Hoare triple {377#(<= ~counter~0 0)} assume !(0 == ~cond); {377#(<= ~counter~0 0)} is VALID [2022-04-08 12:35:55,213 INFO L290 TraceCheckUtils]: 9: Hoare triple {377#(<= ~counter~0 0)} assume true; {377#(<= ~counter~0 0)} is VALID [2022-04-08 12:35:55,214 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {377#(<= ~counter~0 0)} {377#(<= ~counter~0 0)} #90#return; {377#(<= ~counter~0 0)} is VALID [2022-04-08 12:35:55,214 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-08 12:35:55,215 INFO L290 TraceCheckUtils]: 12: Hoare triple {377#(<= ~counter~0 0)} ~cond := #in~cond; {377#(<= ~counter~0 0)} is VALID [2022-04-08 12:35:55,216 INFO L290 TraceCheckUtils]: 13: Hoare triple {377#(<= ~counter~0 0)} assume !(0 == ~cond); {377#(<= ~counter~0 0)} is VALID [2022-04-08 12:35:55,216 INFO L290 TraceCheckUtils]: 14: Hoare triple {377#(<= ~counter~0 0)} assume true; {377#(<= ~counter~0 0)} is VALID [2022-04-08 12:35:55,218 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {377#(<= ~counter~0 0)} {377#(<= ~counter~0 0)} #92#return; {377#(<= ~counter~0 0)} is VALID [2022-04-08 12:35:55,218 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-08 12:35:55,218 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-08 12:35:55,219 INFO L290 TraceCheckUtils]: 18: Hoare triple {426#(<= |main_#t~post6| 0)} assume !(#t~post6 < 20);havoc #t~post6; {370#false} is VALID [2022-04-08 12:35:55,219 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-08 12:35:55,220 INFO L290 TraceCheckUtils]: 20: Hoare triple {370#false} ~cond := #in~cond; {370#false} is VALID [2022-04-08 12:35:55,220 INFO L290 TraceCheckUtils]: 21: Hoare triple {370#false} assume 0 == ~cond; {370#false} is VALID [2022-04-08 12:35:55,221 INFO L290 TraceCheckUtils]: 22: Hoare triple {370#false} assume !false; {370#false} is VALID [2022-04-08 12:35:55,221 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-08 12:35:55,221 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 12:35:55,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:35:55,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382911480] [2022-04-08 12:35:55,222 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:35:55,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228204774] [2022-04-08 12:35:55,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [228204774] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:35:55,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:35:55,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 12:35:55,223 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:35:55,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1890863356] [2022-04-08 12:35:55,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1890863356] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:35:55,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:35:55,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 12:35:55,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784265268] [2022-04-08 12:35:55,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:35:55,226 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-08 12:35:55,227 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:35:55,227 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-08 12:35:55,243 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-08 12:35:55,243 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 12:35:55,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:35:55,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 12:35:55,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 12:35:55,245 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-08 12:35:55,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:35:55,326 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2022-04-08 12:35:55,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 12:35:55,326 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-08 12:35:55,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:35:55,327 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-08 12:35:55,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-04-08 12:35:55,333 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-08 12:35:55,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-04-08 12:35:55,334 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 50 transitions. [2022-04-08 12:35:55,368 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-08 12:35:55,370 INFO L225 Difference]: With dead ends: 41 [2022-04-08 12:35:55,370 INFO L226 Difference]: Without dead ends: 34 [2022-04-08 12:35:55,370 INFO L912 BasicCegarLoop]: 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-08 12:35:55,371 INFO L913 BasicCegarLoop]: 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-08 12:35:55,372 INFO L914 BasicCegarLoop]: 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-08 12:35:55,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-08 12:35:55,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-08 12:35:55,381 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:35:55,382 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-08 12:35:55,382 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-08 12:35:55,382 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-08 12:35:55,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:35:55,387 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-08 12:35:55,387 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-08 12:35:55,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:35:55,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:35:55,388 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-08 12:35:55,389 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-08 12:35:55,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:35:55,390 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-08 12:35:55,391 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-08 12:35:55,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:35:55,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:35:55,391 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:35:55,391 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:35:55,392 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-08 12:35:55,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2022-04-08 12:35:55,393 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 23 [2022-04-08 12:35:55,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:35:55,394 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-04-08 12:35:55,394 INFO L479 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-08 12:35:55,394 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 43 transitions. [2022-04-08 12:35:55,435 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-08 12:35:55,435 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-08 12:35:55,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 12:35:55,436 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:35:55,437 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:35:55,457 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-08 12:35:55,647 WARN L460 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-08 12:35:55,648 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:35:55,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:35:55,648 INFO L85 PathProgramCache]: Analyzing trace with hash -153938307, now seen corresponding path program 1 times [2022-04-08 12:35:55,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:35:55,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [732401286] [2022-04-08 12:35:55,649 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:35:55,649 INFO L85 PathProgramCache]: Analyzing trace with hash -153938307, now seen corresponding path program 2 times [2022-04-08 12:35:55,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:35:55,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116164694] [2022-04-08 12:35:55,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:35:55,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:35:55,663 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:35:55,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1435492613] [2022-04-08 12:35:55,664 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:35:55,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:35:55,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:35:55,665 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-08 12:35:55,666 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-08 12:35:55,709 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 12:35:55,709 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:35:55,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-08 12:35:55,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:35:55,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:35:55,979 INFO L272 TraceCheckUtils]: 0: Hoare triple {659#true} call ULTIMATE.init(); {659#true} is VALID [2022-04-08 12:35:55,979 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-08 12:35:55,979 INFO L290 TraceCheckUtils]: 2: Hoare triple {659#true} assume true; {659#true} is VALID [2022-04-08 12:35:55,979 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {659#true} {659#true} #102#return; {659#true} is VALID [2022-04-08 12:35:55,979 INFO L272 TraceCheckUtils]: 4: Hoare triple {659#true} call #t~ret9 := main(); {659#true} is VALID [2022-04-08 12:35:55,979 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-08 12:35:55,980 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-08 12:35:55,980 INFO L290 TraceCheckUtils]: 7: Hoare triple {659#true} ~cond := #in~cond; {659#true} is VALID [2022-04-08 12:35:55,980 INFO L290 TraceCheckUtils]: 8: Hoare triple {659#true} assume !(0 == ~cond); {659#true} is VALID [2022-04-08 12:35:55,980 INFO L290 TraceCheckUtils]: 9: Hoare triple {659#true} assume true; {659#true} is VALID [2022-04-08 12:35:55,980 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {659#true} {659#true} #90#return; {659#true} is VALID [2022-04-08 12:35:55,980 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-08 12:35:55,980 INFO L290 TraceCheckUtils]: 12: Hoare triple {659#true} ~cond := #in~cond; {659#true} is VALID [2022-04-08 12:35:55,981 INFO L290 TraceCheckUtils]: 13: Hoare triple {659#true} assume !(0 == ~cond); {659#true} is VALID [2022-04-08 12:35:55,981 INFO L290 TraceCheckUtils]: 14: Hoare triple {659#true} assume true; {659#true} is VALID [2022-04-08 12:35:55,981 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {659#true} {659#true} #92#return; {659#true} is VALID [2022-04-08 12:35:57,672 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-08 12:35:57,675 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-08 12:35:57,676 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-08 12:35:57,899 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-08 12:35:57,900 INFO L290 TraceCheckUtils]: 20: Hoare triple {722#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {726#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:35:57,900 INFO L290 TraceCheckUtils]: 21: Hoare triple {726#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {660#false} is VALID [2022-04-08 12:35:57,901 INFO L290 TraceCheckUtils]: 22: Hoare triple {660#false} assume !false; {660#false} is VALID [2022-04-08 12:35:57,901 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-08 12:35:57,901 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 12:35:57,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:35:57,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116164694] [2022-04-08 12:35:57,901 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:35:57,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435492613] [2022-04-08 12:35:57,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435492613] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:35:57,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:35:57,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 12:35:57,902 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:35:57,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [732401286] [2022-04-08 12:35:57,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [732401286] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:35:57,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:35:57,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 12:35:57,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203964798] [2022-04-08 12:35:57,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:35:57,903 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-08 12:35:57,903 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:35:57,903 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-08 12:36:00,298 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-08 12:36:00,298 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 12:36:00,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:36:00,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 12:36:00,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 12:36:00,299 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-08 12:36:01,592 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 12:36:02,798 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 12:36:06,608 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 12:36:09,387 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 12:36:11,338 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 12:36:13,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:13,641 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2022-04-08 12:36:13,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 12:36:13,641 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-08 12:36:13,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:36:13,642 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-08 12:36:13,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-04-08 12:36:13,644 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-08 12:36:13,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-04-08 12:36:13,646 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 68 transitions. [2022-04-08 12:36:19,950 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-08 12:36:19,951 INFO L225 Difference]: With dead ends: 53 [2022-04-08 12:36:19,952 INFO L226 Difference]: Without dead ends: 51 [2022-04-08 12:36:19,952 INFO L912 BasicCegarLoop]: 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-08 12:36:19,952 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 16 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2022-04-08 12:36:19,953 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 116 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 9.1s Time] [2022-04-08 12:36:19,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-08 12:36:19,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-04-08 12:36:19,970 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:36:19,970 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-08 12:36:19,971 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-08 12:36:19,971 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-08 12:36:19,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:19,973 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2022-04-08 12:36:19,973 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2022-04-08 12:36:19,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:36:19,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:36:19,974 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-08 12:36:19,974 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-08 12:36:19,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:19,981 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2022-04-08 12:36:19,981 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2022-04-08 12:36:19,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:36:19,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:36:19,982 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:36:19,982 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:36:19,982 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-08 12:36:19,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 67 transitions. [2022-04-08 12:36:19,986 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 67 transitions. Word has length 23 [2022-04-08 12:36:19,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:36:19,986 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 67 transitions. [2022-04-08 12:36:19,986 INFO L479 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-08 12:36:19,986 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 67 transitions. [2022-04-08 12:36:26,156 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 65 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-08 12:36:26,157 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 67 transitions. [2022-04-08 12:36:26,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 12:36:26,157 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:36:26,157 INFO L499 BasicCegarLoop]: 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-08 12:36:26,177 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-08 12:36:26,358 WARN L460 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-08 12:36:26,358 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:36:26,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:36:26,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1676885497, now seen corresponding path program 1 times [2022-04-08 12:36:26,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:36:26,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [115531222] [2022-04-08 12:36:26,359 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:36:26,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1676885497, now seen corresponding path program 2 times [2022-04-08 12:36:26,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:36:26,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504770716] [2022-04-08 12:36:26,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:36:26,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:36:26,371 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:36:26,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1663377777] [2022-04-08 12:36:26,372 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:36:26,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:36:26,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:36:26,378 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-08 12:36:26,379 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-08 12:36:26,422 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:36:26,422 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:36:26,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-08 12:36:26,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:36:26,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:36:26,585 INFO L272 TraceCheckUtils]: 0: Hoare triple {1042#true} call ULTIMATE.init(); {1042#true} is VALID [2022-04-08 12:36:26,585 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-08 12:36:26,585 INFO L290 TraceCheckUtils]: 2: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-08 12:36:26,585 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1042#true} {1042#true} #102#return; {1042#true} is VALID [2022-04-08 12:36:26,585 INFO L272 TraceCheckUtils]: 4: Hoare triple {1042#true} call #t~ret9 := main(); {1042#true} is VALID [2022-04-08 12:36:26,585 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-08 12:36:26,586 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-08 12:36:26,586 INFO L290 TraceCheckUtils]: 7: Hoare triple {1042#true} ~cond := #in~cond; {1042#true} is VALID [2022-04-08 12:36:26,586 INFO L290 TraceCheckUtils]: 8: Hoare triple {1042#true} assume !(0 == ~cond); {1042#true} is VALID [2022-04-08 12:36:26,586 INFO L290 TraceCheckUtils]: 9: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-08 12:36:26,586 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1042#true} {1042#true} #90#return; {1042#true} is VALID [2022-04-08 12:36:26,586 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-08 12:36:26,586 INFO L290 TraceCheckUtils]: 12: Hoare triple {1042#true} ~cond := #in~cond; {1042#true} is VALID [2022-04-08 12:36:26,587 INFO L290 TraceCheckUtils]: 13: Hoare triple {1042#true} assume !(0 == ~cond); {1042#true} is VALID [2022-04-08 12:36:26,587 INFO L290 TraceCheckUtils]: 14: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-08 12:36:26,587 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1042#true} {1042#true} #92#return; {1042#true} is VALID [2022-04-08 12:36:26,587 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-08 12:36:26,587 INFO L290 TraceCheckUtils]: 17: Hoare triple {1042#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1042#true} is VALID [2022-04-08 12:36:26,587 INFO L290 TraceCheckUtils]: 18: Hoare triple {1042#true} assume !!(#t~post6 < 20);havoc #t~post6; {1042#true} is VALID [2022-04-08 12:36:26,587 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-08 12:36:26,589 INFO L290 TraceCheckUtils]: 20: Hoare triple {1042#true} ~cond := #in~cond; {1107#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:36:26,590 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-08 12:36:26,590 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-08 12:36:26,591 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-08 12:36:26,592 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-08 12:36:26,592 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-08 12:36:26,593 INFO L290 TraceCheckUtils]: 26: Hoare triple {1126#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1130#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:36:26,593 INFO L290 TraceCheckUtils]: 27: Hoare triple {1130#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1043#false} is VALID [2022-04-08 12:36:26,593 INFO L290 TraceCheckUtils]: 28: Hoare triple {1043#false} assume !false; {1043#false} is VALID [2022-04-08 12:36:26,594 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-08 12:36:26,594 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:36:26,963 INFO L290 TraceCheckUtils]: 28: Hoare triple {1043#false} assume !false; {1043#false} is VALID [2022-04-08 12:36:26,964 INFO L290 TraceCheckUtils]: 27: Hoare triple {1130#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1043#false} is VALID [2022-04-08 12:36:26,964 INFO L290 TraceCheckUtils]: 26: Hoare triple {1126#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1130#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:36:26,965 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-08 12:36:26,965 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-08 12:36:26,966 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-08 12:36:26,966 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-08 12:36:26,967 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-08 12:36:26,975 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-08 12:36:26,976 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-08 12:36:26,976 INFO L290 TraceCheckUtils]: 18: Hoare triple {1042#true} assume !!(#t~post6 < 20);havoc #t~post6; {1042#true} is VALID [2022-04-08 12:36:26,976 INFO L290 TraceCheckUtils]: 17: Hoare triple {1042#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1042#true} is VALID [2022-04-08 12:36:26,976 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-08 12:36:26,976 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1042#true} {1042#true} #92#return; {1042#true} is VALID [2022-04-08 12:36:26,976 INFO L290 TraceCheckUtils]: 14: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-08 12:36:26,976 INFO L290 TraceCheckUtils]: 13: Hoare triple {1042#true} assume !(0 == ~cond); {1042#true} is VALID [2022-04-08 12:36:26,977 INFO L290 TraceCheckUtils]: 12: Hoare triple {1042#true} ~cond := #in~cond; {1042#true} is VALID [2022-04-08 12:36:26,978 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-08 12:36:26,978 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1042#true} {1042#true} #90#return; {1042#true} is VALID [2022-04-08 12:36:26,978 INFO L290 TraceCheckUtils]: 9: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-08 12:36:26,979 INFO L290 TraceCheckUtils]: 8: Hoare triple {1042#true} assume !(0 == ~cond); {1042#true} is VALID [2022-04-08 12:36:26,979 INFO L290 TraceCheckUtils]: 7: Hoare triple {1042#true} ~cond := #in~cond; {1042#true} is VALID [2022-04-08 12:36:26,989 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-08 12:36:26,989 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-08 12:36:26,989 INFO L272 TraceCheckUtils]: 4: Hoare triple {1042#true} call #t~ret9 := main(); {1042#true} is VALID [2022-04-08 12:36:26,990 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1042#true} {1042#true} #102#return; {1042#true} is VALID [2022-04-08 12:36:26,990 INFO L290 TraceCheckUtils]: 2: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-08 12:36:26,990 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-08 12:36:26,990 INFO L272 TraceCheckUtils]: 0: Hoare triple {1042#true} call ULTIMATE.init(); {1042#true} is VALID [2022-04-08 12:36:26,990 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-08 12:36:26,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:36:26,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504770716] [2022-04-08 12:36:26,991 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:36:26,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663377777] [2022-04-08 12:36:26,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1663377777] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:36:26,991 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:36:26,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-08 12:36:26,991 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:36:26,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [115531222] [2022-04-08 12:36:26,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [115531222] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:36:26,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:36:26,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 12:36:26,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892103598] [2022-04-08 12:36:26,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:36:26,992 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-08 12:36:26,992 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:36:26,992 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-08 12:36:27,008 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-08 12:36:27,008 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 12:36:27,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:36:27,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 12:36:27,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-08 12:36:27,009 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-08 12:36:27,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:27,474 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2022-04-08 12:36:27,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 12:36:27,474 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-08 12:36:27,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:36:27,475 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-08 12:36:27,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-08 12:36:27,476 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-08 12:36:27,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-08 12:36:27,477 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 47 transitions. [2022-04-08 12:36:27,518 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-08 12:36:27,519 INFO L225 Difference]: With dead ends: 57 [2022-04-08 12:36:27,519 INFO L226 Difference]: Without dead ends: 52 [2022-04-08 12:36:27,520 INFO L912 BasicCegarLoop]: 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-08 12:36:27,520 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 25 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-08 12:36:27,521 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 135 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 12:36:27,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-08 12:36:27,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 36. [2022-04-08 12:36:27,536 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:36:27,536 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-08 12:36:27,536 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-08 12:36:27,537 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-08 12:36:27,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:27,539 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-08 12:36:27,539 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-08 12:36:27,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:36:27,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:36:27,539 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-08 12:36:27,540 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-08 12:36:27,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:27,541 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-08 12:36:27,541 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-08 12:36:27,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:36:27,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:36:27,542 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:36:27,542 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:36:27,542 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-08 12:36:27,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2022-04-08 12:36:27,543 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 29 [2022-04-08 12:36:27,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:36:27,544 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2022-04-08 12:36:27,544 INFO L479 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-08 12:36:27,544 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 43 transitions. [2022-04-08 12:36:28,673 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-08 12:36:28,673 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-04-08 12:36:28,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-08 12:36:28,674 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:36:28,674 INFO L499 BasicCegarLoop]: 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-08 12:36:28,690 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-08 12:36:28,883 WARN L460 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-08 12:36:28,883 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:36:28,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:36:28,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1154059858, now seen corresponding path program 1 times [2022-04-08 12:36:28,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:36:28,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1394498151] [2022-04-08 12:36:28,884 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:36:28,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1154059858, now seen corresponding path program 2 times [2022-04-08 12:36:28,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:36:28,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533422337] [2022-04-08 12:36:28,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:36:28,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:36:28,900 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:36:28,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [417765237] [2022-04-08 12:36:28,900 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:36:28,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:36:28,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:36:28,901 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-08 12:36:28,902 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-08 12:36:29,056 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:36:29,057 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:36:29,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 12:36:29,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:36:29,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:36:29,228 INFO L272 TraceCheckUtils]: 0: Hoare triple {1521#true} call ULTIMATE.init(); {1521#true} is VALID [2022-04-08 12:36:29,229 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-08 12:36:29,230 INFO L290 TraceCheckUtils]: 2: Hoare triple {1529#(<= ~counter~0 0)} assume true; {1529#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:29,230 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1529#(<= ~counter~0 0)} {1521#true} #102#return; {1529#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:29,231 INFO L272 TraceCheckUtils]: 4: Hoare triple {1529#(<= ~counter~0 0)} call #t~ret9 := main(); {1529#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:29,231 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-08 12:36:29,231 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-08 12:36:29,232 INFO L290 TraceCheckUtils]: 7: Hoare triple {1529#(<= ~counter~0 0)} ~cond := #in~cond; {1529#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:29,232 INFO L290 TraceCheckUtils]: 8: Hoare triple {1529#(<= ~counter~0 0)} assume !(0 == ~cond); {1529#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:29,232 INFO L290 TraceCheckUtils]: 9: Hoare triple {1529#(<= ~counter~0 0)} assume true; {1529#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:29,233 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1529#(<= ~counter~0 0)} {1529#(<= ~counter~0 0)} #90#return; {1529#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:29,233 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-08 12:36:29,233 INFO L290 TraceCheckUtils]: 12: Hoare triple {1529#(<= ~counter~0 0)} ~cond := #in~cond; {1529#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:29,234 INFO L290 TraceCheckUtils]: 13: Hoare triple {1529#(<= ~counter~0 0)} assume !(0 == ~cond); {1529#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:29,234 INFO L290 TraceCheckUtils]: 14: Hoare triple {1529#(<= ~counter~0 0)} assume true; {1529#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:29,234 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1529#(<= ~counter~0 0)} {1529#(<= ~counter~0 0)} #92#return; {1529#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:29,234 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-08 12:36:29,235 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-08 12:36:29,235 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-08 12:36:29,236 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-08 12:36:29,236 INFO L290 TraceCheckUtils]: 20: Hoare triple {1578#(<= ~counter~0 1)} ~cond := #in~cond; {1578#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:29,236 INFO L290 TraceCheckUtils]: 21: Hoare triple {1578#(<= ~counter~0 1)} assume !(0 == ~cond); {1578#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:29,237 INFO L290 TraceCheckUtils]: 22: Hoare triple {1578#(<= ~counter~0 1)} assume true; {1578#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:29,237 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1578#(<= ~counter~0 1)} {1578#(<= ~counter~0 1)} #94#return; {1578#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:29,237 INFO L290 TraceCheckUtils]: 24: Hoare triple {1578#(<= ~counter~0 1)} assume !!(0 != ~r~0); {1578#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:29,238 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-08 12:36:29,238 INFO L290 TraceCheckUtils]: 26: Hoare triple {1603#(<= |main_#t~post7| 1)} assume !(#t~post7 < 20);havoc #t~post7; {1522#false} is VALID [2022-04-08 12:36:29,238 INFO L290 TraceCheckUtils]: 27: Hoare triple {1522#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {1522#false} is VALID [2022-04-08 12:36:29,238 INFO L290 TraceCheckUtils]: 28: Hoare triple {1522#false} assume !(#t~post8 < 20);havoc #t~post8; {1522#false} is VALID [2022-04-08 12:36:29,238 INFO L290 TraceCheckUtils]: 29: Hoare triple {1522#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1522#false} is VALID [2022-04-08 12:36:29,239 INFO L290 TraceCheckUtils]: 30: Hoare triple {1522#false} assume !(#t~post6 < 20);havoc #t~post6; {1522#false} is VALID [2022-04-08 12:36:29,239 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-08 12:36:29,239 INFO L290 TraceCheckUtils]: 32: Hoare triple {1522#false} ~cond := #in~cond; {1522#false} is VALID [2022-04-08 12:36:29,239 INFO L290 TraceCheckUtils]: 33: Hoare triple {1522#false} assume 0 == ~cond; {1522#false} is VALID [2022-04-08 12:36:29,239 INFO L290 TraceCheckUtils]: 34: Hoare triple {1522#false} assume !false; {1522#false} is VALID [2022-04-08 12:36:29,239 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-08 12:36:29,239 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 12:36:29,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:36:29,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533422337] [2022-04-08 12:36:29,240 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:36:29,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417765237] [2022-04-08 12:36:29,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [417765237] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:36:29,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:36:29,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 12:36:29,240 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:36:29,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1394498151] [2022-04-08 12:36:29,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1394498151] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:36:29,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:36:29,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 12:36:29,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787386010] [2022-04-08 12:36:29,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:36:29,241 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-08 12:36:29,242 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:36:29,242 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-08 12:36:29,259 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-08 12:36:29,259 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 12:36:29,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:36:29,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 12:36:29,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-08 12:36:29,260 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-08 12:36:29,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:29,399 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2022-04-08 12:36:29,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 12:36:29,400 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-08 12:36:29,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:36:29,400 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-08 12:36:29,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-04-08 12:36:29,401 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-08 12:36:29,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-04-08 12:36:29,403 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 77 transitions. [2022-04-08 12:36:29,460 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-08 12:36:29,461 INFO L225 Difference]: With dead ends: 65 [2022-04-08 12:36:29,461 INFO L226 Difference]: Without dead ends: 44 [2022-04-08 12:36:29,461 INFO L912 BasicCegarLoop]: 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-08 12:36:29,462 INFO L913 BasicCegarLoop]: 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-08 12:36:29,462 INFO L914 BasicCegarLoop]: 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-08 12:36:29,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-08 12:36:29,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-08 12:36:29,485 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:36:29,485 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-08 12:36:29,486 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-08 12:36:29,486 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-08 12:36:29,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:29,487 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-04-08 12:36:29,487 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-04-08 12:36:29,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:36:29,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:36:29,488 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-08 12:36:29,488 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-08 12:36:29,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:29,489 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-04-08 12:36:29,489 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-04-08 12:36:29,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:36:29,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:36:29,489 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:36:29,489 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:36:29,490 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-08 12:36:29,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2022-04-08 12:36:29,491 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 35 [2022-04-08 12:36:29,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:36:29,491 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2022-04-08 12:36:29,491 INFO L479 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-08 12:36:29,491 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 51 transitions. [2022-04-08 12:36:30,932 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-08 12:36:30,932 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-04-08 12:36:30,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-08 12:36:30,933 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:36:30,933 INFO L499 BasicCegarLoop]: 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-08 12:36:30,939 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-08 12:36:31,135 WARN L460 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-08 12:36:31,136 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:36:31,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:36:31,136 INFO L85 PathProgramCache]: Analyzing trace with hash -174895632, now seen corresponding path program 1 times [2022-04-08 12:36:31,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:36:31,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [770842217] [2022-04-08 12:36:31,136 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:36:31,137 INFO L85 PathProgramCache]: Analyzing trace with hash -174895632, now seen corresponding path program 2 times [2022-04-08 12:36:31,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:36:31,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717155099] [2022-04-08 12:36:31,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:36:31,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:36:31,160 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:36:31,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [236370071] [2022-04-08 12:36:31,161 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:36:31,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:36:31,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:36:31,162 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-08 12:36:31,163 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-08 12:36:31,200 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:36:31,201 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:36:31,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 12:36:31,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:36:31,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:36:31,409 INFO L272 TraceCheckUtils]: 0: Hoare triple {1936#true} call ULTIMATE.init(); {1936#true} is VALID [2022-04-08 12:36:31,410 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-08 12:36:31,410 INFO L290 TraceCheckUtils]: 2: Hoare triple {1944#(<= ~counter~0 0)} assume true; {1944#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:31,411 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1944#(<= ~counter~0 0)} {1936#true} #102#return; {1944#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:31,411 INFO L272 TraceCheckUtils]: 4: Hoare triple {1944#(<= ~counter~0 0)} call #t~ret9 := main(); {1944#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:31,412 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-08 12:36:31,412 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-08 12:36:31,413 INFO L290 TraceCheckUtils]: 7: Hoare triple {1944#(<= ~counter~0 0)} ~cond := #in~cond; {1944#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:31,413 INFO L290 TraceCheckUtils]: 8: Hoare triple {1944#(<= ~counter~0 0)} assume !(0 == ~cond); {1944#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:31,413 INFO L290 TraceCheckUtils]: 9: Hoare triple {1944#(<= ~counter~0 0)} assume true; {1944#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:31,414 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1944#(<= ~counter~0 0)} {1944#(<= ~counter~0 0)} #90#return; {1944#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:31,414 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-08 12:36:31,414 INFO L290 TraceCheckUtils]: 12: Hoare triple {1944#(<= ~counter~0 0)} ~cond := #in~cond; {1944#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:31,415 INFO L290 TraceCheckUtils]: 13: Hoare triple {1944#(<= ~counter~0 0)} assume !(0 == ~cond); {1944#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:31,415 INFO L290 TraceCheckUtils]: 14: Hoare triple {1944#(<= ~counter~0 0)} assume true; {1944#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:31,416 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1944#(<= ~counter~0 0)} {1944#(<= ~counter~0 0)} #92#return; {1944#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:31,416 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-08 12:36:31,417 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-08 12:36:31,417 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-08 12:36:31,417 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-08 12:36:31,418 INFO L290 TraceCheckUtils]: 20: Hoare triple {1993#(<= ~counter~0 1)} ~cond := #in~cond; {1993#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:31,418 INFO L290 TraceCheckUtils]: 21: Hoare triple {1993#(<= ~counter~0 1)} assume !(0 == ~cond); {1993#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:31,418 INFO L290 TraceCheckUtils]: 22: Hoare triple {1993#(<= ~counter~0 1)} assume true; {1993#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:31,419 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1993#(<= ~counter~0 1)} {1993#(<= ~counter~0 1)} #94#return; {1993#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:31,419 INFO L290 TraceCheckUtils]: 24: Hoare triple {1993#(<= ~counter~0 1)} assume !!(0 != ~r~0); {1993#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:31,420 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-08 12:36:31,420 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-08 12:36:31,421 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-08 12:36:31,421 INFO L290 TraceCheckUtils]: 28: Hoare triple {2018#(<= ~counter~0 2)} ~cond := #in~cond; {2018#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:31,421 INFO L290 TraceCheckUtils]: 29: Hoare triple {2018#(<= ~counter~0 2)} assume !(0 == ~cond); {2018#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:31,422 INFO L290 TraceCheckUtils]: 30: Hoare triple {2018#(<= ~counter~0 2)} assume true; {2018#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:31,422 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2018#(<= ~counter~0 2)} {2018#(<= ~counter~0 2)} #96#return; {2018#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:31,423 INFO L290 TraceCheckUtils]: 32: Hoare triple {2018#(<= ~counter~0 2)} assume !(~r~0 > 0); {2018#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:31,423 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-08 12:36:31,424 INFO L290 TraceCheckUtils]: 34: Hoare triple {2043#(<= |main_#t~post8| 2)} assume !(#t~post8 < 20);havoc #t~post8; {1937#false} is VALID [2022-04-08 12:36:31,424 INFO L290 TraceCheckUtils]: 35: Hoare triple {1937#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1937#false} is VALID [2022-04-08 12:36:31,424 INFO L290 TraceCheckUtils]: 36: Hoare triple {1937#false} assume !(#t~post6 < 20);havoc #t~post6; {1937#false} is VALID [2022-04-08 12:36:31,424 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-08 12:36:31,424 INFO L290 TraceCheckUtils]: 38: Hoare triple {1937#false} ~cond := #in~cond; {1937#false} is VALID [2022-04-08 12:36:31,424 INFO L290 TraceCheckUtils]: 39: Hoare triple {1937#false} assume 0 == ~cond; {1937#false} is VALID [2022-04-08 12:36:31,424 INFO L290 TraceCheckUtils]: 40: Hoare triple {1937#false} assume !false; {1937#false} is VALID [2022-04-08 12:36:31,424 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-08 12:36:31,424 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:36:31,633 INFO L290 TraceCheckUtils]: 40: Hoare triple {1937#false} assume !false; {1937#false} is VALID [2022-04-08 12:36:31,633 INFO L290 TraceCheckUtils]: 39: Hoare triple {1937#false} assume 0 == ~cond; {1937#false} is VALID [2022-04-08 12:36:31,633 INFO L290 TraceCheckUtils]: 38: Hoare triple {1937#false} ~cond := #in~cond; {1937#false} is VALID [2022-04-08 12:36:31,633 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-08 12:36:31,633 INFO L290 TraceCheckUtils]: 36: Hoare triple {1937#false} assume !(#t~post6 < 20);havoc #t~post6; {1937#false} is VALID [2022-04-08 12:36:31,633 INFO L290 TraceCheckUtils]: 35: Hoare triple {1937#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1937#false} is VALID [2022-04-08 12:36:31,634 INFO L290 TraceCheckUtils]: 34: Hoare triple {2083#(< |main_#t~post8| 20)} assume !(#t~post8 < 20);havoc #t~post8; {1937#false} is VALID [2022-04-08 12:36:31,634 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-08 12:36:31,635 INFO L290 TraceCheckUtils]: 32: Hoare triple {2087#(< ~counter~0 20)} assume !(~r~0 > 0); {2087#(< ~counter~0 20)} is VALID [2022-04-08 12:36:31,635 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1936#true} {2087#(< ~counter~0 20)} #96#return; {2087#(< ~counter~0 20)} is VALID [2022-04-08 12:36:31,635 INFO L290 TraceCheckUtils]: 30: Hoare triple {1936#true} assume true; {1936#true} is VALID [2022-04-08 12:36:31,635 INFO L290 TraceCheckUtils]: 29: Hoare triple {1936#true} assume !(0 == ~cond); {1936#true} is VALID [2022-04-08 12:36:31,636 INFO L290 TraceCheckUtils]: 28: Hoare triple {1936#true} ~cond := #in~cond; {1936#true} is VALID [2022-04-08 12:36:31,636 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-08 12:36:31,636 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-08 12:36:31,637 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-08 12:36:31,637 INFO L290 TraceCheckUtils]: 24: Hoare triple {2112#(< ~counter~0 19)} assume !!(0 != ~r~0); {2112#(< ~counter~0 19)} is VALID [2022-04-08 12:36:31,637 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1936#true} {2112#(< ~counter~0 19)} #94#return; {2112#(< ~counter~0 19)} is VALID [2022-04-08 12:36:31,638 INFO L290 TraceCheckUtils]: 22: Hoare triple {1936#true} assume true; {1936#true} is VALID [2022-04-08 12:36:31,638 INFO L290 TraceCheckUtils]: 21: Hoare triple {1936#true} assume !(0 == ~cond); {1936#true} is VALID [2022-04-08 12:36:31,638 INFO L290 TraceCheckUtils]: 20: Hoare triple {1936#true} ~cond := #in~cond; {1936#true} is VALID [2022-04-08 12:36:31,638 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-08 12:36:31,638 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-08 12:36:31,639 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-08 12:36:31,639 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-08 12:36:31,639 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1936#true} {2137#(< ~counter~0 18)} #92#return; {2137#(< ~counter~0 18)} is VALID [2022-04-08 12:36:31,640 INFO L290 TraceCheckUtils]: 14: Hoare triple {1936#true} assume true; {1936#true} is VALID [2022-04-08 12:36:31,640 INFO L290 TraceCheckUtils]: 13: Hoare triple {1936#true} assume !(0 == ~cond); {1936#true} is VALID [2022-04-08 12:36:31,640 INFO L290 TraceCheckUtils]: 12: Hoare triple {1936#true} ~cond := #in~cond; {1936#true} is VALID [2022-04-08 12:36:31,640 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-08 12:36:31,640 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1936#true} {2137#(< ~counter~0 18)} #90#return; {2137#(< ~counter~0 18)} is VALID [2022-04-08 12:36:31,640 INFO L290 TraceCheckUtils]: 9: Hoare triple {1936#true} assume true; {1936#true} is VALID [2022-04-08 12:36:31,641 INFO L290 TraceCheckUtils]: 8: Hoare triple {1936#true} assume !(0 == ~cond); {1936#true} is VALID [2022-04-08 12:36:31,641 INFO L290 TraceCheckUtils]: 7: Hoare triple {1936#true} ~cond := #in~cond; {1936#true} is VALID [2022-04-08 12:36:31,641 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-08 12:36:31,641 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-08 12:36:31,641 INFO L272 TraceCheckUtils]: 4: Hoare triple {2137#(< ~counter~0 18)} call #t~ret9 := main(); {2137#(< ~counter~0 18)} is VALID [2022-04-08 12:36:31,642 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2137#(< ~counter~0 18)} {1936#true} #102#return; {2137#(< ~counter~0 18)} is VALID [2022-04-08 12:36:31,642 INFO L290 TraceCheckUtils]: 2: Hoare triple {2137#(< ~counter~0 18)} assume true; {2137#(< ~counter~0 18)} is VALID [2022-04-08 12:36:31,643 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-08 12:36:31,643 INFO L272 TraceCheckUtils]: 0: Hoare triple {1936#true} call ULTIMATE.init(); {1936#true} is VALID [2022-04-08 12:36:31,643 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-08 12:36:31,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:36:31,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717155099] [2022-04-08 12:36:31,643 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:36:31,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236370071] [2022-04-08 12:36:31,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236370071] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 12:36:31,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 12:36:31,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2022-04-08 12:36:31,644 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:36:31,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [770842217] [2022-04-08 12:36:31,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [770842217] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:36:31,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:36:31,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 12:36:31,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716909857] [2022-04-08 12:36:31,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:36:31,645 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-08 12:36:31,645 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:36:31,645 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-08 12:36:31,669 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-08 12:36:31,669 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 12:36:31,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:36:31,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 12:36:31,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-08 12:36:31,670 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-08 12:36:31,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:31,816 INFO L93 Difference]: Finished difference Result 74 states and 89 transitions. [2022-04-08 12:36:31,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 12:36:31,817 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-08 12:36:31,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:36:31,817 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-08 12:36:31,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2022-04-08 12:36:31,818 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-08 12:36:31,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2022-04-08 12:36:31,820 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 87 transitions. [2022-04-08 12:36:31,868 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-08 12:36:31,869 INFO L225 Difference]: With dead ends: 74 [2022-04-08 12:36:31,869 INFO L226 Difference]: Without dead ends: 53 [2022-04-08 12:36:31,869 INFO L912 BasicCegarLoop]: 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-08 12:36:31,870 INFO L913 BasicCegarLoop]: 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-08 12:36:31,870 INFO L914 BasicCegarLoop]: 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-08 12:36:31,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-08 12:36:31,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2022-04-08 12:36:31,903 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:36:31,904 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-08 12:36:31,904 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-08 12:36:31,904 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-08 12:36:31,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:31,905 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-04-08 12:36:31,905 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2022-04-08 12:36:31,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:36:31,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:36:31,906 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-08 12:36:31,906 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-08 12:36:31,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:31,907 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-04-08 12:36:31,908 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2022-04-08 12:36:31,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:36:31,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:36:31,908 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:36:31,908 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:36:31,908 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-08 12:36:31,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2022-04-08 12:36:31,909 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 41 [2022-04-08 12:36:31,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:36:31,909 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2022-04-08 12:36:31,910 INFO L479 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-08 12:36:31,910 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 60 transitions. [2022-04-08 12:36:33,973 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-08 12:36:33,973 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2022-04-08 12:36:33,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-08 12:36:33,973 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:36:33,973 INFO L499 BasicCegarLoop]: 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-08 12:36:33,992 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-08 12:36:34,183 WARN L460 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-08 12:36:34,184 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:36:34,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:36:34,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1292932747, now seen corresponding path program 1 times [2022-04-08 12:36:34,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:36:34,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1214220557] [2022-04-08 12:36:34,184 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:36:34,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1292932747, now seen corresponding path program 2 times [2022-04-08 12:36:34,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:36:34,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849740062] [2022-04-08 12:36:34,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:36:34,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:36:34,195 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:36:34,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1896516717] [2022-04-08 12:36:34,195 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:36:34,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:36:34,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:36:34,196 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-08 12:36:34,208 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-08 12:36:34,243 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:36:34,243 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:36:34,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 12:36:34,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:36:34,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:36:34,483 INFO L272 TraceCheckUtils]: 0: Hoare triple {2549#true} call ULTIMATE.init(); {2549#true} is VALID [2022-04-08 12:36:34,484 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-08 12:36:34,485 INFO L290 TraceCheckUtils]: 2: Hoare triple {2557#(<= ~counter~0 0)} assume true; {2557#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:34,486 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2557#(<= ~counter~0 0)} {2549#true} #102#return; {2557#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:34,487 INFO L272 TraceCheckUtils]: 4: Hoare triple {2557#(<= ~counter~0 0)} call #t~ret9 := main(); {2557#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:34,488 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-08 12:36:34,489 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-08 12:36:34,489 INFO L290 TraceCheckUtils]: 7: Hoare triple {2557#(<= ~counter~0 0)} ~cond := #in~cond; {2557#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:34,490 INFO L290 TraceCheckUtils]: 8: Hoare triple {2557#(<= ~counter~0 0)} assume !(0 == ~cond); {2557#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:34,490 INFO L290 TraceCheckUtils]: 9: Hoare triple {2557#(<= ~counter~0 0)} assume true; {2557#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:34,491 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2557#(<= ~counter~0 0)} {2557#(<= ~counter~0 0)} #90#return; {2557#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:34,495 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-08 12:36:34,498 INFO L290 TraceCheckUtils]: 12: Hoare triple {2557#(<= ~counter~0 0)} ~cond := #in~cond; {2557#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:34,499 INFO L290 TraceCheckUtils]: 13: Hoare triple {2557#(<= ~counter~0 0)} assume !(0 == ~cond); {2557#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:34,499 INFO L290 TraceCheckUtils]: 14: Hoare triple {2557#(<= ~counter~0 0)} assume true; {2557#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:34,499 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2557#(<= ~counter~0 0)} {2557#(<= ~counter~0 0)} #92#return; {2557#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:34,500 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-08 12:36:34,500 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-08 12:36:34,500 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-08 12:36:34,501 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-08 12:36:34,501 INFO L290 TraceCheckUtils]: 20: Hoare triple {2606#(<= ~counter~0 1)} ~cond := #in~cond; {2606#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:34,502 INFO L290 TraceCheckUtils]: 21: Hoare triple {2606#(<= ~counter~0 1)} assume !(0 == ~cond); {2606#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:34,502 INFO L290 TraceCheckUtils]: 22: Hoare triple {2606#(<= ~counter~0 1)} assume true; {2606#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:34,502 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2606#(<= ~counter~0 1)} {2606#(<= ~counter~0 1)} #94#return; {2606#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:34,503 INFO L290 TraceCheckUtils]: 24: Hoare triple {2606#(<= ~counter~0 1)} assume !!(0 != ~r~0); {2606#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:34,503 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-08 12:36:34,503 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-08 12:36:34,504 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-08 12:36:34,504 INFO L290 TraceCheckUtils]: 28: Hoare triple {2631#(<= ~counter~0 2)} ~cond := #in~cond; {2631#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:34,505 INFO L290 TraceCheckUtils]: 29: Hoare triple {2631#(<= ~counter~0 2)} assume !(0 == ~cond); {2631#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:34,505 INFO L290 TraceCheckUtils]: 30: Hoare triple {2631#(<= ~counter~0 2)} assume true; {2631#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:34,505 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2631#(<= ~counter~0 2)} {2631#(<= ~counter~0 2)} #96#return; {2631#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:34,506 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-08 12:36:34,506 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-08 12:36:34,506 INFO L290 TraceCheckUtils]: 34: Hoare triple {2656#(<= |main_#t~post7| 2)} assume !(#t~post7 < 20);havoc #t~post7; {2550#false} is VALID [2022-04-08 12:36:34,507 INFO L290 TraceCheckUtils]: 35: Hoare triple {2550#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {2550#false} is VALID [2022-04-08 12:36:34,507 INFO L290 TraceCheckUtils]: 36: Hoare triple {2550#false} assume !(#t~post8 < 20);havoc #t~post8; {2550#false} is VALID [2022-04-08 12:36:34,507 INFO L290 TraceCheckUtils]: 37: Hoare triple {2550#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2550#false} is VALID [2022-04-08 12:36:34,507 INFO L290 TraceCheckUtils]: 38: Hoare triple {2550#false} assume !(#t~post6 < 20);havoc #t~post6; {2550#false} is VALID [2022-04-08 12:36:34,507 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-08 12:36:34,507 INFO L290 TraceCheckUtils]: 40: Hoare triple {2550#false} ~cond := #in~cond; {2550#false} is VALID [2022-04-08 12:36:34,507 INFO L290 TraceCheckUtils]: 41: Hoare triple {2550#false} assume 0 == ~cond; {2550#false} is VALID [2022-04-08 12:36:34,507 INFO L290 TraceCheckUtils]: 42: Hoare triple {2550#false} assume !false; {2550#false} is VALID [2022-04-08 12:36:34,507 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-08 12:36:34,507 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:36:34,707 INFO L290 TraceCheckUtils]: 42: Hoare triple {2550#false} assume !false; {2550#false} is VALID [2022-04-08 12:36:34,707 INFO L290 TraceCheckUtils]: 41: Hoare triple {2550#false} assume 0 == ~cond; {2550#false} is VALID [2022-04-08 12:36:34,707 INFO L290 TraceCheckUtils]: 40: Hoare triple {2550#false} ~cond := #in~cond; {2550#false} is VALID [2022-04-08 12:36:34,707 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-08 12:36:34,707 INFO L290 TraceCheckUtils]: 38: Hoare triple {2550#false} assume !(#t~post6 < 20);havoc #t~post6; {2550#false} is VALID [2022-04-08 12:36:34,708 INFO L290 TraceCheckUtils]: 37: Hoare triple {2550#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2550#false} is VALID [2022-04-08 12:36:34,708 INFO L290 TraceCheckUtils]: 36: Hoare triple {2550#false} assume !(#t~post8 < 20);havoc #t~post8; {2550#false} is VALID [2022-04-08 12:36:34,708 INFO L290 TraceCheckUtils]: 35: Hoare triple {2550#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {2550#false} is VALID [2022-04-08 12:36:34,708 INFO L290 TraceCheckUtils]: 34: Hoare triple {2708#(< |main_#t~post7| 20)} assume !(#t~post7 < 20);havoc #t~post7; {2550#false} is VALID [2022-04-08 12:36:34,708 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-08 12:36:34,709 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-08 12:36:34,709 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2549#true} {2712#(< ~counter~0 20)} #96#return; {2712#(< ~counter~0 20)} is VALID [2022-04-08 12:36:34,709 INFO L290 TraceCheckUtils]: 30: Hoare triple {2549#true} assume true; {2549#true} is VALID [2022-04-08 12:36:34,710 INFO L290 TraceCheckUtils]: 29: Hoare triple {2549#true} assume !(0 == ~cond); {2549#true} is VALID [2022-04-08 12:36:34,710 INFO L290 TraceCheckUtils]: 28: Hoare triple {2549#true} ~cond := #in~cond; {2549#true} is VALID [2022-04-08 12:36:34,710 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-08 12:36:34,710 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-08 12:36:34,711 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-08 12:36:34,711 INFO L290 TraceCheckUtils]: 24: Hoare triple {2737#(< ~counter~0 19)} assume !!(0 != ~r~0); {2737#(< ~counter~0 19)} is VALID [2022-04-08 12:36:34,711 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2549#true} {2737#(< ~counter~0 19)} #94#return; {2737#(< ~counter~0 19)} is VALID [2022-04-08 12:36:34,712 INFO L290 TraceCheckUtils]: 22: Hoare triple {2549#true} assume true; {2549#true} is VALID [2022-04-08 12:36:34,712 INFO L290 TraceCheckUtils]: 21: Hoare triple {2549#true} assume !(0 == ~cond); {2549#true} is VALID [2022-04-08 12:36:34,712 INFO L290 TraceCheckUtils]: 20: Hoare triple {2549#true} ~cond := #in~cond; {2549#true} is VALID [2022-04-08 12:36:34,712 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-08 12:36:34,713 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-08 12:36:34,713 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-08 12:36:34,714 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-08 12:36:34,714 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2549#true} {2762#(< ~counter~0 18)} #92#return; {2762#(< ~counter~0 18)} is VALID [2022-04-08 12:36:34,714 INFO L290 TraceCheckUtils]: 14: Hoare triple {2549#true} assume true; {2549#true} is VALID [2022-04-08 12:36:34,714 INFO L290 TraceCheckUtils]: 13: Hoare triple {2549#true} assume !(0 == ~cond); {2549#true} is VALID [2022-04-08 12:36:34,714 INFO L290 TraceCheckUtils]: 12: Hoare triple {2549#true} ~cond := #in~cond; {2549#true} is VALID [2022-04-08 12:36:34,714 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-08 12:36:34,715 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2549#true} {2762#(< ~counter~0 18)} #90#return; {2762#(< ~counter~0 18)} is VALID [2022-04-08 12:36:34,715 INFO L290 TraceCheckUtils]: 9: Hoare triple {2549#true} assume true; {2549#true} is VALID [2022-04-08 12:36:34,715 INFO L290 TraceCheckUtils]: 8: Hoare triple {2549#true} assume !(0 == ~cond); {2549#true} is VALID [2022-04-08 12:36:34,715 INFO L290 TraceCheckUtils]: 7: Hoare triple {2549#true} ~cond := #in~cond; {2549#true} is VALID [2022-04-08 12:36:34,715 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-08 12:36:34,715 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-08 12:36:34,716 INFO L272 TraceCheckUtils]: 4: Hoare triple {2762#(< ~counter~0 18)} call #t~ret9 := main(); {2762#(< ~counter~0 18)} is VALID [2022-04-08 12:36:34,716 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2762#(< ~counter~0 18)} {2549#true} #102#return; {2762#(< ~counter~0 18)} is VALID [2022-04-08 12:36:34,716 INFO L290 TraceCheckUtils]: 2: Hoare triple {2762#(< ~counter~0 18)} assume true; {2762#(< ~counter~0 18)} is VALID [2022-04-08 12:36:34,717 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-08 12:36:34,717 INFO L272 TraceCheckUtils]: 0: Hoare triple {2549#true} call ULTIMATE.init(); {2549#true} is VALID [2022-04-08 12:36:34,717 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-08 12:36:34,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:36:34,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849740062] [2022-04-08 12:36:34,718 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:36:34,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896516717] [2022-04-08 12:36:34,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896516717] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:36:34,718 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:36:34,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-08 12:36:34,718 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:36:34,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1214220557] [2022-04-08 12:36:34,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1214220557] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:36:34,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:36:34,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 12:36:34,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116960868] [2022-04-08 12:36:34,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:36:34,719 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-08 12:36:34,719 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:36:34,719 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-08 12:36:34,744 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-08 12:36:34,744 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 12:36:34,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:36:34,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 12:36:34,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-08 12:36:34,745 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-08 12:36:34,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:34,923 INFO L93 Difference]: Finished difference Result 75 states and 90 transitions. [2022-04-08 12:36:34,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 12:36:34,923 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-08 12:36:34,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:36:34,923 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-08 12:36:34,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2022-04-08 12:36:34,925 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-08 12:36:34,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2022-04-08 12:36:34,926 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 87 transitions. [2022-04-08 12:36:34,982 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-08 12:36:34,983 INFO L225 Difference]: With dead ends: 75 [2022-04-08 12:36:34,983 INFO L226 Difference]: Without dead ends: 54 [2022-04-08 12:36:34,984 INFO L912 BasicCegarLoop]: 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-08 12:36:34,984 INFO L913 BasicCegarLoop]: 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-08 12:36:34,984 INFO L914 BasicCegarLoop]: 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-08 12:36:34,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-08 12:36:35,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-08 12:36:35,032 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:36:35,033 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-08 12:36:35,033 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-08 12:36:35,033 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-08 12:36:35,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:35,034 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2022-04-08 12:36:35,034 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2022-04-08 12:36:35,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:36:35,035 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:36:35,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-08 12:36:35,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-08 12:36:35,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:35,036 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2022-04-08 12:36:35,036 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2022-04-08 12:36:35,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:36:35,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:36:35,037 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:36:35,037 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:36:35,037 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-08 12:36:35,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2022-04-08 12:36:35,038 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 43 [2022-04-08 12:36:35,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:36:35,038 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2022-04-08 12:36:35,039 INFO L479 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-08 12:36:35,039 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 62 transitions. [2022-04-08 12:36:35,671 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-08 12:36:35,671 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2022-04-08 12:36:35,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-08 12:36:35,672 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:36:35,672 INFO L499 BasicCegarLoop]: 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-08 12:36:35,687 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-08 12:36:35,872 WARN L460 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-08 12:36:35,872 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:36:35,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:36:35,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1407897436, now seen corresponding path program 1 times [2022-04-08 12:36:35,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:36:35,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1066600425] [2022-04-08 12:36:35,873 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:36:35,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1407897436, now seen corresponding path program 2 times [2022-04-08 12:36:35,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:36:35,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699894119] [2022-04-08 12:36:35,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:36:35,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:36:35,883 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:36:35,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1117627327] [2022-04-08 12:36:35,883 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:36:35,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:36:35,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:36:35,884 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-08 12:36:35,885 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-08 12:36:35,937 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:36:35,937 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:36:35,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-08 12:36:35,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:36:35,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:36:36,101 INFO L272 TraceCheckUtils]: 0: Hoare triple {3184#true} call ULTIMATE.init(); {3184#true} is VALID [2022-04-08 12:36:36,102 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-08 12:36:36,102 INFO L290 TraceCheckUtils]: 2: Hoare triple {3184#true} assume true; {3184#true} is VALID [2022-04-08 12:36:36,102 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3184#true} {3184#true} #102#return; {3184#true} is VALID [2022-04-08 12:36:36,102 INFO L272 TraceCheckUtils]: 4: Hoare triple {3184#true} call #t~ret9 := main(); {3184#true} is VALID [2022-04-08 12:36:36,102 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-08 12:36:36,102 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-08 12:36:36,102 INFO L290 TraceCheckUtils]: 7: Hoare triple {3184#true} ~cond := #in~cond; {3184#true} is VALID [2022-04-08 12:36:36,102 INFO L290 TraceCheckUtils]: 8: Hoare triple {3184#true} assume !(0 == ~cond); {3184#true} is VALID [2022-04-08 12:36:36,102 INFO L290 TraceCheckUtils]: 9: Hoare triple {3184#true} assume true; {3184#true} is VALID [2022-04-08 12:36:36,103 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3184#true} {3184#true} #90#return; {3184#true} is VALID [2022-04-08 12:36:36,103 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-08 12:36:36,103 INFO L290 TraceCheckUtils]: 12: Hoare triple {3184#true} ~cond := #in~cond; {3184#true} is VALID [2022-04-08 12:36:36,103 INFO L290 TraceCheckUtils]: 13: Hoare triple {3184#true} assume !(0 == ~cond); {3184#true} is VALID [2022-04-08 12:36:36,103 INFO L290 TraceCheckUtils]: 14: Hoare triple {3184#true} assume true; {3184#true} is VALID [2022-04-08 12:36:36,103 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3184#true} {3184#true} #92#return; {3184#true} is VALID [2022-04-08 12:36:36,103 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-08 12:36:36,103 INFO L290 TraceCheckUtils]: 17: Hoare triple {3184#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3184#true} is VALID [2022-04-08 12:36:36,103 INFO L290 TraceCheckUtils]: 18: Hoare triple {3184#true} assume !!(#t~post6 < 20);havoc #t~post6; {3184#true} is VALID [2022-04-08 12:36:36,103 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-08 12:36:36,103 INFO L290 TraceCheckUtils]: 20: Hoare triple {3184#true} ~cond := #in~cond; {3184#true} is VALID [2022-04-08 12:36:36,103 INFO L290 TraceCheckUtils]: 21: Hoare triple {3184#true} assume !(0 == ~cond); {3184#true} is VALID [2022-04-08 12:36:36,104 INFO L290 TraceCheckUtils]: 22: Hoare triple {3184#true} assume true; {3184#true} is VALID [2022-04-08 12:36:36,104 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3184#true} {3184#true} #94#return; {3184#true} is VALID [2022-04-08 12:36:36,104 INFO L290 TraceCheckUtils]: 24: Hoare triple {3184#true} assume !!(0 != ~r~0); {3261#(not (= main_~r~0 0))} is VALID [2022-04-08 12:36:36,104 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-08 12:36:36,104 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-08 12:36:36,105 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-08 12:36:36,105 INFO L290 TraceCheckUtils]: 28: Hoare triple {3184#true} ~cond := #in~cond; {3184#true} is VALID [2022-04-08 12:36:36,105 INFO L290 TraceCheckUtils]: 29: Hoare triple {3184#true} assume !(0 == ~cond); {3184#true} is VALID [2022-04-08 12:36:36,105 INFO L290 TraceCheckUtils]: 30: Hoare triple {3184#true} assume true; {3184#true} is VALID [2022-04-08 12:36:36,105 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-08 12:36:36,106 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-08 12:36:36,106 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-08 12:36:36,106 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-08 12:36:36,107 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-08 12:36:36,107 INFO L290 TraceCheckUtils]: 36: Hoare triple {3184#true} ~cond := #in~cond; {3184#true} is VALID [2022-04-08 12:36:36,107 INFO L290 TraceCheckUtils]: 37: Hoare triple {3184#true} assume !(0 == ~cond); {3184#true} is VALID [2022-04-08 12:36:36,107 INFO L290 TraceCheckUtils]: 38: Hoare triple {3184#true} assume true; {3184#true} is VALID [2022-04-08 12:36:36,108 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-08 12:36:36,108 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-08 12:36:36,108 INFO L290 TraceCheckUtils]: 41: Hoare triple {3185#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3185#false} is VALID [2022-04-08 12:36:36,108 INFO L290 TraceCheckUtils]: 42: Hoare triple {3185#false} assume !(#t~post6 < 20);havoc #t~post6; {3185#false} is VALID [2022-04-08 12:36:36,108 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-08 12:36:36,108 INFO L290 TraceCheckUtils]: 44: Hoare triple {3185#false} ~cond := #in~cond; {3185#false} is VALID [2022-04-08 12:36:36,108 INFO L290 TraceCheckUtils]: 45: Hoare triple {3185#false} assume 0 == ~cond; {3185#false} is VALID [2022-04-08 12:36:36,109 INFO L290 TraceCheckUtils]: 46: Hoare triple {3185#false} assume !false; {3185#false} is VALID [2022-04-08 12:36:36,109 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-08 12:36:36,109 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 12:36:36,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:36:36,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699894119] [2022-04-08 12:36:36,109 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:36:36,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117627327] [2022-04-08 12:36:36,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1117627327] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:36:36,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:36:36,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 12:36:36,110 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:36:36,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1066600425] [2022-04-08 12:36:36,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1066600425] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:36:36,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:36:36,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 12:36:36,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496799577] [2022-04-08 12:36:36,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:36:36,110 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-08 12:36:36,110 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:36:36,111 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-08 12:36:36,137 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-08 12:36:36,137 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 12:36:36,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:36:36,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 12:36:36,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-08 12:36:36,137 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-08 12:36:36,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:36,310 INFO L93 Difference]: Finished difference Result 101 states and 131 transitions. [2022-04-08 12:36:36,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 12:36:36,310 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-08 12:36:36,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:36:36,311 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-08 12:36:36,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-04-08 12:36:36,312 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-08 12:36:36,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-04-08 12:36:36,313 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 108 transitions. [2022-04-08 12:36:36,401 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-08 12:36:36,402 INFO L225 Difference]: With dead ends: 101 [2022-04-08 12:36:36,402 INFO L226 Difference]: Without dead ends: 80 [2022-04-08 12:36:36,403 INFO L912 BasicCegarLoop]: 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-08 12:36:36,403 INFO L913 BasicCegarLoop]: 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-08 12:36:36,403 INFO L914 BasicCegarLoop]: 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-08 12:36:36,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-04-08 12:36:36,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 70. [2022-04-08 12:36:36,464 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:36:36,464 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-08 12:36:36,465 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-08 12:36:36,465 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-08 12:36:36,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:36,467 INFO L93 Difference]: Finished difference Result 80 states and 102 transitions. [2022-04-08 12:36:36,467 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 102 transitions. [2022-04-08 12:36:36,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:36:36,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:36:36,467 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-08 12:36:36,468 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-08 12:36:36,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:36,469 INFO L93 Difference]: Finished difference Result 80 states and 102 transitions. [2022-04-08 12:36:36,469 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 102 transitions. [2022-04-08 12:36:36,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:36:36,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:36:36,470 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:36:36,470 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:36:36,470 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-08 12:36:36,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 87 transitions. [2022-04-08 12:36:36,472 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 87 transitions. Word has length 47 [2022-04-08 12:36:36,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:36:36,472 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 87 transitions. [2022-04-08 12:36:36,472 INFO L479 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-08 12:36:36,472 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 87 transitions. [2022-04-08 12:36:37,556 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-08 12:36:37,556 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 87 transitions. [2022-04-08 12:36:37,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-08 12:36:37,557 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:36:37,557 INFO L499 BasicCegarLoop]: 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-08 12:36:37,575 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-08 12:36:37,757 WARN L460 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-08 12:36:37,757 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:36:37,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:36:37,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1915058849, now seen corresponding path program 1 times [2022-04-08 12:36:37,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:36:37,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1576247868] [2022-04-08 12:36:37,758 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:36:37,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1915058849, now seen corresponding path program 2 times [2022-04-08 12:36:37,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:36:37,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081036240] [2022-04-08 12:36:37,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:36:37,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:36:37,770 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:36:37,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1409429838] [2022-04-08 12:36:37,770 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:36:37,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:36:37,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:36:37,773 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-08 12:36:37,774 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-08 12:36:37,815 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:36:37,815 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:36:37,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 12:36:37,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:36:37,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:36:38,007 INFO L272 TraceCheckUtils]: 0: Hoare triple {3830#true} call ULTIMATE.init(); {3830#true} is VALID [2022-04-08 12:36:38,008 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-08 12:36:38,008 INFO L290 TraceCheckUtils]: 2: Hoare triple {3838#(<= ~counter~0 0)} assume true; {3838#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:38,009 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3838#(<= ~counter~0 0)} {3830#true} #102#return; {3838#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:38,009 INFO L272 TraceCheckUtils]: 4: Hoare triple {3838#(<= ~counter~0 0)} call #t~ret9 := main(); {3838#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:38,009 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-08 12:36:38,010 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-08 12:36:38,010 INFO L290 TraceCheckUtils]: 7: Hoare triple {3838#(<= ~counter~0 0)} ~cond := #in~cond; {3838#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:38,010 INFO L290 TraceCheckUtils]: 8: Hoare triple {3838#(<= ~counter~0 0)} assume !(0 == ~cond); {3838#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:38,011 INFO L290 TraceCheckUtils]: 9: Hoare triple {3838#(<= ~counter~0 0)} assume true; {3838#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:38,011 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3838#(<= ~counter~0 0)} {3838#(<= ~counter~0 0)} #90#return; {3838#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:38,012 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-08 12:36:38,012 INFO L290 TraceCheckUtils]: 12: Hoare triple {3838#(<= ~counter~0 0)} ~cond := #in~cond; {3838#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:38,012 INFO L290 TraceCheckUtils]: 13: Hoare triple {3838#(<= ~counter~0 0)} assume !(0 == ~cond); {3838#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:38,012 INFO L290 TraceCheckUtils]: 14: Hoare triple {3838#(<= ~counter~0 0)} assume true; {3838#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:38,013 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3838#(<= ~counter~0 0)} {3838#(<= ~counter~0 0)} #92#return; {3838#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:38,013 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-08 12:36:38,013 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-08 12:36:38,014 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-08 12:36:38,014 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-08 12:36:38,015 INFO L290 TraceCheckUtils]: 20: Hoare triple {3887#(<= ~counter~0 1)} ~cond := #in~cond; {3887#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:38,015 INFO L290 TraceCheckUtils]: 21: Hoare triple {3887#(<= ~counter~0 1)} assume !(0 == ~cond); {3887#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:38,015 INFO L290 TraceCheckUtils]: 22: Hoare triple {3887#(<= ~counter~0 1)} assume true; {3887#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:38,016 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3887#(<= ~counter~0 1)} {3887#(<= ~counter~0 1)} #94#return; {3887#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:38,016 INFO L290 TraceCheckUtils]: 24: Hoare triple {3887#(<= ~counter~0 1)} assume !!(0 != ~r~0); {3887#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:38,016 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-08 12:36:38,017 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-08 12:36:38,017 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-08 12:36:38,017 INFO L290 TraceCheckUtils]: 28: Hoare triple {3912#(<= ~counter~0 2)} ~cond := #in~cond; {3912#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:38,018 INFO L290 TraceCheckUtils]: 29: Hoare triple {3912#(<= ~counter~0 2)} assume !(0 == ~cond); {3912#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:38,018 INFO L290 TraceCheckUtils]: 30: Hoare triple {3912#(<= ~counter~0 2)} assume true; {3912#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:38,019 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3912#(<= ~counter~0 2)} {3912#(<= ~counter~0 2)} #96#return; {3912#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:38,019 INFO L290 TraceCheckUtils]: 32: Hoare triple {3912#(<= ~counter~0 2)} assume !(~r~0 > 0); {3912#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:38,019 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-08 12:36:38,020 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-08 12:36:38,020 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-08 12:36:38,020 INFO L290 TraceCheckUtils]: 36: Hoare triple {3937#(<= ~counter~0 3)} ~cond := #in~cond; {3937#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:38,021 INFO L290 TraceCheckUtils]: 37: Hoare triple {3937#(<= ~counter~0 3)} assume !(0 == ~cond); {3937#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:38,021 INFO L290 TraceCheckUtils]: 38: Hoare triple {3937#(<= ~counter~0 3)} assume true; {3937#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:38,021 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3937#(<= ~counter~0 3)} {3937#(<= ~counter~0 3)} #98#return; {3937#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:38,022 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-08 12:36:38,022 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-08 12:36:38,023 INFO L290 TraceCheckUtils]: 42: Hoare triple {3962#(<= |main_#t~post8| 3)} assume !(#t~post8 < 20);havoc #t~post8; {3831#false} is VALID [2022-04-08 12:36:38,023 INFO L290 TraceCheckUtils]: 43: Hoare triple {3831#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3831#false} is VALID [2022-04-08 12:36:38,023 INFO L290 TraceCheckUtils]: 44: Hoare triple {3831#false} assume !(#t~post6 < 20);havoc #t~post6; {3831#false} is VALID [2022-04-08 12:36:38,023 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-08 12:36:38,023 INFO L290 TraceCheckUtils]: 46: Hoare triple {3831#false} ~cond := #in~cond; {3831#false} is VALID [2022-04-08 12:36:38,023 INFO L290 TraceCheckUtils]: 47: Hoare triple {3831#false} assume 0 == ~cond; {3831#false} is VALID [2022-04-08 12:36:38,023 INFO L290 TraceCheckUtils]: 48: Hoare triple {3831#false} assume !false; {3831#false} is VALID [2022-04-08 12:36:38,023 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-08 12:36:38,023 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:36:38,255 INFO L290 TraceCheckUtils]: 48: Hoare triple {3831#false} assume !false; {3831#false} is VALID [2022-04-08 12:36:38,255 INFO L290 TraceCheckUtils]: 47: Hoare triple {3831#false} assume 0 == ~cond; {3831#false} is VALID [2022-04-08 12:36:38,255 INFO L290 TraceCheckUtils]: 46: Hoare triple {3831#false} ~cond := #in~cond; {3831#false} is VALID [2022-04-08 12:36:38,255 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-08 12:36:38,256 INFO L290 TraceCheckUtils]: 44: Hoare triple {3831#false} assume !(#t~post6 < 20);havoc #t~post6; {3831#false} is VALID [2022-04-08 12:36:38,256 INFO L290 TraceCheckUtils]: 43: Hoare triple {3831#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3831#false} is VALID [2022-04-08 12:36:38,260 INFO L290 TraceCheckUtils]: 42: Hoare triple {4002#(< |main_#t~post8| 20)} assume !(#t~post8 < 20);havoc #t~post8; {3831#false} is VALID [2022-04-08 12:36:38,260 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-08 12:36:38,261 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-08 12:36:38,262 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3830#true} {4006#(< ~counter~0 20)} #98#return; {4006#(< ~counter~0 20)} is VALID [2022-04-08 12:36:38,262 INFO L290 TraceCheckUtils]: 38: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-08 12:36:38,262 INFO L290 TraceCheckUtils]: 37: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-08 12:36:38,262 INFO L290 TraceCheckUtils]: 36: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-08 12:36:38,262 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-08 12:36:38,262 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-08 12:36:38,263 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-08 12:36:38,263 INFO L290 TraceCheckUtils]: 32: Hoare triple {4031#(< ~counter~0 19)} assume !(~r~0 > 0); {4031#(< ~counter~0 19)} is VALID [2022-04-08 12:36:38,264 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3830#true} {4031#(< ~counter~0 19)} #96#return; {4031#(< ~counter~0 19)} is VALID [2022-04-08 12:36:38,264 INFO L290 TraceCheckUtils]: 30: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-08 12:36:38,264 INFO L290 TraceCheckUtils]: 29: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-08 12:36:38,264 INFO L290 TraceCheckUtils]: 28: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-08 12:36:38,264 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-08 12:36:38,264 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-08 12:36:38,265 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-08 12:36:38,265 INFO L290 TraceCheckUtils]: 24: Hoare triple {4056#(< ~counter~0 18)} assume !!(0 != ~r~0); {4056#(< ~counter~0 18)} is VALID [2022-04-08 12:36:38,266 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3830#true} {4056#(< ~counter~0 18)} #94#return; {4056#(< ~counter~0 18)} is VALID [2022-04-08 12:36:38,266 INFO L290 TraceCheckUtils]: 22: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-08 12:36:38,266 INFO L290 TraceCheckUtils]: 21: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-08 12:36:38,266 INFO L290 TraceCheckUtils]: 20: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-08 12:36:38,266 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-08 12:36:38,272 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-08 12:36:38,272 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-08 12:36:38,273 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-08 12:36:38,273 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3830#true} {4081#(< ~counter~0 17)} #92#return; {4081#(< ~counter~0 17)} is VALID [2022-04-08 12:36:38,273 INFO L290 TraceCheckUtils]: 14: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-08 12:36:38,273 INFO L290 TraceCheckUtils]: 13: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-08 12:36:38,273 INFO L290 TraceCheckUtils]: 12: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-08 12:36:38,273 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-08 12:36:38,274 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3830#true} {4081#(< ~counter~0 17)} #90#return; {4081#(< ~counter~0 17)} is VALID [2022-04-08 12:36:38,274 INFO L290 TraceCheckUtils]: 9: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-08 12:36:38,274 INFO L290 TraceCheckUtils]: 8: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-08 12:36:38,274 INFO L290 TraceCheckUtils]: 7: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-08 12:36:38,274 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-08 12:36:38,275 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-08 12:36:38,275 INFO L272 TraceCheckUtils]: 4: Hoare triple {4081#(< ~counter~0 17)} call #t~ret9 := main(); {4081#(< ~counter~0 17)} is VALID [2022-04-08 12:36:38,275 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4081#(< ~counter~0 17)} {3830#true} #102#return; {4081#(< ~counter~0 17)} is VALID [2022-04-08 12:36:38,276 INFO L290 TraceCheckUtils]: 2: Hoare triple {4081#(< ~counter~0 17)} assume true; {4081#(< ~counter~0 17)} is VALID [2022-04-08 12:36:38,276 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-08 12:36:38,276 INFO L272 TraceCheckUtils]: 0: Hoare triple {3830#true} call ULTIMATE.init(); {3830#true} is VALID [2022-04-08 12:36:38,277 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-08 12:36:38,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:36:38,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081036240] [2022-04-08 12:36:38,277 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:36:38,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1409429838] [2022-04-08 12:36:38,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1409429838] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:36:38,277 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:36:38,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-08 12:36:38,277 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:36:38,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1576247868] [2022-04-08 12:36:38,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1576247868] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:36:38,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:36:38,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 12:36:38,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659286990] [2022-04-08 12:36:38,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:36:38,278 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-08 12:36:38,278 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:36:38,278 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-08 12:36:38,314 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-08 12:36:38,314 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 12:36:38,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:36:38,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 12:36:38,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-08 12:36:38,315 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-08 12:36:38,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:38,550 INFO L93 Difference]: Finished difference Result 118 states and 153 transitions. [2022-04-08 12:36:38,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 12:36:38,551 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-08 12:36:38,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:36:38,551 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-08 12:36:38,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2022-04-08 12:36:38,552 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-08 12:36:38,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2022-04-08 12:36:38,553 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 101 transitions. [2022-04-08 12:36:38,619 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-08 12:36:38,621 INFO L225 Difference]: With dead ends: 118 [2022-04-08 12:36:38,621 INFO L226 Difference]: Without dead ends: 81 [2022-04-08 12:36:38,623 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2022-04-08 12:36:38,625 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 19 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-08 12:36:38,625 INFO L914 BasicCegarLoop]: 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-08 12:36:38,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-08 12:36:38,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2022-04-08 12:36:38,692 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:36:38,692 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-08 12:36:38,698 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-08 12:36:38,699 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-08 12:36:38,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:38,707 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2022-04-08 12:36:38,707 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2022-04-08 12:36:38,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:36:38,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:36:38,707 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-08 12:36:38,710 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-08 12:36:38,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:38,711 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2022-04-08 12:36:38,711 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2022-04-08 12:36:38,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:36:38,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:36:38,712 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:36:38,712 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:36:38,712 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-08 12:36:38,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 99 transitions. [2022-04-08 12:36:38,713 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 99 transitions. Word has length 49 [2022-04-08 12:36:38,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:36:38,714 INFO L478 AbstractCegarLoop]: Abstraction has 80 states and 99 transitions. [2022-04-08 12:36:38,714 INFO L479 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-08 12:36:38,714 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 80 states and 99 transitions. [2022-04-08 12:36:40,820 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:36:40,821 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 99 transitions. [2022-04-08 12:36:40,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-08 12:36:40,821 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:36:40,821 INFO L499 BasicCegarLoop]: 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-08 12:36:40,837 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-08 12:36:41,021 WARN L460 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-08 12:36:41,022 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:36:41,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:36:41,022 INFO L85 PathProgramCache]: Analyzing trace with hash -60460648, now seen corresponding path program 3 times [2022-04-08 12:36:41,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:36:41,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1213834531] [2022-04-08 12:36:41,023 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:36:41,023 INFO L85 PathProgramCache]: Analyzing trace with hash -60460648, now seen corresponding path program 4 times [2022-04-08 12:36:41,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:36:41,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513269344] [2022-04-08 12:36:41,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:36:41,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:36:41,034 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:36:41,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1703384996] [2022-04-08 12:36:41,035 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 12:36:41,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:36:41,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:36:41,036 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-08 12:36:41,038 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-08 12:36:41,095 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 12:36:41,095 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:36:41,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 12:36:41,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:36:41,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:36:41,319 INFO L272 TraceCheckUtils]: 0: Hoare triple {4695#true} call ULTIMATE.init(); {4695#true} is VALID [2022-04-08 12:36:41,319 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-08 12:36:41,320 INFO L290 TraceCheckUtils]: 2: Hoare triple {4703#(<= ~counter~0 0)} assume true; {4703#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:41,320 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4703#(<= ~counter~0 0)} {4695#true} #102#return; {4703#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:41,320 INFO L272 TraceCheckUtils]: 4: Hoare triple {4703#(<= ~counter~0 0)} call #t~ret9 := main(); {4703#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:41,320 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-08 12:36:41,321 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-08 12:36:41,321 INFO L290 TraceCheckUtils]: 7: Hoare triple {4703#(<= ~counter~0 0)} ~cond := #in~cond; {4703#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:41,321 INFO L290 TraceCheckUtils]: 8: Hoare triple {4703#(<= ~counter~0 0)} assume !(0 == ~cond); {4703#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:41,322 INFO L290 TraceCheckUtils]: 9: Hoare triple {4703#(<= ~counter~0 0)} assume true; {4703#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:41,322 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4703#(<= ~counter~0 0)} {4703#(<= ~counter~0 0)} #90#return; {4703#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:41,322 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-08 12:36:41,323 INFO L290 TraceCheckUtils]: 12: Hoare triple {4703#(<= ~counter~0 0)} ~cond := #in~cond; {4703#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:41,323 INFO L290 TraceCheckUtils]: 13: Hoare triple {4703#(<= ~counter~0 0)} assume !(0 == ~cond); {4703#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:41,323 INFO L290 TraceCheckUtils]: 14: Hoare triple {4703#(<= ~counter~0 0)} assume true; {4703#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:41,324 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4703#(<= ~counter~0 0)} {4703#(<= ~counter~0 0)} #92#return; {4703#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:41,324 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-08 12:36:41,324 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-08 12:36:41,325 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-08 12:36:41,325 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-08 12:36:41,325 INFO L290 TraceCheckUtils]: 20: Hoare triple {4752#(<= ~counter~0 1)} ~cond := #in~cond; {4752#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:41,326 INFO L290 TraceCheckUtils]: 21: Hoare triple {4752#(<= ~counter~0 1)} assume !(0 == ~cond); {4752#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:41,326 INFO L290 TraceCheckUtils]: 22: Hoare triple {4752#(<= ~counter~0 1)} assume true; {4752#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:41,326 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4752#(<= ~counter~0 1)} {4752#(<= ~counter~0 1)} #94#return; {4752#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:41,327 INFO L290 TraceCheckUtils]: 24: Hoare triple {4752#(<= ~counter~0 1)} assume !!(0 != ~r~0); {4752#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:41,327 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-08 12:36:41,327 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-08 12:36:41,328 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-08 12:36:41,328 INFO L290 TraceCheckUtils]: 28: Hoare triple {4777#(<= ~counter~0 2)} ~cond := #in~cond; {4777#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:41,330 INFO L290 TraceCheckUtils]: 29: Hoare triple {4777#(<= ~counter~0 2)} assume !(0 == ~cond); {4777#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:41,330 INFO L290 TraceCheckUtils]: 30: Hoare triple {4777#(<= ~counter~0 2)} assume true; {4777#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:41,331 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4777#(<= ~counter~0 2)} {4777#(<= ~counter~0 2)} #96#return; {4777#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:41,331 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-08 12:36:41,331 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-08 12:36:41,332 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-08 12:36:41,332 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-08 12:36:41,332 INFO L290 TraceCheckUtils]: 36: Hoare triple {4802#(<= ~counter~0 3)} ~cond := #in~cond; {4802#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:41,333 INFO L290 TraceCheckUtils]: 37: Hoare triple {4802#(<= ~counter~0 3)} assume !(0 == ~cond); {4802#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:41,333 INFO L290 TraceCheckUtils]: 38: Hoare triple {4802#(<= ~counter~0 3)} assume true; {4802#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:41,333 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4802#(<= ~counter~0 3)} {4802#(<= ~counter~0 3)} #96#return; {4802#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:41,334 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-08 12:36:41,334 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-08 12:36:41,334 INFO L290 TraceCheckUtils]: 42: Hoare triple {4827#(<= |main_#t~post7| 3)} assume !(#t~post7 < 20);havoc #t~post7; {4696#false} is VALID [2022-04-08 12:36:41,334 INFO L290 TraceCheckUtils]: 43: Hoare triple {4696#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4696#false} is VALID [2022-04-08 12:36:41,335 INFO L290 TraceCheckUtils]: 44: Hoare triple {4696#false} assume !(#t~post8 < 20);havoc #t~post8; {4696#false} is VALID [2022-04-08 12:36:41,335 INFO L290 TraceCheckUtils]: 45: Hoare triple {4696#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4696#false} is VALID [2022-04-08 12:36:41,335 INFO L290 TraceCheckUtils]: 46: Hoare triple {4696#false} assume !(#t~post6 < 20);havoc #t~post6; {4696#false} is VALID [2022-04-08 12:36:41,335 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-08 12:36:41,335 INFO L290 TraceCheckUtils]: 48: Hoare triple {4696#false} ~cond := #in~cond; {4696#false} is VALID [2022-04-08 12:36:41,335 INFO L290 TraceCheckUtils]: 49: Hoare triple {4696#false} assume 0 == ~cond; {4696#false} is VALID [2022-04-08 12:36:41,335 INFO L290 TraceCheckUtils]: 50: Hoare triple {4696#false} assume !false; {4696#false} is VALID [2022-04-08 12:36:41,335 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-08 12:36:41,335 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:36:41,553 INFO L290 TraceCheckUtils]: 50: Hoare triple {4696#false} assume !false; {4696#false} is VALID [2022-04-08 12:36:41,553 INFO L290 TraceCheckUtils]: 49: Hoare triple {4696#false} assume 0 == ~cond; {4696#false} is VALID [2022-04-08 12:36:41,553 INFO L290 TraceCheckUtils]: 48: Hoare triple {4696#false} ~cond := #in~cond; {4696#false} is VALID [2022-04-08 12:36:41,553 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-08 12:36:41,553 INFO L290 TraceCheckUtils]: 46: Hoare triple {4696#false} assume !(#t~post6 < 20);havoc #t~post6; {4696#false} is VALID [2022-04-08 12:36:41,553 INFO L290 TraceCheckUtils]: 45: Hoare triple {4696#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4696#false} is VALID [2022-04-08 12:36:41,554 INFO L290 TraceCheckUtils]: 44: Hoare triple {4696#false} assume !(#t~post8 < 20);havoc #t~post8; {4696#false} is VALID [2022-04-08 12:36:41,554 INFO L290 TraceCheckUtils]: 43: Hoare triple {4696#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4696#false} is VALID [2022-04-08 12:36:41,554 INFO L290 TraceCheckUtils]: 42: Hoare triple {4879#(< |main_#t~post7| 20)} assume !(#t~post7 < 20);havoc #t~post7; {4696#false} is VALID [2022-04-08 12:36:41,554 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-08 12:36:41,554 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-08 12:36:41,555 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4695#true} {4883#(< ~counter~0 20)} #96#return; {4883#(< ~counter~0 20)} is VALID [2022-04-08 12:36:41,555 INFO L290 TraceCheckUtils]: 38: Hoare triple {4695#true} assume true; {4695#true} is VALID [2022-04-08 12:36:41,555 INFO L290 TraceCheckUtils]: 37: Hoare triple {4695#true} assume !(0 == ~cond); {4695#true} is VALID [2022-04-08 12:36:41,555 INFO L290 TraceCheckUtils]: 36: Hoare triple {4695#true} ~cond := #in~cond; {4695#true} is VALID [2022-04-08 12:36:41,555 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-08 12:36:41,556 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-08 12:36:41,556 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-08 12:36:41,556 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-08 12:36:41,557 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4695#true} {4908#(< ~counter~0 19)} #96#return; {4908#(< ~counter~0 19)} is VALID [2022-04-08 12:36:41,557 INFO L290 TraceCheckUtils]: 30: Hoare triple {4695#true} assume true; {4695#true} is VALID [2022-04-08 12:36:41,557 INFO L290 TraceCheckUtils]: 29: Hoare triple {4695#true} assume !(0 == ~cond); {4695#true} is VALID [2022-04-08 12:36:41,557 INFO L290 TraceCheckUtils]: 28: Hoare triple {4695#true} ~cond := #in~cond; {4695#true} is VALID [2022-04-08 12:36:41,557 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-08 12:36:41,558 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-08 12:36:41,559 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-08 12:36:41,559 INFO L290 TraceCheckUtils]: 24: Hoare triple {4933#(< ~counter~0 18)} assume !!(0 != ~r~0); {4933#(< ~counter~0 18)} is VALID [2022-04-08 12:36:41,559 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4695#true} {4933#(< ~counter~0 18)} #94#return; {4933#(< ~counter~0 18)} is VALID [2022-04-08 12:36:41,559 INFO L290 TraceCheckUtils]: 22: Hoare triple {4695#true} assume true; {4695#true} is VALID [2022-04-08 12:36:41,560 INFO L290 TraceCheckUtils]: 21: Hoare triple {4695#true} assume !(0 == ~cond); {4695#true} is VALID [2022-04-08 12:36:41,560 INFO L290 TraceCheckUtils]: 20: Hoare triple {4695#true} ~cond := #in~cond; {4695#true} is VALID [2022-04-08 12:36:41,560 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-08 12:36:41,560 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-08 12:36:41,560 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-08 12:36:41,561 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-08 12:36:41,561 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4695#true} {4958#(< ~counter~0 17)} #92#return; {4958#(< ~counter~0 17)} is VALID [2022-04-08 12:36:41,561 INFO L290 TraceCheckUtils]: 14: Hoare triple {4695#true} assume true; {4695#true} is VALID [2022-04-08 12:36:41,561 INFO L290 TraceCheckUtils]: 13: Hoare triple {4695#true} assume !(0 == ~cond); {4695#true} is VALID [2022-04-08 12:36:41,561 INFO L290 TraceCheckUtils]: 12: Hoare triple {4695#true} ~cond := #in~cond; {4695#true} is VALID [2022-04-08 12:36:41,561 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-08 12:36:41,562 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4695#true} {4958#(< ~counter~0 17)} #90#return; {4958#(< ~counter~0 17)} is VALID [2022-04-08 12:36:41,562 INFO L290 TraceCheckUtils]: 9: Hoare triple {4695#true} assume true; {4695#true} is VALID [2022-04-08 12:36:41,562 INFO L290 TraceCheckUtils]: 8: Hoare triple {4695#true} assume !(0 == ~cond); {4695#true} is VALID [2022-04-08 12:36:41,562 INFO L290 TraceCheckUtils]: 7: Hoare triple {4695#true} ~cond := #in~cond; {4695#true} is VALID [2022-04-08 12:36:41,562 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-08 12:36:41,562 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-08 12:36:41,563 INFO L272 TraceCheckUtils]: 4: Hoare triple {4958#(< ~counter~0 17)} call #t~ret9 := main(); {4958#(< ~counter~0 17)} is VALID [2022-04-08 12:36:41,563 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4958#(< ~counter~0 17)} {4695#true} #102#return; {4958#(< ~counter~0 17)} is VALID [2022-04-08 12:36:41,563 INFO L290 TraceCheckUtils]: 2: Hoare triple {4958#(< ~counter~0 17)} assume true; {4958#(< ~counter~0 17)} is VALID [2022-04-08 12:36:41,564 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-08 12:36:41,564 INFO L272 TraceCheckUtils]: 0: Hoare triple {4695#true} call ULTIMATE.init(); {4695#true} is VALID [2022-04-08 12:36:41,564 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-08 12:36:41,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:36:41,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513269344] [2022-04-08 12:36:41,564 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:36:41,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703384996] [2022-04-08 12:36:41,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703384996] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:36:41,564 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:36:41,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-08 12:36:41,565 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:36:41,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1213834531] [2022-04-08 12:36:41,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1213834531] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:36:41,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:36:41,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 12:36:41,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608039063] [2022-04-08 12:36:41,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:36:41,565 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-08 12:36:41,566 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:36:41,566 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-08 12:36:41,595 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-08 12:36:41,596 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 12:36:41,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:36:41,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 12:36:41,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-08 12:36:41,596 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-08 12:36:41,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:41,855 INFO L93 Difference]: Finished difference Result 119 states and 154 transitions. [2022-04-08 12:36:41,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 12:36:41,855 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-08 12:36:41,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:36:41,855 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-08 12:36:41,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2022-04-08 12:36:41,857 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-08 12:36:41,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2022-04-08 12:36:41,858 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 101 transitions. [2022-04-08 12:36:41,932 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-08 12:36:41,934 INFO L225 Difference]: With dead ends: 119 [2022-04-08 12:36:41,934 INFO L226 Difference]: Without dead ends: 82 [2022-04-08 12:36:41,934 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2022-04-08 12:36:41,934 INFO L913 BasicCegarLoop]: 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-08 12:36:41,934 INFO L914 BasicCegarLoop]: 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-08 12:36:41,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-08 12:36:42,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-04-08 12:36:42,001 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:36:42,002 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-08 12:36:42,002 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-08 12:36:42,002 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-08 12:36:42,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:42,003 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2022-04-08 12:36:42,004 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2022-04-08 12:36:42,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:36:42,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:36:42,004 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-08 12:36:42,004 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-08 12:36:42,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:42,006 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2022-04-08 12:36:42,006 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2022-04-08 12:36:42,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:36:42,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:36:42,007 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:36:42,007 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:36:42,007 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-08 12:36:42,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 101 transitions. [2022-04-08 12:36:42,009 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 101 transitions. Word has length 51 [2022-04-08 12:36:42,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:36:42,009 INFO L478 AbstractCegarLoop]: Abstraction has 82 states and 101 transitions. [2022-04-08 12:36:42,009 INFO L479 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-08 12:36:42,009 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 82 states and 101 transitions. [2022-04-08 12:36:43,922 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-08 12:36:43,923 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2022-04-08 12:36:43,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-08 12:36:43,923 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:36:43,923 INFO L499 BasicCegarLoop]: 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-08 12:36:43,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-08 12:36:44,123 WARN L460 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-08 12:36:44,124 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:36:44,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:36:44,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1067781299, now seen corresponding path program 1 times [2022-04-08 12:36:44,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:36:44,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [212879369] [2022-04-08 12:36:44,125 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:36:44,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1067781299, now seen corresponding path program 2 times [2022-04-08 12:36:44,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:36:44,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892713183] [2022-04-08 12:36:44,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:36:44,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:36:44,134 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:36:44,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [237724182] [2022-04-08 12:36:44,134 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:36:44,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:36:44,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:36:44,135 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-08 12:36:44,136 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-08 12:36:44,171 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:36:44,172 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:36:44,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-08 12:36:44,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:36:44,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:36:44,427 INFO L272 TraceCheckUtils]: 0: Hoare triple {5582#true} call ULTIMATE.init(); {5582#true} is VALID [2022-04-08 12:36:44,428 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-08 12:36:44,428 INFO L290 TraceCheckUtils]: 2: Hoare triple {5590#(<= ~counter~0 0)} assume true; {5590#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:44,429 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5590#(<= ~counter~0 0)} {5582#true} #102#return; {5590#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:44,429 INFO L272 TraceCheckUtils]: 4: Hoare triple {5590#(<= ~counter~0 0)} call #t~ret9 := main(); {5590#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:44,429 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-08 12:36:44,430 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-08 12:36:44,430 INFO L290 TraceCheckUtils]: 7: Hoare triple {5590#(<= ~counter~0 0)} ~cond := #in~cond; {5590#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:44,430 INFO L290 TraceCheckUtils]: 8: Hoare triple {5590#(<= ~counter~0 0)} assume !(0 == ~cond); {5590#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:44,431 INFO L290 TraceCheckUtils]: 9: Hoare triple {5590#(<= ~counter~0 0)} assume true; {5590#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:44,431 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5590#(<= ~counter~0 0)} {5590#(<= ~counter~0 0)} #90#return; {5590#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:44,431 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-08 12:36:44,432 INFO L290 TraceCheckUtils]: 12: Hoare triple {5590#(<= ~counter~0 0)} ~cond := #in~cond; {5590#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:44,432 INFO L290 TraceCheckUtils]: 13: Hoare triple {5590#(<= ~counter~0 0)} assume !(0 == ~cond); {5590#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:44,432 INFO L290 TraceCheckUtils]: 14: Hoare triple {5590#(<= ~counter~0 0)} assume true; {5590#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:44,433 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5590#(<= ~counter~0 0)} {5590#(<= ~counter~0 0)} #92#return; {5590#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:44,433 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-08 12:36:44,434 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-08 12:36:44,434 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-08 12:36:44,434 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-08 12:36:44,435 INFO L290 TraceCheckUtils]: 20: Hoare triple {5639#(<= ~counter~0 1)} ~cond := #in~cond; {5639#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:44,435 INFO L290 TraceCheckUtils]: 21: Hoare triple {5639#(<= ~counter~0 1)} assume !(0 == ~cond); {5639#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:44,435 INFO L290 TraceCheckUtils]: 22: Hoare triple {5639#(<= ~counter~0 1)} assume true; {5639#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:44,436 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5639#(<= ~counter~0 1)} {5639#(<= ~counter~0 1)} #94#return; {5639#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:44,436 INFO L290 TraceCheckUtils]: 24: Hoare triple {5639#(<= ~counter~0 1)} assume !!(0 != ~r~0); {5639#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:44,437 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-08 12:36:44,437 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-08 12:36:44,437 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-08 12:36:44,438 INFO L290 TraceCheckUtils]: 28: Hoare triple {5664#(<= ~counter~0 2)} ~cond := #in~cond; {5664#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:44,438 INFO L290 TraceCheckUtils]: 29: Hoare triple {5664#(<= ~counter~0 2)} assume !(0 == ~cond); {5664#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:44,438 INFO L290 TraceCheckUtils]: 30: Hoare triple {5664#(<= ~counter~0 2)} assume true; {5664#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:44,439 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {5664#(<= ~counter~0 2)} {5664#(<= ~counter~0 2)} #96#return; {5664#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:44,439 INFO L290 TraceCheckUtils]: 32: Hoare triple {5664#(<= ~counter~0 2)} assume !(~r~0 > 0); {5664#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:44,440 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-08 12:36:44,440 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-08 12:36:44,440 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-08 12:36:44,441 INFO L290 TraceCheckUtils]: 36: Hoare triple {5689#(<= ~counter~0 3)} ~cond := #in~cond; {5689#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:44,441 INFO L290 TraceCheckUtils]: 37: Hoare triple {5689#(<= ~counter~0 3)} assume !(0 == ~cond); {5689#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:44,441 INFO L290 TraceCheckUtils]: 38: Hoare triple {5689#(<= ~counter~0 3)} assume true; {5689#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:44,442 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {5689#(<= ~counter~0 3)} {5689#(<= ~counter~0 3)} #98#return; {5689#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:44,442 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-08 12:36:44,443 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-08 12:36:44,443 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-08 12:36:44,443 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-08 12:36:44,444 INFO L290 TraceCheckUtils]: 44: Hoare triple {5714#(<= ~counter~0 4)} ~cond := #in~cond; {5714#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:44,444 INFO L290 TraceCheckUtils]: 45: Hoare triple {5714#(<= ~counter~0 4)} assume !(0 == ~cond); {5714#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:44,444 INFO L290 TraceCheckUtils]: 46: Hoare triple {5714#(<= ~counter~0 4)} assume true; {5714#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:44,445 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {5714#(<= ~counter~0 4)} {5714#(<= ~counter~0 4)} #98#return; {5714#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:44,445 INFO L290 TraceCheckUtils]: 48: Hoare triple {5714#(<= ~counter~0 4)} assume !(~r~0 < 0); {5714#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:44,445 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-08 12:36:44,446 INFO L290 TraceCheckUtils]: 50: Hoare triple {5739#(<= |main_#t~post6| 4)} assume !(#t~post6 < 20);havoc #t~post6; {5583#false} is VALID [2022-04-08 12:36:44,446 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-08 12:36:44,446 INFO L290 TraceCheckUtils]: 52: Hoare triple {5583#false} ~cond := #in~cond; {5583#false} is VALID [2022-04-08 12:36:44,446 INFO L290 TraceCheckUtils]: 53: Hoare triple {5583#false} assume 0 == ~cond; {5583#false} is VALID [2022-04-08 12:36:44,446 INFO L290 TraceCheckUtils]: 54: Hoare triple {5583#false} assume !false; {5583#false} is VALID [2022-04-08 12:36:44,446 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-08 12:36:44,446 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:36:44,719 INFO L290 TraceCheckUtils]: 54: Hoare triple {5583#false} assume !false; {5583#false} is VALID [2022-04-08 12:36:44,720 INFO L290 TraceCheckUtils]: 53: Hoare triple {5583#false} assume 0 == ~cond; {5583#false} is VALID [2022-04-08 12:36:44,720 INFO L290 TraceCheckUtils]: 52: Hoare triple {5583#false} ~cond := #in~cond; {5583#false} is VALID [2022-04-08 12:36:44,720 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-08 12:36:44,722 INFO L290 TraceCheckUtils]: 50: Hoare triple {5767#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {5583#false} is VALID [2022-04-08 12:36:44,722 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-08 12:36:44,722 INFO L290 TraceCheckUtils]: 48: Hoare triple {5771#(< ~counter~0 20)} assume !(~r~0 < 0); {5771#(< ~counter~0 20)} is VALID [2022-04-08 12:36:44,723 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {5582#true} {5771#(< ~counter~0 20)} #98#return; {5771#(< ~counter~0 20)} is VALID [2022-04-08 12:36:44,723 INFO L290 TraceCheckUtils]: 46: Hoare triple {5582#true} assume true; {5582#true} is VALID [2022-04-08 12:36:44,723 INFO L290 TraceCheckUtils]: 45: Hoare triple {5582#true} assume !(0 == ~cond); {5582#true} is VALID [2022-04-08 12:36:44,723 INFO L290 TraceCheckUtils]: 44: Hoare triple {5582#true} ~cond := #in~cond; {5582#true} is VALID [2022-04-08 12:36:44,723 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-08 12:36:44,724 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-08 12:36:44,724 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-08 12:36:44,724 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-08 12:36:44,725 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {5582#true} {5796#(< ~counter~0 19)} #98#return; {5796#(< ~counter~0 19)} is VALID [2022-04-08 12:36:44,725 INFO L290 TraceCheckUtils]: 38: Hoare triple {5582#true} assume true; {5582#true} is VALID [2022-04-08 12:36:44,725 INFO L290 TraceCheckUtils]: 37: Hoare triple {5582#true} assume !(0 == ~cond); {5582#true} is VALID [2022-04-08 12:36:44,725 INFO L290 TraceCheckUtils]: 36: Hoare triple {5582#true} ~cond := #in~cond; {5582#true} is VALID [2022-04-08 12:36:44,725 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-08 12:36:44,737 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-08 12:36:44,737 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-08 12:36:44,738 INFO L290 TraceCheckUtils]: 32: Hoare triple {5821#(< ~counter~0 18)} assume !(~r~0 > 0); {5821#(< ~counter~0 18)} is VALID [2022-04-08 12:36:44,738 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {5582#true} {5821#(< ~counter~0 18)} #96#return; {5821#(< ~counter~0 18)} is VALID [2022-04-08 12:36:44,738 INFO L290 TraceCheckUtils]: 30: Hoare triple {5582#true} assume true; {5582#true} is VALID [2022-04-08 12:36:44,738 INFO L290 TraceCheckUtils]: 29: Hoare triple {5582#true} assume !(0 == ~cond); {5582#true} is VALID [2022-04-08 12:36:44,738 INFO L290 TraceCheckUtils]: 28: Hoare triple {5582#true} ~cond := #in~cond; {5582#true} is VALID [2022-04-08 12:36:44,739 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-08 12:36:44,739 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-08 12:36:44,739 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-08 12:36:44,739 INFO L290 TraceCheckUtils]: 24: Hoare triple {5846#(< ~counter~0 17)} assume !!(0 != ~r~0); {5846#(< ~counter~0 17)} is VALID [2022-04-08 12:36:44,740 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5582#true} {5846#(< ~counter~0 17)} #94#return; {5846#(< ~counter~0 17)} is VALID [2022-04-08 12:36:44,740 INFO L290 TraceCheckUtils]: 22: Hoare triple {5582#true} assume true; {5582#true} is VALID [2022-04-08 12:36:44,740 INFO L290 TraceCheckUtils]: 21: Hoare triple {5582#true} assume !(0 == ~cond); {5582#true} is VALID [2022-04-08 12:36:44,740 INFO L290 TraceCheckUtils]: 20: Hoare triple {5582#true} ~cond := #in~cond; {5582#true} is VALID [2022-04-08 12:36:44,740 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-08 12:36:44,741 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-08 12:36:44,741 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-08 12:36:44,741 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-08 12:36:44,742 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5582#true} {5871#(< ~counter~0 16)} #92#return; {5871#(< ~counter~0 16)} is VALID [2022-04-08 12:36:44,742 INFO L290 TraceCheckUtils]: 14: Hoare triple {5582#true} assume true; {5582#true} is VALID [2022-04-08 12:36:44,742 INFO L290 TraceCheckUtils]: 13: Hoare triple {5582#true} assume !(0 == ~cond); {5582#true} is VALID [2022-04-08 12:36:44,742 INFO L290 TraceCheckUtils]: 12: Hoare triple {5582#true} ~cond := #in~cond; {5582#true} is VALID [2022-04-08 12:36:44,742 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-08 12:36:44,742 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5582#true} {5871#(< ~counter~0 16)} #90#return; {5871#(< ~counter~0 16)} is VALID [2022-04-08 12:36:44,743 INFO L290 TraceCheckUtils]: 9: Hoare triple {5582#true} assume true; {5582#true} is VALID [2022-04-08 12:36:44,743 INFO L290 TraceCheckUtils]: 8: Hoare triple {5582#true} assume !(0 == ~cond); {5582#true} is VALID [2022-04-08 12:36:44,743 INFO L290 TraceCheckUtils]: 7: Hoare triple {5582#true} ~cond := #in~cond; {5582#true} is VALID [2022-04-08 12:36:44,743 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-08 12:36:44,743 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-08 12:36:44,743 INFO L272 TraceCheckUtils]: 4: Hoare triple {5871#(< ~counter~0 16)} call #t~ret9 := main(); {5871#(< ~counter~0 16)} is VALID [2022-04-08 12:36:44,744 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5871#(< ~counter~0 16)} {5582#true} #102#return; {5871#(< ~counter~0 16)} is VALID [2022-04-08 12:36:44,744 INFO L290 TraceCheckUtils]: 2: Hoare triple {5871#(< ~counter~0 16)} assume true; {5871#(< ~counter~0 16)} is VALID [2022-04-08 12:36:44,744 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-08 12:36:44,744 INFO L272 TraceCheckUtils]: 0: Hoare triple {5582#true} call ULTIMATE.init(); {5582#true} is VALID [2022-04-08 12:36:44,745 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-08 12:36:44,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:36:44,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892713183] [2022-04-08 12:36:44,745 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:36:44,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237724182] [2022-04-08 12:36:44,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [237724182] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:36:44,745 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:36:44,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-08 12:36:44,745 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:36:44,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [212879369] [2022-04-08 12:36:44,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [212879369] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:36:44,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:36:44,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 12:36:44,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827360470] [2022-04-08 12:36:44,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:36:44,746 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-08 12:36:44,746 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:36:44,746 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-08 12:36:44,782 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-08 12:36:44,782 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 12:36:44,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:36:44,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 12:36:44,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-08 12:36:44,783 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-08 12:36:45,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:45,057 INFO L93 Difference]: Finished difference Result 99 states and 121 transitions. [2022-04-08 12:36:45,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 12:36:45,058 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-08 12:36:45,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:36:45,058 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-08 12:36:45,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-08 12:36:45,059 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-08 12:36:45,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-08 12:36:45,060 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 95 transitions. [2022-04-08 12:36:45,131 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-08 12:36:45,133 INFO L225 Difference]: With dead ends: 99 [2022-04-08 12:36:45,133 INFO L226 Difference]: Without dead ends: 94 [2022-04-08 12:36:45,133 INFO L912 BasicCegarLoop]: 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-08 12:36:45,133 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 33 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-08 12:36:45,134 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 149 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 12:36:45,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-08 12:36:45,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2022-04-08 12:36:45,208 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:36:45,209 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-08 12:36:45,209 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-08 12:36:45,209 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-08 12:36:45,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:45,211 INFO L93 Difference]: Finished difference Result 94 states and 116 transitions. [2022-04-08 12:36:45,211 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 116 transitions. [2022-04-08 12:36:45,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:36:45,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:36:45,211 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-08 12:36:45,211 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-08 12:36:45,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:45,213 INFO L93 Difference]: Finished difference Result 94 states and 116 transitions. [2022-04-08 12:36:45,213 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 116 transitions. [2022-04-08 12:36:45,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:36:45,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:36:45,213 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:36:45,213 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:36:45,214 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-08 12:36:45,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 112 transitions. [2022-04-08 12:36:45,215 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 112 transitions. Word has length 55 [2022-04-08 12:36:45,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:36:45,215 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 112 transitions. [2022-04-08 12:36:45,215 INFO L479 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-08 12:36:45,215 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 112 transitions. [2022-04-08 12:36:47,341 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 111 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 12:36:47,341 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 112 transitions. [2022-04-08 12:36:47,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-08 12:36:47,342 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:36:47,342 INFO L499 BasicCegarLoop]: 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-08 12:36:47,358 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-08 12:36:47,554 WARN L460 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-08 12:36:47,555 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:36:47,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:36:47,555 INFO L85 PathProgramCache]: Analyzing trace with hash -2095290798, now seen corresponding path program 3 times [2022-04-08 12:36:47,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:36:47,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [329536419] [2022-04-08 12:36:47,556 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:36:47,556 INFO L85 PathProgramCache]: Analyzing trace with hash -2095290798, now seen corresponding path program 4 times [2022-04-08 12:36:47,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:36:47,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914239064] [2022-04-08 12:36:47,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:36:47,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:36:47,571 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:36:47,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [509045863] [2022-04-08 12:36:47,572 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 12:36:47,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:36:47,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:36:47,572 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-08 12:36:47,574 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-08 12:36:47,620 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 12:36:47,621 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:36:47,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-08 12:36:47,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:36:47,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:36:47,852 INFO L272 TraceCheckUtils]: 0: Hoare triple {6495#true} call ULTIMATE.init(); {6495#true} is VALID [2022-04-08 12:36:47,852 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-08 12:36:47,852 INFO L290 TraceCheckUtils]: 2: Hoare triple {6503#(<= ~counter~0 0)} assume true; {6503#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:47,853 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6503#(<= ~counter~0 0)} {6495#true} #102#return; {6503#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:47,853 INFO L272 TraceCheckUtils]: 4: Hoare triple {6503#(<= ~counter~0 0)} call #t~ret9 := main(); {6503#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:47,853 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-08 12:36:47,854 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-08 12:36:47,854 INFO L290 TraceCheckUtils]: 7: Hoare triple {6503#(<= ~counter~0 0)} ~cond := #in~cond; {6503#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:47,855 INFO L290 TraceCheckUtils]: 8: Hoare triple {6503#(<= ~counter~0 0)} assume !(0 == ~cond); {6503#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:47,856 INFO L290 TraceCheckUtils]: 9: Hoare triple {6503#(<= ~counter~0 0)} assume true; {6503#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:47,856 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6503#(<= ~counter~0 0)} {6503#(<= ~counter~0 0)} #90#return; {6503#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:47,856 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-08 12:36:47,857 INFO L290 TraceCheckUtils]: 12: Hoare triple {6503#(<= ~counter~0 0)} ~cond := #in~cond; {6503#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:47,857 INFO L290 TraceCheckUtils]: 13: Hoare triple {6503#(<= ~counter~0 0)} assume !(0 == ~cond); {6503#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:47,857 INFO L290 TraceCheckUtils]: 14: Hoare triple {6503#(<= ~counter~0 0)} assume true; {6503#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:47,858 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6503#(<= ~counter~0 0)} {6503#(<= ~counter~0 0)} #92#return; {6503#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:47,858 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-08 12:36:47,858 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-08 12:36:47,859 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-08 12:36:47,859 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-08 12:36:47,859 INFO L290 TraceCheckUtils]: 20: Hoare triple {6552#(<= ~counter~0 1)} ~cond := #in~cond; {6552#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:47,860 INFO L290 TraceCheckUtils]: 21: Hoare triple {6552#(<= ~counter~0 1)} assume !(0 == ~cond); {6552#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:47,860 INFO L290 TraceCheckUtils]: 22: Hoare triple {6552#(<= ~counter~0 1)} assume true; {6552#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:47,860 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6552#(<= ~counter~0 1)} {6552#(<= ~counter~0 1)} #94#return; {6552#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:47,861 INFO L290 TraceCheckUtils]: 24: Hoare triple {6552#(<= ~counter~0 1)} assume !!(0 != ~r~0); {6552#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:47,861 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-08 12:36:47,861 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-08 12:36:47,862 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-08 12:36:47,862 INFO L290 TraceCheckUtils]: 28: Hoare triple {6577#(<= ~counter~0 2)} ~cond := #in~cond; {6577#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:47,862 INFO L290 TraceCheckUtils]: 29: Hoare triple {6577#(<= ~counter~0 2)} assume !(0 == ~cond); {6577#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:47,863 INFO L290 TraceCheckUtils]: 30: Hoare triple {6577#(<= ~counter~0 2)} assume true; {6577#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:47,863 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6577#(<= ~counter~0 2)} {6577#(<= ~counter~0 2)} #96#return; {6577#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:47,863 INFO L290 TraceCheckUtils]: 32: Hoare triple {6577#(<= ~counter~0 2)} assume !(~r~0 > 0); {6577#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:47,864 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-08 12:36:47,864 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-08 12:36:47,865 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-08 12:36:47,865 INFO L290 TraceCheckUtils]: 36: Hoare triple {6602#(<= ~counter~0 3)} ~cond := #in~cond; {6602#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:47,865 INFO L290 TraceCheckUtils]: 37: Hoare triple {6602#(<= ~counter~0 3)} assume !(0 == ~cond); {6602#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:47,865 INFO L290 TraceCheckUtils]: 38: Hoare triple {6602#(<= ~counter~0 3)} assume true; {6602#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:47,866 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {6602#(<= ~counter~0 3)} {6602#(<= ~counter~0 3)} #98#return; {6602#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:47,866 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-08 12:36:47,867 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-08 12:36:47,867 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-08 12:36:47,867 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-08 12:36:47,868 INFO L290 TraceCheckUtils]: 44: Hoare triple {6627#(<= ~counter~0 4)} ~cond := #in~cond; {6627#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:47,868 INFO L290 TraceCheckUtils]: 45: Hoare triple {6627#(<= ~counter~0 4)} assume !(0 == ~cond); {6627#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:47,868 INFO L290 TraceCheckUtils]: 46: Hoare triple {6627#(<= ~counter~0 4)} assume true; {6627#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:47,871 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6627#(<= ~counter~0 4)} {6627#(<= ~counter~0 4)} #98#return; {6627#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:47,871 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-08 12:36:47,872 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-08 12:36:47,872 INFO L290 TraceCheckUtils]: 50: Hoare triple {6652#(<= |main_#t~post8| 4)} assume !(#t~post8 < 20);havoc #t~post8; {6496#false} is VALID [2022-04-08 12:36:47,872 INFO L290 TraceCheckUtils]: 51: Hoare triple {6496#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6496#false} is VALID [2022-04-08 12:36:47,872 INFO L290 TraceCheckUtils]: 52: Hoare triple {6496#false} assume !(#t~post6 < 20);havoc #t~post6; {6496#false} is VALID [2022-04-08 12:36:47,872 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-08 12:36:47,872 INFO L290 TraceCheckUtils]: 54: Hoare triple {6496#false} ~cond := #in~cond; {6496#false} is VALID [2022-04-08 12:36:47,873 INFO L290 TraceCheckUtils]: 55: Hoare triple {6496#false} assume 0 == ~cond; {6496#false} is VALID [2022-04-08 12:36:47,873 INFO L290 TraceCheckUtils]: 56: Hoare triple {6496#false} assume !false; {6496#false} is VALID [2022-04-08 12:36:47,873 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-08 12:36:47,873 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:36:48,160 INFO L290 TraceCheckUtils]: 56: Hoare triple {6496#false} assume !false; {6496#false} is VALID [2022-04-08 12:36:48,161 INFO L290 TraceCheckUtils]: 55: Hoare triple {6496#false} assume 0 == ~cond; {6496#false} is VALID [2022-04-08 12:36:48,161 INFO L290 TraceCheckUtils]: 54: Hoare triple {6496#false} ~cond := #in~cond; {6496#false} is VALID [2022-04-08 12:36:48,161 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-08 12:36:48,161 INFO L290 TraceCheckUtils]: 52: Hoare triple {6496#false} assume !(#t~post6 < 20);havoc #t~post6; {6496#false} is VALID [2022-04-08 12:36:48,161 INFO L290 TraceCheckUtils]: 51: Hoare triple {6496#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6496#false} is VALID [2022-04-08 12:36:48,161 INFO L290 TraceCheckUtils]: 50: Hoare triple {6692#(< |main_#t~post8| 20)} assume !(#t~post8 < 20);havoc #t~post8; {6496#false} is VALID [2022-04-08 12:36:48,162 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-08 12:36:48,162 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-08 12:36:48,163 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6495#true} {6696#(< ~counter~0 20)} #98#return; {6696#(< ~counter~0 20)} is VALID [2022-04-08 12:36:48,163 INFO L290 TraceCheckUtils]: 46: Hoare triple {6495#true} assume true; {6495#true} is VALID [2022-04-08 12:36:48,163 INFO L290 TraceCheckUtils]: 45: Hoare triple {6495#true} assume !(0 == ~cond); {6495#true} is VALID [2022-04-08 12:36:48,163 INFO L290 TraceCheckUtils]: 44: Hoare triple {6495#true} ~cond := #in~cond; {6495#true} is VALID [2022-04-08 12:36:48,163 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-08 12:36:48,163 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-08 12:36:48,164 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-08 12:36:48,164 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-08 12:36:48,165 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {6495#true} {6721#(< ~counter~0 19)} #98#return; {6721#(< ~counter~0 19)} is VALID [2022-04-08 12:36:48,165 INFO L290 TraceCheckUtils]: 38: Hoare triple {6495#true} assume true; {6495#true} is VALID [2022-04-08 12:36:48,165 INFO L290 TraceCheckUtils]: 37: Hoare triple {6495#true} assume !(0 == ~cond); {6495#true} is VALID [2022-04-08 12:36:48,165 INFO L290 TraceCheckUtils]: 36: Hoare triple {6495#true} ~cond := #in~cond; {6495#true} is VALID [2022-04-08 12:36:48,165 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-08 12:36:48,165 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-08 12:36:48,166 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-08 12:36:48,166 INFO L290 TraceCheckUtils]: 32: Hoare triple {6746#(< ~counter~0 18)} assume !(~r~0 > 0); {6746#(< ~counter~0 18)} is VALID [2022-04-08 12:36:48,167 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6495#true} {6746#(< ~counter~0 18)} #96#return; {6746#(< ~counter~0 18)} is VALID [2022-04-08 12:36:48,167 INFO L290 TraceCheckUtils]: 30: Hoare triple {6495#true} assume true; {6495#true} is VALID [2022-04-08 12:36:48,167 INFO L290 TraceCheckUtils]: 29: Hoare triple {6495#true} assume !(0 == ~cond); {6495#true} is VALID [2022-04-08 12:36:48,167 INFO L290 TraceCheckUtils]: 28: Hoare triple {6495#true} ~cond := #in~cond; {6495#true} is VALID [2022-04-08 12:36:48,167 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-08 12:36:48,167 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-08 12:36:48,168 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-08 12:36:48,168 INFO L290 TraceCheckUtils]: 24: Hoare triple {6771#(< ~counter~0 17)} assume !!(0 != ~r~0); {6771#(< ~counter~0 17)} is VALID [2022-04-08 12:36:48,169 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6495#true} {6771#(< ~counter~0 17)} #94#return; {6771#(< ~counter~0 17)} is VALID [2022-04-08 12:36:48,169 INFO L290 TraceCheckUtils]: 22: Hoare triple {6495#true} assume true; {6495#true} is VALID [2022-04-08 12:36:48,169 INFO L290 TraceCheckUtils]: 21: Hoare triple {6495#true} assume !(0 == ~cond); {6495#true} is VALID [2022-04-08 12:36:48,169 INFO L290 TraceCheckUtils]: 20: Hoare triple {6495#true} ~cond := #in~cond; {6495#true} is VALID [2022-04-08 12:36:48,169 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-08 12:36:48,169 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-08 12:36:48,170 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-08 12:36:48,170 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-08 12:36:48,170 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6495#true} {6796#(< ~counter~0 16)} #92#return; {6796#(< ~counter~0 16)} is VALID [2022-04-08 12:36:48,170 INFO L290 TraceCheckUtils]: 14: Hoare triple {6495#true} assume true; {6495#true} is VALID [2022-04-08 12:36:48,170 INFO L290 TraceCheckUtils]: 13: Hoare triple {6495#true} assume !(0 == ~cond); {6495#true} is VALID [2022-04-08 12:36:48,171 INFO L290 TraceCheckUtils]: 12: Hoare triple {6495#true} ~cond := #in~cond; {6495#true} is VALID [2022-04-08 12:36:48,171 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-08 12:36:48,171 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6495#true} {6796#(< ~counter~0 16)} #90#return; {6796#(< ~counter~0 16)} is VALID [2022-04-08 12:36:48,171 INFO L290 TraceCheckUtils]: 9: Hoare triple {6495#true} assume true; {6495#true} is VALID [2022-04-08 12:36:48,171 INFO L290 TraceCheckUtils]: 8: Hoare triple {6495#true} assume !(0 == ~cond); {6495#true} is VALID [2022-04-08 12:36:48,171 INFO L290 TraceCheckUtils]: 7: Hoare triple {6495#true} ~cond := #in~cond; {6495#true} is VALID [2022-04-08 12:36:48,171 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-08 12:36:48,172 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-08 12:36:48,172 INFO L272 TraceCheckUtils]: 4: Hoare triple {6796#(< ~counter~0 16)} call #t~ret9 := main(); {6796#(< ~counter~0 16)} is VALID [2022-04-08 12:36:48,172 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6796#(< ~counter~0 16)} {6495#true} #102#return; {6796#(< ~counter~0 16)} is VALID [2022-04-08 12:36:48,173 INFO L290 TraceCheckUtils]: 2: Hoare triple {6796#(< ~counter~0 16)} assume true; {6796#(< ~counter~0 16)} is VALID [2022-04-08 12:36:48,173 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-08 12:36:48,173 INFO L272 TraceCheckUtils]: 0: Hoare triple {6495#true} call ULTIMATE.init(); {6495#true} is VALID [2022-04-08 12:36:48,173 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-08 12:36:48,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:36:48,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914239064] [2022-04-08 12:36:48,174 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:36:48,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509045863] [2022-04-08 12:36:48,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509045863] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:36:48,174 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:36:48,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-08 12:36:48,174 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:36:48,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [329536419] [2022-04-08 12:36:48,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [329536419] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:36:48,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:36:48,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 12:36:48,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834918263] [2022-04-08 12:36:48,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:36:48,175 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-08 12:36:48,175 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:36:48,175 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-08 12:36:48,228 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-08 12:36:48,228 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 12:36:48,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:36:48,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 12:36:48,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-08 12:36:48,229 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-08 12:36:48,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:48,481 INFO L93 Difference]: Finished difference Result 132 states and 170 transitions. [2022-04-08 12:36:48,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 12:36:48,481 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-08 12:36:48,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:36:48,482 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-08 12:36:48,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2022-04-08 12:36:48,483 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-08 12:36:48,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2022-04-08 12:36:48,485 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 117 transitions. [2022-04-08 12:36:48,557 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-08 12:36:48,558 INFO L225 Difference]: With dead ends: 132 [2022-04-08 12:36:48,558 INFO L226 Difference]: Without dead ends: 95 [2022-04-08 12:36:48,559 INFO L912 BasicCegarLoop]: 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-08 12:36:48,559 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 25 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-08 12:36:48,559 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 160 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 12:36:48,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-04-08 12:36:48,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2022-04-08 12:36:48,627 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:36:48,627 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-08 12:36:48,628 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-08 12:36:48,628 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-08 12:36:48,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:48,629 INFO L93 Difference]: Finished difference Result 95 states and 117 transitions. [2022-04-08 12:36:48,629 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 117 transitions. [2022-04-08 12:36:48,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:36:48,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:36:48,630 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-08 12:36:48,630 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-08 12:36:48,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:48,632 INFO L93 Difference]: Finished difference Result 95 states and 117 transitions. [2022-04-08 12:36:48,632 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 117 transitions. [2022-04-08 12:36:48,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:36:48,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:36:48,632 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:36:48,632 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:36:48,632 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-08 12:36:48,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 116 transitions. [2022-04-08 12:36:48,634 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 116 transitions. Word has length 57 [2022-04-08 12:36:48,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:36:48,634 INFO L478 AbstractCegarLoop]: Abstraction has 94 states and 116 transitions. [2022-04-08 12:36:48,634 INFO L479 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-08 12:36:48,634 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 116 transitions. [2022-04-08 12:36:49,546 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-08 12:36:49,546 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 116 transitions. [2022-04-08 12:36:49,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-08 12:36:49,547 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:36:49,547 INFO L499 BasicCegarLoop]: 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-08 12:36:49,563 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-08 12:36:49,758 WARN L460 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-08 12:36:49,758 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:36:49,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:36:49,759 INFO L85 PathProgramCache]: Analyzing trace with hash -659642693, now seen corresponding path program 5 times [2022-04-08 12:36:49,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:36:49,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [851818686] [2022-04-08 12:36:49,759 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:36:49,759 INFO L85 PathProgramCache]: Analyzing trace with hash -659642693, now seen corresponding path program 6 times [2022-04-08 12:36:49,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:36:49,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841668605] [2022-04-08 12:36:49,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:36:49,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:36:49,768 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:36:49,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1123231162] [2022-04-08 12:36:49,768 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 12:36:49,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:36:49,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:36:49,769 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-08 12:36:49,770 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-08 12:36:49,842 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 12:36:49,843 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:36:49,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-08 12:36:49,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:36:49,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:36:50,098 INFO L272 TraceCheckUtils]: 0: Hoare triple {7496#true} call ULTIMATE.init(); {7496#true} is VALID [2022-04-08 12:36:50,098 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-08 12:36:50,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {7504#(<= ~counter~0 0)} assume true; {7504#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:50,099 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7504#(<= ~counter~0 0)} {7496#true} #102#return; {7504#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:50,099 INFO L272 TraceCheckUtils]: 4: Hoare triple {7504#(<= ~counter~0 0)} call #t~ret9 := main(); {7504#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:50,100 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-08 12:36:50,100 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-08 12:36:50,100 INFO L290 TraceCheckUtils]: 7: Hoare triple {7504#(<= ~counter~0 0)} ~cond := #in~cond; {7504#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:50,101 INFO L290 TraceCheckUtils]: 8: Hoare triple {7504#(<= ~counter~0 0)} assume !(0 == ~cond); {7504#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:50,101 INFO L290 TraceCheckUtils]: 9: Hoare triple {7504#(<= ~counter~0 0)} assume true; {7504#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:50,101 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7504#(<= ~counter~0 0)} {7504#(<= ~counter~0 0)} #90#return; {7504#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:50,102 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-08 12:36:50,102 INFO L290 TraceCheckUtils]: 12: Hoare triple {7504#(<= ~counter~0 0)} ~cond := #in~cond; {7504#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:50,102 INFO L290 TraceCheckUtils]: 13: Hoare triple {7504#(<= ~counter~0 0)} assume !(0 == ~cond); {7504#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:50,103 INFO L290 TraceCheckUtils]: 14: Hoare triple {7504#(<= ~counter~0 0)} assume true; {7504#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:50,103 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7504#(<= ~counter~0 0)} {7504#(<= ~counter~0 0)} #92#return; {7504#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:50,103 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-08 12:36:50,104 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-08 12:36:50,104 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-08 12:36:50,105 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-08 12:36:50,105 INFO L290 TraceCheckUtils]: 20: Hoare triple {7553#(<= ~counter~0 1)} ~cond := #in~cond; {7553#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:50,105 INFO L290 TraceCheckUtils]: 21: Hoare triple {7553#(<= ~counter~0 1)} assume !(0 == ~cond); {7553#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:50,105 INFO L290 TraceCheckUtils]: 22: Hoare triple {7553#(<= ~counter~0 1)} assume true; {7553#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:50,106 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7553#(<= ~counter~0 1)} {7553#(<= ~counter~0 1)} #94#return; {7553#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:50,106 INFO L290 TraceCheckUtils]: 24: Hoare triple {7553#(<= ~counter~0 1)} assume !!(0 != ~r~0); {7553#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:50,107 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-08 12:36:50,107 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-08 12:36:50,108 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-08 12:36:50,108 INFO L290 TraceCheckUtils]: 28: Hoare triple {7578#(<= ~counter~0 2)} ~cond := #in~cond; {7578#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:50,109 INFO L290 TraceCheckUtils]: 29: Hoare triple {7578#(<= ~counter~0 2)} assume !(0 == ~cond); {7578#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:50,109 INFO L290 TraceCheckUtils]: 30: Hoare triple {7578#(<= ~counter~0 2)} assume true; {7578#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:50,111 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {7578#(<= ~counter~0 2)} {7578#(<= ~counter~0 2)} #96#return; {7578#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:50,119 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-08 12:36:50,120 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-08 12:36:50,120 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-08 12:36:50,121 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-08 12:36:50,121 INFO L290 TraceCheckUtils]: 36: Hoare triple {7603#(<= ~counter~0 3)} ~cond := #in~cond; {7603#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:50,122 INFO L290 TraceCheckUtils]: 37: Hoare triple {7603#(<= ~counter~0 3)} assume !(0 == ~cond); {7603#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:50,122 INFO L290 TraceCheckUtils]: 38: Hoare triple {7603#(<= ~counter~0 3)} assume true; {7603#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:50,122 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {7603#(<= ~counter~0 3)} {7603#(<= ~counter~0 3)} #96#return; {7603#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:50,123 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-08 12:36:50,123 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-08 12:36:50,124 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-08 12:36:50,124 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-08 12:36:50,125 INFO L290 TraceCheckUtils]: 44: Hoare triple {7628#(<= ~counter~0 4)} ~cond := #in~cond; {7628#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:50,125 INFO L290 TraceCheckUtils]: 45: Hoare triple {7628#(<= ~counter~0 4)} assume !(0 == ~cond); {7628#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:50,125 INFO L290 TraceCheckUtils]: 46: Hoare triple {7628#(<= ~counter~0 4)} assume true; {7628#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:50,126 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {7628#(<= ~counter~0 4)} {7628#(<= ~counter~0 4)} #96#return; {7628#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:50,126 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-08 12:36:50,127 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-08 12:36:50,127 INFO L290 TraceCheckUtils]: 50: Hoare triple {7653#(<= |main_#t~post7| 4)} assume !(#t~post7 < 20);havoc #t~post7; {7497#false} is VALID [2022-04-08 12:36:50,127 INFO L290 TraceCheckUtils]: 51: Hoare triple {7497#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {7497#false} is VALID [2022-04-08 12:36:50,127 INFO L290 TraceCheckUtils]: 52: Hoare triple {7497#false} assume !(#t~post8 < 20);havoc #t~post8; {7497#false} is VALID [2022-04-08 12:36:50,127 INFO L290 TraceCheckUtils]: 53: Hoare triple {7497#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7497#false} is VALID [2022-04-08 12:36:50,127 INFO L290 TraceCheckUtils]: 54: Hoare triple {7497#false} assume !(#t~post6 < 20);havoc #t~post6; {7497#false} is VALID [2022-04-08 12:36:50,127 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-08 12:36:50,127 INFO L290 TraceCheckUtils]: 56: Hoare triple {7497#false} ~cond := #in~cond; {7497#false} is VALID [2022-04-08 12:36:50,127 INFO L290 TraceCheckUtils]: 57: Hoare triple {7497#false} assume 0 == ~cond; {7497#false} is VALID [2022-04-08 12:36:50,128 INFO L290 TraceCheckUtils]: 58: Hoare triple {7497#false} assume !false; {7497#false} is VALID [2022-04-08 12:36:50,128 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-08 12:36:50,128 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:36:50,403 INFO L290 TraceCheckUtils]: 58: Hoare triple {7497#false} assume !false; {7497#false} is VALID [2022-04-08 12:36:50,404 INFO L290 TraceCheckUtils]: 57: Hoare triple {7497#false} assume 0 == ~cond; {7497#false} is VALID [2022-04-08 12:36:50,404 INFO L290 TraceCheckUtils]: 56: Hoare triple {7497#false} ~cond := #in~cond; {7497#false} is VALID [2022-04-08 12:36:50,404 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-08 12:36:50,404 INFO L290 TraceCheckUtils]: 54: Hoare triple {7497#false} assume !(#t~post6 < 20);havoc #t~post6; {7497#false} is VALID [2022-04-08 12:36:50,404 INFO L290 TraceCheckUtils]: 53: Hoare triple {7497#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7497#false} is VALID [2022-04-08 12:36:50,404 INFO L290 TraceCheckUtils]: 52: Hoare triple {7497#false} assume !(#t~post8 < 20);havoc #t~post8; {7497#false} is VALID [2022-04-08 12:36:50,404 INFO L290 TraceCheckUtils]: 51: Hoare triple {7497#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {7497#false} is VALID [2022-04-08 12:36:50,411 INFO L290 TraceCheckUtils]: 50: Hoare triple {7705#(< |main_#t~post7| 20)} assume !(#t~post7 < 20);havoc #t~post7; {7497#false} is VALID [2022-04-08 12:36:50,411 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-08 12:36:50,412 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-08 12:36:50,412 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {7496#true} {7709#(< ~counter~0 20)} #96#return; {7709#(< ~counter~0 20)} is VALID [2022-04-08 12:36:50,412 INFO L290 TraceCheckUtils]: 46: Hoare triple {7496#true} assume true; {7496#true} is VALID [2022-04-08 12:36:50,412 INFO L290 TraceCheckUtils]: 45: Hoare triple {7496#true} assume !(0 == ~cond); {7496#true} is VALID [2022-04-08 12:36:50,412 INFO L290 TraceCheckUtils]: 44: Hoare triple {7496#true} ~cond := #in~cond; {7496#true} is VALID [2022-04-08 12:36:50,413 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-08 12:36:50,413 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-08 12:36:50,413 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-08 12:36:50,414 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-08 12:36:50,414 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {7496#true} {7734#(< ~counter~0 19)} #96#return; {7734#(< ~counter~0 19)} is VALID [2022-04-08 12:36:50,414 INFO L290 TraceCheckUtils]: 38: Hoare triple {7496#true} assume true; {7496#true} is VALID [2022-04-08 12:36:50,414 INFO L290 TraceCheckUtils]: 37: Hoare triple {7496#true} assume !(0 == ~cond); {7496#true} is VALID [2022-04-08 12:36:50,414 INFO L290 TraceCheckUtils]: 36: Hoare triple {7496#true} ~cond := #in~cond; {7496#true} is VALID [2022-04-08 12:36:50,414 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-08 12:36:50,415 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-08 12:36:50,415 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-08 12:36:50,415 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-08 12:36:50,416 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {7496#true} {7759#(< ~counter~0 18)} #96#return; {7759#(< ~counter~0 18)} is VALID [2022-04-08 12:36:50,416 INFO L290 TraceCheckUtils]: 30: Hoare triple {7496#true} assume true; {7496#true} is VALID [2022-04-08 12:36:50,416 INFO L290 TraceCheckUtils]: 29: Hoare triple {7496#true} assume !(0 == ~cond); {7496#true} is VALID [2022-04-08 12:36:50,416 INFO L290 TraceCheckUtils]: 28: Hoare triple {7496#true} ~cond := #in~cond; {7496#true} is VALID [2022-04-08 12:36:50,416 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-08 12:36:50,416 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-08 12:36:50,417 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-08 12:36:50,417 INFO L290 TraceCheckUtils]: 24: Hoare triple {7784#(< ~counter~0 17)} assume !!(0 != ~r~0); {7784#(< ~counter~0 17)} is VALID [2022-04-08 12:36:50,418 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7496#true} {7784#(< ~counter~0 17)} #94#return; {7784#(< ~counter~0 17)} is VALID [2022-04-08 12:36:50,418 INFO L290 TraceCheckUtils]: 22: Hoare triple {7496#true} assume true; {7496#true} is VALID [2022-04-08 12:36:50,418 INFO L290 TraceCheckUtils]: 21: Hoare triple {7496#true} assume !(0 == ~cond); {7496#true} is VALID [2022-04-08 12:36:50,418 INFO L290 TraceCheckUtils]: 20: Hoare triple {7496#true} ~cond := #in~cond; {7496#true} is VALID [2022-04-08 12:36:50,418 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-08 12:36:50,418 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-08 12:36:50,419 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-08 12:36:50,419 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-08 12:36:50,419 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7496#true} {7809#(< ~counter~0 16)} #92#return; {7809#(< ~counter~0 16)} is VALID [2022-04-08 12:36:50,419 INFO L290 TraceCheckUtils]: 14: Hoare triple {7496#true} assume true; {7496#true} is VALID [2022-04-08 12:36:50,419 INFO L290 TraceCheckUtils]: 13: Hoare triple {7496#true} assume !(0 == ~cond); {7496#true} is VALID [2022-04-08 12:36:50,419 INFO L290 TraceCheckUtils]: 12: Hoare triple {7496#true} ~cond := #in~cond; {7496#true} is VALID [2022-04-08 12:36:50,420 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-08 12:36:50,420 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7496#true} {7809#(< ~counter~0 16)} #90#return; {7809#(< ~counter~0 16)} is VALID [2022-04-08 12:36:50,420 INFO L290 TraceCheckUtils]: 9: Hoare triple {7496#true} assume true; {7496#true} is VALID [2022-04-08 12:36:50,420 INFO L290 TraceCheckUtils]: 8: Hoare triple {7496#true} assume !(0 == ~cond); {7496#true} is VALID [2022-04-08 12:36:50,420 INFO L290 TraceCheckUtils]: 7: Hoare triple {7496#true} ~cond := #in~cond; {7496#true} is VALID [2022-04-08 12:36:50,420 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-08 12:36:50,420 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-08 12:36:50,421 INFO L272 TraceCheckUtils]: 4: Hoare triple {7809#(< ~counter~0 16)} call #t~ret9 := main(); {7809#(< ~counter~0 16)} is VALID [2022-04-08 12:36:50,421 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7809#(< ~counter~0 16)} {7496#true} #102#return; {7809#(< ~counter~0 16)} is VALID [2022-04-08 12:36:50,421 INFO L290 TraceCheckUtils]: 2: Hoare triple {7809#(< ~counter~0 16)} assume true; {7809#(< ~counter~0 16)} is VALID [2022-04-08 12:36:50,422 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-08 12:36:50,422 INFO L272 TraceCheckUtils]: 0: Hoare triple {7496#true} call ULTIMATE.init(); {7496#true} is VALID [2022-04-08 12:36:50,422 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-08 12:36:50,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:36:50,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841668605] [2022-04-08 12:36:50,422 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:36:50,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123231162] [2022-04-08 12:36:50,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123231162] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:36:50,423 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:36:50,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-08 12:36:50,423 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:36:50,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [851818686] [2022-04-08 12:36:50,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [851818686] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:36:50,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:36:50,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 12:36:50,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750111621] [2022-04-08 12:36:50,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:36:50,424 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-08 12:36:50,424 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:36:50,424 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-08 12:36:50,461 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-08 12:36:50,461 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 12:36:50,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:36:50,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 12:36:50,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-08 12:36:50,461 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-08 12:36:50,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:50,724 INFO L93 Difference]: Finished difference Result 133 states and 171 transitions. [2022-04-08 12:36:50,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 12:36:50,724 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-08 12:36:50,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:36:50,725 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-08 12:36:50,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 117 transitions. [2022-04-08 12:36:50,728 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-08 12:36:50,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 117 transitions. [2022-04-08 12:36:50,729 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 117 transitions. [2022-04-08 12:36:50,799 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-08 12:36:50,800 INFO L225 Difference]: With dead ends: 133 [2022-04-08 12:36:50,800 INFO L226 Difference]: Without dead ends: 96 [2022-04-08 12:36:50,801 INFO L912 BasicCegarLoop]: 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-08 12:36:50,801 INFO L913 BasicCegarLoop]: 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-08 12:36:50,801 INFO L914 BasicCegarLoop]: 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-08 12:36:50,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-08 12:36:50,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-04-08 12:36:50,882 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:36:50,883 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-08 12:36:50,883 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-08 12:36:50,883 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-08 12:36:50,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:50,885 INFO L93 Difference]: Finished difference Result 96 states and 118 transitions. [2022-04-08 12:36:50,885 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 118 transitions. [2022-04-08 12:36:50,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:36:50,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:36:50,886 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-08 12:36:50,886 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-08 12:36:50,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:50,888 INFO L93 Difference]: Finished difference Result 96 states and 118 transitions. [2022-04-08 12:36:50,888 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 118 transitions. [2022-04-08 12:36:50,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:36:50,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:36:50,889 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:36:50,889 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:36:50,889 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-08 12:36:50,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 118 transitions. [2022-04-08 12:36:50,891 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 118 transitions. Word has length 59 [2022-04-08 12:36:50,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:36:50,891 INFO L478 AbstractCegarLoop]: Abstraction has 96 states and 118 transitions. [2022-04-08 12:36:50,891 INFO L479 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-08 12:36:50,891 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 96 states and 118 transitions. [2022-04-08 12:36:51,771 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-08 12:36:51,772 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 118 transitions. [2022-04-08 12:36:51,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-08 12:36:51,772 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:36:51,772 INFO L499 BasicCegarLoop]: 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-08 12:36:51,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-08 12:36:51,979 WARN L460 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-08 12:36:51,979 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:36:51,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:36:51,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1402694082, now seen corresponding path program 3 times [2022-04-08 12:36:51,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:36:51,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1008642397] [2022-04-08 12:36:51,980 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:36:51,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1402694082, now seen corresponding path program 4 times [2022-04-08 12:36:51,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:36:51,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365232224] [2022-04-08 12:36:51,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:36:51,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:36:51,990 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:36:51,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [460610247] [2022-04-08 12:36:51,991 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 12:36:51,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:36:51,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:36:51,991 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-08 12:36:51,992 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-08 12:36:52,045 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 12:36:52,045 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:36:52,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 12:36:52,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:36:52,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:36:52,341 INFO L272 TraceCheckUtils]: 0: Hoare triple {8519#true} call ULTIMATE.init(); {8519#true} is VALID [2022-04-08 12:36:52,342 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-08 12:36:52,342 INFO L290 TraceCheckUtils]: 2: Hoare triple {8527#(<= ~counter~0 0)} assume true; {8527#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:52,342 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8527#(<= ~counter~0 0)} {8519#true} #102#return; {8527#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:52,343 INFO L272 TraceCheckUtils]: 4: Hoare triple {8527#(<= ~counter~0 0)} call #t~ret9 := main(); {8527#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:52,343 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-08 12:36:52,343 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-08 12:36:52,344 INFO L290 TraceCheckUtils]: 7: Hoare triple {8527#(<= ~counter~0 0)} ~cond := #in~cond; {8527#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:52,344 INFO L290 TraceCheckUtils]: 8: Hoare triple {8527#(<= ~counter~0 0)} assume !(0 == ~cond); {8527#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:52,344 INFO L290 TraceCheckUtils]: 9: Hoare triple {8527#(<= ~counter~0 0)} assume true; {8527#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:52,345 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8527#(<= ~counter~0 0)} {8527#(<= ~counter~0 0)} #90#return; {8527#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:52,345 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-08 12:36:52,345 INFO L290 TraceCheckUtils]: 12: Hoare triple {8527#(<= ~counter~0 0)} ~cond := #in~cond; {8527#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:52,345 INFO L290 TraceCheckUtils]: 13: Hoare triple {8527#(<= ~counter~0 0)} assume !(0 == ~cond); {8527#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:52,346 INFO L290 TraceCheckUtils]: 14: Hoare triple {8527#(<= ~counter~0 0)} assume true; {8527#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:52,346 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8527#(<= ~counter~0 0)} {8527#(<= ~counter~0 0)} #92#return; {8527#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:52,346 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-08 12:36:52,347 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-08 12:36:52,347 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-08 12:36:52,348 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-08 12:36:52,348 INFO L290 TraceCheckUtils]: 20: Hoare triple {8576#(<= ~counter~0 1)} ~cond := #in~cond; {8576#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:52,348 INFO L290 TraceCheckUtils]: 21: Hoare triple {8576#(<= ~counter~0 1)} assume !(0 == ~cond); {8576#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:52,349 INFO L290 TraceCheckUtils]: 22: Hoare triple {8576#(<= ~counter~0 1)} assume true; {8576#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:52,349 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8576#(<= ~counter~0 1)} {8576#(<= ~counter~0 1)} #94#return; {8576#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:52,349 INFO L290 TraceCheckUtils]: 24: Hoare triple {8576#(<= ~counter~0 1)} assume !!(0 != ~r~0); {8576#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:52,350 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-08 12:36:52,350 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-08 12:36:52,351 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-08 12:36:52,351 INFO L290 TraceCheckUtils]: 28: Hoare triple {8601#(<= ~counter~0 2)} ~cond := #in~cond; {8601#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:52,351 INFO L290 TraceCheckUtils]: 29: Hoare triple {8601#(<= ~counter~0 2)} assume !(0 == ~cond); {8601#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:52,351 INFO L290 TraceCheckUtils]: 30: Hoare triple {8601#(<= ~counter~0 2)} assume true; {8601#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:52,352 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {8601#(<= ~counter~0 2)} {8601#(<= ~counter~0 2)} #96#return; {8601#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:52,352 INFO L290 TraceCheckUtils]: 32: Hoare triple {8601#(<= ~counter~0 2)} assume !(~r~0 > 0); {8601#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:52,353 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-08 12:36:52,353 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-08 12:36:52,353 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-08 12:36:52,354 INFO L290 TraceCheckUtils]: 36: Hoare triple {8626#(<= ~counter~0 3)} ~cond := #in~cond; {8626#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:52,354 INFO L290 TraceCheckUtils]: 37: Hoare triple {8626#(<= ~counter~0 3)} assume !(0 == ~cond); {8626#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:52,354 INFO L290 TraceCheckUtils]: 38: Hoare triple {8626#(<= ~counter~0 3)} assume true; {8626#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:52,355 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {8626#(<= ~counter~0 3)} {8626#(<= ~counter~0 3)} #98#return; {8626#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:52,355 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-08 12:36:52,356 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-08 12:36:52,356 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-08 12:36:52,356 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-08 12:36:52,357 INFO L290 TraceCheckUtils]: 44: Hoare triple {8651#(<= ~counter~0 4)} ~cond := #in~cond; {8651#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:52,357 INFO L290 TraceCheckUtils]: 45: Hoare triple {8651#(<= ~counter~0 4)} assume !(0 == ~cond); {8651#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:52,357 INFO L290 TraceCheckUtils]: 46: Hoare triple {8651#(<= ~counter~0 4)} assume true; {8651#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:52,358 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {8651#(<= ~counter~0 4)} {8651#(<= ~counter~0 4)} #98#return; {8651#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:52,358 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-08 12:36:52,358 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-08 12:36:52,359 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-08 12:36:52,359 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-08 12:36:52,359 INFO L290 TraceCheckUtils]: 52: Hoare triple {8676#(<= ~counter~0 5)} ~cond := #in~cond; {8676#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:52,360 INFO L290 TraceCheckUtils]: 53: Hoare triple {8676#(<= ~counter~0 5)} assume !(0 == ~cond); {8676#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:52,360 INFO L290 TraceCheckUtils]: 54: Hoare triple {8676#(<= ~counter~0 5)} assume true; {8676#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:52,360 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {8676#(<= ~counter~0 5)} {8676#(<= ~counter~0 5)} #98#return; {8676#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:52,361 INFO L290 TraceCheckUtils]: 56: Hoare triple {8676#(<= ~counter~0 5)} assume !(~r~0 < 0); {8676#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:52,361 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-08 12:36:52,361 INFO L290 TraceCheckUtils]: 58: Hoare triple {8701#(<= |main_#t~post6| 5)} assume !(#t~post6 < 20);havoc #t~post6; {8520#false} is VALID [2022-04-08 12:36:52,362 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-08 12:36:52,362 INFO L290 TraceCheckUtils]: 60: Hoare triple {8520#false} ~cond := #in~cond; {8520#false} is VALID [2022-04-08 12:36:52,362 INFO L290 TraceCheckUtils]: 61: Hoare triple {8520#false} assume 0 == ~cond; {8520#false} is VALID [2022-04-08 12:36:52,362 INFO L290 TraceCheckUtils]: 62: Hoare triple {8520#false} assume !false; {8520#false} is VALID [2022-04-08 12:36:52,362 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-08 12:36:52,362 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:36:52,653 INFO L290 TraceCheckUtils]: 62: Hoare triple {8520#false} assume !false; {8520#false} is VALID [2022-04-08 12:36:52,654 INFO L290 TraceCheckUtils]: 61: Hoare triple {8520#false} assume 0 == ~cond; {8520#false} is VALID [2022-04-08 12:36:52,654 INFO L290 TraceCheckUtils]: 60: Hoare triple {8520#false} ~cond := #in~cond; {8520#false} is VALID [2022-04-08 12:36:52,654 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-08 12:36:52,654 INFO L290 TraceCheckUtils]: 58: Hoare triple {8729#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {8520#false} is VALID [2022-04-08 12:36:52,654 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-08 12:36:52,655 INFO L290 TraceCheckUtils]: 56: Hoare triple {8733#(< ~counter~0 20)} assume !(~r~0 < 0); {8733#(< ~counter~0 20)} is VALID [2022-04-08 12:36:52,655 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {8519#true} {8733#(< ~counter~0 20)} #98#return; {8733#(< ~counter~0 20)} is VALID [2022-04-08 12:36:52,655 INFO L290 TraceCheckUtils]: 54: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-08 12:36:52,655 INFO L290 TraceCheckUtils]: 53: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-08 12:36:52,655 INFO L290 TraceCheckUtils]: 52: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-08 12:36:52,656 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-08 12:36:52,656 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-08 12:36:52,656 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-08 12:36:52,657 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-08 12:36:52,657 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {8519#true} {8758#(< ~counter~0 19)} #98#return; {8758#(< ~counter~0 19)} is VALID [2022-04-08 12:36:52,657 INFO L290 TraceCheckUtils]: 46: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-08 12:36:52,657 INFO L290 TraceCheckUtils]: 45: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-08 12:36:52,657 INFO L290 TraceCheckUtils]: 44: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-08 12:36:52,657 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-08 12:36:52,658 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-08 12:36:52,658 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-08 12:36:52,658 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-08 12:36:52,659 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {8519#true} {8783#(< ~counter~0 18)} #98#return; {8783#(< ~counter~0 18)} is VALID [2022-04-08 12:36:52,659 INFO L290 TraceCheckUtils]: 38: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-08 12:36:52,659 INFO L290 TraceCheckUtils]: 37: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-08 12:36:52,659 INFO L290 TraceCheckUtils]: 36: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-08 12:36:52,659 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-08 12:36:52,659 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-08 12:36:52,660 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-08 12:36:52,660 INFO L290 TraceCheckUtils]: 32: Hoare triple {8808#(< ~counter~0 17)} assume !(~r~0 > 0); {8808#(< ~counter~0 17)} is VALID [2022-04-08 12:36:52,661 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {8519#true} {8808#(< ~counter~0 17)} #96#return; {8808#(< ~counter~0 17)} is VALID [2022-04-08 12:36:52,661 INFO L290 TraceCheckUtils]: 30: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-08 12:36:52,661 INFO L290 TraceCheckUtils]: 29: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-08 12:36:52,661 INFO L290 TraceCheckUtils]: 28: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-08 12:36:52,661 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-08 12:36:52,661 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-08 12:36:52,661 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-08 12:36:52,662 INFO L290 TraceCheckUtils]: 24: Hoare triple {8833#(< ~counter~0 16)} assume !!(0 != ~r~0); {8833#(< ~counter~0 16)} is VALID [2022-04-08 12:36:52,662 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8519#true} {8833#(< ~counter~0 16)} #94#return; {8833#(< ~counter~0 16)} is VALID [2022-04-08 12:36:52,662 INFO L290 TraceCheckUtils]: 22: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-08 12:36:52,662 INFO L290 TraceCheckUtils]: 21: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-08 12:36:52,662 INFO L290 TraceCheckUtils]: 20: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-08 12:36:52,663 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-08 12:36:52,663 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-08 12:36:52,663 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-08 12:36:52,663 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-08 12:36:52,664 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8519#true} {8858#(< ~counter~0 15)} #92#return; {8858#(< ~counter~0 15)} is VALID [2022-04-08 12:36:52,664 INFO L290 TraceCheckUtils]: 14: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-08 12:36:52,664 INFO L290 TraceCheckUtils]: 13: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-08 12:36:52,664 INFO L290 TraceCheckUtils]: 12: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-08 12:36:52,664 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-08 12:36:52,665 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8519#true} {8858#(< ~counter~0 15)} #90#return; {8858#(< ~counter~0 15)} is VALID [2022-04-08 12:36:52,665 INFO L290 TraceCheckUtils]: 9: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-08 12:36:52,665 INFO L290 TraceCheckUtils]: 8: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-08 12:36:52,665 INFO L290 TraceCheckUtils]: 7: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-08 12:36:52,665 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-08 12:36:52,665 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-08 12:36:52,665 INFO L272 TraceCheckUtils]: 4: Hoare triple {8858#(< ~counter~0 15)} call #t~ret9 := main(); {8858#(< ~counter~0 15)} is VALID [2022-04-08 12:36:52,666 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8858#(< ~counter~0 15)} {8519#true} #102#return; {8858#(< ~counter~0 15)} is VALID [2022-04-08 12:36:52,666 INFO L290 TraceCheckUtils]: 2: Hoare triple {8858#(< ~counter~0 15)} assume true; {8858#(< ~counter~0 15)} is VALID [2022-04-08 12:36:52,666 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-08 12:36:52,666 INFO L272 TraceCheckUtils]: 0: Hoare triple {8519#true} call ULTIMATE.init(); {8519#true} is VALID [2022-04-08 12:36:52,667 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-08 12:36:52,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:36:52,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365232224] [2022-04-08 12:36:52,667 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:36:52,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460610247] [2022-04-08 12:36:52,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460610247] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:36:52,667 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:36:52,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-04-08 12:36:52,667 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:36:52,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1008642397] [2022-04-08 12:36:52,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1008642397] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:36:52,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:36:52,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 12:36:52,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046246025] [2022-04-08 12:36:52,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:36:52,668 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-08 12:36:52,668 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:36:52,668 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-08 12:36:52,706 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-08 12:36:52,707 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 12:36:52,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:36:52,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 12:36:52,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2022-04-08 12:36:52,707 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-08 12:36:53,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:53,037 INFO L93 Difference]: Finished difference Result 116 states and 142 transitions. [2022-04-08 12:36:53,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 12:36:53,037 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-08 12:36:53,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:36:53,038 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-08 12:36:53,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 115 transitions. [2022-04-08 12:36:53,040 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-08 12:36:53,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 115 transitions. [2022-04-08 12:36:53,041 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 115 transitions. [2022-04-08 12:36:53,117 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-08 12:36:53,120 INFO L225 Difference]: With dead ends: 116 [2022-04-08 12:36:53,120 INFO L226 Difference]: Without dead ends: 111 [2022-04-08 12:36:53,120 INFO L912 BasicCegarLoop]: 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-08 12:36:53,121 INFO L913 BasicCegarLoop]: 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-08 12:36:53,121 INFO L914 BasicCegarLoop]: 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-08 12:36:53,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-04-08 12:36:53,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 106. [2022-04-08 12:36:53,219 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:36:53,219 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-08 12:36:53,220 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-08 12:36:53,220 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-08 12:36:53,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:53,222 INFO L93 Difference]: Finished difference Result 111 states and 137 transitions. [2022-04-08 12:36:53,222 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 137 transitions. [2022-04-08 12:36:53,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:36:53,222 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:36:53,222 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-08 12:36:53,222 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-08 12:36:53,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:53,224 INFO L93 Difference]: Finished difference Result 111 states and 137 transitions. [2022-04-08 12:36:53,224 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 137 transitions. [2022-04-08 12:36:53,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:36:53,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:36:53,225 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:36:53,225 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:36:53,226 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-08 12:36:53,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 131 transitions. [2022-04-08 12:36:53,228 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 131 transitions. Word has length 63 [2022-04-08 12:36:53,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:36:53,228 INFO L478 AbstractCegarLoop]: Abstraction has 106 states and 131 transitions. [2022-04-08 12:36:53,228 INFO L479 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-08 12:36:53,228 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 106 states and 131 transitions. [2022-04-08 12:36:54,961 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-08 12:36:54,962 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 131 transitions. [2022-04-08 12:36:54,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-08 12:36:54,962 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:36:54,962 INFO L499 BasicCegarLoop]: 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-08 12:36:54,978 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-08 12:36:55,171 WARN L460 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-08 12:36:55,171 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:36:55,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:36:55,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1823928061, now seen corresponding path program 5 times [2022-04-08 12:36:55,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:36:55,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [873118449] [2022-04-08 12:36:55,172 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:36:55,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1823928061, now seen corresponding path program 6 times [2022-04-08 12:36:55,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:36:55,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842507263] [2022-04-08 12:36:55,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:36:55,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:36:55,184 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:36:55,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1387831500] [2022-04-08 12:36:55,185 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 12:36:55,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:36:55,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:36:55,186 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-08 12:36:55,186 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-08 12:36:55,248 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-08 12:36:55,248 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:36:55,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 12:36:55,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:36:55,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:36:55,537 INFO L272 TraceCheckUtils]: 0: Hoare triple {9582#true} call ULTIMATE.init(); {9582#true} is VALID [2022-04-08 12:36:55,537 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-08 12:36:55,538 INFO L290 TraceCheckUtils]: 2: Hoare triple {9590#(<= ~counter~0 0)} assume true; {9590#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:55,538 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9590#(<= ~counter~0 0)} {9582#true} #102#return; {9590#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:55,538 INFO L272 TraceCheckUtils]: 4: Hoare triple {9590#(<= ~counter~0 0)} call #t~ret9 := main(); {9590#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:55,538 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-08 12:36:55,539 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-08 12:36:55,539 INFO L290 TraceCheckUtils]: 7: Hoare triple {9590#(<= ~counter~0 0)} ~cond := #in~cond; {9590#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:55,539 INFO L290 TraceCheckUtils]: 8: Hoare triple {9590#(<= ~counter~0 0)} assume !(0 == ~cond); {9590#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:55,540 INFO L290 TraceCheckUtils]: 9: Hoare triple {9590#(<= ~counter~0 0)} assume true; {9590#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:55,540 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9590#(<= ~counter~0 0)} {9590#(<= ~counter~0 0)} #90#return; {9590#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:55,540 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-08 12:36:55,541 INFO L290 TraceCheckUtils]: 12: Hoare triple {9590#(<= ~counter~0 0)} ~cond := #in~cond; {9590#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:55,541 INFO L290 TraceCheckUtils]: 13: Hoare triple {9590#(<= ~counter~0 0)} assume !(0 == ~cond); {9590#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:55,541 INFO L290 TraceCheckUtils]: 14: Hoare triple {9590#(<= ~counter~0 0)} assume true; {9590#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:55,542 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {9590#(<= ~counter~0 0)} {9590#(<= ~counter~0 0)} #92#return; {9590#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:55,542 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-08 12:36:55,542 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-08 12:36:55,543 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-08 12:36:55,543 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-08 12:36:55,543 INFO L290 TraceCheckUtils]: 20: Hoare triple {9639#(<= ~counter~0 1)} ~cond := #in~cond; {9639#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:55,544 INFO L290 TraceCheckUtils]: 21: Hoare triple {9639#(<= ~counter~0 1)} assume !(0 == ~cond); {9639#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:55,544 INFO L290 TraceCheckUtils]: 22: Hoare triple {9639#(<= ~counter~0 1)} assume true; {9639#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:55,545 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {9639#(<= ~counter~0 1)} {9639#(<= ~counter~0 1)} #94#return; {9639#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:55,545 INFO L290 TraceCheckUtils]: 24: Hoare triple {9639#(<= ~counter~0 1)} assume !!(0 != ~r~0); {9639#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:55,545 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-08 12:36:55,545 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-08 12:36:55,546 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-08 12:36:55,546 INFO L290 TraceCheckUtils]: 28: Hoare triple {9664#(<= ~counter~0 2)} ~cond := #in~cond; {9664#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:55,547 INFO L290 TraceCheckUtils]: 29: Hoare triple {9664#(<= ~counter~0 2)} assume !(0 == ~cond); {9664#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:55,547 INFO L290 TraceCheckUtils]: 30: Hoare triple {9664#(<= ~counter~0 2)} assume true; {9664#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:55,547 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {9664#(<= ~counter~0 2)} {9664#(<= ~counter~0 2)} #96#return; {9664#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:55,548 INFO L290 TraceCheckUtils]: 32: Hoare triple {9664#(<= ~counter~0 2)} assume !(~r~0 > 0); {9664#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:55,548 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-08 12:36:55,548 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-08 12:36:55,549 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-08 12:36:55,549 INFO L290 TraceCheckUtils]: 36: Hoare triple {9689#(<= ~counter~0 3)} ~cond := #in~cond; {9689#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:55,549 INFO L290 TraceCheckUtils]: 37: Hoare triple {9689#(<= ~counter~0 3)} assume !(0 == ~cond); {9689#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:55,550 INFO L290 TraceCheckUtils]: 38: Hoare triple {9689#(<= ~counter~0 3)} assume true; {9689#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:55,550 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {9689#(<= ~counter~0 3)} {9689#(<= ~counter~0 3)} #98#return; {9689#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:55,550 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-08 12:36:55,551 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-08 12:36:55,551 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-08 12:36:55,551 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-08 12:36:55,552 INFO L290 TraceCheckUtils]: 44: Hoare triple {9714#(<= ~counter~0 4)} ~cond := #in~cond; {9714#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:55,552 INFO L290 TraceCheckUtils]: 45: Hoare triple {9714#(<= ~counter~0 4)} assume !(0 == ~cond); {9714#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:55,552 INFO L290 TraceCheckUtils]: 46: Hoare triple {9714#(<= ~counter~0 4)} assume true; {9714#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:55,553 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {9714#(<= ~counter~0 4)} {9714#(<= ~counter~0 4)} #98#return; {9714#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:55,553 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-08 12:36:55,553 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-08 12:36:55,554 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-08 12:36:55,554 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-08 12:36:55,554 INFO L290 TraceCheckUtils]: 52: Hoare triple {9739#(<= ~counter~0 5)} ~cond := #in~cond; {9739#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:55,555 INFO L290 TraceCheckUtils]: 53: Hoare triple {9739#(<= ~counter~0 5)} assume !(0 == ~cond); {9739#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:55,555 INFO L290 TraceCheckUtils]: 54: Hoare triple {9739#(<= ~counter~0 5)} assume true; {9739#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:55,555 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {9739#(<= ~counter~0 5)} {9739#(<= ~counter~0 5)} #98#return; {9739#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:55,556 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-08 12:36:55,556 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-08 12:36:55,556 INFO L290 TraceCheckUtils]: 58: Hoare triple {9764#(<= |main_#t~post8| 5)} assume !(#t~post8 < 20);havoc #t~post8; {9583#false} is VALID [2022-04-08 12:36:55,556 INFO L290 TraceCheckUtils]: 59: Hoare triple {9583#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9583#false} is VALID [2022-04-08 12:36:55,557 INFO L290 TraceCheckUtils]: 60: Hoare triple {9583#false} assume !(#t~post6 < 20);havoc #t~post6; {9583#false} is VALID [2022-04-08 12:36:55,557 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-08 12:36:55,557 INFO L290 TraceCheckUtils]: 62: Hoare triple {9583#false} ~cond := #in~cond; {9583#false} is VALID [2022-04-08 12:36:55,557 INFO L290 TraceCheckUtils]: 63: Hoare triple {9583#false} assume 0 == ~cond; {9583#false} is VALID [2022-04-08 12:36:55,557 INFO L290 TraceCheckUtils]: 64: Hoare triple {9583#false} assume !false; {9583#false} is VALID [2022-04-08 12:36:55,557 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-08 12:36:55,558 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:36:55,868 INFO L290 TraceCheckUtils]: 64: Hoare triple {9583#false} assume !false; {9583#false} is VALID [2022-04-08 12:36:55,868 INFO L290 TraceCheckUtils]: 63: Hoare triple {9583#false} assume 0 == ~cond; {9583#false} is VALID [2022-04-08 12:36:55,868 INFO L290 TraceCheckUtils]: 62: Hoare triple {9583#false} ~cond := #in~cond; {9583#false} is VALID [2022-04-08 12:36:55,868 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-08 12:36:55,868 INFO L290 TraceCheckUtils]: 60: Hoare triple {9583#false} assume !(#t~post6 < 20);havoc #t~post6; {9583#false} is VALID [2022-04-08 12:36:55,868 INFO L290 TraceCheckUtils]: 59: Hoare triple {9583#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9583#false} is VALID [2022-04-08 12:36:55,869 INFO L290 TraceCheckUtils]: 58: Hoare triple {9804#(< |main_#t~post8| 20)} assume !(#t~post8 < 20);havoc #t~post8; {9583#false} is VALID [2022-04-08 12:36:55,869 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-08 12:36:55,869 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-08 12:36:55,870 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {9582#true} {9808#(< ~counter~0 20)} #98#return; {9808#(< ~counter~0 20)} is VALID [2022-04-08 12:36:55,870 INFO L290 TraceCheckUtils]: 54: Hoare triple {9582#true} assume true; {9582#true} is VALID [2022-04-08 12:36:55,870 INFO L290 TraceCheckUtils]: 53: Hoare triple {9582#true} assume !(0 == ~cond); {9582#true} is VALID [2022-04-08 12:36:55,870 INFO L290 TraceCheckUtils]: 52: Hoare triple {9582#true} ~cond := #in~cond; {9582#true} is VALID [2022-04-08 12:36:55,870 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-08 12:36:55,870 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-08 12:36:55,871 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-08 12:36:55,871 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-08 12:36:55,872 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {9582#true} {9833#(< ~counter~0 19)} #98#return; {9833#(< ~counter~0 19)} is VALID [2022-04-08 12:36:55,872 INFO L290 TraceCheckUtils]: 46: Hoare triple {9582#true} assume true; {9582#true} is VALID [2022-04-08 12:36:55,872 INFO L290 TraceCheckUtils]: 45: Hoare triple {9582#true} assume !(0 == ~cond); {9582#true} is VALID [2022-04-08 12:36:55,872 INFO L290 TraceCheckUtils]: 44: Hoare triple {9582#true} ~cond := #in~cond; {9582#true} is VALID [2022-04-08 12:36:55,872 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-08 12:36:55,872 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-08 12:36:55,873 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-08 12:36:55,873 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-08 12:36:55,873 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {9582#true} {9858#(< ~counter~0 18)} #98#return; {9858#(< ~counter~0 18)} is VALID [2022-04-08 12:36:55,874 INFO L290 TraceCheckUtils]: 38: Hoare triple {9582#true} assume true; {9582#true} is VALID [2022-04-08 12:36:55,874 INFO L290 TraceCheckUtils]: 37: Hoare triple {9582#true} assume !(0 == ~cond); {9582#true} is VALID [2022-04-08 12:36:55,874 INFO L290 TraceCheckUtils]: 36: Hoare triple {9582#true} ~cond := #in~cond; {9582#true} is VALID [2022-04-08 12:36:55,874 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-08 12:36:55,874 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-08 12:36:55,874 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-08 12:36:55,875 INFO L290 TraceCheckUtils]: 32: Hoare triple {9883#(< ~counter~0 17)} assume !(~r~0 > 0); {9883#(< ~counter~0 17)} is VALID [2022-04-08 12:36:55,875 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {9582#true} {9883#(< ~counter~0 17)} #96#return; {9883#(< ~counter~0 17)} is VALID [2022-04-08 12:36:55,875 INFO L290 TraceCheckUtils]: 30: Hoare triple {9582#true} assume true; {9582#true} is VALID [2022-04-08 12:36:55,875 INFO L290 TraceCheckUtils]: 29: Hoare triple {9582#true} assume !(0 == ~cond); {9582#true} is VALID [2022-04-08 12:36:55,875 INFO L290 TraceCheckUtils]: 28: Hoare triple {9582#true} ~cond := #in~cond; {9582#true} is VALID [2022-04-08 12:36:55,876 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-08 12:36:55,876 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-08 12:36:55,876 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-08 12:36:55,876 INFO L290 TraceCheckUtils]: 24: Hoare triple {9908#(< ~counter~0 16)} assume !!(0 != ~r~0); {9908#(< ~counter~0 16)} is VALID [2022-04-08 12:36:55,877 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {9582#true} {9908#(< ~counter~0 16)} #94#return; {9908#(< ~counter~0 16)} is VALID [2022-04-08 12:36:55,877 INFO L290 TraceCheckUtils]: 22: Hoare triple {9582#true} assume true; {9582#true} is VALID [2022-04-08 12:36:55,877 INFO L290 TraceCheckUtils]: 21: Hoare triple {9582#true} assume !(0 == ~cond); {9582#true} is VALID [2022-04-08 12:36:55,877 INFO L290 TraceCheckUtils]: 20: Hoare triple {9582#true} ~cond := #in~cond; {9582#true} is VALID [2022-04-08 12:36:55,877 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-08 12:36:55,877 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-08 12:36:55,878 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-08 12:36:55,878 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-08 12:36:55,879 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {9582#true} {9933#(< ~counter~0 15)} #92#return; {9933#(< ~counter~0 15)} is VALID [2022-04-08 12:36:55,879 INFO L290 TraceCheckUtils]: 14: Hoare triple {9582#true} assume true; {9582#true} is VALID [2022-04-08 12:36:55,879 INFO L290 TraceCheckUtils]: 13: Hoare triple {9582#true} assume !(0 == ~cond); {9582#true} is VALID [2022-04-08 12:36:55,879 INFO L290 TraceCheckUtils]: 12: Hoare triple {9582#true} ~cond := #in~cond; {9582#true} is VALID [2022-04-08 12:36:55,879 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-08 12:36:55,879 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9582#true} {9933#(< ~counter~0 15)} #90#return; {9933#(< ~counter~0 15)} is VALID [2022-04-08 12:36:55,879 INFO L290 TraceCheckUtils]: 9: Hoare triple {9582#true} assume true; {9582#true} is VALID [2022-04-08 12:36:55,879 INFO L290 TraceCheckUtils]: 8: Hoare triple {9582#true} assume !(0 == ~cond); {9582#true} is VALID [2022-04-08 12:36:55,880 INFO L290 TraceCheckUtils]: 7: Hoare triple {9582#true} ~cond := #in~cond; {9582#true} is VALID [2022-04-08 12:36:55,880 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-08 12:36:55,880 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-08 12:36:55,880 INFO L272 TraceCheckUtils]: 4: Hoare triple {9933#(< ~counter~0 15)} call #t~ret9 := main(); {9933#(< ~counter~0 15)} is VALID [2022-04-08 12:36:55,880 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9933#(< ~counter~0 15)} {9582#true} #102#return; {9933#(< ~counter~0 15)} is VALID [2022-04-08 12:36:55,881 INFO L290 TraceCheckUtils]: 2: Hoare triple {9933#(< ~counter~0 15)} assume true; {9933#(< ~counter~0 15)} is VALID [2022-04-08 12:36:55,881 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-08 12:36:55,881 INFO L272 TraceCheckUtils]: 0: Hoare triple {9582#true} call ULTIMATE.init(); {9582#true} is VALID [2022-04-08 12:36:55,881 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-08 12:36:55,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:36:55,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842507263] [2022-04-08 12:36:55,882 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:36:55,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387831500] [2022-04-08 12:36:55,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1387831500] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:36:55,882 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:36:55,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-04-08 12:36:55,882 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:36:55,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [873118449] [2022-04-08 12:36:55,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [873118449] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:36:55,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:36:55,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 12:36:55,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849467242] [2022-04-08 12:36:55,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:36:55,883 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-08 12:36:55,883 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:36:55,883 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-08 12:36:55,923 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-08 12:36:55,923 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 12:36:55,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:36:55,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 12:36:55,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2022-04-08 12:36:55,924 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-08 12:36:56,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:56,298 INFO L93 Difference]: Finished difference Result 149 states and 191 transitions. [2022-04-08 12:36:56,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 12:36:56,298 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-08 12:36:56,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:36:56,298 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-08 12:36:56,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 137 transitions. [2022-04-08 12:36:56,299 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-08 12:36:56,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 137 transitions. [2022-04-08 12:36:56,300 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 137 transitions. [2022-04-08 12:36:56,382 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-08 12:36:56,384 INFO L225 Difference]: With dead ends: 149 [2022-04-08 12:36:56,384 INFO L226 Difference]: Without dead ends: 112 [2022-04-08 12:36:56,384 INFO L912 BasicCegarLoop]: 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-08 12:36:56,384 INFO L913 BasicCegarLoop]: 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-08 12:36:56,385 INFO L914 BasicCegarLoop]: 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-08 12:36:56,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-04-08 12:36:56,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2022-04-08 12:36:56,481 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:36:56,482 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-08 12:36:56,482 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-08 12:36:56,482 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-08 12:36:56,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:56,484 INFO L93 Difference]: Finished difference Result 112 states and 138 transitions. [2022-04-08 12:36:56,484 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 138 transitions. [2022-04-08 12:36:56,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:36:56,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:36:56,484 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-08 12:36:56,484 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-08 12:36:56,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:56,486 INFO L93 Difference]: Finished difference Result 112 states and 138 transitions. [2022-04-08 12:36:56,486 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 138 transitions. [2022-04-08 12:36:56,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:36:56,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:36:56,486 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:36:56,486 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:36:56,487 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-08 12:36:56,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 135 transitions. [2022-04-08 12:36:56,488 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 135 transitions. Word has length 65 [2022-04-08 12:36:56,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:36:56,488 INFO L478 AbstractCegarLoop]: Abstraction has 109 states and 135 transitions. [2022-04-08 12:36:56,488 INFO L479 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-08 12:36:56,489 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 109 states and 135 transitions. [2022-04-08 12:36:57,084 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-08 12:36:57,085 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 135 transitions. [2022-04-08 12:36:57,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-08 12:36:57,085 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:36:57,085 INFO L499 BasicCegarLoop]: 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-08 12:36:57,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-04-08 12:36:57,299 WARN L460 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-08 12:36:57,299 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:36:57,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:36:57,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1211810838, now seen corresponding path program 1 times [2022-04-08 12:36:57,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:36:57,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1889907667] [2022-04-08 12:36:57,300 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:36:57,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1211810838, now seen corresponding path program 2 times [2022-04-08 12:36:57,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:36:57,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345425255] [2022-04-08 12:36:57,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:36:57,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:36:57,309 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:36:57,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [805595433] [2022-04-08 12:36:57,309 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:36:57,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:36:57,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:36:57,310 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-08 12:36:57,311 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-08 12:36:57,348 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:36:57,349 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:36:57,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 12:36:57,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:36:57,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:36:57,631 INFO L272 TraceCheckUtils]: 0: Hoare triple {10733#true} call ULTIMATE.init(); {10733#true} is VALID [2022-04-08 12:36:57,632 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-08 12:36:57,632 INFO L290 TraceCheckUtils]: 2: Hoare triple {10741#(<= ~counter~0 0)} assume true; {10741#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:57,632 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10741#(<= ~counter~0 0)} {10733#true} #102#return; {10741#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:57,633 INFO L272 TraceCheckUtils]: 4: Hoare triple {10741#(<= ~counter~0 0)} call #t~ret9 := main(); {10741#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:57,633 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-08 12:36:57,633 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-08 12:36:57,634 INFO L290 TraceCheckUtils]: 7: Hoare triple {10741#(<= ~counter~0 0)} ~cond := #in~cond; {10741#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:57,634 INFO L290 TraceCheckUtils]: 8: Hoare triple {10741#(<= ~counter~0 0)} assume !(0 == ~cond); {10741#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:57,634 INFO L290 TraceCheckUtils]: 9: Hoare triple {10741#(<= ~counter~0 0)} assume true; {10741#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:57,635 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10741#(<= ~counter~0 0)} {10741#(<= ~counter~0 0)} #90#return; {10741#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:57,635 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-08 12:36:57,635 INFO L290 TraceCheckUtils]: 12: Hoare triple {10741#(<= ~counter~0 0)} ~cond := #in~cond; {10741#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:57,636 INFO L290 TraceCheckUtils]: 13: Hoare triple {10741#(<= ~counter~0 0)} assume !(0 == ~cond); {10741#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:57,636 INFO L290 TraceCheckUtils]: 14: Hoare triple {10741#(<= ~counter~0 0)} assume true; {10741#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:57,636 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10741#(<= ~counter~0 0)} {10741#(<= ~counter~0 0)} #92#return; {10741#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:57,637 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-08 12:36:57,637 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-08 12:36:57,637 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-08 12:36:57,638 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-08 12:36:57,638 INFO L290 TraceCheckUtils]: 20: Hoare triple {10790#(<= ~counter~0 1)} ~cond := #in~cond; {10790#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:57,638 INFO L290 TraceCheckUtils]: 21: Hoare triple {10790#(<= ~counter~0 1)} assume !(0 == ~cond); {10790#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:57,639 INFO L290 TraceCheckUtils]: 22: Hoare triple {10790#(<= ~counter~0 1)} assume true; {10790#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:57,639 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {10790#(<= ~counter~0 1)} {10790#(<= ~counter~0 1)} #94#return; {10790#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:57,639 INFO L290 TraceCheckUtils]: 24: Hoare triple {10790#(<= ~counter~0 1)} assume !!(0 != ~r~0); {10790#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:57,640 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-08 12:36:57,640 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-08 12:36:57,641 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-08 12:36:57,641 INFO L290 TraceCheckUtils]: 28: Hoare triple {10815#(<= ~counter~0 2)} ~cond := #in~cond; {10815#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:57,641 INFO L290 TraceCheckUtils]: 29: Hoare triple {10815#(<= ~counter~0 2)} assume !(0 == ~cond); {10815#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:57,642 INFO L290 TraceCheckUtils]: 30: Hoare triple {10815#(<= ~counter~0 2)} assume true; {10815#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:57,642 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {10815#(<= ~counter~0 2)} {10815#(<= ~counter~0 2)} #96#return; {10815#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:57,642 INFO L290 TraceCheckUtils]: 32: Hoare triple {10815#(<= ~counter~0 2)} assume !(~r~0 > 0); {10815#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:57,656 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-08 12:36:57,657 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-08 12:36:57,657 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-08 12:36:57,657 INFO L290 TraceCheckUtils]: 36: Hoare triple {10840#(<= ~counter~0 3)} ~cond := #in~cond; {10840#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:57,658 INFO L290 TraceCheckUtils]: 37: Hoare triple {10840#(<= ~counter~0 3)} assume !(0 == ~cond); {10840#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:57,658 INFO L290 TraceCheckUtils]: 38: Hoare triple {10840#(<= ~counter~0 3)} assume true; {10840#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:57,658 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {10840#(<= ~counter~0 3)} {10840#(<= ~counter~0 3)} #98#return; {10840#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:57,659 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-08 12:36:57,659 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-08 12:36:57,659 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-08 12:36:57,660 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-08 12:36:57,660 INFO L290 TraceCheckUtils]: 44: Hoare triple {10865#(<= ~counter~0 4)} ~cond := #in~cond; {10865#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:57,660 INFO L290 TraceCheckUtils]: 45: Hoare triple {10865#(<= ~counter~0 4)} assume !(0 == ~cond); {10865#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:57,661 INFO L290 TraceCheckUtils]: 46: Hoare triple {10865#(<= ~counter~0 4)} assume true; {10865#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:57,661 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {10865#(<= ~counter~0 4)} {10865#(<= ~counter~0 4)} #98#return; {10865#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:57,661 INFO L290 TraceCheckUtils]: 48: Hoare triple {10865#(<= ~counter~0 4)} assume !(~r~0 < 0); {10865#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:57,662 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-08 12:36:57,662 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-08 12:36:57,663 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-08 12:36:57,663 INFO L290 TraceCheckUtils]: 52: Hoare triple {10890#(<= ~counter~0 5)} ~cond := #in~cond; {10890#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:57,663 INFO L290 TraceCheckUtils]: 53: Hoare triple {10890#(<= ~counter~0 5)} assume !(0 == ~cond); {10890#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:57,663 INFO L290 TraceCheckUtils]: 54: Hoare triple {10890#(<= ~counter~0 5)} assume true; {10890#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:57,664 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {10890#(<= ~counter~0 5)} {10890#(<= ~counter~0 5)} #94#return; {10890#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:57,664 INFO L290 TraceCheckUtils]: 56: Hoare triple {10890#(<= ~counter~0 5)} assume !!(0 != ~r~0); {10890#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:57,664 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-08 12:36:57,665 INFO L290 TraceCheckUtils]: 58: Hoare triple {10915#(<= |main_#t~post7| 5)} assume !(#t~post7 < 20);havoc #t~post7; {10734#false} is VALID [2022-04-08 12:36:57,665 INFO L290 TraceCheckUtils]: 59: Hoare triple {10734#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10734#false} is VALID [2022-04-08 12:36:57,665 INFO L290 TraceCheckUtils]: 60: Hoare triple {10734#false} assume !(#t~post8 < 20);havoc #t~post8; {10734#false} is VALID [2022-04-08 12:36:57,665 INFO L290 TraceCheckUtils]: 61: Hoare triple {10734#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10734#false} is VALID [2022-04-08 12:36:57,665 INFO L290 TraceCheckUtils]: 62: Hoare triple {10734#false} assume !(#t~post6 < 20);havoc #t~post6; {10734#false} is VALID [2022-04-08 12:36:57,665 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-08 12:36:57,665 INFO L290 TraceCheckUtils]: 64: Hoare triple {10734#false} ~cond := #in~cond; {10734#false} is VALID [2022-04-08 12:36:57,665 INFO L290 TraceCheckUtils]: 65: Hoare triple {10734#false} assume 0 == ~cond; {10734#false} is VALID [2022-04-08 12:36:57,665 INFO L290 TraceCheckUtils]: 66: Hoare triple {10734#false} assume !false; {10734#false} is VALID [2022-04-08 12:36:57,666 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-08 12:36:57,666 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:36:57,956 INFO L290 TraceCheckUtils]: 66: Hoare triple {10734#false} assume !false; {10734#false} is VALID [2022-04-08 12:36:57,956 INFO L290 TraceCheckUtils]: 65: Hoare triple {10734#false} assume 0 == ~cond; {10734#false} is VALID [2022-04-08 12:36:57,957 INFO L290 TraceCheckUtils]: 64: Hoare triple {10734#false} ~cond := #in~cond; {10734#false} is VALID [2022-04-08 12:36:57,957 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-08 12:36:57,957 INFO L290 TraceCheckUtils]: 62: Hoare triple {10734#false} assume !(#t~post6 < 20);havoc #t~post6; {10734#false} is VALID [2022-04-08 12:36:57,957 INFO L290 TraceCheckUtils]: 61: Hoare triple {10734#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10734#false} is VALID [2022-04-08 12:36:57,957 INFO L290 TraceCheckUtils]: 60: Hoare triple {10734#false} assume !(#t~post8 < 20);havoc #t~post8; {10734#false} is VALID [2022-04-08 12:36:57,957 INFO L290 TraceCheckUtils]: 59: Hoare triple {10734#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10734#false} is VALID [2022-04-08 12:36:57,957 INFO L290 TraceCheckUtils]: 58: Hoare triple {10967#(< |main_#t~post7| 20)} assume !(#t~post7 < 20);havoc #t~post7; {10734#false} is VALID [2022-04-08 12:36:57,958 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-08 12:36:57,958 INFO L290 TraceCheckUtils]: 56: Hoare triple {10971#(< ~counter~0 20)} assume !!(0 != ~r~0); {10971#(< ~counter~0 20)} is VALID [2022-04-08 12:36:57,958 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {10733#true} {10971#(< ~counter~0 20)} #94#return; {10971#(< ~counter~0 20)} is VALID [2022-04-08 12:36:57,958 INFO L290 TraceCheckUtils]: 54: Hoare triple {10733#true} assume true; {10733#true} is VALID [2022-04-08 12:36:57,958 INFO L290 TraceCheckUtils]: 53: Hoare triple {10733#true} assume !(0 == ~cond); {10733#true} is VALID [2022-04-08 12:36:57,959 INFO L290 TraceCheckUtils]: 52: Hoare triple {10733#true} ~cond := #in~cond; {10733#true} is VALID [2022-04-08 12:36:57,959 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-08 12:36:57,959 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-08 12:36:57,959 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-08 12:36:57,960 INFO L290 TraceCheckUtils]: 48: Hoare triple {10996#(< ~counter~0 19)} assume !(~r~0 < 0); {10996#(< ~counter~0 19)} is VALID [2022-04-08 12:36:57,960 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {10733#true} {10996#(< ~counter~0 19)} #98#return; {10996#(< ~counter~0 19)} is VALID [2022-04-08 12:36:57,960 INFO L290 TraceCheckUtils]: 46: Hoare triple {10733#true} assume true; {10733#true} is VALID [2022-04-08 12:36:57,960 INFO L290 TraceCheckUtils]: 45: Hoare triple {10733#true} assume !(0 == ~cond); {10733#true} is VALID [2022-04-08 12:36:57,960 INFO L290 TraceCheckUtils]: 44: Hoare triple {10733#true} ~cond := #in~cond; {10733#true} is VALID [2022-04-08 12:36:57,961 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-08 12:36:57,961 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-08 12:36:57,961 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-08 12:36:57,962 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-08 12:36:57,962 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {10733#true} {11021#(< ~counter~0 18)} #98#return; {11021#(< ~counter~0 18)} is VALID [2022-04-08 12:36:57,962 INFO L290 TraceCheckUtils]: 38: Hoare triple {10733#true} assume true; {10733#true} is VALID [2022-04-08 12:36:57,962 INFO L290 TraceCheckUtils]: 37: Hoare triple {10733#true} assume !(0 == ~cond); {10733#true} is VALID [2022-04-08 12:36:57,962 INFO L290 TraceCheckUtils]: 36: Hoare triple {10733#true} ~cond := #in~cond; {10733#true} is VALID [2022-04-08 12:36:57,962 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-08 12:36:57,963 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-08 12:36:57,963 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-08 12:36:57,963 INFO L290 TraceCheckUtils]: 32: Hoare triple {11046#(< ~counter~0 17)} assume !(~r~0 > 0); {11046#(< ~counter~0 17)} is VALID [2022-04-08 12:36:57,964 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {10733#true} {11046#(< ~counter~0 17)} #96#return; {11046#(< ~counter~0 17)} is VALID [2022-04-08 12:36:57,964 INFO L290 TraceCheckUtils]: 30: Hoare triple {10733#true} assume true; {10733#true} is VALID [2022-04-08 12:36:57,964 INFO L290 TraceCheckUtils]: 29: Hoare triple {10733#true} assume !(0 == ~cond); {10733#true} is VALID [2022-04-08 12:36:57,965 INFO L290 TraceCheckUtils]: 28: Hoare triple {10733#true} ~cond := #in~cond; {10733#true} is VALID [2022-04-08 12:36:57,965 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-08 12:36:57,965 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-08 12:36:57,965 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-08 12:36:57,966 INFO L290 TraceCheckUtils]: 24: Hoare triple {11071#(< ~counter~0 16)} assume !!(0 != ~r~0); {11071#(< ~counter~0 16)} is VALID [2022-04-08 12:36:57,966 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {10733#true} {11071#(< ~counter~0 16)} #94#return; {11071#(< ~counter~0 16)} is VALID [2022-04-08 12:36:57,966 INFO L290 TraceCheckUtils]: 22: Hoare triple {10733#true} assume true; {10733#true} is VALID [2022-04-08 12:36:57,966 INFO L290 TraceCheckUtils]: 21: Hoare triple {10733#true} assume !(0 == ~cond); {10733#true} is VALID [2022-04-08 12:36:57,966 INFO L290 TraceCheckUtils]: 20: Hoare triple {10733#true} ~cond := #in~cond; {10733#true} is VALID [2022-04-08 12:36:57,966 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-08 12:36:57,967 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-08 12:36:57,967 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-08 12:36:57,967 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-08 12:36:57,968 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10733#true} {11096#(< ~counter~0 15)} #92#return; {11096#(< ~counter~0 15)} is VALID [2022-04-08 12:36:57,968 INFO L290 TraceCheckUtils]: 14: Hoare triple {10733#true} assume true; {10733#true} is VALID [2022-04-08 12:36:57,968 INFO L290 TraceCheckUtils]: 13: Hoare triple {10733#true} assume !(0 == ~cond); {10733#true} is VALID [2022-04-08 12:36:57,968 INFO L290 TraceCheckUtils]: 12: Hoare triple {10733#true} ~cond := #in~cond; {10733#true} is VALID [2022-04-08 12:36:57,968 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-08 12:36:57,969 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10733#true} {11096#(< ~counter~0 15)} #90#return; {11096#(< ~counter~0 15)} is VALID [2022-04-08 12:36:57,969 INFO L290 TraceCheckUtils]: 9: Hoare triple {10733#true} assume true; {10733#true} is VALID [2022-04-08 12:36:57,971 INFO L290 TraceCheckUtils]: 8: Hoare triple {10733#true} assume !(0 == ~cond); {10733#true} is VALID [2022-04-08 12:36:57,971 INFO L290 TraceCheckUtils]: 7: Hoare triple {10733#true} ~cond := #in~cond; {10733#true} is VALID [2022-04-08 12:36:57,971 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-08 12:36:57,971 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-08 12:36:57,972 INFO L272 TraceCheckUtils]: 4: Hoare triple {11096#(< ~counter~0 15)} call #t~ret9 := main(); {11096#(< ~counter~0 15)} is VALID [2022-04-08 12:36:57,972 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11096#(< ~counter~0 15)} {10733#true} #102#return; {11096#(< ~counter~0 15)} is VALID [2022-04-08 12:36:57,972 INFO L290 TraceCheckUtils]: 2: Hoare triple {11096#(< ~counter~0 15)} assume true; {11096#(< ~counter~0 15)} is VALID [2022-04-08 12:36:57,973 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-08 12:36:57,973 INFO L272 TraceCheckUtils]: 0: Hoare triple {10733#true} call ULTIMATE.init(); {10733#true} is VALID [2022-04-08 12:36:57,973 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-08 12:36:57,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:36:57,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345425255] [2022-04-08 12:36:57,973 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:36:57,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805595433] [2022-04-08 12:36:57,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [805595433] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:36:57,974 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:36:57,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-04-08 12:36:57,974 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:36:57,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1889907667] [2022-04-08 12:36:57,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1889907667] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:36:57,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:36:57,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 12:36:57,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233352313] [2022-04-08 12:36:57,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:36:57,974 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-08 12:36:57,975 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:36:57,975 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-08 12:36:58,015 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-08 12:36:58,016 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 12:36:58,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:36:58,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 12:36:58,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2022-04-08 12:36:58,016 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-08 12:36:58,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:58,342 INFO L93 Difference]: Finished difference Result 151 states and 194 transitions. [2022-04-08 12:36:58,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 12:36:58,342 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-08 12:36:58,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:36:58,343 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-08 12:36:58,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 137 transitions. [2022-04-08 12:36:58,344 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-08 12:36:58,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 137 transitions. [2022-04-08 12:36:58,345 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 137 transitions. [2022-04-08 12:36:58,457 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-08 12:36:58,459 INFO L225 Difference]: With dead ends: 151 [2022-04-08 12:36:58,459 INFO L226 Difference]: Without dead ends: 114 [2022-04-08 12:36:58,459 INFO L912 BasicCegarLoop]: 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-08 12:36:58,460 INFO L913 BasicCegarLoop]: 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-08 12:36:58,460 INFO L914 BasicCegarLoop]: 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-08 12:36:58,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-04-08 12:36:58,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2022-04-08 12:36:58,578 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:36:58,579 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-08 12:36:58,579 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-08 12:36:58,579 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-08 12:36:58,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:58,588 INFO L93 Difference]: Finished difference Result 114 states and 140 transitions. [2022-04-08 12:36:58,588 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 140 transitions. [2022-04-08 12:36:58,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:36:58,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:36:58,588 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-08 12:36:58,589 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-08 12:36:58,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:36:58,590 INFO L93 Difference]: Finished difference Result 114 states and 140 transitions. [2022-04-08 12:36:58,590 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 140 transitions. [2022-04-08 12:36:58,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:36:58,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:36:58,591 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:36:58,591 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:36:58,591 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-08 12:36:58,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 140 transitions. [2022-04-08 12:36:58,593 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 140 transitions. Word has length 67 [2022-04-08 12:36:58,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:36:58,593 INFO L478 AbstractCegarLoop]: Abstraction has 114 states and 140 transitions. [2022-04-08 12:36:58,593 INFO L479 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-08 12:36:58,593 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 114 states and 140 transitions. [2022-04-08 12:36:59,064 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:36:59,064 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 140 transitions. [2022-04-08 12:36:59,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-08 12:36:59,065 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:36:59,065 INFO L499 BasicCegarLoop]: 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-08 12:36:59,095 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-08 12:36:59,281 WARN L460 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-08 12:36:59,281 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:36:59,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:36:59,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1645787183, now seen corresponding path program 5 times [2022-04-08 12:36:59,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:36:59,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [580830775] [2022-04-08 12:36:59,282 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:36:59,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1645787183, now seen corresponding path program 6 times [2022-04-08 12:36:59,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:36:59,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171814326] [2022-04-08 12:36:59,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:36:59,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:36:59,294 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:36:59,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1048161942] [2022-04-08 12:36:59,294 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 12:36:59,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:36:59,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:36:59,295 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-08 12:36:59,296 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-08 12:36:59,360 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 12:36:59,360 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:36:59,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-08 12:36:59,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:36:59,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:36:59,694 INFO L272 TraceCheckUtils]: 0: Hoare triple {11916#true} call ULTIMATE.init(); {11916#true} is VALID [2022-04-08 12:36:59,694 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-08 12:36:59,694 INFO L290 TraceCheckUtils]: 2: Hoare triple {11924#(<= ~counter~0 0)} assume true; {11924#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:59,695 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11924#(<= ~counter~0 0)} {11916#true} #102#return; {11924#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:59,695 INFO L272 TraceCheckUtils]: 4: Hoare triple {11924#(<= ~counter~0 0)} call #t~ret9 := main(); {11924#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:59,695 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-08 12:36:59,696 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-08 12:36:59,696 INFO L290 TraceCheckUtils]: 7: Hoare triple {11924#(<= ~counter~0 0)} ~cond := #in~cond; {11924#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:59,696 INFO L290 TraceCheckUtils]: 8: Hoare triple {11924#(<= ~counter~0 0)} assume !(0 == ~cond); {11924#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:59,696 INFO L290 TraceCheckUtils]: 9: Hoare triple {11924#(<= ~counter~0 0)} assume true; {11924#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:59,697 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11924#(<= ~counter~0 0)} {11924#(<= ~counter~0 0)} #90#return; {11924#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:59,697 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-08 12:36:59,698 INFO L290 TraceCheckUtils]: 12: Hoare triple {11924#(<= ~counter~0 0)} ~cond := #in~cond; {11924#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:59,698 INFO L290 TraceCheckUtils]: 13: Hoare triple {11924#(<= ~counter~0 0)} assume !(0 == ~cond); {11924#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:59,698 INFO L290 TraceCheckUtils]: 14: Hoare triple {11924#(<= ~counter~0 0)} assume true; {11924#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:59,698 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {11924#(<= ~counter~0 0)} {11924#(<= ~counter~0 0)} #92#return; {11924#(<= ~counter~0 0)} is VALID [2022-04-08 12:36:59,699 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-08 12:36:59,699 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-08 12:36:59,700 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-08 12:36:59,700 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-08 12:36:59,700 INFO L290 TraceCheckUtils]: 20: Hoare triple {11973#(<= ~counter~0 1)} ~cond := #in~cond; {11973#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:59,701 INFO L290 TraceCheckUtils]: 21: Hoare triple {11973#(<= ~counter~0 1)} assume !(0 == ~cond); {11973#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:59,701 INFO L290 TraceCheckUtils]: 22: Hoare triple {11973#(<= ~counter~0 1)} assume true; {11973#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:59,701 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {11973#(<= ~counter~0 1)} {11973#(<= ~counter~0 1)} #94#return; {11973#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:59,702 INFO L290 TraceCheckUtils]: 24: Hoare triple {11973#(<= ~counter~0 1)} assume !!(0 != ~r~0); {11973#(<= ~counter~0 1)} is VALID [2022-04-08 12:36:59,702 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-08 12:36:59,702 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-08 12:36:59,703 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-08 12:36:59,703 INFO L290 TraceCheckUtils]: 28: Hoare triple {11998#(<= ~counter~0 2)} ~cond := #in~cond; {11998#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:59,703 INFO L290 TraceCheckUtils]: 29: Hoare triple {11998#(<= ~counter~0 2)} assume !(0 == ~cond); {11998#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:59,703 INFO L290 TraceCheckUtils]: 30: Hoare triple {11998#(<= ~counter~0 2)} assume true; {11998#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:59,704 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {11998#(<= ~counter~0 2)} {11998#(<= ~counter~0 2)} #96#return; {11998#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:59,704 INFO L290 TraceCheckUtils]: 32: Hoare triple {11998#(<= ~counter~0 2)} assume !(~r~0 > 0); {11998#(<= ~counter~0 2)} is VALID [2022-04-08 12:36:59,705 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-08 12:36:59,705 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-08 12:36:59,705 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-08 12:36:59,706 INFO L290 TraceCheckUtils]: 36: Hoare triple {12023#(<= ~counter~0 3)} ~cond := #in~cond; {12023#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:59,706 INFO L290 TraceCheckUtils]: 37: Hoare triple {12023#(<= ~counter~0 3)} assume !(0 == ~cond); {12023#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:59,706 INFO L290 TraceCheckUtils]: 38: Hoare triple {12023#(<= ~counter~0 3)} assume true; {12023#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:59,707 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {12023#(<= ~counter~0 3)} {12023#(<= ~counter~0 3)} #98#return; {12023#(<= ~counter~0 3)} is VALID [2022-04-08 12:36:59,707 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-08 12:36:59,708 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-08 12:36:59,708 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-08 12:36:59,709 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-08 12:36:59,709 INFO L290 TraceCheckUtils]: 44: Hoare triple {12048#(<= ~counter~0 4)} ~cond := #in~cond; {12048#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:59,709 INFO L290 TraceCheckUtils]: 45: Hoare triple {12048#(<= ~counter~0 4)} assume !(0 == ~cond); {12048#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:59,709 INFO L290 TraceCheckUtils]: 46: Hoare triple {12048#(<= ~counter~0 4)} assume true; {12048#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:59,710 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {12048#(<= ~counter~0 4)} {12048#(<= ~counter~0 4)} #98#return; {12048#(<= ~counter~0 4)} is VALID [2022-04-08 12:36:59,710 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-08 12:36:59,711 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-08 12:36:59,711 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-08 12:36:59,711 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-08 12:36:59,712 INFO L290 TraceCheckUtils]: 52: Hoare triple {12073#(<= ~counter~0 5)} ~cond := #in~cond; {12073#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:59,712 INFO L290 TraceCheckUtils]: 53: Hoare triple {12073#(<= ~counter~0 5)} assume !(0 == ~cond); {12073#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:59,712 INFO L290 TraceCheckUtils]: 54: Hoare triple {12073#(<= ~counter~0 5)} assume true; {12073#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:59,713 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {12073#(<= ~counter~0 5)} {12073#(<= ~counter~0 5)} #98#return; {12073#(<= ~counter~0 5)} is VALID [2022-04-08 12:36:59,713 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-08 12:36:59,713 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-08 12:36:59,714 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-08 12:36:59,714 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-08 12:36:59,727 INFO L290 TraceCheckUtils]: 60: Hoare triple {12098#(<= ~counter~0 6)} ~cond := #in~cond; {12098#(<= ~counter~0 6)} is VALID [2022-04-08 12:36:59,727 INFO L290 TraceCheckUtils]: 61: Hoare triple {12098#(<= ~counter~0 6)} assume !(0 == ~cond); {12098#(<= ~counter~0 6)} is VALID [2022-04-08 12:36:59,728 INFO L290 TraceCheckUtils]: 62: Hoare triple {12098#(<= ~counter~0 6)} assume true; {12098#(<= ~counter~0 6)} is VALID [2022-04-08 12:36:59,728 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {12098#(<= ~counter~0 6)} {12098#(<= ~counter~0 6)} #98#return; {12098#(<= ~counter~0 6)} is VALID [2022-04-08 12:36:59,729 INFO L290 TraceCheckUtils]: 64: Hoare triple {12098#(<= ~counter~0 6)} assume !(~r~0 < 0); {12098#(<= ~counter~0 6)} is VALID [2022-04-08 12:36:59,729 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-08 12:36:59,729 INFO L290 TraceCheckUtils]: 66: Hoare triple {12123#(<= |main_#t~post6| 6)} assume !(#t~post6 < 20);havoc #t~post6; {11917#false} is VALID [2022-04-08 12:36:59,729 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-08 12:36:59,729 INFO L290 TraceCheckUtils]: 68: Hoare triple {11917#false} ~cond := #in~cond; {11917#false} is VALID [2022-04-08 12:36:59,729 INFO L290 TraceCheckUtils]: 69: Hoare triple {11917#false} assume 0 == ~cond; {11917#false} is VALID [2022-04-08 12:36:59,729 INFO L290 TraceCheckUtils]: 70: Hoare triple {11917#false} assume !false; {11917#false} is VALID [2022-04-08 12:36:59,730 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-08 12:36:59,730 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:37:00,081 INFO L290 TraceCheckUtils]: 70: Hoare triple {11917#false} assume !false; {11917#false} is VALID [2022-04-08 12:37:00,082 INFO L290 TraceCheckUtils]: 69: Hoare triple {11917#false} assume 0 == ~cond; {11917#false} is VALID [2022-04-08 12:37:00,082 INFO L290 TraceCheckUtils]: 68: Hoare triple {11917#false} ~cond := #in~cond; {11917#false} is VALID [2022-04-08 12:37:00,082 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-08 12:37:00,082 INFO L290 TraceCheckUtils]: 66: Hoare triple {12151#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {11917#false} is VALID [2022-04-08 12:37:00,082 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-08 12:37:00,083 INFO L290 TraceCheckUtils]: 64: Hoare triple {12155#(< ~counter~0 20)} assume !(~r~0 < 0); {12155#(< ~counter~0 20)} is VALID [2022-04-08 12:37:00,083 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {11916#true} {12155#(< ~counter~0 20)} #98#return; {12155#(< ~counter~0 20)} is VALID [2022-04-08 12:37:00,083 INFO L290 TraceCheckUtils]: 62: Hoare triple {11916#true} assume true; {11916#true} is VALID [2022-04-08 12:37:00,083 INFO L290 TraceCheckUtils]: 61: Hoare triple {11916#true} assume !(0 == ~cond); {11916#true} is VALID [2022-04-08 12:37:00,083 INFO L290 TraceCheckUtils]: 60: Hoare triple {11916#true} ~cond := #in~cond; {11916#true} is VALID [2022-04-08 12:37:00,084 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-08 12:37:00,084 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-08 12:37:00,084 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-08 12:37:00,085 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-08 12:37:00,085 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {11916#true} {12180#(< ~counter~0 19)} #98#return; {12180#(< ~counter~0 19)} is VALID [2022-04-08 12:37:00,085 INFO L290 TraceCheckUtils]: 54: Hoare triple {11916#true} assume true; {11916#true} is VALID [2022-04-08 12:37:00,085 INFO L290 TraceCheckUtils]: 53: Hoare triple {11916#true} assume !(0 == ~cond); {11916#true} is VALID [2022-04-08 12:37:00,085 INFO L290 TraceCheckUtils]: 52: Hoare triple {11916#true} ~cond := #in~cond; {11916#true} is VALID [2022-04-08 12:37:00,085 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-08 12:37:00,086 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-08 12:37:00,086 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-08 12:37:00,086 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-08 12:37:00,087 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {11916#true} {12205#(< ~counter~0 18)} #98#return; {12205#(< ~counter~0 18)} is VALID [2022-04-08 12:37:00,087 INFO L290 TraceCheckUtils]: 46: Hoare triple {11916#true} assume true; {11916#true} is VALID [2022-04-08 12:37:00,087 INFO L290 TraceCheckUtils]: 45: Hoare triple {11916#true} assume !(0 == ~cond); {11916#true} is VALID [2022-04-08 12:37:00,087 INFO L290 TraceCheckUtils]: 44: Hoare triple {11916#true} ~cond := #in~cond; {11916#true} is VALID [2022-04-08 12:37:00,087 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-08 12:37:00,087 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-08 12:37:00,088 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-08 12:37:00,088 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-08 12:37:00,089 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {11916#true} {12230#(< ~counter~0 17)} #98#return; {12230#(< ~counter~0 17)} is VALID [2022-04-08 12:37:00,089 INFO L290 TraceCheckUtils]: 38: Hoare triple {11916#true} assume true; {11916#true} is VALID [2022-04-08 12:37:00,089 INFO L290 TraceCheckUtils]: 37: Hoare triple {11916#true} assume !(0 == ~cond); {11916#true} is VALID [2022-04-08 12:37:00,089 INFO L290 TraceCheckUtils]: 36: Hoare triple {11916#true} ~cond := #in~cond; {11916#true} is VALID [2022-04-08 12:37:00,089 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-08 12:37:00,089 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-08 12:37:00,090 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-08 12:37:00,090 INFO L290 TraceCheckUtils]: 32: Hoare triple {12255#(< ~counter~0 16)} assume !(~r~0 > 0); {12255#(< ~counter~0 16)} is VALID [2022-04-08 12:37:00,090 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {11916#true} {12255#(< ~counter~0 16)} #96#return; {12255#(< ~counter~0 16)} is VALID [2022-04-08 12:37:00,091 INFO L290 TraceCheckUtils]: 30: Hoare triple {11916#true} assume true; {11916#true} is VALID [2022-04-08 12:37:00,091 INFO L290 TraceCheckUtils]: 29: Hoare triple {11916#true} assume !(0 == ~cond); {11916#true} is VALID [2022-04-08 12:37:00,091 INFO L290 TraceCheckUtils]: 28: Hoare triple {11916#true} ~cond := #in~cond; {11916#true} is VALID [2022-04-08 12:37:00,091 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-08 12:37:00,091 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-08 12:37:00,091 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-08 12:37:00,092 INFO L290 TraceCheckUtils]: 24: Hoare triple {12280#(< ~counter~0 15)} assume !!(0 != ~r~0); {12280#(< ~counter~0 15)} is VALID [2022-04-08 12:37:00,092 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {11916#true} {12280#(< ~counter~0 15)} #94#return; {12280#(< ~counter~0 15)} is VALID [2022-04-08 12:37:00,092 INFO L290 TraceCheckUtils]: 22: Hoare triple {11916#true} assume true; {11916#true} is VALID [2022-04-08 12:37:00,092 INFO L290 TraceCheckUtils]: 21: Hoare triple {11916#true} assume !(0 == ~cond); {11916#true} is VALID [2022-04-08 12:37:00,092 INFO L290 TraceCheckUtils]: 20: Hoare triple {11916#true} ~cond := #in~cond; {11916#true} is VALID [2022-04-08 12:37:00,093 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-08 12:37:00,093 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-08 12:37:00,093 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-08 12:37:00,094 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-08 12:37:00,094 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {11916#true} {12305#(< ~counter~0 14)} #92#return; {12305#(< ~counter~0 14)} is VALID [2022-04-08 12:37:00,094 INFO L290 TraceCheckUtils]: 14: Hoare triple {11916#true} assume true; {11916#true} is VALID [2022-04-08 12:37:00,094 INFO L290 TraceCheckUtils]: 13: Hoare triple {11916#true} assume !(0 == ~cond); {11916#true} is VALID [2022-04-08 12:37:00,094 INFO L290 TraceCheckUtils]: 12: Hoare triple {11916#true} ~cond := #in~cond; {11916#true} is VALID [2022-04-08 12:37:00,094 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-08 12:37:00,095 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11916#true} {12305#(< ~counter~0 14)} #90#return; {12305#(< ~counter~0 14)} is VALID [2022-04-08 12:37:00,095 INFO L290 TraceCheckUtils]: 9: Hoare triple {11916#true} assume true; {11916#true} is VALID [2022-04-08 12:37:00,095 INFO L290 TraceCheckUtils]: 8: Hoare triple {11916#true} assume !(0 == ~cond); {11916#true} is VALID [2022-04-08 12:37:00,095 INFO L290 TraceCheckUtils]: 7: Hoare triple {11916#true} ~cond := #in~cond; {11916#true} is VALID [2022-04-08 12:37:00,095 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-08 12:37:00,095 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-08 12:37:00,095 INFO L272 TraceCheckUtils]: 4: Hoare triple {12305#(< ~counter~0 14)} call #t~ret9 := main(); {12305#(< ~counter~0 14)} is VALID [2022-04-08 12:37:00,096 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12305#(< ~counter~0 14)} {11916#true} #102#return; {12305#(< ~counter~0 14)} is VALID [2022-04-08 12:37:00,096 INFO L290 TraceCheckUtils]: 2: Hoare triple {12305#(< ~counter~0 14)} assume true; {12305#(< ~counter~0 14)} is VALID [2022-04-08 12:37:00,096 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-08 12:37:00,097 INFO L272 TraceCheckUtils]: 0: Hoare triple {11916#true} call ULTIMATE.init(); {11916#true} is VALID [2022-04-08 12:37:00,097 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-08 12:37:00,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:37:00,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171814326] [2022-04-08 12:37:00,097 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:37:00,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048161942] [2022-04-08 12:37:00,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048161942] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:37:00,097 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:37:00,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-08 12:37:00,098 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:37:00,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [580830775] [2022-04-08 12:37:00,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [580830775] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:37:00,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:37:00,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 12:37:00,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603212391] [2022-04-08 12:37:00,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:37:00,098 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-08 12:37:00,098 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:37:00,099 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-08 12:37:00,146 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-08 12:37:00,146 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 12:37:00,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:37:00,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 12:37:00,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-08 12:37:00,147 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-08 12:37:00,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:37:00,568 INFO L93 Difference]: Finished difference Result 137 states and 169 transitions. [2022-04-08 12:37:00,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 12:37:00,568 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-08 12:37:00,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:37:00,568 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-08 12:37:00,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 135 transitions. [2022-04-08 12:37:00,569 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-08 12:37:00,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 135 transitions. [2022-04-08 12:37:00,570 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 135 transitions. [2022-04-08 12:37:00,672 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-08 12:37:00,673 INFO L225 Difference]: With dead ends: 137 [2022-04-08 12:37:00,674 INFO L226 Difference]: Without dead ends: 132 [2022-04-08 12:37:00,674 INFO L912 BasicCegarLoop]: 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-08 12:37:00,674 INFO L913 BasicCegarLoop]: 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-08 12:37:00,674 INFO L914 BasicCegarLoop]: 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-08 12:37:00,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-04-08 12:37:00,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 125. [2022-04-08 12:37:00,779 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:37:00,779 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-08 12:37:00,780 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-08 12:37:00,780 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-08 12:37:00,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:37:00,796 INFO L93 Difference]: Finished difference Result 132 states and 164 transitions. [2022-04-08 12:37:00,796 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 164 transitions. [2022-04-08 12:37:00,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:37:00,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:37:00,796 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-08 12:37:00,797 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-08 12:37:00,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:37:00,798 INFO L93 Difference]: Finished difference Result 132 states and 164 transitions. [2022-04-08 12:37:00,799 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 164 transitions. [2022-04-08 12:37:00,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:37:00,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:37:00,799 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:37:00,799 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:37:00,799 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-08 12:37:00,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 155 transitions. [2022-04-08 12:37:00,801 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 155 transitions. Word has length 71 [2022-04-08 12:37:00,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:37:00,801 INFO L478 AbstractCegarLoop]: Abstraction has 125 states and 155 transitions. [2022-04-08 12:37:00,801 INFO L479 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-08 12:37:00,801 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 125 states and 155 transitions. [2022-04-08 12:37:01,684 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-08 12:37:01,684 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 155 transitions. [2022-04-08 12:37:01,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-08 12:37:01,685 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:37:01,685 INFO L499 BasicCegarLoop]: 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-08 12:37:01,701 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-08 12:37:01,900 WARN L460 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-08 12:37:01,900 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:37:01,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:37:01,900 INFO L85 PathProgramCache]: Analyzing trace with hash -15963768, now seen corresponding path program 1 times [2022-04-08 12:37:01,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:37:01,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1580196748] [2022-04-08 12:37:01,901 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:37:01,901 INFO L85 PathProgramCache]: Analyzing trace with hash -15963768, now seen corresponding path program 2 times [2022-04-08 12:37:01,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:37:01,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795454978] [2022-04-08 12:37:01,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:37:01,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:37:01,910 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:37:01,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1313170209] [2022-04-08 12:37:01,910 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:37:01,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:37:01,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:37:01,911 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-08 12:37:01,912 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-08 12:37:01,952 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:37:01,952 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:37:01,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-08 12:37:01,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:37:01,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:37:02,143 INFO L272 TraceCheckUtils]: 0: Hoare triple {13153#true} call ULTIMATE.init(); {13153#true} is VALID [2022-04-08 12:37:02,143 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-08 12:37:02,143 INFO L290 TraceCheckUtils]: 2: Hoare triple {13153#true} assume true; {13153#true} is VALID [2022-04-08 12:37:02,144 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13153#true} {13153#true} #102#return; {13153#true} is VALID [2022-04-08 12:37:02,144 INFO L272 TraceCheckUtils]: 4: Hoare triple {13153#true} call #t~ret9 := main(); {13153#true} is VALID [2022-04-08 12:37:02,144 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-08 12:37:02,144 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-08 12:37:02,144 INFO L290 TraceCheckUtils]: 7: Hoare triple {13153#true} ~cond := #in~cond; {13153#true} is VALID [2022-04-08 12:37:02,144 INFO L290 TraceCheckUtils]: 8: Hoare triple {13153#true} assume !(0 == ~cond); {13153#true} is VALID [2022-04-08 12:37:02,144 INFO L290 TraceCheckUtils]: 9: Hoare triple {13153#true} assume true; {13153#true} is VALID [2022-04-08 12:37:02,144 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13153#true} {13153#true} #90#return; {13153#true} is VALID [2022-04-08 12:37:02,144 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-08 12:37:02,144 INFO L290 TraceCheckUtils]: 12: Hoare triple {13153#true} ~cond := #in~cond; {13153#true} is VALID [2022-04-08 12:37:02,144 INFO L290 TraceCheckUtils]: 13: Hoare triple {13153#true} assume !(0 == ~cond); {13153#true} is VALID [2022-04-08 12:37:02,144 INFO L290 TraceCheckUtils]: 14: Hoare triple {13153#true} assume true; {13153#true} is VALID [2022-04-08 12:37:02,144 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {13153#true} {13153#true} #92#return; {13153#true} is VALID [2022-04-08 12:37:02,144 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-08 12:37:02,145 INFO L290 TraceCheckUtils]: 17: Hoare triple {13153#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13153#true} is VALID [2022-04-08 12:37:02,145 INFO L290 TraceCheckUtils]: 18: Hoare triple {13153#true} assume !!(#t~post6 < 20);havoc #t~post6; {13153#true} is VALID [2022-04-08 12:37:02,145 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-08 12:37:02,145 INFO L290 TraceCheckUtils]: 20: Hoare triple {13153#true} ~cond := #in~cond; {13153#true} is VALID [2022-04-08 12:37:02,145 INFO L290 TraceCheckUtils]: 21: Hoare triple {13153#true} assume !(0 == ~cond); {13153#true} is VALID [2022-04-08 12:37:02,145 INFO L290 TraceCheckUtils]: 22: Hoare triple {13153#true} assume true; {13153#true} is VALID [2022-04-08 12:37:02,145 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {13153#true} {13153#true} #94#return; {13153#true} is VALID [2022-04-08 12:37:02,145 INFO L290 TraceCheckUtils]: 24: Hoare triple {13153#true} assume !!(0 != ~r~0); {13153#true} is VALID [2022-04-08 12:37:02,145 INFO L290 TraceCheckUtils]: 25: Hoare triple {13153#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13153#true} is VALID [2022-04-08 12:37:02,145 INFO L290 TraceCheckUtils]: 26: Hoare triple {13153#true} assume !!(#t~post7 < 20);havoc #t~post7; {13153#true} is VALID [2022-04-08 12:37:02,145 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-08 12:37:02,145 INFO L290 TraceCheckUtils]: 28: Hoare triple {13153#true} ~cond := #in~cond; {13153#true} is VALID [2022-04-08 12:37:02,145 INFO L290 TraceCheckUtils]: 29: Hoare triple {13153#true} assume !(0 == ~cond); {13153#true} is VALID [2022-04-08 12:37:02,145 INFO L290 TraceCheckUtils]: 30: Hoare triple {13153#true} assume true; {13153#true} is VALID [2022-04-08 12:37:02,145 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {13153#true} {13153#true} #96#return; {13153#true} is VALID [2022-04-08 12:37:02,146 INFO L290 TraceCheckUtils]: 32: Hoare triple {13153#true} assume !(~r~0 > 0); {13153#true} is VALID [2022-04-08 12:37:02,146 INFO L290 TraceCheckUtils]: 33: Hoare triple {13153#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {13153#true} is VALID [2022-04-08 12:37:02,146 INFO L290 TraceCheckUtils]: 34: Hoare triple {13153#true} assume !!(#t~post8 < 20);havoc #t~post8; {13153#true} is VALID [2022-04-08 12:37:02,146 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-08 12:37:02,146 INFO L290 TraceCheckUtils]: 36: Hoare triple {13153#true} ~cond := #in~cond; {13153#true} is VALID [2022-04-08 12:37:02,146 INFO L290 TraceCheckUtils]: 37: Hoare triple {13153#true} assume !(0 == ~cond); {13153#true} is VALID [2022-04-08 12:37:02,146 INFO L290 TraceCheckUtils]: 38: Hoare triple {13153#true} assume true; {13153#true} is VALID [2022-04-08 12:37:02,146 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {13153#true} {13153#true} #98#return; {13153#true} is VALID [2022-04-08 12:37:02,146 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-08 12:37:02,146 INFO L290 TraceCheckUtils]: 41: Hoare triple {13153#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {13153#true} is VALID [2022-04-08 12:37:02,146 INFO L290 TraceCheckUtils]: 42: Hoare triple {13153#true} assume !!(#t~post8 < 20);havoc #t~post8; {13153#true} is VALID [2022-04-08 12:37:02,146 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-08 12:37:02,146 INFO L290 TraceCheckUtils]: 44: Hoare triple {13153#true} ~cond := #in~cond; {13153#true} is VALID [2022-04-08 12:37:02,146 INFO L290 TraceCheckUtils]: 45: Hoare triple {13153#true} assume !(0 == ~cond); {13153#true} is VALID [2022-04-08 12:37:02,147 INFO L290 TraceCheckUtils]: 46: Hoare triple {13153#true} assume true; {13153#true} is VALID [2022-04-08 12:37:02,147 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {13153#true} {13153#true} #98#return; {13153#true} is VALID [2022-04-08 12:37:02,147 INFO L290 TraceCheckUtils]: 48: Hoare triple {13153#true} assume !(~r~0 < 0); {13302#(not (< main_~r~0 0))} is VALID [2022-04-08 12:37:02,147 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-08 12:37:02,147 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-08 12:37:02,148 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-08 12:37:02,148 INFO L290 TraceCheckUtils]: 52: Hoare triple {13153#true} ~cond := #in~cond; {13153#true} is VALID [2022-04-08 12:37:02,148 INFO L290 TraceCheckUtils]: 53: Hoare triple {13153#true} assume !(0 == ~cond); {13153#true} is VALID [2022-04-08 12:37:02,148 INFO L290 TraceCheckUtils]: 54: Hoare triple {13153#true} assume true; {13153#true} is VALID [2022-04-08 12:37:02,148 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-08 12:37:02,149 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-08 12:37:02,149 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-08 12:37:02,149 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-08 12:37:02,149 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-08 12:37:02,149 INFO L290 TraceCheckUtils]: 60: Hoare triple {13153#true} ~cond := #in~cond; {13153#true} is VALID [2022-04-08 12:37:02,149 INFO L290 TraceCheckUtils]: 61: Hoare triple {13153#true} assume !(0 == ~cond); {13153#true} is VALID [2022-04-08 12:37:02,150 INFO L290 TraceCheckUtils]: 62: Hoare triple {13153#true} assume true; {13153#true} is VALID [2022-04-08 12:37:02,150 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-08 12:37:02,150 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-08 12:37:02,150 INFO L290 TraceCheckUtils]: 65: Hoare triple {13154#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {13154#false} is VALID [2022-04-08 12:37:02,150 INFO L290 TraceCheckUtils]: 66: Hoare triple {13154#false} assume !(#t~post8 < 20);havoc #t~post8; {13154#false} is VALID [2022-04-08 12:37:02,151 INFO L290 TraceCheckUtils]: 67: Hoare triple {13154#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13154#false} is VALID [2022-04-08 12:37:02,151 INFO L290 TraceCheckUtils]: 68: Hoare triple {13154#false} assume !(#t~post6 < 20);havoc #t~post6; {13154#false} is VALID [2022-04-08 12:37:02,151 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-08 12:37:02,151 INFO L290 TraceCheckUtils]: 70: Hoare triple {13154#false} ~cond := #in~cond; {13154#false} is VALID [2022-04-08 12:37:02,151 INFO L290 TraceCheckUtils]: 71: Hoare triple {13154#false} assume 0 == ~cond; {13154#false} is VALID [2022-04-08 12:37:02,151 INFO L290 TraceCheckUtils]: 72: Hoare triple {13154#false} assume !false; {13154#false} is VALID [2022-04-08 12:37:02,151 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-08 12:37:02,151 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 12:37:02,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:37:02,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795454978] [2022-04-08 12:37:02,151 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:37:02,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313170209] [2022-04-08 12:37:02,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1313170209] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:37:02,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:37:02,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 12:37:02,152 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:37:02,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1580196748] [2022-04-08 12:37:02,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1580196748] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:37:02,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:37:02,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 12:37:02,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726468954] [2022-04-08 12:37:02,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:37:02,152 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-08 12:37:02,153 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:37:02,153 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-08 12:37:02,191 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-08 12:37:02,191 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 12:37:02,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:37:02,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 12:37:02,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-08 12:37:02,192 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-08 12:37:02,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:37:02,427 INFO L93 Difference]: Finished difference Result 180 states and 235 transitions. [2022-04-08 12:37:02,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 12:37:02,427 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-08 12:37:02,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:37:02,427 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-08 12:37:02,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-04-08 12:37:02,428 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-08 12:37:02,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-04-08 12:37:02,429 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 94 transitions. [2022-04-08 12:37:02,495 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-08 12:37:02,497 INFO L225 Difference]: With dead ends: 180 [2022-04-08 12:37:02,497 INFO L226 Difference]: Without dead ends: 143 [2022-04-08 12:37:02,498 INFO L912 BasicCegarLoop]: 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-08 12:37:02,498 INFO L913 BasicCegarLoop]: 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-08 12:37:02,498 INFO L914 BasicCegarLoop]: 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-08 12:37:02,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-04-08 12:37:02,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 137. [2022-04-08 12:37:02,627 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:37:02,627 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-08 12:37:02,627 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-08 12:37:02,628 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-08 12:37:02,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:37:02,630 INFO L93 Difference]: Finished difference Result 143 states and 181 transitions. [2022-04-08 12:37:02,630 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 181 transitions. [2022-04-08 12:37:02,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:37:02,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:37:02,630 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-08 12:37:02,630 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-08 12:37:02,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:37:02,632 INFO L93 Difference]: Finished difference Result 143 states and 181 transitions. [2022-04-08 12:37:02,632 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 181 transitions. [2022-04-08 12:37:02,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:37:02,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:37:02,633 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:37:02,633 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:37:02,633 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-08 12:37:02,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 173 transitions. [2022-04-08 12:37:02,635 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 173 transitions. Word has length 73 [2022-04-08 12:37:02,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:37:02,635 INFO L478 AbstractCegarLoop]: Abstraction has 137 states and 173 transitions. [2022-04-08 12:37:02,635 INFO L479 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-08 12:37:02,635 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 137 states and 173 transitions. [2022-04-08 12:37:03,883 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-08 12:37:03,883 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 173 transitions. [2022-04-08 12:37:03,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-08 12:37:03,884 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:37:03,884 INFO L499 BasicCegarLoop]: 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-08 12:37:03,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-04-08 12:37:04,096 WARN L460 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-08 12:37:04,096 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:37:04,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:37:04,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1401128268, now seen corresponding path program 7 times [2022-04-08 12:37:04,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:37:04,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [708518794] [2022-04-08 12:37:04,097 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:37:04,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1401128268, now seen corresponding path program 8 times [2022-04-08 12:37:04,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:37:04,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425551219] [2022-04-08 12:37:04,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:37:04,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:37:04,106 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:37:04,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1941808122] [2022-04-08 12:37:04,106 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:37:04,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:37:04,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:37:04,110 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-08 12:37:04,135 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-08 12:37:04,159 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:37:04,159 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:37:04,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-08 12:37:04,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:37:04,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:37:04,500 INFO L272 TraceCheckUtils]: 0: Hoare triple {14295#true} call ULTIMATE.init(); {14295#true} is VALID [2022-04-08 12:37:04,500 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-08 12:37:04,500 INFO L290 TraceCheckUtils]: 2: Hoare triple {14303#(<= ~counter~0 0)} assume true; {14303#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:04,501 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14303#(<= ~counter~0 0)} {14295#true} #102#return; {14303#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:04,501 INFO L272 TraceCheckUtils]: 4: Hoare triple {14303#(<= ~counter~0 0)} call #t~ret9 := main(); {14303#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:04,501 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-08 12:37:04,502 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-08 12:37:04,502 INFO L290 TraceCheckUtils]: 7: Hoare triple {14303#(<= ~counter~0 0)} ~cond := #in~cond; {14303#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:04,502 INFO L290 TraceCheckUtils]: 8: Hoare triple {14303#(<= ~counter~0 0)} assume !(0 == ~cond); {14303#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:04,503 INFO L290 TraceCheckUtils]: 9: Hoare triple {14303#(<= ~counter~0 0)} assume true; {14303#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:04,503 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14303#(<= ~counter~0 0)} {14303#(<= ~counter~0 0)} #90#return; {14303#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:04,503 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-08 12:37:04,504 INFO L290 TraceCheckUtils]: 12: Hoare triple {14303#(<= ~counter~0 0)} ~cond := #in~cond; {14303#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:04,504 INFO L290 TraceCheckUtils]: 13: Hoare triple {14303#(<= ~counter~0 0)} assume !(0 == ~cond); {14303#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:04,504 INFO L290 TraceCheckUtils]: 14: Hoare triple {14303#(<= ~counter~0 0)} assume true; {14303#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:04,505 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {14303#(<= ~counter~0 0)} {14303#(<= ~counter~0 0)} #92#return; {14303#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:04,505 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-08 12:37:04,505 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-08 12:37:04,506 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-08 12:37:04,506 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-08 12:37:04,506 INFO L290 TraceCheckUtils]: 20: Hoare triple {14352#(<= ~counter~0 1)} ~cond := #in~cond; {14352#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:04,507 INFO L290 TraceCheckUtils]: 21: Hoare triple {14352#(<= ~counter~0 1)} assume !(0 == ~cond); {14352#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:04,507 INFO L290 TraceCheckUtils]: 22: Hoare triple {14352#(<= ~counter~0 1)} assume true; {14352#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:04,507 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {14352#(<= ~counter~0 1)} {14352#(<= ~counter~0 1)} #94#return; {14352#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:04,508 INFO L290 TraceCheckUtils]: 24: Hoare triple {14352#(<= ~counter~0 1)} assume !!(0 != ~r~0); {14352#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:04,519 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-08 12:37:04,520 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-08 12:37:04,520 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-08 12:37:04,521 INFO L290 TraceCheckUtils]: 28: Hoare triple {14377#(<= ~counter~0 2)} ~cond := #in~cond; {14377#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:04,521 INFO L290 TraceCheckUtils]: 29: Hoare triple {14377#(<= ~counter~0 2)} assume !(0 == ~cond); {14377#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:04,521 INFO L290 TraceCheckUtils]: 30: Hoare triple {14377#(<= ~counter~0 2)} assume true; {14377#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:04,522 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {14377#(<= ~counter~0 2)} {14377#(<= ~counter~0 2)} #96#return; {14377#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:04,522 INFO L290 TraceCheckUtils]: 32: Hoare triple {14377#(<= ~counter~0 2)} assume !(~r~0 > 0); {14377#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:04,522 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-08 12:37:04,523 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-08 12:37:04,523 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-08 12:37:04,523 INFO L290 TraceCheckUtils]: 36: Hoare triple {14402#(<= ~counter~0 3)} ~cond := #in~cond; {14402#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:04,524 INFO L290 TraceCheckUtils]: 37: Hoare triple {14402#(<= ~counter~0 3)} assume !(0 == ~cond); {14402#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:04,524 INFO L290 TraceCheckUtils]: 38: Hoare triple {14402#(<= ~counter~0 3)} assume true; {14402#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:04,524 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {14402#(<= ~counter~0 3)} {14402#(<= ~counter~0 3)} #98#return; {14402#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:04,525 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-08 12:37:04,525 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-08 12:37:04,525 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-08 12:37:04,526 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-08 12:37:04,526 INFO L290 TraceCheckUtils]: 44: Hoare triple {14427#(<= ~counter~0 4)} ~cond := #in~cond; {14427#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:04,527 INFO L290 TraceCheckUtils]: 45: Hoare triple {14427#(<= ~counter~0 4)} assume !(0 == ~cond); {14427#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:04,527 INFO L290 TraceCheckUtils]: 46: Hoare triple {14427#(<= ~counter~0 4)} assume true; {14427#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:04,527 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {14427#(<= ~counter~0 4)} {14427#(<= ~counter~0 4)} #98#return; {14427#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:04,528 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-08 12:37:04,528 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-08 12:37:04,528 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-08 12:37:04,529 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-08 12:37:04,529 INFO L290 TraceCheckUtils]: 52: Hoare triple {14452#(<= ~counter~0 5)} ~cond := #in~cond; {14452#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:04,529 INFO L290 TraceCheckUtils]: 53: Hoare triple {14452#(<= ~counter~0 5)} assume !(0 == ~cond); {14452#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:04,530 INFO L290 TraceCheckUtils]: 54: Hoare triple {14452#(<= ~counter~0 5)} assume true; {14452#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:04,530 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {14452#(<= ~counter~0 5)} {14452#(<= ~counter~0 5)} #98#return; {14452#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:04,530 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-08 12:37:04,531 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-08 12:37:04,531 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-08 12:37:04,532 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-08 12:37:04,532 INFO L290 TraceCheckUtils]: 60: Hoare triple {14477#(<= ~counter~0 6)} ~cond := #in~cond; {14477#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:04,532 INFO L290 TraceCheckUtils]: 61: Hoare triple {14477#(<= ~counter~0 6)} assume !(0 == ~cond); {14477#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:04,532 INFO L290 TraceCheckUtils]: 62: Hoare triple {14477#(<= ~counter~0 6)} assume true; {14477#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:04,533 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {14477#(<= ~counter~0 6)} {14477#(<= ~counter~0 6)} #98#return; {14477#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:04,533 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-08 12:37:04,533 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-08 12:37:04,534 INFO L290 TraceCheckUtils]: 66: Hoare triple {14502#(<= |main_#t~post8| 6)} assume !(#t~post8 < 20);havoc #t~post8; {14296#false} is VALID [2022-04-08 12:37:04,534 INFO L290 TraceCheckUtils]: 67: Hoare triple {14296#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14296#false} is VALID [2022-04-08 12:37:04,534 INFO L290 TraceCheckUtils]: 68: Hoare triple {14296#false} assume !(#t~post6 < 20);havoc #t~post6; {14296#false} is VALID [2022-04-08 12:37:04,534 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-08 12:37:04,534 INFO L290 TraceCheckUtils]: 70: Hoare triple {14296#false} ~cond := #in~cond; {14296#false} is VALID [2022-04-08 12:37:04,534 INFO L290 TraceCheckUtils]: 71: Hoare triple {14296#false} assume 0 == ~cond; {14296#false} is VALID [2022-04-08 12:37:04,534 INFO L290 TraceCheckUtils]: 72: Hoare triple {14296#false} assume !false; {14296#false} is VALID [2022-04-08 12:37:04,534 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-08 12:37:04,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:37:04,876 INFO L290 TraceCheckUtils]: 72: Hoare triple {14296#false} assume !false; {14296#false} is VALID [2022-04-08 12:37:04,876 INFO L290 TraceCheckUtils]: 71: Hoare triple {14296#false} assume 0 == ~cond; {14296#false} is VALID [2022-04-08 12:37:04,876 INFO L290 TraceCheckUtils]: 70: Hoare triple {14296#false} ~cond := #in~cond; {14296#false} is VALID [2022-04-08 12:37:04,876 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-08 12:37:04,876 INFO L290 TraceCheckUtils]: 68: Hoare triple {14296#false} assume !(#t~post6 < 20);havoc #t~post6; {14296#false} is VALID [2022-04-08 12:37:04,876 INFO L290 TraceCheckUtils]: 67: Hoare triple {14296#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14296#false} is VALID [2022-04-08 12:37:04,877 INFO L290 TraceCheckUtils]: 66: Hoare triple {14542#(< |main_#t~post8| 20)} assume !(#t~post8 < 20);havoc #t~post8; {14296#false} is VALID [2022-04-08 12:37:04,877 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-08 12:37:04,877 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-08 12:37:04,878 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {14295#true} {14546#(< ~counter~0 20)} #98#return; {14546#(< ~counter~0 20)} is VALID [2022-04-08 12:37:04,878 INFO L290 TraceCheckUtils]: 62: Hoare triple {14295#true} assume true; {14295#true} is VALID [2022-04-08 12:37:04,878 INFO L290 TraceCheckUtils]: 61: Hoare triple {14295#true} assume !(0 == ~cond); {14295#true} is VALID [2022-04-08 12:37:04,878 INFO L290 TraceCheckUtils]: 60: Hoare triple {14295#true} ~cond := #in~cond; {14295#true} is VALID [2022-04-08 12:37:04,878 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-08 12:37:04,878 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-08 12:37:04,879 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-08 12:37:04,879 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-08 12:37:04,880 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {14295#true} {14571#(< ~counter~0 19)} #98#return; {14571#(< ~counter~0 19)} is VALID [2022-04-08 12:37:04,880 INFO L290 TraceCheckUtils]: 54: Hoare triple {14295#true} assume true; {14295#true} is VALID [2022-04-08 12:37:04,880 INFO L290 TraceCheckUtils]: 53: Hoare triple {14295#true} assume !(0 == ~cond); {14295#true} is VALID [2022-04-08 12:37:04,880 INFO L290 TraceCheckUtils]: 52: Hoare triple {14295#true} ~cond := #in~cond; {14295#true} is VALID [2022-04-08 12:37:04,880 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-08 12:37:04,880 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-08 12:37:04,881 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-08 12:37:04,881 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-08 12:37:04,881 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {14295#true} {14596#(< ~counter~0 18)} #98#return; {14596#(< ~counter~0 18)} is VALID [2022-04-08 12:37:04,881 INFO L290 TraceCheckUtils]: 46: Hoare triple {14295#true} assume true; {14295#true} is VALID [2022-04-08 12:37:04,882 INFO L290 TraceCheckUtils]: 45: Hoare triple {14295#true} assume !(0 == ~cond); {14295#true} is VALID [2022-04-08 12:37:04,882 INFO L290 TraceCheckUtils]: 44: Hoare triple {14295#true} ~cond := #in~cond; {14295#true} is VALID [2022-04-08 12:37:04,882 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-08 12:37:04,882 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-08 12:37:04,882 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-08 12:37:04,883 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-08 12:37:04,883 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {14295#true} {14621#(< ~counter~0 17)} #98#return; {14621#(< ~counter~0 17)} is VALID [2022-04-08 12:37:04,883 INFO L290 TraceCheckUtils]: 38: Hoare triple {14295#true} assume true; {14295#true} is VALID [2022-04-08 12:37:04,883 INFO L290 TraceCheckUtils]: 37: Hoare triple {14295#true} assume !(0 == ~cond); {14295#true} is VALID [2022-04-08 12:37:04,883 INFO L290 TraceCheckUtils]: 36: Hoare triple {14295#true} ~cond := #in~cond; {14295#true} is VALID [2022-04-08 12:37:04,883 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-08 12:37:04,884 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-08 12:37:04,884 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-08 12:37:04,884 INFO L290 TraceCheckUtils]: 32: Hoare triple {14646#(< ~counter~0 16)} assume !(~r~0 > 0); {14646#(< ~counter~0 16)} is VALID [2022-04-08 12:37:04,885 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {14295#true} {14646#(< ~counter~0 16)} #96#return; {14646#(< ~counter~0 16)} is VALID [2022-04-08 12:37:04,885 INFO L290 TraceCheckUtils]: 30: Hoare triple {14295#true} assume true; {14295#true} is VALID [2022-04-08 12:37:04,885 INFO L290 TraceCheckUtils]: 29: Hoare triple {14295#true} assume !(0 == ~cond); {14295#true} is VALID [2022-04-08 12:37:04,885 INFO L290 TraceCheckUtils]: 28: Hoare triple {14295#true} ~cond := #in~cond; {14295#true} is VALID [2022-04-08 12:37:04,885 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-08 12:37:04,885 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-08 12:37:04,886 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-08 12:37:04,886 INFO L290 TraceCheckUtils]: 24: Hoare triple {14671#(< ~counter~0 15)} assume !!(0 != ~r~0); {14671#(< ~counter~0 15)} is VALID [2022-04-08 12:37:04,887 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {14295#true} {14671#(< ~counter~0 15)} #94#return; {14671#(< ~counter~0 15)} is VALID [2022-04-08 12:37:04,887 INFO L290 TraceCheckUtils]: 22: Hoare triple {14295#true} assume true; {14295#true} is VALID [2022-04-08 12:37:04,887 INFO L290 TraceCheckUtils]: 21: Hoare triple {14295#true} assume !(0 == ~cond); {14295#true} is VALID [2022-04-08 12:37:04,887 INFO L290 TraceCheckUtils]: 20: Hoare triple {14295#true} ~cond := #in~cond; {14295#true} is VALID [2022-04-08 12:37:04,887 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-08 12:37:04,887 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-08 12:37:04,888 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-08 12:37:04,888 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-08 12:37:04,888 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {14295#true} {14696#(< ~counter~0 14)} #92#return; {14696#(< ~counter~0 14)} is VALID [2022-04-08 12:37:04,888 INFO L290 TraceCheckUtils]: 14: Hoare triple {14295#true} assume true; {14295#true} is VALID [2022-04-08 12:37:04,888 INFO L290 TraceCheckUtils]: 13: Hoare triple {14295#true} assume !(0 == ~cond); {14295#true} is VALID [2022-04-08 12:37:04,888 INFO L290 TraceCheckUtils]: 12: Hoare triple {14295#true} ~cond := #in~cond; {14295#true} is VALID [2022-04-08 12:37:04,889 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-08 12:37:04,889 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14295#true} {14696#(< ~counter~0 14)} #90#return; {14696#(< ~counter~0 14)} is VALID [2022-04-08 12:37:04,889 INFO L290 TraceCheckUtils]: 9: Hoare triple {14295#true} assume true; {14295#true} is VALID [2022-04-08 12:37:04,889 INFO L290 TraceCheckUtils]: 8: Hoare triple {14295#true} assume !(0 == ~cond); {14295#true} is VALID [2022-04-08 12:37:04,889 INFO L290 TraceCheckUtils]: 7: Hoare triple {14295#true} ~cond := #in~cond; {14295#true} is VALID [2022-04-08 12:37:04,889 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-08 12:37:04,889 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-08 12:37:04,890 INFO L272 TraceCheckUtils]: 4: Hoare triple {14696#(< ~counter~0 14)} call #t~ret9 := main(); {14696#(< ~counter~0 14)} is VALID [2022-04-08 12:37:04,890 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14696#(< ~counter~0 14)} {14295#true} #102#return; {14696#(< ~counter~0 14)} is VALID [2022-04-08 12:37:04,890 INFO L290 TraceCheckUtils]: 2: Hoare triple {14696#(< ~counter~0 14)} assume true; {14696#(< ~counter~0 14)} is VALID [2022-04-08 12:37:04,891 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-08 12:37:04,891 INFO L272 TraceCheckUtils]: 0: Hoare triple {14295#true} call ULTIMATE.init(); {14295#true} is VALID [2022-04-08 12:37:04,891 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-08 12:37:04,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:37:04,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425551219] [2022-04-08 12:37:04,891 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:37:04,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941808122] [2022-04-08 12:37:04,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1941808122] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:37:04,892 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:37:04,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-08 12:37:04,892 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:37:04,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [708518794] [2022-04-08 12:37:04,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [708518794] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:37:04,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:37:04,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 12:37:04,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210622393] [2022-04-08 12:37:04,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:37:04,893 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-08 12:37:04,893 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:37:04,893 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-08 12:37:04,936 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-08 12:37:04,937 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 12:37:04,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:37:04,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 12:37:04,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-08 12:37:04,937 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-08 12:37:05,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:37:05,390 INFO L93 Difference]: Finished difference Result 193 states and 252 transitions. [2022-04-08 12:37:05,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 12:37:05,391 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-08 12:37:05,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:37:05,391 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-08 12:37:05,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 157 transitions. [2022-04-08 12:37:05,393 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-08 12:37:05,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 157 transitions. [2022-04-08 12:37:05,395 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 157 transitions. [2022-04-08 12:37:05,511 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-08 12:37:05,514 INFO L225 Difference]: With dead ends: 193 [2022-04-08 12:37:05,514 INFO L226 Difference]: Without dead ends: 144 [2022-04-08 12:37:05,514 INFO L912 BasicCegarLoop]: 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-08 12:37:05,515 INFO L913 BasicCegarLoop]: 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-08 12:37:05,515 INFO L914 BasicCegarLoop]: 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-08 12:37:05,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-04-08 12:37:05,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 140. [2022-04-08 12:37:05,663 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:37:05,663 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-08 12:37:05,663 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-08 12:37:05,663 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-08 12:37:05,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:37:05,666 INFO L93 Difference]: Finished difference Result 144 states and 181 transitions. [2022-04-08 12:37:05,666 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 181 transitions. [2022-04-08 12:37:05,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:37:05,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:37:05,667 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-08 12:37:05,667 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-08 12:37:05,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:37:05,669 INFO L93 Difference]: Finished difference Result 144 states and 181 transitions. [2022-04-08 12:37:05,669 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 181 transitions. [2022-04-08 12:37:05,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:37:05,669 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:37:05,670 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:37:05,670 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:37:05,671 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-08 12:37:05,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 177 transitions. [2022-04-08 12:37:05,673 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 177 transitions. Word has length 73 [2022-04-08 12:37:05,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:37:05,674 INFO L478 AbstractCegarLoop]: Abstraction has 140 states and 177 transitions. [2022-04-08 12:37:05,674 INFO L479 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-08 12:37:05,674 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 140 states and 177 transitions. [2022-04-08 12:37:07,820 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-08 12:37:07,820 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 177 transitions. [2022-04-08 12:37:07,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-08 12:37:07,821 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:37:07,821 INFO L499 BasicCegarLoop]: 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-08 12:37:07,841 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-08 12:37:08,021 WARN L460 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-08 12:37:08,022 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:37:08,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:37:08,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1116733197, now seen corresponding path program 1 times [2022-04-08 12:37:08,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:37:08,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [849871918] [2022-04-08 12:37:08,023 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:37:08,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1116733197, now seen corresponding path program 2 times [2022-04-08 12:37:08,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:37:08,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026827275] [2022-04-08 12:37:08,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:37:08,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:37:08,037 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:37:08,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2139275500] [2022-04-08 12:37:08,037 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:37:08,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:37:08,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:37:08,040 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-08 12:37:08,040 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-08 12:37:08,085 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:37:08,086 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:37:08,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-08 12:37:08,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:37:08,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:37:08,427 INFO L272 TraceCheckUtils]: 0: Hoare triple {15712#true} call ULTIMATE.init(); {15712#true} is VALID [2022-04-08 12:37:08,427 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-08 12:37:08,428 INFO L290 TraceCheckUtils]: 2: Hoare triple {15720#(<= ~counter~0 0)} assume true; {15720#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:08,428 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15720#(<= ~counter~0 0)} {15712#true} #102#return; {15720#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:08,428 INFO L272 TraceCheckUtils]: 4: Hoare triple {15720#(<= ~counter~0 0)} call #t~ret9 := main(); {15720#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:08,429 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-08 12:37:08,429 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-08 12:37:08,429 INFO L290 TraceCheckUtils]: 7: Hoare triple {15720#(<= ~counter~0 0)} ~cond := #in~cond; {15720#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:08,430 INFO L290 TraceCheckUtils]: 8: Hoare triple {15720#(<= ~counter~0 0)} assume !(0 == ~cond); {15720#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:08,430 INFO L290 TraceCheckUtils]: 9: Hoare triple {15720#(<= ~counter~0 0)} assume true; {15720#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:08,430 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15720#(<= ~counter~0 0)} {15720#(<= ~counter~0 0)} #90#return; {15720#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:08,431 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-08 12:37:08,431 INFO L290 TraceCheckUtils]: 12: Hoare triple {15720#(<= ~counter~0 0)} ~cond := #in~cond; {15720#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:08,431 INFO L290 TraceCheckUtils]: 13: Hoare triple {15720#(<= ~counter~0 0)} assume !(0 == ~cond); {15720#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:08,432 INFO L290 TraceCheckUtils]: 14: Hoare triple {15720#(<= ~counter~0 0)} assume true; {15720#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:08,432 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {15720#(<= ~counter~0 0)} {15720#(<= ~counter~0 0)} #92#return; {15720#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:08,432 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-08 12:37:08,433 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-08 12:37:08,433 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-08 12:37:08,434 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-08 12:37:08,434 INFO L290 TraceCheckUtils]: 20: Hoare triple {15769#(<= ~counter~0 1)} ~cond := #in~cond; {15769#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:08,434 INFO L290 TraceCheckUtils]: 21: Hoare triple {15769#(<= ~counter~0 1)} assume !(0 == ~cond); {15769#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:08,434 INFO L290 TraceCheckUtils]: 22: Hoare triple {15769#(<= ~counter~0 1)} assume true; {15769#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:08,435 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {15769#(<= ~counter~0 1)} {15769#(<= ~counter~0 1)} #94#return; {15769#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:08,435 INFO L290 TraceCheckUtils]: 24: Hoare triple {15769#(<= ~counter~0 1)} assume !!(0 != ~r~0); {15769#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:08,436 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-08 12:37:08,436 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-08 12:37:08,436 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-08 12:37:08,437 INFO L290 TraceCheckUtils]: 28: Hoare triple {15794#(<= ~counter~0 2)} ~cond := #in~cond; {15794#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:08,437 INFO L290 TraceCheckUtils]: 29: Hoare triple {15794#(<= ~counter~0 2)} assume !(0 == ~cond); {15794#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:08,437 INFO L290 TraceCheckUtils]: 30: Hoare triple {15794#(<= ~counter~0 2)} assume true; {15794#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:08,438 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {15794#(<= ~counter~0 2)} {15794#(<= ~counter~0 2)} #96#return; {15794#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:08,438 INFO L290 TraceCheckUtils]: 32: Hoare triple {15794#(<= ~counter~0 2)} assume !(~r~0 > 0); {15794#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:08,438 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-08 12:37:08,439 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-08 12:37:08,439 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-08 12:37:08,439 INFO L290 TraceCheckUtils]: 36: Hoare triple {15819#(<= ~counter~0 3)} ~cond := #in~cond; {15819#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:08,440 INFO L290 TraceCheckUtils]: 37: Hoare triple {15819#(<= ~counter~0 3)} assume !(0 == ~cond); {15819#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:08,440 INFO L290 TraceCheckUtils]: 38: Hoare triple {15819#(<= ~counter~0 3)} assume true; {15819#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:08,440 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {15819#(<= ~counter~0 3)} {15819#(<= ~counter~0 3)} #98#return; {15819#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:08,441 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-08 12:37:08,441 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-08 12:37:08,441 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-08 12:37:08,442 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-08 12:37:08,442 INFO L290 TraceCheckUtils]: 44: Hoare triple {15844#(<= ~counter~0 4)} ~cond := #in~cond; {15844#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:08,442 INFO L290 TraceCheckUtils]: 45: Hoare triple {15844#(<= ~counter~0 4)} assume !(0 == ~cond); {15844#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:08,443 INFO L290 TraceCheckUtils]: 46: Hoare triple {15844#(<= ~counter~0 4)} assume true; {15844#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:08,443 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {15844#(<= ~counter~0 4)} {15844#(<= ~counter~0 4)} #98#return; {15844#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:08,443 INFO L290 TraceCheckUtils]: 48: Hoare triple {15844#(<= ~counter~0 4)} assume !(~r~0 < 0); {15844#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:08,444 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-08 12:37:08,444 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-08 12:37:08,444 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-08 12:37:08,445 INFO L290 TraceCheckUtils]: 52: Hoare triple {15869#(<= ~counter~0 5)} ~cond := #in~cond; {15869#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:08,445 INFO L290 TraceCheckUtils]: 53: Hoare triple {15869#(<= ~counter~0 5)} assume !(0 == ~cond); {15869#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:08,445 INFO L290 TraceCheckUtils]: 54: Hoare triple {15869#(<= ~counter~0 5)} assume true; {15869#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:08,446 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {15869#(<= ~counter~0 5)} {15869#(<= ~counter~0 5)} #94#return; {15869#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:08,446 INFO L290 TraceCheckUtils]: 56: Hoare triple {15869#(<= ~counter~0 5)} assume !!(0 != ~r~0); {15869#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:08,446 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-08 12:37:08,447 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-08 12:37:08,447 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-08 12:37:08,447 INFO L290 TraceCheckUtils]: 60: Hoare triple {15894#(<= ~counter~0 6)} ~cond := #in~cond; {15894#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:08,448 INFO L290 TraceCheckUtils]: 61: Hoare triple {15894#(<= ~counter~0 6)} assume !(0 == ~cond); {15894#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:08,448 INFO L290 TraceCheckUtils]: 62: Hoare triple {15894#(<= ~counter~0 6)} assume true; {15894#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:08,448 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {15894#(<= ~counter~0 6)} {15894#(<= ~counter~0 6)} #96#return; {15894#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:08,449 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-08 12:37:08,449 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-08 12:37:08,449 INFO L290 TraceCheckUtils]: 66: Hoare triple {15919#(<= |main_#t~post7| 6)} assume !(#t~post7 < 20);havoc #t~post7; {15713#false} is VALID [2022-04-08 12:37:08,449 INFO L290 TraceCheckUtils]: 67: Hoare triple {15713#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {15713#false} is VALID [2022-04-08 12:37:08,449 INFO L290 TraceCheckUtils]: 68: Hoare triple {15713#false} assume !(#t~post8 < 20);havoc #t~post8; {15713#false} is VALID [2022-04-08 12:37:08,449 INFO L290 TraceCheckUtils]: 69: Hoare triple {15713#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15713#false} is VALID [2022-04-08 12:37:08,450 INFO L290 TraceCheckUtils]: 70: Hoare triple {15713#false} assume !(#t~post6 < 20);havoc #t~post6; {15713#false} is VALID [2022-04-08 12:37:08,450 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-08 12:37:08,450 INFO L290 TraceCheckUtils]: 72: Hoare triple {15713#false} ~cond := #in~cond; {15713#false} is VALID [2022-04-08 12:37:08,450 INFO L290 TraceCheckUtils]: 73: Hoare triple {15713#false} assume 0 == ~cond; {15713#false} is VALID [2022-04-08 12:37:08,450 INFO L290 TraceCheckUtils]: 74: Hoare triple {15713#false} assume !false; {15713#false} is VALID [2022-04-08 12:37:08,450 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-08 12:37:08,450 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:37:08,816 INFO L290 TraceCheckUtils]: 74: Hoare triple {15713#false} assume !false; {15713#false} is VALID [2022-04-08 12:37:08,816 INFO L290 TraceCheckUtils]: 73: Hoare triple {15713#false} assume 0 == ~cond; {15713#false} is VALID [2022-04-08 12:37:08,816 INFO L290 TraceCheckUtils]: 72: Hoare triple {15713#false} ~cond := #in~cond; {15713#false} is VALID [2022-04-08 12:37:08,817 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-08 12:37:08,817 INFO L290 TraceCheckUtils]: 70: Hoare triple {15713#false} assume !(#t~post6 < 20);havoc #t~post6; {15713#false} is VALID [2022-04-08 12:37:08,817 INFO L290 TraceCheckUtils]: 69: Hoare triple {15713#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15713#false} is VALID [2022-04-08 12:37:08,817 INFO L290 TraceCheckUtils]: 68: Hoare triple {15713#false} assume !(#t~post8 < 20);havoc #t~post8; {15713#false} is VALID [2022-04-08 12:37:08,823 INFO L290 TraceCheckUtils]: 67: Hoare triple {15713#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {15713#false} is VALID [2022-04-08 12:37:08,823 INFO L290 TraceCheckUtils]: 66: Hoare triple {15971#(< |main_#t~post7| 20)} assume !(#t~post7 < 20);havoc #t~post7; {15713#false} is VALID [2022-04-08 12:37:08,824 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-08 12:37:08,824 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-08 12:37:08,825 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {15712#true} {15975#(< ~counter~0 20)} #96#return; {15975#(< ~counter~0 20)} is VALID [2022-04-08 12:37:08,825 INFO L290 TraceCheckUtils]: 62: Hoare triple {15712#true} assume true; {15712#true} is VALID [2022-04-08 12:37:08,825 INFO L290 TraceCheckUtils]: 61: Hoare triple {15712#true} assume !(0 == ~cond); {15712#true} is VALID [2022-04-08 12:37:08,825 INFO L290 TraceCheckUtils]: 60: Hoare triple {15712#true} ~cond := #in~cond; {15712#true} is VALID [2022-04-08 12:37:08,825 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-08 12:37:08,825 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-08 12:37:08,826 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-08 12:37:08,826 INFO L290 TraceCheckUtils]: 56: Hoare triple {16000#(< ~counter~0 19)} assume !!(0 != ~r~0); {16000#(< ~counter~0 19)} is VALID [2022-04-08 12:37:08,827 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {15712#true} {16000#(< ~counter~0 19)} #94#return; {16000#(< ~counter~0 19)} is VALID [2022-04-08 12:37:08,827 INFO L290 TraceCheckUtils]: 54: Hoare triple {15712#true} assume true; {15712#true} is VALID [2022-04-08 12:37:08,827 INFO L290 TraceCheckUtils]: 53: Hoare triple {15712#true} assume !(0 == ~cond); {15712#true} is VALID [2022-04-08 12:37:08,827 INFO L290 TraceCheckUtils]: 52: Hoare triple {15712#true} ~cond := #in~cond; {15712#true} is VALID [2022-04-08 12:37:08,827 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-08 12:37:08,827 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-08 12:37:08,828 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-08 12:37:08,828 INFO L290 TraceCheckUtils]: 48: Hoare triple {16025#(< ~counter~0 18)} assume !(~r~0 < 0); {16025#(< ~counter~0 18)} is VALID [2022-04-08 12:37:08,828 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {15712#true} {16025#(< ~counter~0 18)} #98#return; {16025#(< ~counter~0 18)} is VALID [2022-04-08 12:37:08,828 INFO L290 TraceCheckUtils]: 46: Hoare triple {15712#true} assume true; {15712#true} is VALID [2022-04-08 12:37:08,829 INFO L290 TraceCheckUtils]: 45: Hoare triple {15712#true} assume !(0 == ~cond); {15712#true} is VALID [2022-04-08 12:37:08,829 INFO L290 TraceCheckUtils]: 44: Hoare triple {15712#true} ~cond := #in~cond; {15712#true} is VALID [2022-04-08 12:37:08,829 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-08 12:37:08,829 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-08 12:37:08,829 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-08 12:37:08,830 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-08 12:37:08,830 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {15712#true} {16050#(< ~counter~0 17)} #98#return; {16050#(< ~counter~0 17)} is VALID [2022-04-08 12:37:08,830 INFO L290 TraceCheckUtils]: 38: Hoare triple {15712#true} assume true; {15712#true} is VALID [2022-04-08 12:37:08,830 INFO L290 TraceCheckUtils]: 37: Hoare triple {15712#true} assume !(0 == ~cond); {15712#true} is VALID [2022-04-08 12:37:08,830 INFO L290 TraceCheckUtils]: 36: Hoare triple {15712#true} ~cond := #in~cond; {15712#true} is VALID [2022-04-08 12:37:08,830 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-08 12:37:08,831 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-08 12:37:08,831 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-08 12:37:08,832 INFO L290 TraceCheckUtils]: 32: Hoare triple {16075#(< ~counter~0 16)} assume !(~r~0 > 0); {16075#(< ~counter~0 16)} is VALID [2022-04-08 12:37:08,832 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {15712#true} {16075#(< ~counter~0 16)} #96#return; {16075#(< ~counter~0 16)} is VALID [2022-04-08 12:37:08,832 INFO L290 TraceCheckUtils]: 30: Hoare triple {15712#true} assume true; {15712#true} is VALID [2022-04-08 12:37:08,832 INFO L290 TraceCheckUtils]: 29: Hoare triple {15712#true} assume !(0 == ~cond); {15712#true} is VALID [2022-04-08 12:37:08,832 INFO L290 TraceCheckUtils]: 28: Hoare triple {15712#true} ~cond := #in~cond; {15712#true} is VALID [2022-04-08 12:37:08,832 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-08 12:37:08,833 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-08 12:37:08,833 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-08 12:37:08,833 INFO L290 TraceCheckUtils]: 24: Hoare triple {16100#(< ~counter~0 15)} assume !!(0 != ~r~0); {16100#(< ~counter~0 15)} is VALID [2022-04-08 12:37:08,834 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {15712#true} {16100#(< ~counter~0 15)} #94#return; {16100#(< ~counter~0 15)} is VALID [2022-04-08 12:37:08,834 INFO L290 TraceCheckUtils]: 22: Hoare triple {15712#true} assume true; {15712#true} is VALID [2022-04-08 12:37:08,834 INFO L290 TraceCheckUtils]: 21: Hoare triple {15712#true} assume !(0 == ~cond); {15712#true} is VALID [2022-04-08 12:37:08,834 INFO L290 TraceCheckUtils]: 20: Hoare triple {15712#true} ~cond := #in~cond; {15712#true} is VALID [2022-04-08 12:37:08,834 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-08 12:37:08,834 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-08 12:37:08,835 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-08 12:37:08,835 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-08 12:37:08,835 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {15712#true} {16125#(< ~counter~0 14)} #92#return; {16125#(< ~counter~0 14)} is VALID [2022-04-08 12:37:08,836 INFO L290 TraceCheckUtils]: 14: Hoare triple {15712#true} assume true; {15712#true} is VALID [2022-04-08 12:37:08,836 INFO L290 TraceCheckUtils]: 13: Hoare triple {15712#true} assume !(0 == ~cond); {15712#true} is VALID [2022-04-08 12:37:08,836 INFO L290 TraceCheckUtils]: 12: Hoare triple {15712#true} ~cond := #in~cond; {15712#true} is VALID [2022-04-08 12:37:08,836 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-08 12:37:08,836 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15712#true} {16125#(< ~counter~0 14)} #90#return; {16125#(< ~counter~0 14)} is VALID [2022-04-08 12:37:08,836 INFO L290 TraceCheckUtils]: 9: Hoare triple {15712#true} assume true; {15712#true} is VALID [2022-04-08 12:37:08,836 INFO L290 TraceCheckUtils]: 8: Hoare triple {15712#true} assume !(0 == ~cond); {15712#true} is VALID [2022-04-08 12:37:08,836 INFO L290 TraceCheckUtils]: 7: Hoare triple {15712#true} ~cond := #in~cond; {15712#true} is VALID [2022-04-08 12:37:08,836 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-08 12:37:08,839 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-08 12:37:08,839 INFO L272 TraceCheckUtils]: 4: Hoare triple {16125#(< ~counter~0 14)} call #t~ret9 := main(); {16125#(< ~counter~0 14)} is VALID [2022-04-08 12:37:08,840 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16125#(< ~counter~0 14)} {15712#true} #102#return; {16125#(< ~counter~0 14)} is VALID [2022-04-08 12:37:08,840 INFO L290 TraceCheckUtils]: 2: Hoare triple {16125#(< ~counter~0 14)} assume true; {16125#(< ~counter~0 14)} is VALID [2022-04-08 12:37:08,840 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-08 12:37:08,840 INFO L272 TraceCheckUtils]: 0: Hoare triple {15712#true} call ULTIMATE.init(); {15712#true} is VALID [2022-04-08 12:37:08,841 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-08 12:37:08,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:37:08,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026827275] [2022-04-08 12:37:08,841 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:37:08,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139275500] [2022-04-08 12:37:08,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2139275500] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:37:08,841 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:37:08,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-08 12:37:08,841 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:37:08,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [849871918] [2022-04-08 12:37:08,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [849871918] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:37:08,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:37:08,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 12:37:08,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371578901] [2022-04-08 12:37:08,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:37:08,842 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-08 12:37:08,842 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:37:08,842 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-08 12:37:08,897 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-08 12:37:08,897 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 12:37:08,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:37:08,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 12:37:08,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-08 12:37:08,898 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-08 12:37:09,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:37:09,370 INFO L93 Difference]: Finished difference Result 195 states and 255 transitions. [2022-04-08 12:37:09,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 12:37:09,370 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-08 12:37:09,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:37:09,370 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-08 12:37:09,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 157 transitions. [2022-04-08 12:37:09,372 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-08 12:37:09,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 157 transitions. [2022-04-08 12:37:09,373 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 157 transitions. [2022-04-08 12:37:09,627 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-08 12:37:09,629 INFO L225 Difference]: With dead ends: 195 [2022-04-08 12:37:09,629 INFO L226 Difference]: Without dead ends: 146 [2022-04-08 12:37:09,629 INFO L912 BasicCegarLoop]: 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-08 12:37:09,629 INFO L913 BasicCegarLoop]: 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-08 12:37:09,630 INFO L914 BasicCegarLoop]: 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-08 12:37:09,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-04-08 12:37:09,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2022-04-08 12:37:09,774 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:37:09,774 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-08 12:37:09,774 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-08 12:37:09,775 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-08 12:37:09,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:37:09,777 INFO L93 Difference]: Finished difference Result 146 states and 183 transitions. [2022-04-08 12:37:09,778 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 183 transitions. [2022-04-08 12:37:09,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:37:09,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:37:09,788 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-08 12:37:09,788 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-08 12:37:09,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:37:09,790 INFO L93 Difference]: Finished difference Result 146 states and 183 transitions. [2022-04-08 12:37:09,790 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 183 transitions. [2022-04-08 12:37:09,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:37:09,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:37:09,791 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:37:09,791 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:37:09,791 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-08 12:37:09,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 183 transitions. [2022-04-08 12:37:09,793 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 183 transitions. Word has length 75 [2022-04-08 12:37:09,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:37:09,793 INFO L478 AbstractCegarLoop]: Abstraction has 146 states and 183 transitions. [2022-04-08 12:37:09,793 INFO L479 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-08 12:37:09,793 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 146 states and 183 transitions. [2022-04-08 12:37:10,506 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 183 edges. 183 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:37:10,506 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 183 transitions. [2022-04-08 12:37:10,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-08 12:37:10,507 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:37:10,507 INFO L499 BasicCegarLoop]: 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-08 12:37:10,526 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-08 12:37:10,707 WARN L460 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-08 12:37:10,707 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:37:10,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:37:10,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1970775776, now seen corresponding path program 7 times [2022-04-08 12:37:10,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:37:10,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1028251205] [2022-04-08 12:37:10,708 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:37:10,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1970775776, now seen corresponding path program 8 times [2022-04-08 12:37:10,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:37:10,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060123946] [2022-04-08 12:37:10,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:37:10,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:37:10,717 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:37:10,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [593817376] [2022-04-08 12:37:10,717 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:37:10,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:37:10,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:37:10,718 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-08 12:37:10,730 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-08 12:37:10,776 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:37:10,777 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:37:10,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-08 12:37:10,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:37:10,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:37:11,131 INFO L272 TraceCheckUtils]: 0: Hoare triple {17163#true} call ULTIMATE.init(); {17163#true} is VALID [2022-04-08 12:37:11,132 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-08 12:37:11,132 INFO L290 TraceCheckUtils]: 2: Hoare triple {17171#(<= ~counter~0 0)} assume true; {17171#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:11,132 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17171#(<= ~counter~0 0)} {17163#true} #102#return; {17171#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:11,133 INFO L272 TraceCheckUtils]: 4: Hoare triple {17171#(<= ~counter~0 0)} call #t~ret9 := main(); {17171#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:11,133 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-08 12:37:11,133 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-08 12:37:11,133 INFO L290 TraceCheckUtils]: 7: Hoare triple {17171#(<= ~counter~0 0)} ~cond := #in~cond; {17171#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:11,134 INFO L290 TraceCheckUtils]: 8: Hoare triple {17171#(<= ~counter~0 0)} assume !(0 == ~cond); {17171#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:11,134 INFO L290 TraceCheckUtils]: 9: Hoare triple {17171#(<= ~counter~0 0)} assume true; {17171#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:11,134 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17171#(<= ~counter~0 0)} {17171#(<= ~counter~0 0)} #90#return; {17171#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:11,135 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-08 12:37:11,135 INFO L290 TraceCheckUtils]: 12: Hoare triple {17171#(<= ~counter~0 0)} ~cond := #in~cond; {17171#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:11,135 INFO L290 TraceCheckUtils]: 13: Hoare triple {17171#(<= ~counter~0 0)} assume !(0 == ~cond); {17171#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:11,136 INFO L290 TraceCheckUtils]: 14: Hoare triple {17171#(<= ~counter~0 0)} assume true; {17171#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:11,136 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {17171#(<= ~counter~0 0)} {17171#(<= ~counter~0 0)} #92#return; {17171#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:11,136 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-08 12:37:11,137 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-08 12:37:11,137 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-08 12:37:11,138 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-08 12:37:11,138 INFO L290 TraceCheckUtils]: 20: Hoare triple {17220#(<= ~counter~0 1)} ~cond := #in~cond; {17220#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:11,138 INFO L290 TraceCheckUtils]: 21: Hoare triple {17220#(<= ~counter~0 1)} assume !(0 == ~cond); {17220#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:11,138 INFO L290 TraceCheckUtils]: 22: Hoare triple {17220#(<= ~counter~0 1)} assume true; {17220#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:11,139 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {17220#(<= ~counter~0 1)} {17220#(<= ~counter~0 1)} #94#return; {17220#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:11,139 INFO L290 TraceCheckUtils]: 24: Hoare triple {17220#(<= ~counter~0 1)} assume !!(0 != ~r~0); {17220#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:11,140 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-08 12:37:11,140 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-08 12:37:11,140 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-08 12:37:11,141 INFO L290 TraceCheckUtils]: 28: Hoare triple {17245#(<= ~counter~0 2)} ~cond := #in~cond; {17245#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:11,141 INFO L290 TraceCheckUtils]: 29: Hoare triple {17245#(<= ~counter~0 2)} assume !(0 == ~cond); {17245#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:11,141 INFO L290 TraceCheckUtils]: 30: Hoare triple {17245#(<= ~counter~0 2)} assume true; {17245#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:11,142 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {17245#(<= ~counter~0 2)} {17245#(<= ~counter~0 2)} #96#return; {17245#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:11,142 INFO L290 TraceCheckUtils]: 32: Hoare triple {17245#(<= ~counter~0 2)} assume !(~r~0 > 0); {17245#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:11,142 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-08 12:37:11,143 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-08 12:37:11,143 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-08 12:37:11,143 INFO L290 TraceCheckUtils]: 36: Hoare triple {17270#(<= ~counter~0 3)} ~cond := #in~cond; {17270#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:11,144 INFO L290 TraceCheckUtils]: 37: Hoare triple {17270#(<= ~counter~0 3)} assume !(0 == ~cond); {17270#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:11,144 INFO L290 TraceCheckUtils]: 38: Hoare triple {17270#(<= ~counter~0 3)} assume true; {17270#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:11,144 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {17270#(<= ~counter~0 3)} {17270#(<= ~counter~0 3)} #98#return; {17270#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:11,145 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-08 12:37:11,145 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-08 12:37:11,145 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-08 12:37:11,146 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-08 12:37:11,146 INFO L290 TraceCheckUtils]: 44: Hoare triple {17295#(<= ~counter~0 4)} ~cond := #in~cond; {17295#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:11,146 INFO L290 TraceCheckUtils]: 45: Hoare triple {17295#(<= ~counter~0 4)} assume !(0 == ~cond); {17295#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:11,147 INFO L290 TraceCheckUtils]: 46: Hoare triple {17295#(<= ~counter~0 4)} assume true; {17295#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:11,147 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {17295#(<= ~counter~0 4)} {17295#(<= ~counter~0 4)} #98#return; {17295#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:11,147 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-08 12:37:11,148 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-08 12:37:11,148 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-08 12:37:11,149 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-08 12:37:11,149 INFO L290 TraceCheckUtils]: 52: Hoare triple {17320#(<= ~counter~0 5)} ~cond := #in~cond; {17320#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:11,149 INFO L290 TraceCheckUtils]: 53: Hoare triple {17320#(<= ~counter~0 5)} assume !(0 == ~cond); {17320#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:11,149 INFO L290 TraceCheckUtils]: 54: Hoare triple {17320#(<= ~counter~0 5)} assume true; {17320#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:11,150 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {17320#(<= ~counter~0 5)} {17320#(<= ~counter~0 5)} #98#return; {17320#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:11,150 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-08 12:37:11,150 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-08 12:37:11,151 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-08 12:37:11,151 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-08 12:37:11,151 INFO L290 TraceCheckUtils]: 60: Hoare triple {17345#(<= ~counter~0 6)} ~cond := #in~cond; {17345#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:11,152 INFO L290 TraceCheckUtils]: 61: Hoare triple {17345#(<= ~counter~0 6)} assume !(0 == ~cond); {17345#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:11,152 INFO L290 TraceCheckUtils]: 62: Hoare triple {17345#(<= ~counter~0 6)} assume true; {17345#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:11,152 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {17345#(<= ~counter~0 6)} {17345#(<= ~counter~0 6)} #98#return; {17345#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:11,153 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-08 12:37:11,153 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-08 12:37:11,153 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-08 12:37:11,154 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-08 12:37:11,154 INFO L290 TraceCheckUtils]: 68: Hoare triple {17370#(<= ~counter~0 7)} ~cond := #in~cond; {17370#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:11,154 INFO L290 TraceCheckUtils]: 69: Hoare triple {17370#(<= ~counter~0 7)} assume !(0 == ~cond); {17370#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:11,155 INFO L290 TraceCheckUtils]: 70: Hoare triple {17370#(<= ~counter~0 7)} assume true; {17370#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:11,155 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {17370#(<= ~counter~0 7)} {17370#(<= ~counter~0 7)} #98#return; {17370#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:11,155 INFO L290 TraceCheckUtils]: 72: Hoare triple {17370#(<= ~counter~0 7)} assume !(~r~0 < 0); {17370#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:11,156 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-08 12:37:11,156 INFO L290 TraceCheckUtils]: 74: Hoare triple {17395#(<= |main_#t~post6| 7)} assume !(#t~post6 < 20);havoc #t~post6; {17164#false} is VALID [2022-04-08 12:37:11,156 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-08 12:37:11,156 INFO L290 TraceCheckUtils]: 76: Hoare triple {17164#false} ~cond := #in~cond; {17164#false} is VALID [2022-04-08 12:37:11,156 INFO L290 TraceCheckUtils]: 77: Hoare triple {17164#false} assume 0 == ~cond; {17164#false} is VALID [2022-04-08 12:37:11,156 INFO L290 TraceCheckUtils]: 78: Hoare triple {17164#false} assume !false; {17164#false} is VALID [2022-04-08 12:37:11,157 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-08 12:37:11,157 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:37:11,569 INFO L290 TraceCheckUtils]: 78: Hoare triple {17164#false} assume !false; {17164#false} is VALID [2022-04-08 12:37:11,569 INFO L290 TraceCheckUtils]: 77: Hoare triple {17164#false} assume 0 == ~cond; {17164#false} is VALID [2022-04-08 12:37:11,569 INFO L290 TraceCheckUtils]: 76: Hoare triple {17164#false} ~cond := #in~cond; {17164#false} is VALID [2022-04-08 12:37:11,569 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-08 12:37:11,569 INFO L290 TraceCheckUtils]: 74: Hoare triple {17423#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {17164#false} is VALID [2022-04-08 12:37:11,570 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-08 12:37:11,570 INFO L290 TraceCheckUtils]: 72: Hoare triple {17427#(< ~counter~0 20)} assume !(~r~0 < 0); {17427#(< ~counter~0 20)} is VALID [2022-04-08 12:37:11,571 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {17163#true} {17427#(< ~counter~0 20)} #98#return; {17427#(< ~counter~0 20)} is VALID [2022-04-08 12:37:11,571 INFO L290 TraceCheckUtils]: 70: Hoare triple {17163#true} assume true; {17163#true} is VALID [2022-04-08 12:37:11,571 INFO L290 TraceCheckUtils]: 69: Hoare triple {17163#true} assume !(0 == ~cond); {17163#true} is VALID [2022-04-08 12:37:11,571 INFO L290 TraceCheckUtils]: 68: Hoare triple {17163#true} ~cond := #in~cond; {17163#true} is VALID [2022-04-08 12:37:11,571 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-08 12:37:11,571 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-08 12:37:11,572 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-08 12:37:11,572 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-08 12:37:11,573 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {17163#true} {17452#(< ~counter~0 19)} #98#return; {17452#(< ~counter~0 19)} is VALID [2022-04-08 12:37:11,573 INFO L290 TraceCheckUtils]: 62: Hoare triple {17163#true} assume true; {17163#true} is VALID [2022-04-08 12:37:11,573 INFO L290 TraceCheckUtils]: 61: Hoare triple {17163#true} assume !(0 == ~cond); {17163#true} is VALID [2022-04-08 12:37:11,573 INFO L290 TraceCheckUtils]: 60: Hoare triple {17163#true} ~cond := #in~cond; {17163#true} is VALID [2022-04-08 12:37:11,573 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-08 12:37:11,573 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-08 12:37:11,574 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-08 12:37:11,574 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-08 12:37:11,574 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {17163#true} {17477#(< ~counter~0 18)} #98#return; {17477#(< ~counter~0 18)} is VALID [2022-04-08 12:37:11,574 INFO L290 TraceCheckUtils]: 54: Hoare triple {17163#true} assume true; {17163#true} is VALID [2022-04-08 12:37:11,574 INFO L290 TraceCheckUtils]: 53: Hoare triple {17163#true} assume !(0 == ~cond); {17163#true} is VALID [2022-04-08 12:37:11,575 INFO L290 TraceCheckUtils]: 52: Hoare triple {17163#true} ~cond := #in~cond; {17163#true} is VALID [2022-04-08 12:37:11,575 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-08 12:37:11,575 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-08 12:37:11,575 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-08 12:37:11,576 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-08 12:37:11,576 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {17163#true} {17502#(< ~counter~0 17)} #98#return; {17502#(< ~counter~0 17)} is VALID [2022-04-08 12:37:11,576 INFO L290 TraceCheckUtils]: 46: Hoare triple {17163#true} assume true; {17163#true} is VALID [2022-04-08 12:37:11,576 INFO L290 TraceCheckUtils]: 45: Hoare triple {17163#true} assume !(0 == ~cond); {17163#true} is VALID [2022-04-08 12:37:11,576 INFO L290 TraceCheckUtils]: 44: Hoare triple {17163#true} ~cond := #in~cond; {17163#true} is VALID [2022-04-08 12:37:11,576 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-08 12:37:11,577 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-08 12:37:11,577 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-08 12:37:11,584 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-08 12:37:11,585 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {17163#true} {17527#(< ~counter~0 16)} #98#return; {17527#(< ~counter~0 16)} is VALID [2022-04-08 12:37:11,585 INFO L290 TraceCheckUtils]: 38: Hoare triple {17163#true} assume true; {17163#true} is VALID [2022-04-08 12:37:11,585 INFO L290 TraceCheckUtils]: 37: Hoare triple {17163#true} assume !(0 == ~cond); {17163#true} is VALID [2022-04-08 12:37:11,585 INFO L290 TraceCheckUtils]: 36: Hoare triple {17163#true} ~cond := #in~cond; {17163#true} is VALID [2022-04-08 12:37:11,585 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-08 12:37:11,585 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-08 12:37:11,586 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-08 12:37:11,586 INFO L290 TraceCheckUtils]: 32: Hoare triple {17552#(< ~counter~0 15)} assume !(~r~0 > 0); {17552#(< ~counter~0 15)} is VALID [2022-04-08 12:37:11,587 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {17163#true} {17552#(< ~counter~0 15)} #96#return; {17552#(< ~counter~0 15)} is VALID [2022-04-08 12:37:11,587 INFO L290 TraceCheckUtils]: 30: Hoare triple {17163#true} assume true; {17163#true} is VALID [2022-04-08 12:37:11,587 INFO L290 TraceCheckUtils]: 29: Hoare triple {17163#true} assume !(0 == ~cond); {17163#true} is VALID [2022-04-08 12:37:11,587 INFO L290 TraceCheckUtils]: 28: Hoare triple {17163#true} ~cond := #in~cond; {17163#true} is VALID [2022-04-08 12:37:11,587 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-08 12:37:11,587 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-08 12:37:11,588 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-08 12:37:11,588 INFO L290 TraceCheckUtils]: 24: Hoare triple {17577#(< ~counter~0 14)} assume !!(0 != ~r~0); {17577#(< ~counter~0 14)} is VALID [2022-04-08 12:37:11,588 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {17163#true} {17577#(< ~counter~0 14)} #94#return; {17577#(< ~counter~0 14)} is VALID [2022-04-08 12:37:11,589 INFO L290 TraceCheckUtils]: 22: Hoare triple {17163#true} assume true; {17163#true} is VALID [2022-04-08 12:37:11,589 INFO L290 TraceCheckUtils]: 21: Hoare triple {17163#true} assume !(0 == ~cond); {17163#true} is VALID [2022-04-08 12:37:11,589 INFO L290 TraceCheckUtils]: 20: Hoare triple {17163#true} ~cond := #in~cond; {17163#true} is VALID [2022-04-08 12:37:11,589 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-08 12:37:11,589 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-08 12:37:11,589 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-08 12:37:11,590 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-08 12:37:11,590 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {17163#true} {17602#(< ~counter~0 13)} #92#return; {17602#(< ~counter~0 13)} is VALID [2022-04-08 12:37:11,590 INFO L290 TraceCheckUtils]: 14: Hoare triple {17163#true} assume true; {17163#true} is VALID [2022-04-08 12:37:11,590 INFO L290 TraceCheckUtils]: 13: Hoare triple {17163#true} assume !(0 == ~cond); {17163#true} is VALID [2022-04-08 12:37:11,590 INFO L290 TraceCheckUtils]: 12: Hoare triple {17163#true} ~cond := #in~cond; {17163#true} is VALID [2022-04-08 12:37:11,590 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-08 12:37:11,591 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17163#true} {17602#(< ~counter~0 13)} #90#return; {17602#(< ~counter~0 13)} is VALID [2022-04-08 12:37:11,591 INFO L290 TraceCheckUtils]: 9: Hoare triple {17163#true} assume true; {17163#true} is VALID [2022-04-08 12:37:11,591 INFO L290 TraceCheckUtils]: 8: Hoare triple {17163#true} assume !(0 == ~cond); {17163#true} is VALID [2022-04-08 12:37:11,591 INFO L290 TraceCheckUtils]: 7: Hoare triple {17163#true} ~cond := #in~cond; {17163#true} is VALID [2022-04-08 12:37:11,591 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-08 12:37:11,591 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-08 12:37:11,592 INFO L272 TraceCheckUtils]: 4: Hoare triple {17602#(< ~counter~0 13)} call #t~ret9 := main(); {17602#(< ~counter~0 13)} is VALID [2022-04-08 12:37:11,592 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17602#(< ~counter~0 13)} {17163#true} #102#return; {17602#(< ~counter~0 13)} is VALID [2022-04-08 12:37:11,592 INFO L290 TraceCheckUtils]: 2: Hoare triple {17602#(< ~counter~0 13)} assume true; {17602#(< ~counter~0 13)} is VALID [2022-04-08 12:37:11,593 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-08 12:37:11,593 INFO L272 TraceCheckUtils]: 0: Hoare triple {17163#true} call ULTIMATE.init(); {17163#true} is VALID [2022-04-08 12:37:11,593 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-08 12:37:11,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:37:11,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060123946] [2022-04-08 12:37:11,593 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:37:11,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593817376] [2022-04-08 12:37:11,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593817376] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:37:11,593 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:37:11,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-04-08 12:37:11,594 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:37:11,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1028251205] [2022-04-08 12:37:11,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1028251205] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:37:11,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:37:11,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 12:37:11,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486097264] [2022-04-08 12:37:11,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:37:11,594 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-08 12:37:11,594 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:37:11,595 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-08 12:37:11,652 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-08 12:37:11,652 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 12:37:11,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:37:11,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 12:37:11,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2022-04-08 12:37:11,653 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-08 12:37:12,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:37:12,253 INFO L93 Difference]: Finished difference Result 168 states and 210 transitions. [2022-04-08 12:37:12,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 12:37:12,253 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-08 12:37:12,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:37:12,254 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-08 12:37:12,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 155 transitions. [2022-04-08 12:37:12,255 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-08 12:37:12,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 155 transitions. [2022-04-08 12:37:12,257 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 155 transitions. [2022-04-08 12:37:12,368 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-08 12:37:12,371 INFO L225 Difference]: With dead ends: 168 [2022-04-08 12:37:12,371 INFO L226 Difference]: Without dead ends: 163 [2022-04-08 12:37:12,371 INFO L912 BasicCegarLoop]: 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-08 12:37:12,371 INFO L913 BasicCegarLoop]: 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-08 12:37:12,372 INFO L914 BasicCegarLoop]: 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-08 12:37:12,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-04-08 12:37:12,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 157. [2022-04-08 12:37:12,535 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:37:12,535 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-08 12:37:12,535 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-08 12:37:12,535 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-08 12:37:12,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:37:12,537 INFO L93 Difference]: Finished difference Result 163 states and 205 transitions. [2022-04-08 12:37:12,538 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 205 transitions. [2022-04-08 12:37:12,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:37:12,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:37:12,538 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-08 12:37:12,538 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-08 12:37:12,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:37:12,540 INFO L93 Difference]: Finished difference Result 163 states and 205 transitions. [2022-04-08 12:37:12,540 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 205 transitions. [2022-04-08 12:37:12,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:37:12,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:37:12,541 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:37:12,541 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:37:12,541 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-08 12:37:12,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 198 transitions. [2022-04-08 12:37:12,543 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 198 transitions. Word has length 79 [2022-04-08 12:37:12,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:37:12,543 INFO L478 AbstractCegarLoop]: Abstraction has 157 states and 198 transitions. [2022-04-08 12:37:12,544 INFO L479 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-08 12:37:12,544 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 157 states and 198 transitions. [2022-04-08 12:37:13,540 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-08 12:37:13,541 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 198 transitions. [2022-04-08 12:37:13,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-04-08 12:37:13,555 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:37:13,555 INFO L499 BasicCegarLoop]: 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-08 12:37:13,572 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-08 12:37:13,756 WARN L460 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-08 12:37:13,756 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:37:13,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:37:13,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1693648491, now seen corresponding path program 1 times [2022-04-08 12:37:13,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:37:13,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1147640147] [2022-04-08 12:37:13,757 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:37:13,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1693648491, now seen corresponding path program 2 times [2022-04-08 12:37:13,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:37:13,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298976262] [2022-04-08 12:37:13,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:37:13,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:37:13,766 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:37:13,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1050757587] [2022-04-08 12:37:13,766 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:37:13,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:37:13,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:37:13,767 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-08 12:37:13,768 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-08 12:37:13,810 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:37:13,810 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:37:13,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-08 12:37:13,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:37:13,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:37:14,172 INFO L272 TraceCheckUtils]: 0: Hoare triple {18640#true} call ULTIMATE.init(); {18640#true} is VALID [2022-04-08 12:37:14,172 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-08 12:37:14,173 INFO L290 TraceCheckUtils]: 2: Hoare triple {18648#(<= ~counter~0 0)} assume true; {18648#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:14,173 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18648#(<= ~counter~0 0)} {18640#true} #102#return; {18648#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:14,173 INFO L272 TraceCheckUtils]: 4: Hoare triple {18648#(<= ~counter~0 0)} call #t~ret9 := main(); {18648#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:14,174 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-08 12:37:14,174 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-08 12:37:14,174 INFO L290 TraceCheckUtils]: 7: Hoare triple {18648#(<= ~counter~0 0)} ~cond := #in~cond; {18648#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:14,175 INFO L290 TraceCheckUtils]: 8: Hoare triple {18648#(<= ~counter~0 0)} assume !(0 == ~cond); {18648#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:14,175 INFO L290 TraceCheckUtils]: 9: Hoare triple {18648#(<= ~counter~0 0)} assume true; {18648#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:14,175 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18648#(<= ~counter~0 0)} {18648#(<= ~counter~0 0)} #90#return; {18648#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:14,176 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-08 12:37:14,176 INFO L290 TraceCheckUtils]: 12: Hoare triple {18648#(<= ~counter~0 0)} ~cond := #in~cond; {18648#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:14,176 INFO L290 TraceCheckUtils]: 13: Hoare triple {18648#(<= ~counter~0 0)} assume !(0 == ~cond); {18648#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:14,176 INFO L290 TraceCheckUtils]: 14: Hoare triple {18648#(<= ~counter~0 0)} assume true; {18648#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:14,177 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {18648#(<= ~counter~0 0)} {18648#(<= ~counter~0 0)} #92#return; {18648#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:14,177 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-08 12:37:14,178 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-08 12:37:14,178 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-08 12:37:14,178 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-08 12:37:14,179 INFO L290 TraceCheckUtils]: 20: Hoare triple {18697#(<= ~counter~0 1)} ~cond := #in~cond; {18697#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:14,179 INFO L290 TraceCheckUtils]: 21: Hoare triple {18697#(<= ~counter~0 1)} assume !(0 == ~cond); {18697#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:14,179 INFO L290 TraceCheckUtils]: 22: Hoare triple {18697#(<= ~counter~0 1)} assume true; {18697#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:14,180 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {18697#(<= ~counter~0 1)} {18697#(<= ~counter~0 1)} #94#return; {18697#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:14,180 INFO L290 TraceCheckUtils]: 24: Hoare triple {18697#(<= ~counter~0 1)} assume !!(0 != ~r~0); {18697#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:14,180 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-08 12:37:14,181 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-08 12:37:14,181 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-08 12:37:14,181 INFO L290 TraceCheckUtils]: 28: Hoare triple {18722#(<= ~counter~0 2)} ~cond := #in~cond; {18722#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:14,182 INFO L290 TraceCheckUtils]: 29: Hoare triple {18722#(<= ~counter~0 2)} assume !(0 == ~cond); {18722#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:14,182 INFO L290 TraceCheckUtils]: 30: Hoare triple {18722#(<= ~counter~0 2)} assume true; {18722#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:14,182 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {18722#(<= ~counter~0 2)} {18722#(<= ~counter~0 2)} #96#return; {18722#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:14,183 INFO L290 TraceCheckUtils]: 32: Hoare triple {18722#(<= ~counter~0 2)} assume !(~r~0 > 0); {18722#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:14,183 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-08 12:37:14,183 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-08 12:37:14,184 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-08 12:37:14,184 INFO L290 TraceCheckUtils]: 36: Hoare triple {18747#(<= ~counter~0 3)} ~cond := #in~cond; {18747#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:14,184 INFO L290 TraceCheckUtils]: 37: Hoare triple {18747#(<= ~counter~0 3)} assume !(0 == ~cond); {18747#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:14,185 INFO L290 TraceCheckUtils]: 38: Hoare triple {18747#(<= ~counter~0 3)} assume true; {18747#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:14,185 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {18747#(<= ~counter~0 3)} {18747#(<= ~counter~0 3)} #98#return; {18747#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:14,185 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-08 12:37:14,186 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-08 12:37:14,186 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-08 12:37:14,187 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-08 12:37:14,187 INFO L290 TraceCheckUtils]: 44: Hoare triple {18772#(<= ~counter~0 4)} ~cond := #in~cond; {18772#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:14,187 INFO L290 TraceCheckUtils]: 45: Hoare triple {18772#(<= ~counter~0 4)} assume !(0 == ~cond); {18772#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:14,187 INFO L290 TraceCheckUtils]: 46: Hoare triple {18772#(<= ~counter~0 4)} assume true; {18772#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:14,188 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {18772#(<= ~counter~0 4)} {18772#(<= ~counter~0 4)} #98#return; {18772#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:14,188 INFO L290 TraceCheckUtils]: 48: Hoare triple {18772#(<= ~counter~0 4)} assume !(~r~0 < 0); {18772#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:14,189 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-08 12:37:14,189 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-08 12:37:14,189 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-08 12:37:14,190 INFO L290 TraceCheckUtils]: 52: Hoare triple {18797#(<= ~counter~0 5)} ~cond := #in~cond; {18797#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:14,190 INFO L290 TraceCheckUtils]: 53: Hoare triple {18797#(<= ~counter~0 5)} assume !(0 == ~cond); {18797#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:14,190 INFO L290 TraceCheckUtils]: 54: Hoare triple {18797#(<= ~counter~0 5)} assume true; {18797#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:14,191 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {18797#(<= ~counter~0 5)} {18797#(<= ~counter~0 5)} #94#return; {18797#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:14,191 INFO L290 TraceCheckUtils]: 56: Hoare triple {18797#(<= ~counter~0 5)} assume !!(0 != ~r~0); {18797#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:14,191 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-08 12:37:14,192 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-08 12:37:14,192 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-08 12:37:14,192 INFO L290 TraceCheckUtils]: 60: Hoare triple {18822#(<= ~counter~0 6)} ~cond := #in~cond; {18822#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:14,193 INFO L290 TraceCheckUtils]: 61: Hoare triple {18822#(<= ~counter~0 6)} assume !(0 == ~cond); {18822#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:14,193 INFO L290 TraceCheckUtils]: 62: Hoare triple {18822#(<= ~counter~0 6)} assume true; {18822#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:14,193 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {18822#(<= ~counter~0 6)} {18822#(<= ~counter~0 6)} #96#return; {18822#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:14,194 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-08 12:37:14,194 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-08 12:37:14,194 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-08 12:37:14,195 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-08 12:37:14,195 INFO L290 TraceCheckUtils]: 68: Hoare triple {18847#(<= ~counter~0 7)} ~cond := #in~cond; {18847#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:14,195 INFO L290 TraceCheckUtils]: 69: Hoare triple {18847#(<= ~counter~0 7)} assume !(0 == ~cond); {18847#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:14,196 INFO L290 TraceCheckUtils]: 70: Hoare triple {18847#(<= ~counter~0 7)} assume true; {18847#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:14,196 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {18847#(<= ~counter~0 7)} {18847#(<= ~counter~0 7)} #96#return; {18847#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:14,196 INFO L290 TraceCheckUtils]: 72: Hoare triple {18847#(<= ~counter~0 7)} assume !(~r~0 > 0); {18847#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:14,197 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-08 12:37:14,197 INFO L290 TraceCheckUtils]: 74: Hoare triple {18872#(<= |main_#t~post8| 7)} assume !(#t~post8 < 20);havoc #t~post8; {18641#false} is VALID [2022-04-08 12:37:14,197 INFO L290 TraceCheckUtils]: 75: Hoare triple {18641#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18641#false} is VALID [2022-04-08 12:37:14,197 INFO L290 TraceCheckUtils]: 76: Hoare triple {18641#false} assume !(#t~post6 < 20);havoc #t~post6; {18641#false} is VALID [2022-04-08 12:37:14,197 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-08 12:37:14,197 INFO L290 TraceCheckUtils]: 78: Hoare triple {18641#false} ~cond := #in~cond; {18641#false} is VALID [2022-04-08 12:37:14,197 INFO L290 TraceCheckUtils]: 79: Hoare triple {18641#false} assume 0 == ~cond; {18641#false} is VALID [2022-04-08 12:37:14,197 INFO L290 TraceCheckUtils]: 80: Hoare triple {18641#false} assume !false; {18641#false} is VALID [2022-04-08 12:37:14,198 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-08 12:37:14,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:37:14,605 INFO L290 TraceCheckUtils]: 80: Hoare triple {18641#false} assume !false; {18641#false} is VALID [2022-04-08 12:37:14,605 INFO L290 TraceCheckUtils]: 79: Hoare triple {18641#false} assume 0 == ~cond; {18641#false} is VALID [2022-04-08 12:37:14,605 INFO L290 TraceCheckUtils]: 78: Hoare triple {18641#false} ~cond := #in~cond; {18641#false} is VALID [2022-04-08 12:37:14,605 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-08 12:37:14,605 INFO L290 TraceCheckUtils]: 76: Hoare triple {18641#false} assume !(#t~post6 < 20);havoc #t~post6; {18641#false} is VALID [2022-04-08 12:37:14,606 INFO L290 TraceCheckUtils]: 75: Hoare triple {18641#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18641#false} is VALID [2022-04-08 12:37:14,606 INFO L290 TraceCheckUtils]: 74: Hoare triple {18912#(< |main_#t~post8| 20)} assume !(#t~post8 < 20);havoc #t~post8; {18641#false} is VALID [2022-04-08 12:37:14,606 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-08 12:37:14,606 INFO L290 TraceCheckUtils]: 72: Hoare triple {18916#(< ~counter~0 20)} assume !(~r~0 > 0); {18916#(< ~counter~0 20)} is VALID [2022-04-08 12:37:14,607 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {18640#true} {18916#(< ~counter~0 20)} #96#return; {18916#(< ~counter~0 20)} is VALID [2022-04-08 12:37:14,607 INFO L290 TraceCheckUtils]: 70: Hoare triple {18640#true} assume true; {18640#true} is VALID [2022-04-08 12:37:14,607 INFO L290 TraceCheckUtils]: 69: Hoare triple {18640#true} assume !(0 == ~cond); {18640#true} is VALID [2022-04-08 12:37:14,607 INFO L290 TraceCheckUtils]: 68: Hoare triple {18640#true} ~cond := #in~cond; {18640#true} is VALID [2022-04-08 12:37:14,607 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-08 12:37:14,607 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-08 12:37:14,608 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-08 12:37:14,608 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-08 12:37:14,609 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {18640#true} {18941#(< ~counter~0 19)} #96#return; {18941#(< ~counter~0 19)} is VALID [2022-04-08 12:37:14,609 INFO L290 TraceCheckUtils]: 62: Hoare triple {18640#true} assume true; {18640#true} is VALID [2022-04-08 12:37:14,609 INFO L290 TraceCheckUtils]: 61: Hoare triple {18640#true} assume !(0 == ~cond); {18640#true} is VALID [2022-04-08 12:37:14,609 INFO L290 TraceCheckUtils]: 60: Hoare triple {18640#true} ~cond := #in~cond; {18640#true} is VALID [2022-04-08 12:37:14,609 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-08 12:37:14,610 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-08 12:37:14,610 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-08 12:37:14,610 INFO L290 TraceCheckUtils]: 56: Hoare triple {18966#(< ~counter~0 18)} assume !!(0 != ~r~0); {18966#(< ~counter~0 18)} is VALID [2022-04-08 12:37:14,611 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {18640#true} {18966#(< ~counter~0 18)} #94#return; {18966#(< ~counter~0 18)} is VALID [2022-04-08 12:37:14,611 INFO L290 TraceCheckUtils]: 54: Hoare triple {18640#true} assume true; {18640#true} is VALID [2022-04-08 12:37:14,611 INFO L290 TraceCheckUtils]: 53: Hoare triple {18640#true} assume !(0 == ~cond); {18640#true} is VALID [2022-04-08 12:37:14,611 INFO L290 TraceCheckUtils]: 52: Hoare triple {18640#true} ~cond := #in~cond; {18640#true} is VALID [2022-04-08 12:37:14,611 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-08 12:37:14,611 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-08 12:37:14,612 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-08 12:37:14,612 INFO L290 TraceCheckUtils]: 48: Hoare triple {18991#(< ~counter~0 17)} assume !(~r~0 < 0); {18991#(< ~counter~0 17)} is VALID [2022-04-08 12:37:14,613 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {18640#true} {18991#(< ~counter~0 17)} #98#return; {18991#(< ~counter~0 17)} is VALID [2022-04-08 12:37:14,613 INFO L290 TraceCheckUtils]: 46: Hoare triple {18640#true} assume true; {18640#true} is VALID [2022-04-08 12:37:14,613 INFO L290 TraceCheckUtils]: 45: Hoare triple {18640#true} assume !(0 == ~cond); {18640#true} is VALID [2022-04-08 12:37:14,613 INFO L290 TraceCheckUtils]: 44: Hoare triple {18640#true} ~cond := #in~cond; {18640#true} is VALID [2022-04-08 12:37:14,613 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-08 12:37:14,613 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-08 12:37:14,614 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-08 12:37:14,614 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-08 12:37:14,615 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {18640#true} {19016#(< ~counter~0 16)} #98#return; {19016#(< ~counter~0 16)} is VALID [2022-04-08 12:37:14,615 INFO L290 TraceCheckUtils]: 38: Hoare triple {18640#true} assume true; {18640#true} is VALID [2022-04-08 12:37:14,615 INFO L290 TraceCheckUtils]: 37: Hoare triple {18640#true} assume !(0 == ~cond); {18640#true} is VALID [2022-04-08 12:37:14,615 INFO L290 TraceCheckUtils]: 36: Hoare triple {18640#true} ~cond := #in~cond; {18640#true} is VALID [2022-04-08 12:37:14,615 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-08 12:37:14,615 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-08 12:37:14,616 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-08 12:37:14,616 INFO L290 TraceCheckUtils]: 32: Hoare triple {19041#(< ~counter~0 15)} assume !(~r~0 > 0); {19041#(< ~counter~0 15)} is VALID [2022-04-08 12:37:14,616 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {18640#true} {19041#(< ~counter~0 15)} #96#return; {19041#(< ~counter~0 15)} is VALID [2022-04-08 12:37:14,616 INFO L290 TraceCheckUtils]: 30: Hoare triple {18640#true} assume true; {18640#true} is VALID [2022-04-08 12:37:14,617 INFO L290 TraceCheckUtils]: 29: Hoare triple {18640#true} assume !(0 == ~cond); {18640#true} is VALID [2022-04-08 12:37:14,617 INFO L290 TraceCheckUtils]: 28: Hoare triple {18640#true} ~cond := #in~cond; {18640#true} is VALID [2022-04-08 12:37:14,617 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-08 12:37:14,617 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-08 12:37:14,617 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-08 12:37:14,618 INFO L290 TraceCheckUtils]: 24: Hoare triple {19066#(< ~counter~0 14)} assume !!(0 != ~r~0); {19066#(< ~counter~0 14)} is VALID [2022-04-08 12:37:14,618 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {18640#true} {19066#(< ~counter~0 14)} #94#return; {19066#(< ~counter~0 14)} is VALID [2022-04-08 12:37:14,618 INFO L290 TraceCheckUtils]: 22: Hoare triple {18640#true} assume true; {18640#true} is VALID [2022-04-08 12:37:14,618 INFO L290 TraceCheckUtils]: 21: Hoare triple {18640#true} assume !(0 == ~cond); {18640#true} is VALID [2022-04-08 12:37:14,618 INFO L290 TraceCheckUtils]: 20: Hoare triple {18640#true} ~cond := #in~cond; {18640#true} is VALID [2022-04-08 12:37:14,618 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-08 12:37:14,619 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-08 12:37:14,619 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-08 12:37:14,619 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-08 12:37:14,620 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {18640#true} {19091#(< ~counter~0 13)} #92#return; {19091#(< ~counter~0 13)} is VALID [2022-04-08 12:37:14,620 INFO L290 TraceCheckUtils]: 14: Hoare triple {18640#true} assume true; {18640#true} is VALID [2022-04-08 12:37:14,620 INFO L290 TraceCheckUtils]: 13: Hoare triple {18640#true} assume !(0 == ~cond); {18640#true} is VALID [2022-04-08 12:37:14,620 INFO L290 TraceCheckUtils]: 12: Hoare triple {18640#true} ~cond := #in~cond; {18640#true} is VALID [2022-04-08 12:37:14,620 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-08 12:37:14,621 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18640#true} {19091#(< ~counter~0 13)} #90#return; {19091#(< ~counter~0 13)} is VALID [2022-04-08 12:37:14,621 INFO L290 TraceCheckUtils]: 9: Hoare triple {18640#true} assume true; {18640#true} is VALID [2022-04-08 12:37:14,621 INFO L290 TraceCheckUtils]: 8: Hoare triple {18640#true} assume !(0 == ~cond); {18640#true} is VALID [2022-04-08 12:37:14,621 INFO L290 TraceCheckUtils]: 7: Hoare triple {18640#true} ~cond := #in~cond; {18640#true} is VALID [2022-04-08 12:37:14,621 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-08 12:37:14,621 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-08 12:37:14,621 INFO L272 TraceCheckUtils]: 4: Hoare triple {19091#(< ~counter~0 13)} call #t~ret9 := main(); {19091#(< ~counter~0 13)} is VALID [2022-04-08 12:37:14,622 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19091#(< ~counter~0 13)} {18640#true} #102#return; {19091#(< ~counter~0 13)} is VALID [2022-04-08 12:37:14,622 INFO L290 TraceCheckUtils]: 2: Hoare triple {19091#(< ~counter~0 13)} assume true; {19091#(< ~counter~0 13)} is VALID [2022-04-08 12:37:14,622 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-08 12:37:14,622 INFO L272 TraceCheckUtils]: 0: Hoare triple {18640#true} call ULTIMATE.init(); {18640#true} is VALID [2022-04-08 12:37:14,623 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-08 12:37:14,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:37:14,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298976262] [2022-04-08 12:37:14,623 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:37:14,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050757587] [2022-04-08 12:37:14,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1050757587] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:37:14,623 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:37:14,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-04-08 12:37:14,623 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:37:14,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1147640147] [2022-04-08 12:37:14,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1147640147] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:37:14,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:37:14,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 12:37:14,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387947341] [2022-04-08 12:37:14,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:37:14,624 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-08 12:37:14,624 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:37:14,624 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-08 12:37:14,678 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-08 12:37:14,678 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 12:37:14,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:37:14,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 12:37:14,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2022-04-08 12:37:14,679 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-08 12:37:15,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:37:15,200 INFO L93 Difference]: Finished difference Result 213 states and 277 transitions. [2022-04-08 12:37:15,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 12:37:15,200 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-08 12:37:15,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:37:15,201 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-08 12:37:15,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 177 transitions. [2022-04-08 12:37:15,202 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-08 12:37:15,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 177 transitions. [2022-04-08 12:37:15,203 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 177 transitions. [2022-04-08 12:37:15,318 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-08 12:37:15,323 INFO L225 Difference]: With dead ends: 213 [2022-04-08 12:37:15,324 INFO L226 Difference]: Without dead ends: 164 [2022-04-08 12:37:15,324 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=243, Invalid=357, Unknown=0, NotChecked=0, Total=600 [2022-04-08 12:37:15,325 INFO L913 BasicCegarLoop]: 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-08 12:37:15,325 INFO L914 BasicCegarLoop]: 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-08 12:37:15,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-04-08 12:37:15,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 160. [2022-04-08 12:37:15,481 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:37:15,481 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-08 12:37:15,482 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-08 12:37:15,482 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-08 12:37:15,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:37:15,484 INFO L93 Difference]: Finished difference Result 164 states and 206 transitions. [2022-04-08 12:37:15,484 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 206 transitions. [2022-04-08 12:37:15,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:37:15,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:37:15,485 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-08 12:37:15,485 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-08 12:37:15,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:37:15,487 INFO L93 Difference]: Finished difference Result 164 states and 206 transitions. [2022-04-08 12:37:15,487 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 206 transitions. [2022-04-08 12:37:15,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:37:15,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:37:15,487 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:37:15,487 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:37:15,487 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-08 12:37:15,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 202 transitions. [2022-04-08 12:37:15,489 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 202 transitions. Word has length 81 [2022-04-08 12:37:15,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:37:15,490 INFO L478 AbstractCegarLoop]: Abstraction has 160 states and 202 transitions. [2022-04-08 12:37:15,490 INFO L479 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-08 12:37:15,490 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 160 states and 202 transitions. [2022-04-08 12:37:17,770 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 202 edges. 201 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 12:37:17,770 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 202 transitions. [2022-04-08 12:37:17,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-04-08 12:37:17,771 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:37:17,771 INFO L499 BasicCegarLoop]: 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-08 12:37:17,787 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-08 12:37:17,971 WARN L460 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-08 12:37:17,971 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:37:17,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:37:17,972 INFO L85 PathProgramCache]: Analyzing trace with hash -918360272, now seen corresponding path program 3 times [2022-04-08 12:37:17,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:37:17,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1350309] [2022-04-08 12:37:17,972 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:37:17,972 INFO L85 PathProgramCache]: Analyzing trace with hash -918360272, now seen corresponding path program 4 times [2022-04-08 12:37:17,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:37:17,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11380087] [2022-04-08 12:37:17,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:37:17,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:37:17,982 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:37:17,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [991662737] [2022-04-08 12:37:17,983 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 12:37:17,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:37:17,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:37:17,987 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-08 12:37:17,988 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-08 12:37:18,088 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 12:37:18,088 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:37:18,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-08 12:37:18,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:37:18,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:37:18,441 INFO L272 TraceCheckUtils]: 0: Hoare triple {20229#true} call ULTIMATE.init(); {20229#true} is VALID [2022-04-08 12:37:18,441 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-08 12:37:18,442 INFO L290 TraceCheckUtils]: 2: Hoare triple {20237#(<= ~counter~0 0)} assume true; {20237#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:18,442 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20237#(<= ~counter~0 0)} {20229#true} #102#return; {20237#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:18,442 INFO L272 TraceCheckUtils]: 4: Hoare triple {20237#(<= ~counter~0 0)} call #t~ret9 := main(); {20237#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:18,443 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-08 12:37:18,443 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-08 12:37:18,443 INFO L290 TraceCheckUtils]: 7: Hoare triple {20237#(<= ~counter~0 0)} ~cond := #in~cond; {20237#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:18,444 INFO L290 TraceCheckUtils]: 8: Hoare triple {20237#(<= ~counter~0 0)} assume !(0 == ~cond); {20237#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:18,444 INFO L290 TraceCheckUtils]: 9: Hoare triple {20237#(<= ~counter~0 0)} assume true; {20237#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:18,444 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20237#(<= ~counter~0 0)} {20237#(<= ~counter~0 0)} #90#return; {20237#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:18,445 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-08 12:37:18,445 INFO L290 TraceCheckUtils]: 12: Hoare triple {20237#(<= ~counter~0 0)} ~cond := #in~cond; {20237#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:18,445 INFO L290 TraceCheckUtils]: 13: Hoare triple {20237#(<= ~counter~0 0)} assume !(0 == ~cond); {20237#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:18,445 INFO L290 TraceCheckUtils]: 14: Hoare triple {20237#(<= ~counter~0 0)} assume true; {20237#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:18,446 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {20237#(<= ~counter~0 0)} {20237#(<= ~counter~0 0)} #92#return; {20237#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:18,446 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-08 12:37:18,447 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-08 12:37:18,447 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-08 12:37:18,448 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-08 12:37:18,448 INFO L290 TraceCheckUtils]: 20: Hoare triple {20286#(<= ~counter~0 1)} ~cond := #in~cond; {20286#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:18,448 INFO L290 TraceCheckUtils]: 21: Hoare triple {20286#(<= ~counter~0 1)} assume !(0 == ~cond); {20286#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:18,448 INFO L290 TraceCheckUtils]: 22: Hoare triple {20286#(<= ~counter~0 1)} assume true; {20286#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:18,449 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {20286#(<= ~counter~0 1)} {20286#(<= ~counter~0 1)} #94#return; {20286#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:18,449 INFO L290 TraceCheckUtils]: 24: Hoare triple {20286#(<= ~counter~0 1)} assume !!(0 != ~r~0); {20286#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:18,450 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-08 12:37:18,450 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-08 12:37:18,450 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-08 12:37:18,451 INFO L290 TraceCheckUtils]: 28: Hoare triple {20311#(<= ~counter~0 2)} ~cond := #in~cond; {20311#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:18,451 INFO L290 TraceCheckUtils]: 29: Hoare triple {20311#(<= ~counter~0 2)} assume !(0 == ~cond); {20311#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:18,451 INFO L290 TraceCheckUtils]: 30: Hoare triple {20311#(<= ~counter~0 2)} assume true; {20311#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:18,452 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {20311#(<= ~counter~0 2)} {20311#(<= ~counter~0 2)} #96#return; {20311#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:18,452 INFO L290 TraceCheckUtils]: 32: Hoare triple {20311#(<= ~counter~0 2)} assume !(~r~0 > 0); {20311#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:18,452 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-08 12:37:18,453 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-08 12:37:18,453 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-08 12:37:18,453 INFO L290 TraceCheckUtils]: 36: Hoare triple {20336#(<= ~counter~0 3)} ~cond := #in~cond; {20336#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:18,454 INFO L290 TraceCheckUtils]: 37: Hoare triple {20336#(<= ~counter~0 3)} assume !(0 == ~cond); {20336#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:18,454 INFO L290 TraceCheckUtils]: 38: Hoare triple {20336#(<= ~counter~0 3)} assume true; {20336#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:18,454 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {20336#(<= ~counter~0 3)} {20336#(<= ~counter~0 3)} #98#return; {20336#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:18,455 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-08 12:37:18,455 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-08 12:37:18,455 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-08 12:37:18,456 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-08 12:37:18,456 INFO L290 TraceCheckUtils]: 44: Hoare triple {20361#(<= ~counter~0 4)} ~cond := #in~cond; {20361#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:18,456 INFO L290 TraceCheckUtils]: 45: Hoare triple {20361#(<= ~counter~0 4)} assume !(0 == ~cond); {20361#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:18,457 INFO L290 TraceCheckUtils]: 46: Hoare triple {20361#(<= ~counter~0 4)} assume true; {20361#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:18,457 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {20361#(<= ~counter~0 4)} {20361#(<= ~counter~0 4)} #98#return; {20361#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:18,457 INFO L290 TraceCheckUtils]: 48: Hoare triple {20361#(<= ~counter~0 4)} assume !(~r~0 < 0); {20361#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:18,458 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-08 12:37:18,458 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-08 12:37:18,458 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-08 12:37:18,459 INFO L290 TraceCheckUtils]: 52: Hoare triple {20386#(<= ~counter~0 5)} ~cond := #in~cond; {20386#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:18,459 INFO L290 TraceCheckUtils]: 53: Hoare triple {20386#(<= ~counter~0 5)} assume !(0 == ~cond); {20386#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:18,459 INFO L290 TraceCheckUtils]: 54: Hoare triple {20386#(<= ~counter~0 5)} assume true; {20386#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:18,460 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {20386#(<= ~counter~0 5)} {20386#(<= ~counter~0 5)} #94#return; {20386#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:18,460 INFO L290 TraceCheckUtils]: 56: Hoare triple {20386#(<= ~counter~0 5)} assume !!(0 != ~r~0); {20386#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:18,460 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-08 12:37:18,461 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-08 12:37:18,461 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-08 12:37:18,461 INFO L290 TraceCheckUtils]: 60: Hoare triple {20411#(<= ~counter~0 6)} ~cond := #in~cond; {20411#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:18,462 INFO L290 TraceCheckUtils]: 61: Hoare triple {20411#(<= ~counter~0 6)} assume !(0 == ~cond); {20411#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:18,462 INFO L290 TraceCheckUtils]: 62: Hoare triple {20411#(<= ~counter~0 6)} assume true; {20411#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:18,462 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {20411#(<= ~counter~0 6)} {20411#(<= ~counter~0 6)} #96#return; {20411#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:18,463 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-08 12:37:18,463 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-08 12:37:18,463 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-08 12:37:18,464 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-08 12:37:18,464 INFO L290 TraceCheckUtils]: 68: Hoare triple {20436#(<= ~counter~0 7)} ~cond := #in~cond; {20436#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:18,464 INFO L290 TraceCheckUtils]: 69: Hoare triple {20436#(<= ~counter~0 7)} assume !(0 == ~cond); {20436#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:18,465 INFO L290 TraceCheckUtils]: 70: Hoare triple {20436#(<= ~counter~0 7)} assume true; {20436#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:18,465 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {20436#(<= ~counter~0 7)} {20436#(<= ~counter~0 7)} #96#return; {20436#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:18,465 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-08 12:37:18,466 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-08 12:37:18,466 INFO L290 TraceCheckUtils]: 74: Hoare triple {20461#(<= |main_#t~post7| 7)} assume !(#t~post7 < 20);havoc #t~post7; {20230#false} is VALID [2022-04-08 12:37:18,466 INFO L290 TraceCheckUtils]: 75: Hoare triple {20230#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {20230#false} is VALID [2022-04-08 12:37:18,466 INFO L290 TraceCheckUtils]: 76: Hoare triple {20230#false} assume !(#t~post8 < 20);havoc #t~post8; {20230#false} is VALID [2022-04-08 12:37:18,466 INFO L290 TraceCheckUtils]: 77: Hoare triple {20230#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20230#false} is VALID [2022-04-08 12:37:18,466 INFO L290 TraceCheckUtils]: 78: Hoare triple {20230#false} assume !(#t~post6 < 20);havoc #t~post6; {20230#false} is VALID [2022-04-08 12:37:18,466 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-08 12:37:18,466 INFO L290 TraceCheckUtils]: 80: Hoare triple {20230#false} ~cond := #in~cond; {20230#false} is VALID [2022-04-08 12:37:18,467 INFO L290 TraceCheckUtils]: 81: Hoare triple {20230#false} assume 0 == ~cond; {20230#false} is VALID [2022-04-08 12:37:18,467 INFO L290 TraceCheckUtils]: 82: Hoare triple {20230#false} assume !false; {20230#false} is VALID [2022-04-08 12:37:18,467 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-08 12:37:18,467 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:37:18,853 INFO L290 TraceCheckUtils]: 82: Hoare triple {20230#false} assume !false; {20230#false} is VALID [2022-04-08 12:37:18,853 INFO L290 TraceCheckUtils]: 81: Hoare triple {20230#false} assume 0 == ~cond; {20230#false} is VALID [2022-04-08 12:37:18,853 INFO L290 TraceCheckUtils]: 80: Hoare triple {20230#false} ~cond := #in~cond; {20230#false} is VALID [2022-04-08 12:37:18,854 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-08 12:37:18,854 INFO L290 TraceCheckUtils]: 78: Hoare triple {20230#false} assume !(#t~post6 < 20);havoc #t~post6; {20230#false} is VALID [2022-04-08 12:37:18,854 INFO L290 TraceCheckUtils]: 77: Hoare triple {20230#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20230#false} is VALID [2022-04-08 12:37:18,854 INFO L290 TraceCheckUtils]: 76: Hoare triple {20230#false} assume !(#t~post8 < 20);havoc #t~post8; {20230#false} is VALID [2022-04-08 12:37:18,854 INFO L290 TraceCheckUtils]: 75: Hoare triple {20230#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {20230#false} is VALID [2022-04-08 12:37:18,854 INFO L290 TraceCheckUtils]: 74: Hoare triple {20513#(< |main_#t~post7| 20)} assume !(#t~post7 < 20);havoc #t~post7; {20230#false} is VALID [2022-04-08 12:37:18,854 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-08 12:37:18,855 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-08 12:37:18,855 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {20229#true} {20517#(< ~counter~0 20)} #96#return; {20517#(< ~counter~0 20)} is VALID [2022-04-08 12:37:18,855 INFO L290 TraceCheckUtils]: 70: Hoare triple {20229#true} assume true; {20229#true} is VALID [2022-04-08 12:37:18,855 INFO L290 TraceCheckUtils]: 69: Hoare triple {20229#true} assume !(0 == ~cond); {20229#true} is VALID [2022-04-08 12:37:18,855 INFO L290 TraceCheckUtils]: 68: Hoare triple {20229#true} ~cond := #in~cond; {20229#true} is VALID [2022-04-08 12:37:18,856 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-08 12:37:18,856 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-08 12:37:18,857 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-08 12:37:18,857 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-08 12:37:18,857 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {20229#true} {20542#(< ~counter~0 19)} #96#return; {20542#(< ~counter~0 19)} is VALID [2022-04-08 12:37:18,857 INFO L290 TraceCheckUtils]: 62: Hoare triple {20229#true} assume true; {20229#true} is VALID [2022-04-08 12:37:18,857 INFO L290 TraceCheckUtils]: 61: Hoare triple {20229#true} assume !(0 == ~cond); {20229#true} is VALID [2022-04-08 12:37:18,857 INFO L290 TraceCheckUtils]: 60: Hoare triple {20229#true} ~cond := #in~cond; {20229#true} is VALID [2022-04-08 12:37:18,858 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-08 12:37:18,858 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-08 12:37:18,858 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-08 12:37:18,860 INFO L290 TraceCheckUtils]: 56: Hoare triple {20567#(< ~counter~0 18)} assume !!(0 != ~r~0); {20567#(< ~counter~0 18)} is VALID [2022-04-08 12:37:18,861 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {20229#true} {20567#(< ~counter~0 18)} #94#return; {20567#(< ~counter~0 18)} is VALID [2022-04-08 12:37:18,861 INFO L290 TraceCheckUtils]: 54: Hoare triple {20229#true} assume true; {20229#true} is VALID [2022-04-08 12:37:18,861 INFO L290 TraceCheckUtils]: 53: Hoare triple {20229#true} assume !(0 == ~cond); {20229#true} is VALID [2022-04-08 12:37:18,861 INFO L290 TraceCheckUtils]: 52: Hoare triple {20229#true} ~cond := #in~cond; {20229#true} is VALID [2022-04-08 12:37:18,861 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-08 12:37:18,861 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-08 12:37:18,862 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-08 12:37:18,862 INFO L290 TraceCheckUtils]: 48: Hoare triple {20592#(< ~counter~0 17)} assume !(~r~0 < 0); {20592#(< ~counter~0 17)} is VALID [2022-04-08 12:37:18,863 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {20229#true} {20592#(< ~counter~0 17)} #98#return; {20592#(< ~counter~0 17)} is VALID [2022-04-08 12:37:18,863 INFO L290 TraceCheckUtils]: 46: Hoare triple {20229#true} assume true; {20229#true} is VALID [2022-04-08 12:37:18,863 INFO L290 TraceCheckUtils]: 45: Hoare triple {20229#true} assume !(0 == ~cond); {20229#true} is VALID [2022-04-08 12:37:18,863 INFO L290 TraceCheckUtils]: 44: Hoare triple {20229#true} ~cond := #in~cond; {20229#true} is VALID [2022-04-08 12:37:18,863 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-08 12:37:18,863 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-08 12:37:18,864 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-08 12:37:18,864 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-08 12:37:18,864 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {20229#true} {20617#(< ~counter~0 16)} #98#return; {20617#(< ~counter~0 16)} is VALID [2022-04-08 12:37:18,864 INFO L290 TraceCheckUtils]: 38: Hoare triple {20229#true} assume true; {20229#true} is VALID [2022-04-08 12:37:18,865 INFO L290 TraceCheckUtils]: 37: Hoare triple {20229#true} assume !(0 == ~cond); {20229#true} is VALID [2022-04-08 12:37:18,865 INFO L290 TraceCheckUtils]: 36: Hoare triple {20229#true} ~cond := #in~cond; {20229#true} is VALID [2022-04-08 12:37:18,865 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-08 12:37:18,865 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-08 12:37:18,865 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-08 12:37:18,866 INFO L290 TraceCheckUtils]: 32: Hoare triple {20642#(< ~counter~0 15)} assume !(~r~0 > 0); {20642#(< ~counter~0 15)} is VALID [2022-04-08 12:37:18,866 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {20229#true} {20642#(< ~counter~0 15)} #96#return; {20642#(< ~counter~0 15)} is VALID [2022-04-08 12:37:18,866 INFO L290 TraceCheckUtils]: 30: Hoare triple {20229#true} assume true; {20229#true} is VALID [2022-04-08 12:37:18,866 INFO L290 TraceCheckUtils]: 29: Hoare triple {20229#true} assume !(0 == ~cond); {20229#true} is VALID [2022-04-08 12:37:18,866 INFO L290 TraceCheckUtils]: 28: Hoare triple {20229#true} ~cond := #in~cond; {20229#true} is VALID [2022-04-08 12:37:18,866 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-08 12:37:18,867 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-08 12:37:18,867 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-08 12:37:18,867 INFO L290 TraceCheckUtils]: 24: Hoare triple {20667#(< ~counter~0 14)} assume !!(0 != ~r~0); {20667#(< ~counter~0 14)} is VALID [2022-04-08 12:37:18,868 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {20229#true} {20667#(< ~counter~0 14)} #94#return; {20667#(< ~counter~0 14)} is VALID [2022-04-08 12:37:18,868 INFO L290 TraceCheckUtils]: 22: Hoare triple {20229#true} assume true; {20229#true} is VALID [2022-04-08 12:37:18,868 INFO L290 TraceCheckUtils]: 21: Hoare triple {20229#true} assume !(0 == ~cond); {20229#true} is VALID [2022-04-08 12:37:18,868 INFO L290 TraceCheckUtils]: 20: Hoare triple {20229#true} ~cond := #in~cond; {20229#true} is VALID [2022-04-08 12:37:18,868 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-08 12:37:18,868 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-08 12:37:18,869 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-08 12:37:18,869 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-08 12:37:18,870 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {20229#true} {20692#(< ~counter~0 13)} #92#return; {20692#(< ~counter~0 13)} is VALID [2022-04-08 12:37:18,870 INFO L290 TraceCheckUtils]: 14: Hoare triple {20229#true} assume true; {20229#true} is VALID [2022-04-08 12:37:18,870 INFO L290 TraceCheckUtils]: 13: Hoare triple {20229#true} assume !(0 == ~cond); {20229#true} is VALID [2022-04-08 12:37:18,870 INFO L290 TraceCheckUtils]: 12: Hoare triple {20229#true} ~cond := #in~cond; {20229#true} is VALID [2022-04-08 12:37:18,870 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-08 12:37:18,870 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20229#true} {20692#(< ~counter~0 13)} #90#return; {20692#(< ~counter~0 13)} is VALID [2022-04-08 12:37:18,870 INFO L290 TraceCheckUtils]: 9: Hoare triple {20229#true} assume true; {20229#true} is VALID [2022-04-08 12:37:18,870 INFO L290 TraceCheckUtils]: 8: Hoare triple {20229#true} assume !(0 == ~cond); {20229#true} is VALID [2022-04-08 12:37:18,871 INFO L290 TraceCheckUtils]: 7: Hoare triple {20229#true} ~cond := #in~cond; {20229#true} is VALID [2022-04-08 12:37:18,871 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-08 12:37:18,871 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-08 12:37:18,871 INFO L272 TraceCheckUtils]: 4: Hoare triple {20692#(< ~counter~0 13)} call #t~ret9 := main(); {20692#(< ~counter~0 13)} is VALID [2022-04-08 12:37:18,871 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20692#(< ~counter~0 13)} {20229#true} #102#return; {20692#(< ~counter~0 13)} is VALID [2022-04-08 12:37:18,872 INFO L290 TraceCheckUtils]: 2: Hoare triple {20692#(< ~counter~0 13)} assume true; {20692#(< ~counter~0 13)} is VALID [2022-04-08 12:37:18,872 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-08 12:37:18,872 INFO L272 TraceCheckUtils]: 0: Hoare triple {20229#true} call ULTIMATE.init(); {20229#true} is VALID [2022-04-08 12:37:18,872 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-08 12:37:18,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:37:18,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11380087] [2022-04-08 12:37:18,873 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:37:18,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [991662737] [2022-04-08 12:37:18,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [991662737] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:37:18,873 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:37:18,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-04-08 12:37:18,873 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:37:18,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1350309] [2022-04-08 12:37:18,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1350309] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:37:18,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:37:18,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 12:37:18,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98130775] [2022-04-08 12:37:18,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:37:18,874 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-08 12:37:18,874 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:37:18,874 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-08 12:37:18,931 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-08 12:37:18,931 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 12:37:18,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:37:18,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 12:37:18,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2022-04-08 12:37:18,932 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-08 12:37:19,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:37:19,476 INFO L93 Difference]: Finished difference Result 215 states and 280 transitions. [2022-04-08 12:37:19,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-08 12:37:19,476 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-08 12:37:19,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:37:19,476 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-08 12:37:19,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 177 transitions. [2022-04-08 12:37:19,477 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-08 12:37:19,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 177 transitions. [2022-04-08 12:37:19,479 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 177 transitions. [2022-04-08 12:37:19,602 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-08 12:37:19,604 INFO L225 Difference]: With dead ends: 215 [2022-04-08 12:37:19,604 INFO L226 Difference]: Without dead ends: 166 [2022-04-08 12:37:19,605 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=266, Invalid=384, Unknown=0, NotChecked=0, Total=650 [2022-04-08 12:37:19,605 INFO L913 BasicCegarLoop]: 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-08 12:37:19,605 INFO L914 BasicCegarLoop]: 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-08 12:37:19,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-04-08 12:37:19,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2022-04-08 12:37:19,796 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:37:19,796 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-08 12:37:19,796 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-08 12:37:19,797 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-08 12:37:19,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:37:19,799 INFO L93 Difference]: Finished difference Result 166 states and 208 transitions. [2022-04-08 12:37:19,799 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 208 transitions. [2022-04-08 12:37:19,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:37:19,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:37:19,800 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-08 12:37:19,800 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-08 12:37:19,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:37:19,802 INFO L93 Difference]: Finished difference Result 166 states and 208 transitions. [2022-04-08 12:37:19,802 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 208 transitions. [2022-04-08 12:37:19,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:37:19,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:37:19,802 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:37:19,802 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:37:19,802 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-08 12:37:19,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 208 transitions. [2022-04-08 12:37:19,805 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 208 transitions. Word has length 83 [2022-04-08 12:37:19,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:37:19,805 INFO L478 AbstractCegarLoop]: Abstraction has 166 states and 208 transitions. [2022-04-08 12:37:19,805 INFO L479 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-08 12:37:19,805 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 166 states and 208 transitions. [2022-04-08 12:37:22,089 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 208 edges. 207 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 12:37:22,089 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 208 transitions. [2022-04-08 12:37:22,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-08 12:37:22,090 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:37:22,090 INFO L499 BasicCegarLoop]: 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-08 12:37:22,108 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-08 12:37:22,290 WARN L460 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-08 12:37:22,290 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:37:22,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:37:22,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1698627479, now seen corresponding path program 1 times [2022-04-08 12:37:22,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:37:22,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [243618151] [2022-04-08 12:37:22,291 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:37:22,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1698627479, now seen corresponding path program 2 times [2022-04-08 12:37:22,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:37:22,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90457743] [2022-04-08 12:37:22,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:37:22,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:37:22,301 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:37:22,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1956297117] [2022-04-08 12:37:22,301 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:37:22,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:37:22,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:37:22,302 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-08 12:37:22,302 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-08 12:37:22,347 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:37:22,347 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:37:22,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-08 12:37:22,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:37:22,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:37:22,731 INFO L272 TraceCheckUtils]: 0: Hoare triple {21852#true} call ULTIMATE.init(); {21852#true} is VALID [2022-04-08 12:37:22,731 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-08 12:37:22,731 INFO L290 TraceCheckUtils]: 2: Hoare triple {21860#(<= ~counter~0 0)} assume true; {21860#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:22,732 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21860#(<= ~counter~0 0)} {21852#true} #102#return; {21860#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:22,732 INFO L272 TraceCheckUtils]: 4: Hoare triple {21860#(<= ~counter~0 0)} call #t~ret9 := main(); {21860#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:22,732 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-08 12:37:22,733 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-08 12:37:22,733 INFO L290 TraceCheckUtils]: 7: Hoare triple {21860#(<= ~counter~0 0)} ~cond := #in~cond; {21860#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:22,733 INFO L290 TraceCheckUtils]: 8: Hoare triple {21860#(<= ~counter~0 0)} assume !(0 == ~cond); {21860#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:22,734 INFO L290 TraceCheckUtils]: 9: Hoare triple {21860#(<= ~counter~0 0)} assume true; {21860#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:22,734 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {21860#(<= ~counter~0 0)} {21860#(<= ~counter~0 0)} #90#return; {21860#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:22,734 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-08 12:37:22,735 INFO L290 TraceCheckUtils]: 12: Hoare triple {21860#(<= ~counter~0 0)} ~cond := #in~cond; {21860#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:22,735 INFO L290 TraceCheckUtils]: 13: Hoare triple {21860#(<= ~counter~0 0)} assume !(0 == ~cond); {21860#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:22,735 INFO L290 TraceCheckUtils]: 14: Hoare triple {21860#(<= ~counter~0 0)} assume true; {21860#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:22,735 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {21860#(<= ~counter~0 0)} {21860#(<= ~counter~0 0)} #92#return; {21860#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:22,736 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-08 12:37:22,736 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-08 12:37:22,737 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-08 12:37:22,737 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-08 12:37:22,737 INFO L290 TraceCheckUtils]: 20: Hoare triple {21909#(<= ~counter~0 1)} ~cond := #in~cond; {21909#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:22,738 INFO L290 TraceCheckUtils]: 21: Hoare triple {21909#(<= ~counter~0 1)} assume !(0 == ~cond); {21909#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:22,738 INFO L290 TraceCheckUtils]: 22: Hoare triple {21909#(<= ~counter~0 1)} assume true; {21909#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:22,738 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {21909#(<= ~counter~0 1)} {21909#(<= ~counter~0 1)} #94#return; {21909#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:22,739 INFO L290 TraceCheckUtils]: 24: Hoare triple {21909#(<= ~counter~0 1)} assume !!(0 != ~r~0); {21909#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:22,739 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-08 12:37:22,739 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-08 12:37:22,740 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-08 12:37:22,740 INFO L290 TraceCheckUtils]: 28: Hoare triple {21934#(<= ~counter~0 2)} ~cond := #in~cond; {21934#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:22,740 INFO L290 TraceCheckUtils]: 29: Hoare triple {21934#(<= ~counter~0 2)} assume !(0 == ~cond); {21934#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:22,741 INFO L290 TraceCheckUtils]: 30: Hoare triple {21934#(<= ~counter~0 2)} assume true; {21934#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:22,741 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {21934#(<= ~counter~0 2)} {21934#(<= ~counter~0 2)} #96#return; {21934#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:22,741 INFO L290 TraceCheckUtils]: 32: Hoare triple {21934#(<= ~counter~0 2)} assume !(~r~0 > 0); {21934#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:22,742 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-08 12:37:22,742 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-08 12:37:22,743 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-08 12:37:22,743 INFO L290 TraceCheckUtils]: 36: Hoare triple {21959#(<= ~counter~0 3)} ~cond := #in~cond; {21959#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:22,743 INFO L290 TraceCheckUtils]: 37: Hoare triple {21959#(<= ~counter~0 3)} assume !(0 == ~cond); {21959#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:22,743 INFO L290 TraceCheckUtils]: 38: Hoare triple {21959#(<= ~counter~0 3)} assume true; {21959#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:22,744 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {21959#(<= ~counter~0 3)} {21959#(<= ~counter~0 3)} #98#return; {21959#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:22,744 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-08 12:37:22,745 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-08 12:37:22,745 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-08 12:37:22,745 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-08 12:37:22,746 INFO L290 TraceCheckUtils]: 44: Hoare triple {21984#(<= ~counter~0 4)} ~cond := #in~cond; {21984#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:22,746 INFO L290 TraceCheckUtils]: 45: Hoare triple {21984#(<= ~counter~0 4)} assume !(0 == ~cond); {21984#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:22,746 INFO L290 TraceCheckUtils]: 46: Hoare triple {21984#(<= ~counter~0 4)} assume true; {21984#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:22,747 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {21984#(<= ~counter~0 4)} {21984#(<= ~counter~0 4)} #98#return; {21984#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:22,747 INFO L290 TraceCheckUtils]: 48: Hoare triple {21984#(<= ~counter~0 4)} assume !(~r~0 < 0); {21984#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:22,747 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-08 12:37:22,748 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-08 12:37:22,748 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-08 12:37:22,748 INFO L290 TraceCheckUtils]: 52: Hoare triple {22009#(<= ~counter~0 5)} ~cond := #in~cond; {22009#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:22,749 INFO L290 TraceCheckUtils]: 53: Hoare triple {22009#(<= ~counter~0 5)} assume !(0 == ~cond); {22009#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:22,749 INFO L290 TraceCheckUtils]: 54: Hoare triple {22009#(<= ~counter~0 5)} assume true; {22009#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:22,749 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {22009#(<= ~counter~0 5)} {22009#(<= ~counter~0 5)} #94#return; {22009#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:22,750 INFO L290 TraceCheckUtils]: 56: Hoare triple {22009#(<= ~counter~0 5)} assume !!(0 != ~r~0); {22009#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:22,750 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-08 12:37:22,750 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-08 12:37:22,751 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-08 12:37:22,751 INFO L290 TraceCheckUtils]: 60: Hoare triple {22034#(<= ~counter~0 6)} ~cond := #in~cond; {22034#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:22,751 INFO L290 TraceCheckUtils]: 61: Hoare triple {22034#(<= ~counter~0 6)} assume !(0 == ~cond); {22034#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:22,751 INFO L290 TraceCheckUtils]: 62: Hoare triple {22034#(<= ~counter~0 6)} assume true; {22034#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:22,752 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {22034#(<= ~counter~0 6)} {22034#(<= ~counter~0 6)} #96#return; {22034#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:22,752 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-08 12:37:22,753 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-08 12:37:22,753 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-08 12:37:22,753 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-08 12:37:22,754 INFO L290 TraceCheckUtils]: 68: Hoare triple {22059#(<= ~counter~0 7)} ~cond := #in~cond; {22059#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:22,754 INFO L290 TraceCheckUtils]: 69: Hoare triple {22059#(<= ~counter~0 7)} assume !(0 == ~cond); {22059#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:22,754 INFO L290 TraceCheckUtils]: 70: Hoare triple {22059#(<= ~counter~0 7)} assume true; {22059#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:22,755 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {22059#(<= ~counter~0 7)} {22059#(<= ~counter~0 7)} #96#return; {22059#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:22,755 INFO L290 TraceCheckUtils]: 72: Hoare triple {22059#(<= ~counter~0 7)} assume !(~r~0 > 0); {22059#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:22,755 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-08 12:37:22,756 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-08 12:37:22,756 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-08 12:37:22,756 INFO L290 TraceCheckUtils]: 76: Hoare triple {22084#(<= ~counter~0 8)} ~cond := #in~cond; {22084#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:22,757 INFO L290 TraceCheckUtils]: 77: Hoare triple {22084#(<= ~counter~0 8)} assume !(0 == ~cond); {22084#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:22,757 INFO L290 TraceCheckUtils]: 78: Hoare triple {22084#(<= ~counter~0 8)} assume true; {22084#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:22,757 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {22084#(<= ~counter~0 8)} {22084#(<= ~counter~0 8)} #98#return; {22084#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:22,758 INFO L290 TraceCheckUtils]: 80: Hoare triple {22084#(<= ~counter~0 8)} assume !(~r~0 < 0); {22084#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:22,758 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-08 12:37:22,758 INFO L290 TraceCheckUtils]: 82: Hoare triple {22109#(<= |main_#t~post6| 8)} assume !(#t~post6 < 20);havoc #t~post6; {21853#false} is VALID [2022-04-08 12:37:22,758 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-08 12:37:22,758 INFO L290 TraceCheckUtils]: 84: Hoare triple {21853#false} ~cond := #in~cond; {21853#false} is VALID [2022-04-08 12:37:22,759 INFO L290 TraceCheckUtils]: 85: Hoare triple {21853#false} assume 0 == ~cond; {21853#false} is VALID [2022-04-08 12:37:22,759 INFO L290 TraceCheckUtils]: 86: Hoare triple {21853#false} assume !false; {21853#false} is VALID [2022-04-08 12:37:22,759 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-08 12:37:22,759 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:37:23,176 INFO L290 TraceCheckUtils]: 86: Hoare triple {21853#false} assume !false; {21853#false} is VALID [2022-04-08 12:37:23,176 INFO L290 TraceCheckUtils]: 85: Hoare triple {21853#false} assume 0 == ~cond; {21853#false} is VALID [2022-04-08 12:37:23,177 INFO L290 TraceCheckUtils]: 84: Hoare triple {21853#false} ~cond := #in~cond; {21853#false} is VALID [2022-04-08 12:37:23,177 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-08 12:37:23,177 INFO L290 TraceCheckUtils]: 82: Hoare triple {22137#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {21853#false} is VALID [2022-04-08 12:37:23,177 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-08 12:37:23,177 INFO L290 TraceCheckUtils]: 80: Hoare triple {22141#(< ~counter~0 20)} assume !(~r~0 < 0); {22141#(< ~counter~0 20)} is VALID [2022-04-08 12:37:23,178 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {21852#true} {22141#(< ~counter~0 20)} #98#return; {22141#(< ~counter~0 20)} is VALID [2022-04-08 12:37:23,178 INFO L290 TraceCheckUtils]: 78: Hoare triple {21852#true} assume true; {21852#true} is VALID [2022-04-08 12:37:23,178 INFO L290 TraceCheckUtils]: 77: Hoare triple {21852#true} assume !(0 == ~cond); {21852#true} is VALID [2022-04-08 12:37:23,178 INFO L290 TraceCheckUtils]: 76: Hoare triple {21852#true} ~cond := #in~cond; {21852#true} is VALID [2022-04-08 12:37:23,178 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-08 12:37:23,179 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-08 12:37:23,179 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-08 12:37:23,180 INFO L290 TraceCheckUtils]: 72: Hoare triple {22166#(< ~counter~0 19)} assume !(~r~0 > 0); {22166#(< ~counter~0 19)} is VALID [2022-04-08 12:37:23,180 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {21852#true} {22166#(< ~counter~0 19)} #96#return; {22166#(< ~counter~0 19)} is VALID [2022-04-08 12:37:23,180 INFO L290 TraceCheckUtils]: 70: Hoare triple {21852#true} assume true; {21852#true} is VALID [2022-04-08 12:37:23,180 INFO L290 TraceCheckUtils]: 69: Hoare triple {21852#true} assume !(0 == ~cond); {21852#true} is VALID [2022-04-08 12:37:23,180 INFO L290 TraceCheckUtils]: 68: Hoare triple {21852#true} ~cond := #in~cond; {21852#true} is VALID [2022-04-08 12:37:23,180 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-08 12:37:23,181 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-08 12:37:23,181 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-08 12:37:23,181 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-08 12:37:23,182 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {21852#true} {22191#(< ~counter~0 18)} #96#return; {22191#(< ~counter~0 18)} is VALID [2022-04-08 12:37:23,182 INFO L290 TraceCheckUtils]: 62: Hoare triple {21852#true} assume true; {21852#true} is VALID [2022-04-08 12:37:23,182 INFO L290 TraceCheckUtils]: 61: Hoare triple {21852#true} assume !(0 == ~cond); {21852#true} is VALID [2022-04-08 12:37:23,182 INFO L290 TraceCheckUtils]: 60: Hoare triple {21852#true} ~cond := #in~cond; {21852#true} is VALID [2022-04-08 12:37:23,182 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-08 12:37:23,182 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-08 12:37:23,183 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-08 12:37:23,183 INFO L290 TraceCheckUtils]: 56: Hoare triple {22216#(< ~counter~0 17)} assume !!(0 != ~r~0); {22216#(< ~counter~0 17)} is VALID [2022-04-08 12:37:23,184 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {21852#true} {22216#(< ~counter~0 17)} #94#return; {22216#(< ~counter~0 17)} is VALID [2022-04-08 12:37:23,184 INFO L290 TraceCheckUtils]: 54: Hoare triple {21852#true} assume true; {21852#true} is VALID [2022-04-08 12:37:23,184 INFO L290 TraceCheckUtils]: 53: Hoare triple {21852#true} assume !(0 == ~cond); {21852#true} is VALID [2022-04-08 12:37:23,184 INFO L290 TraceCheckUtils]: 52: Hoare triple {21852#true} ~cond := #in~cond; {21852#true} is VALID [2022-04-08 12:37:23,184 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-08 12:37:23,184 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-08 12:37:23,185 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-08 12:37:23,185 INFO L290 TraceCheckUtils]: 48: Hoare triple {22241#(< ~counter~0 16)} assume !(~r~0 < 0); {22241#(< ~counter~0 16)} is VALID [2022-04-08 12:37:23,185 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {21852#true} {22241#(< ~counter~0 16)} #98#return; {22241#(< ~counter~0 16)} is VALID [2022-04-08 12:37:23,185 INFO L290 TraceCheckUtils]: 46: Hoare triple {21852#true} assume true; {21852#true} is VALID [2022-04-08 12:37:23,185 INFO L290 TraceCheckUtils]: 45: Hoare triple {21852#true} assume !(0 == ~cond); {21852#true} is VALID [2022-04-08 12:37:23,186 INFO L290 TraceCheckUtils]: 44: Hoare triple {21852#true} ~cond := #in~cond; {21852#true} is VALID [2022-04-08 12:37:23,186 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-08 12:37:23,186 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-08 12:37:23,186 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-08 12:37:23,187 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-08 12:37:23,187 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {21852#true} {22266#(< ~counter~0 15)} #98#return; {22266#(< ~counter~0 15)} is VALID [2022-04-08 12:37:23,187 INFO L290 TraceCheckUtils]: 38: Hoare triple {21852#true} assume true; {21852#true} is VALID [2022-04-08 12:37:23,187 INFO L290 TraceCheckUtils]: 37: Hoare triple {21852#true} assume !(0 == ~cond); {21852#true} is VALID [2022-04-08 12:37:23,187 INFO L290 TraceCheckUtils]: 36: Hoare triple {21852#true} ~cond := #in~cond; {21852#true} is VALID [2022-04-08 12:37:23,187 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-08 12:37:23,188 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-08 12:37:23,188 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-08 12:37:23,188 INFO L290 TraceCheckUtils]: 32: Hoare triple {22291#(< ~counter~0 14)} assume !(~r~0 > 0); {22291#(< ~counter~0 14)} is VALID [2022-04-08 12:37:23,189 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {21852#true} {22291#(< ~counter~0 14)} #96#return; {22291#(< ~counter~0 14)} is VALID [2022-04-08 12:37:23,189 INFO L290 TraceCheckUtils]: 30: Hoare triple {21852#true} assume true; {21852#true} is VALID [2022-04-08 12:37:23,189 INFO L290 TraceCheckUtils]: 29: Hoare triple {21852#true} assume !(0 == ~cond); {21852#true} is VALID [2022-04-08 12:37:23,189 INFO L290 TraceCheckUtils]: 28: Hoare triple {21852#true} ~cond := #in~cond; {21852#true} is VALID [2022-04-08 12:37:23,189 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-08 12:37:23,189 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-08 12:37:23,190 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-08 12:37:23,190 INFO L290 TraceCheckUtils]: 24: Hoare triple {22316#(< ~counter~0 13)} assume !!(0 != ~r~0); {22316#(< ~counter~0 13)} is VALID [2022-04-08 12:37:23,191 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {21852#true} {22316#(< ~counter~0 13)} #94#return; {22316#(< ~counter~0 13)} is VALID [2022-04-08 12:37:23,191 INFO L290 TraceCheckUtils]: 22: Hoare triple {21852#true} assume true; {21852#true} is VALID [2022-04-08 12:37:23,191 INFO L290 TraceCheckUtils]: 21: Hoare triple {21852#true} assume !(0 == ~cond); {21852#true} is VALID [2022-04-08 12:37:23,191 INFO L290 TraceCheckUtils]: 20: Hoare triple {21852#true} ~cond := #in~cond; {21852#true} is VALID [2022-04-08 12:37:23,191 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-08 12:37:23,191 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-08 12:37:23,192 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-08 12:37:23,192 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-08 12:37:23,192 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {21852#true} {22341#(< ~counter~0 12)} #92#return; {22341#(< ~counter~0 12)} is VALID [2022-04-08 12:37:23,192 INFO L290 TraceCheckUtils]: 14: Hoare triple {21852#true} assume true; {21852#true} is VALID [2022-04-08 12:37:23,192 INFO L290 TraceCheckUtils]: 13: Hoare triple {21852#true} assume !(0 == ~cond); {21852#true} is VALID [2022-04-08 12:37:23,193 INFO L290 TraceCheckUtils]: 12: Hoare triple {21852#true} ~cond := #in~cond; {21852#true} is VALID [2022-04-08 12:37:23,193 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-08 12:37:23,199 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {21852#true} {22341#(< ~counter~0 12)} #90#return; {22341#(< ~counter~0 12)} is VALID [2022-04-08 12:37:23,199 INFO L290 TraceCheckUtils]: 9: Hoare triple {21852#true} assume true; {21852#true} is VALID [2022-04-08 12:37:23,199 INFO L290 TraceCheckUtils]: 8: Hoare triple {21852#true} assume !(0 == ~cond); {21852#true} is VALID [2022-04-08 12:37:23,199 INFO L290 TraceCheckUtils]: 7: Hoare triple {21852#true} ~cond := #in~cond; {21852#true} is VALID [2022-04-08 12:37:23,199 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-08 12:37:23,200 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-08 12:37:23,200 INFO L272 TraceCheckUtils]: 4: Hoare triple {22341#(< ~counter~0 12)} call #t~ret9 := main(); {22341#(< ~counter~0 12)} is VALID [2022-04-08 12:37:23,200 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22341#(< ~counter~0 12)} {21852#true} #102#return; {22341#(< ~counter~0 12)} is VALID [2022-04-08 12:37:23,201 INFO L290 TraceCheckUtils]: 2: Hoare triple {22341#(< ~counter~0 12)} assume true; {22341#(< ~counter~0 12)} is VALID [2022-04-08 12:37:23,201 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-08 12:37:23,201 INFO L272 TraceCheckUtils]: 0: Hoare triple {21852#true} call ULTIMATE.init(); {21852#true} is VALID [2022-04-08 12:37:23,201 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-08 12:37:23,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:37:23,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90457743] [2022-04-08 12:37:23,202 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:37:23,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1956297117] [2022-04-08 12:37:23,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1956297117] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:37:23,202 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:37:23,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2022-04-08 12:37:23,202 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:37:23,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [243618151] [2022-04-08 12:37:23,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [243618151] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:37:23,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:37:23,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 12:37:23,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268210912] [2022-04-08 12:37:23,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:37:23,203 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-08 12:37:23,203 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:37:23,203 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-08 12:37:23,257 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-08 12:37:23,257 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 12:37:23,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:37:23,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 12:37:23,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=267, Unknown=0, NotChecked=0, Total=462 [2022-04-08 12:37:23,258 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-08 12:37:23,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:37:23,930 INFO L93 Difference]: Finished difference Result 188 states and 235 transitions. [2022-04-08 12:37:23,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-08 12:37:23,930 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-08 12:37:23,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:37:23,930 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-08 12:37:23,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 175 transitions. [2022-04-08 12:37:23,935 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-08 12:37:23,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 175 transitions. [2022-04-08 12:37:23,937 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 175 transitions. [2022-04-08 12:37:24,050 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-08 12:37:24,052 INFO L225 Difference]: With dead ends: 188 [2022-04-08 12:37:24,053 INFO L226 Difference]: Without dead ends: 183 [2022-04-08 12:37:24,053 INFO L912 BasicCegarLoop]: 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-08 12:37:24,053 INFO L913 BasicCegarLoop]: 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-08 12:37:24,053 INFO L914 BasicCegarLoop]: 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-08 12:37:24,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-04-08 12:37:24,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 177. [2022-04-08 12:37:24,253 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:37:24,254 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-08 12:37:24,254 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-08 12:37:24,254 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-08 12:37:24,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:37:24,256 INFO L93 Difference]: Finished difference Result 183 states and 230 transitions. [2022-04-08 12:37:24,256 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 230 transitions. [2022-04-08 12:37:24,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:37:24,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:37:24,257 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-08 12:37:24,257 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-08 12:37:24,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:37:24,260 INFO L93 Difference]: Finished difference Result 183 states and 230 transitions. [2022-04-08 12:37:24,260 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 230 transitions. [2022-04-08 12:37:24,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:37:24,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:37:24,260 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:37:24,260 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:37:24,260 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-08 12:37:24,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 223 transitions. [2022-04-08 12:37:24,263 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 223 transitions. Word has length 87 [2022-04-08 12:37:24,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:37:24,263 INFO L478 AbstractCegarLoop]: Abstraction has 177 states and 223 transitions. [2022-04-08 12:37:24,263 INFO L479 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-08 12:37:24,263 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 177 states and 223 transitions. [2022-04-08 12:37:25,508 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-08 12:37:25,508 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 223 transitions. [2022-04-08 12:37:25,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-08 12:37:25,509 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:37:25,509 INFO L499 BasicCegarLoop]: 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-08 12:37:25,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-08 12:37:25,723 WARN L460 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-08 12:37:25,724 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:37:25,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:37:25,724 INFO L85 PathProgramCache]: Analyzing trace with hash 2133755932, now seen corresponding path program 3 times [2022-04-08 12:37:25,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:37:25,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1305969262] [2022-04-08 12:37:25,725 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:37:25,725 INFO L85 PathProgramCache]: Analyzing trace with hash 2133755932, now seen corresponding path program 4 times [2022-04-08 12:37:25,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:37:25,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64348027] [2022-04-08 12:37:25,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:37:25,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:37:25,734 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:37:25,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1416729428] [2022-04-08 12:37:25,735 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 12:37:25,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:37:25,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:37:25,741 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-08 12:37:25,743 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-08 12:37:25,783 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 12:37:25,783 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:37:25,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-08 12:37:25,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:37:25,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:37:26,004 INFO L272 TraceCheckUtils]: 0: Hoare triple {23501#true} call ULTIMATE.init(); {23501#true} is VALID [2022-04-08 12:37:26,005 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-08 12:37:26,005 INFO L290 TraceCheckUtils]: 2: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-08 12:37:26,005 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23501#true} {23501#true} #102#return; {23501#true} is VALID [2022-04-08 12:37:26,005 INFO L272 TraceCheckUtils]: 4: Hoare triple {23501#true} call #t~ret9 := main(); {23501#true} is VALID [2022-04-08 12:37:26,005 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-08 12:37:26,005 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-08 12:37:26,005 INFO L290 TraceCheckUtils]: 7: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-08 12:37:26,005 INFO L290 TraceCheckUtils]: 8: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-08 12:37:26,005 INFO L290 TraceCheckUtils]: 9: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-08 12:37:26,005 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23501#true} {23501#true} #90#return; {23501#true} is VALID [2022-04-08 12:37:26,005 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-08 12:37:26,005 INFO L290 TraceCheckUtils]: 12: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-08 12:37:26,006 INFO L290 TraceCheckUtils]: 13: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-08 12:37:26,006 INFO L290 TraceCheckUtils]: 14: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-08 12:37:26,006 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {23501#true} {23501#true} #92#return; {23501#true} is VALID [2022-04-08 12:37:26,006 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-08 12:37:26,006 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-08 12:37:26,007 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-08 12:37:26,007 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-08 12:37:26,007 INFO L290 TraceCheckUtils]: 20: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-08 12:37:26,007 INFO L290 TraceCheckUtils]: 21: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-08 12:37:26,007 INFO L290 TraceCheckUtils]: 22: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-08 12:37:26,007 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {23501#true} {23554#(<= main_~v~0 1)} #94#return; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 12:37:26,008 INFO L290 TraceCheckUtils]: 24: Hoare triple {23554#(<= main_~v~0 1)} assume !!(0 != ~r~0); {23554#(<= main_~v~0 1)} is VALID [2022-04-08 12:37:26,008 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-08 12:37:26,008 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-08 12:37:26,008 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-08 12:37:26,008 INFO L290 TraceCheckUtils]: 28: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-08 12:37:26,008 INFO L290 TraceCheckUtils]: 29: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-08 12:37:26,008 INFO L290 TraceCheckUtils]: 30: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-08 12:37:26,009 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {23501#true} {23554#(<= main_~v~0 1)} #96#return; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 12:37:26,009 INFO L290 TraceCheckUtils]: 32: Hoare triple {23554#(<= main_~v~0 1)} assume !(~r~0 > 0); {23554#(<= main_~v~0 1)} is VALID [2022-04-08 12:37:26,009 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-08 12:37:26,010 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-08 12:37:26,010 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-08 12:37:26,010 INFO L290 TraceCheckUtils]: 36: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-08 12:37:26,010 INFO L290 TraceCheckUtils]: 37: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-08 12:37:26,010 INFO L290 TraceCheckUtils]: 38: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-08 12:37:26,010 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {23501#true} {23554#(<= main_~v~0 1)} #98#return; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 12:37:26,011 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-08 12:37:26,011 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-08 12:37:26,011 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-08 12:37:26,011 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-08 12:37:26,011 INFO L290 TraceCheckUtils]: 44: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-08 12:37:26,011 INFO L290 TraceCheckUtils]: 45: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-08 12:37:26,012 INFO L290 TraceCheckUtils]: 46: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-08 12:37:26,012 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {23501#true} {23554#(<= main_~v~0 1)} #98#return; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 12:37:26,012 INFO L290 TraceCheckUtils]: 48: Hoare triple {23554#(<= main_~v~0 1)} assume !(~r~0 < 0); {23554#(<= main_~v~0 1)} is VALID [2022-04-08 12:37:26,012 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-08 12:37:26,013 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-08 12:37:26,013 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-08 12:37:26,013 INFO L290 TraceCheckUtils]: 52: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-08 12:37:26,013 INFO L290 TraceCheckUtils]: 53: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-08 12:37:26,013 INFO L290 TraceCheckUtils]: 54: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-08 12:37:26,013 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {23501#true} {23554#(<= main_~v~0 1)} #94#return; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 12:37:26,014 INFO L290 TraceCheckUtils]: 56: Hoare triple {23554#(<= main_~v~0 1)} assume !!(0 != ~r~0); {23554#(<= main_~v~0 1)} is VALID [2022-04-08 12:37:26,014 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-08 12:37:26,014 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-08 12:37:26,015 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-08 12:37:26,015 INFO L290 TraceCheckUtils]: 60: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-08 12:37:26,015 INFO L290 TraceCheckUtils]: 61: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-08 12:37:26,015 INFO L290 TraceCheckUtils]: 62: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-08 12:37:26,024 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {23501#true} {23554#(<= main_~v~0 1)} #96#return; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 12:37:26,025 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-08 12:37:26,025 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-08 12:37:26,025 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-08 12:37:26,025 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-08 12:37:26,025 INFO L290 TraceCheckUtils]: 68: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-08 12:37:26,025 INFO L290 TraceCheckUtils]: 69: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-08 12:37:26,025 INFO L290 TraceCheckUtils]: 70: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-08 12:37:26,026 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-08 12:37:26,026 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-08 12:37:26,026 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-08 12:37:26,027 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-08 12:37:26,027 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-08 12:37:26,027 INFO L290 TraceCheckUtils]: 76: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-08 12:37:26,027 INFO L290 TraceCheckUtils]: 77: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-08 12:37:26,027 INFO L290 TraceCheckUtils]: 78: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-08 12:37:26,027 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-08 12:37:26,028 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-08 12:37:26,028 INFO L290 TraceCheckUtils]: 81: Hoare triple {23502#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23502#false} is VALID [2022-04-08 12:37:26,028 INFO L290 TraceCheckUtils]: 82: Hoare triple {23502#false} assume !(#t~post8 < 20);havoc #t~post8; {23502#false} is VALID [2022-04-08 12:37:26,029 INFO L290 TraceCheckUtils]: 83: Hoare triple {23502#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23502#false} is VALID [2022-04-08 12:37:26,029 INFO L290 TraceCheckUtils]: 84: Hoare triple {23502#false} assume !(#t~post6 < 20);havoc #t~post6; {23502#false} is VALID [2022-04-08 12:37:26,029 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-08 12:37:26,029 INFO L290 TraceCheckUtils]: 86: Hoare triple {23502#false} ~cond := #in~cond; {23502#false} is VALID [2022-04-08 12:37:26,029 INFO L290 TraceCheckUtils]: 87: Hoare triple {23502#false} assume 0 == ~cond; {23502#false} is VALID [2022-04-08 12:37:26,029 INFO L290 TraceCheckUtils]: 88: Hoare triple {23502#false} assume !false; {23502#false} is VALID [2022-04-08 12:37:26,029 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-08 12:37:26,029 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:37:26,252 INFO L290 TraceCheckUtils]: 88: Hoare triple {23502#false} assume !false; {23502#false} is VALID [2022-04-08 12:37:26,252 INFO L290 TraceCheckUtils]: 87: Hoare triple {23502#false} assume 0 == ~cond; {23502#false} is VALID [2022-04-08 12:37:26,252 INFO L290 TraceCheckUtils]: 86: Hoare triple {23502#false} ~cond := #in~cond; {23502#false} is VALID [2022-04-08 12:37:26,255 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-08 12:37:26,255 INFO L290 TraceCheckUtils]: 84: Hoare triple {23502#false} assume !(#t~post6 < 20);havoc #t~post6; {23502#false} is VALID [2022-04-08 12:37:26,255 INFO L290 TraceCheckUtils]: 83: Hoare triple {23502#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23502#false} is VALID [2022-04-08 12:37:26,255 INFO L290 TraceCheckUtils]: 82: Hoare triple {23502#false} assume !(#t~post8 < 20);havoc #t~post8; {23502#false} is VALID [2022-04-08 12:37:26,256 INFO L290 TraceCheckUtils]: 81: Hoare triple {23502#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23502#false} is VALID [2022-04-08 12:37:26,257 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-08 12:37:26,257 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-08 12:37:26,257 INFO L290 TraceCheckUtils]: 78: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-08 12:37:26,257 INFO L290 TraceCheckUtils]: 77: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-08 12:37:26,257 INFO L290 TraceCheckUtils]: 76: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-08 12:37:26,258 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-08 12:37:26,258 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-08 12:37:26,258 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-08 12:37:26,258 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-08 12:37:26,259 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-08 12:37:26,259 INFO L290 TraceCheckUtils]: 70: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-08 12:37:26,259 INFO L290 TraceCheckUtils]: 69: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-08 12:37:26,259 INFO L290 TraceCheckUtils]: 68: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-08 12:37:26,261 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-08 12:37:26,262 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-08 12:37:26,262 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-08 12:37:26,262 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-08 12:37:26,263 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {23501#true} {23554#(<= main_~v~0 1)} #96#return; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 12:37:26,263 INFO L290 TraceCheckUtils]: 62: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-08 12:37:26,263 INFO L290 TraceCheckUtils]: 61: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-08 12:37:26,263 INFO L290 TraceCheckUtils]: 60: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-08 12:37:26,263 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-08 12:37:26,263 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-08 12:37:26,264 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-08 12:37:26,264 INFO L290 TraceCheckUtils]: 56: Hoare triple {23554#(<= main_~v~0 1)} assume !!(0 != ~r~0); {23554#(<= main_~v~0 1)} is VALID [2022-04-08 12:37:26,264 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {23501#true} {23554#(<= main_~v~0 1)} #94#return; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 12:37:26,264 INFO L290 TraceCheckUtils]: 54: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-08 12:37:26,264 INFO L290 TraceCheckUtils]: 53: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-08 12:37:26,265 INFO L290 TraceCheckUtils]: 52: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-08 12:37:26,265 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-08 12:37:26,265 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-08 12:37:26,265 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-08 12:37:26,265 INFO L290 TraceCheckUtils]: 48: Hoare triple {23554#(<= main_~v~0 1)} assume !(~r~0 < 0); {23554#(<= main_~v~0 1)} is VALID [2022-04-08 12:37:26,266 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {23501#true} {23554#(<= main_~v~0 1)} #98#return; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 12:37:26,266 INFO L290 TraceCheckUtils]: 46: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-08 12:37:26,266 INFO L290 TraceCheckUtils]: 45: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-08 12:37:26,266 INFO L290 TraceCheckUtils]: 44: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-08 12:37:26,266 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-08 12:37:26,266 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-08 12:37:26,267 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-08 12:37:26,267 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-08 12:37:26,267 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {23501#true} {23554#(<= main_~v~0 1)} #98#return; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 12:37:26,267 INFO L290 TraceCheckUtils]: 38: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-08 12:37:26,267 INFO L290 TraceCheckUtils]: 37: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-08 12:37:26,267 INFO L290 TraceCheckUtils]: 36: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-08 12:37:26,268 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-08 12:37:26,268 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-08 12:37:26,268 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-08 12:37:26,268 INFO L290 TraceCheckUtils]: 32: Hoare triple {23554#(<= main_~v~0 1)} assume !(~r~0 > 0); {23554#(<= main_~v~0 1)} is VALID [2022-04-08 12:37:26,269 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {23501#true} {23554#(<= main_~v~0 1)} #96#return; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 12:37:26,269 INFO L290 TraceCheckUtils]: 30: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-08 12:37:26,269 INFO L290 TraceCheckUtils]: 29: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-08 12:37:26,269 INFO L290 TraceCheckUtils]: 28: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-08 12:37:26,269 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-08 12:37:26,269 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-08 12:37:26,270 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-08 12:37:26,270 INFO L290 TraceCheckUtils]: 24: Hoare triple {23554#(<= main_~v~0 1)} assume !!(0 != ~r~0); {23554#(<= main_~v~0 1)} is VALID [2022-04-08 12:37:26,270 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {23501#true} {23554#(<= main_~v~0 1)} #94#return; {23554#(<= main_~v~0 1)} is VALID [2022-04-08 12:37:26,270 INFO L290 TraceCheckUtils]: 22: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-08 12:37:26,270 INFO L290 TraceCheckUtils]: 21: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-08 12:37:26,270 INFO L290 TraceCheckUtils]: 20: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-08 12:37:26,271 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-08 12:37:26,271 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-08 12:37:26,271 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-08 12:37:26,271 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-08 12:37:26,271 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {23501#true} {23501#true} #92#return; {23501#true} is VALID [2022-04-08 12:37:26,272 INFO L290 TraceCheckUtils]: 14: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-08 12:37:26,272 INFO L290 TraceCheckUtils]: 13: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-08 12:37:26,272 INFO L290 TraceCheckUtils]: 12: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-08 12:37:26,272 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-08 12:37:26,272 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23501#true} {23501#true} #90#return; {23501#true} is VALID [2022-04-08 12:37:26,272 INFO L290 TraceCheckUtils]: 9: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-08 12:37:26,272 INFO L290 TraceCheckUtils]: 8: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-08 12:37:26,272 INFO L290 TraceCheckUtils]: 7: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-08 12:37:26,272 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-08 12:37:26,272 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-08 12:37:26,272 INFO L272 TraceCheckUtils]: 4: Hoare triple {23501#true} call #t~ret9 := main(); {23501#true} is VALID [2022-04-08 12:37:26,272 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23501#true} {23501#true} #102#return; {23501#true} is VALID [2022-04-08 12:37:26,272 INFO L290 TraceCheckUtils]: 2: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-08 12:37:26,272 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-08 12:37:26,273 INFO L272 TraceCheckUtils]: 0: Hoare triple {23501#true} call ULTIMATE.init(); {23501#true} is VALID [2022-04-08 12:37:26,273 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-08 12:37:26,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:37:26,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64348027] [2022-04-08 12:37:26,273 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:37:26,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416729428] [2022-04-08 12:37:26,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1416729428] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:37:26,273 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:37:26,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2022-04-08 12:37:26,273 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:37:26,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1305969262] [2022-04-08 12:37:26,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1305969262] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:37:26,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:37:26,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 12:37:26,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965989574] [2022-04-08 12:37:26,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:37:26,274 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-08 12:37:26,274 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:37:26,274 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-08 12:37:26,307 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-08 12:37:26,308 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 12:37:26,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:37:26,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 12:37:26,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 12:37:26,308 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-08 12:37:26,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:37:26,892 INFO L93 Difference]: Finished difference Result 407 states and 543 transitions. [2022-04-08 12:37:26,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 12:37:26,892 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-08 12:37:26,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:37:26,892 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-08 12:37:26,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2022-04-08 12:37:26,893 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-08 12:37:26,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2022-04-08 12:37:26,894 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 127 transitions. [2022-04-08 12:37:26,986 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-08 12:37:26,991 INFO L225 Difference]: With dead ends: 407 [2022-04-08 12:37:26,991 INFO L226 Difference]: Without dead ends: 301 [2022-04-08 12:37:26,992 INFO L912 BasicCegarLoop]: 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-08 12:37:26,992 INFO L913 BasicCegarLoop]: 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-08 12:37:26,992 INFO L914 BasicCegarLoop]: 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-08 12:37:26,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2022-04-08 12:37:27,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 296. [2022-04-08 12:37:27,374 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:37:27,374 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-08 12:37:27,374 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-08 12:37:27,375 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-08 12:37:27,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:37:27,383 INFO L93 Difference]: Finished difference Result 301 states and 401 transitions. [2022-04-08 12:37:27,383 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 401 transitions. [2022-04-08 12:37:27,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:37:27,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:37:27,384 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-08 12:37:27,384 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-08 12:37:27,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:37:27,389 INFO L93 Difference]: Finished difference Result 301 states and 401 transitions. [2022-04-08 12:37:27,389 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 401 transitions. [2022-04-08 12:37:27,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:37:27,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:37:27,390 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:37:27,390 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:37:27,390 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-08 12:37:27,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 395 transitions. [2022-04-08 12:37:27,395 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 395 transitions. Word has length 89 [2022-04-08 12:37:27,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:37:27,395 INFO L478 AbstractCegarLoop]: Abstraction has 296 states and 395 transitions. [2022-04-08 12:37:27,396 INFO L479 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-08 12:37:27,396 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 296 states and 395 transitions. [2022-04-08 12:37:28,254 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 395 edges. 395 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:37:28,254 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 395 transitions. [2022-04-08 12:37:28,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-08 12:37:28,255 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:37:28,255 INFO L499 BasicCegarLoop]: 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-08 12:37:28,273 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-08 12:37:28,455 WARN L460 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-08 12:37:28,455 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:37:28,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:37:28,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1322512306, now seen corresponding path program 5 times [2022-04-08 12:37:28,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:37:28,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [437062257] [2022-04-08 12:37:28,456 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:37:28,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1322512306, now seen corresponding path program 6 times [2022-04-08 12:37:28,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:37:28,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913223328] [2022-04-08 12:37:28,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:37:28,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:37:28,467 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:37:28,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2062465488] [2022-04-08 12:37:28,468 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 12:37:28,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:37:28,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:37:28,469 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-08 12:37:28,470 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-08 12:37:28,598 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-08 12:37:28,598 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:37:28,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-08 12:37:28,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:37:28,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:37:29,067 INFO L272 TraceCheckUtils]: 0: Hoare triple {26048#true} call ULTIMATE.init(); {26048#true} is VALID [2022-04-08 12:37:29,067 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-08 12:37:29,067 INFO L290 TraceCheckUtils]: 2: Hoare triple {26056#(<= ~counter~0 0)} assume true; {26056#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:29,068 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26056#(<= ~counter~0 0)} {26048#true} #102#return; {26056#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:29,068 INFO L272 TraceCheckUtils]: 4: Hoare triple {26056#(<= ~counter~0 0)} call #t~ret9 := main(); {26056#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:29,068 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-08 12:37:29,069 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-08 12:37:29,069 INFO L290 TraceCheckUtils]: 7: Hoare triple {26056#(<= ~counter~0 0)} ~cond := #in~cond; {26056#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:29,069 INFO L290 TraceCheckUtils]: 8: Hoare triple {26056#(<= ~counter~0 0)} assume !(0 == ~cond); {26056#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:29,069 INFO L290 TraceCheckUtils]: 9: Hoare triple {26056#(<= ~counter~0 0)} assume true; {26056#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:29,070 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {26056#(<= ~counter~0 0)} {26056#(<= ~counter~0 0)} #90#return; {26056#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:29,070 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-08 12:37:29,070 INFO L290 TraceCheckUtils]: 12: Hoare triple {26056#(<= ~counter~0 0)} ~cond := #in~cond; {26056#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:29,071 INFO L290 TraceCheckUtils]: 13: Hoare triple {26056#(<= ~counter~0 0)} assume !(0 == ~cond); {26056#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:29,071 INFO L290 TraceCheckUtils]: 14: Hoare triple {26056#(<= ~counter~0 0)} assume true; {26056#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:29,071 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {26056#(<= ~counter~0 0)} {26056#(<= ~counter~0 0)} #92#return; {26056#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:29,072 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-08 12:37:29,072 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-08 12:37:29,077 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-08 12:37:29,077 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-08 12:37:29,078 INFO L290 TraceCheckUtils]: 20: Hoare triple {26105#(<= ~counter~0 1)} ~cond := #in~cond; {26105#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:29,079 INFO L290 TraceCheckUtils]: 21: Hoare triple {26105#(<= ~counter~0 1)} assume !(0 == ~cond); {26105#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:29,079 INFO L290 TraceCheckUtils]: 22: Hoare triple {26105#(<= ~counter~0 1)} assume true; {26105#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:29,079 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {26105#(<= ~counter~0 1)} {26105#(<= ~counter~0 1)} #94#return; {26105#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:29,080 INFO L290 TraceCheckUtils]: 24: Hoare triple {26105#(<= ~counter~0 1)} assume !!(0 != ~r~0); {26105#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:29,080 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-08 12:37:29,081 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-08 12:37:29,081 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-08 12:37:29,081 INFO L290 TraceCheckUtils]: 28: Hoare triple {26130#(<= ~counter~0 2)} ~cond := #in~cond; {26130#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:29,082 INFO L290 TraceCheckUtils]: 29: Hoare triple {26130#(<= ~counter~0 2)} assume !(0 == ~cond); {26130#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:29,082 INFO L290 TraceCheckUtils]: 30: Hoare triple {26130#(<= ~counter~0 2)} assume true; {26130#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:29,083 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {26130#(<= ~counter~0 2)} {26130#(<= ~counter~0 2)} #96#return; {26130#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:29,083 INFO L290 TraceCheckUtils]: 32: Hoare triple {26130#(<= ~counter~0 2)} assume !(~r~0 > 0); {26130#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:29,084 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-08 12:37:29,084 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-08 12:37:29,084 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-08 12:37:29,085 INFO L290 TraceCheckUtils]: 36: Hoare triple {26155#(<= ~counter~0 3)} ~cond := #in~cond; {26155#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:29,085 INFO L290 TraceCheckUtils]: 37: Hoare triple {26155#(<= ~counter~0 3)} assume !(0 == ~cond); {26155#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:29,085 INFO L290 TraceCheckUtils]: 38: Hoare triple {26155#(<= ~counter~0 3)} assume true; {26155#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:29,085 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {26155#(<= ~counter~0 3)} {26155#(<= ~counter~0 3)} #98#return; {26155#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:29,086 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-08 12:37:29,086 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-08 12:37:29,087 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-08 12:37:29,087 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-08 12:37:29,087 INFO L290 TraceCheckUtils]: 44: Hoare triple {26180#(<= ~counter~0 4)} ~cond := #in~cond; {26180#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:29,087 INFO L290 TraceCheckUtils]: 45: Hoare triple {26180#(<= ~counter~0 4)} assume !(0 == ~cond); {26180#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:29,088 INFO L290 TraceCheckUtils]: 46: Hoare triple {26180#(<= ~counter~0 4)} assume true; {26180#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:29,088 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {26180#(<= ~counter~0 4)} {26180#(<= ~counter~0 4)} #98#return; {26180#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:29,088 INFO L290 TraceCheckUtils]: 48: Hoare triple {26180#(<= ~counter~0 4)} assume !(~r~0 < 0); {26180#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:29,089 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-08 12:37:29,089 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-08 12:37:29,090 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-08 12:37:29,090 INFO L290 TraceCheckUtils]: 52: Hoare triple {26205#(<= ~counter~0 5)} ~cond := #in~cond; {26205#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:29,090 INFO L290 TraceCheckUtils]: 53: Hoare triple {26205#(<= ~counter~0 5)} assume !(0 == ~cond); {26205#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:29,090 INFO L290 TraceCheckUtils]: 54: Hoare triple {26205#(<= ~counter~0 5)} assume true; {26205#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:29,091 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {26205#(<= ~counter~0 5)} {26205#(<= ~counter~0 5)} #94#return; {26205#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:29,091 INFO L290 TraceCheckUtils]: 56: Hoare triple {26205#(<= ~counter~0 5)} assume !!(0 != ~r~0); {26205#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:29,092 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-08 12:37:29,092 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-08 12:37:29,092 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-08 12:37:29,093 INFO L290 TraceCheckUtils]: 60: Hoare triple {26230#(<= ~counter~0 6)} ~cond := #in~cond; {26230#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:29,093 INFO L290 TraceCheckUtils]: 61: Hoare triple {26230#(<= ~counter~0 6)} assume !(0 == ~cond); {26230#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:29,093 INFO L290 TraceCheckUtils]: 62: Hoare triple {26230#(<= ~counter~0 6)} assume true; {26230#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:29,094 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {26230#(<= ~counter~0 6)} {26230#(<= ~counter~0 6)} #96#return; {26230#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:29,094 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-08 12:37:29,094 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-08 12:37:29,095 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-08 12:37:29,095 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-08 12:37:29,095 INFO L290 TraceCheckUtils]: 68: Hoare triple {26255#(<= ~counter~0 7)} ~cond := #in~cond; {26255#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:29,096 INFO L290 TraceCheckUtils]: 69: Hoare triple {26255#(<= ~counter~0 7)} assume !(0 == ~cond); {26255#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:29,096 INFO L290 TraceCheckUtils]: 70: Hoare triple {26255#(<= ~counter~0 7)} assume true; {26255#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:29,096 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {26255#(<= ~counter~0 7)} {26255#(<= ~counter~0 7)} #96#return; {26255#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:29,097 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-08 12:37:29,097 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-08 12:37:29,097 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-08 12:37:29,098 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-08 12:37:29,098 INFO L290 TraceCheckUtils]: 76: Hoare triple {26280#(<= ~counter~0 8)} ~cond := #in~cond; {26280#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:29,098 INFO L290 TraceCheckUtils]: 77: Hoare triple {26280#(<= ~counter~0 8)} assume !(0 == ~cond); {26280#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:29,099 INFO L290 TraceCheckUtils]: 78: Hoare triple {26280#(<= ~counter~0 8)} assume true; {26280#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:29,099 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {26280#(<= ~counter~0 8)} {26280#(<= ~counter~0 8)} #96#return; {26280#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:29,099 INFO L290 TraceCheckUtils]: 80: Hoare triple {26280#(<= ~counter~0 8)} assume !(~r~0 > 0); {26280#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:29,100 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-08 12:37:29,100 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-08 12:37:29,100 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-08 12:37:29,101 INFO L290 TraceCheckUtils]: 84: Hoare triple {26312#(<= |main_#t~post6| 9)} assume !(#t~post6 < 20);havoc #t~post6; {26049#false} is VALID [2022-04-08 12:37:29,101 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-08 12:37:29,101 INFO L290 TraceCheckUtils]: 86: Hoare triple {26049#false} ~cond := #in~cond; {26049#false} is VALID [2022-04-08 12:37:29,101 INFO L290 TraceCheckUtils]: 87: Hoare triple {26049#false} assume 0 == ~cond; {26049#false} is VALID [2022-04-08 12:37:29,101 INFO L290 TraceCheckUtils]: 88: Hoare triple {26049#false} assume !false; {26049#false} is VALID [2022-04-08 12:37:29,101 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-08 12:37:29,101 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:37:29,549 INFO L290 TraceCheckUtils]: 88: Hoare triple {26049#false} assume !false; {26049#false} is VALID [2022-04-08 12:37:29,549 INFO L290 TraceCheckUtils]: 87: Hoare triple {26049#false} assume 0 == ~cond; {26049#false} is VALID [2022-04-08 12:37:29,550 INFO L290 TraceCheckUtils]: 86: Hoare triple {26049#false} ~cond := #in~cond; {26049#false} is VALID [2022-04-08 12:37:29,550 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-08 12:37:29,551 INFO L290 TraceCheckUtils]: 84: Hoare triple {26340#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {26049#false} is VALID [2022-04-08 12:37:29,551 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-08 12:37:29,551 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-08 12:37:29,552 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-08 12:37:29,552 INFO L290 TraceCheckUtils]: 80: Hoare triple {26351#(< ~counter~0 19)} assume !(~r~0 > 0); {26351#(< ~counter~0 19)} is VALID [2022-04-08 12:37:29,553 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {26048#true} {26351#(< ~counter~0 19)} #96#return; {26351#(< ~counter~0 19)} is VALID [2022-04-08 12:37:29,553 INFO L290 TraceCheckUtils]: 78: Hoare triple {26048#true} assume true; {26048#true} is VALID [2022-04-08 12:37:29,553 INFO L290 TraceCheckUtils]: 77: Hoare triple {26048#true} assume !(0 == ~cond); {26048#true} is VALID [2022-04-08 12:37:29,553 INFO L290 TraceCheckUtils]: 76: Hoare triple {26048#true} ~cond := #in~cond; {26048#true} is VALID [2022-04-08 12:37:29,553 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-08 12:37:29,553 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-08 12:37:29,554 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-08 12:37:29,554 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-08 12:37:29,555 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {26048#true} {26376#(< ~counter~0 18)} #96#return; {26376#(< ~counter~0 18)} is VALID [2022-04-08 12:37:29,555 INFO L290 TraceCheckUtils]: 70: Hoare triple {26048#true} assume true; {26048#true} is VALID [2022-04-08 12:37:29,555 INFO L290 TraceCheckUtils]: 69: Hoare triple {26048#true} assume !(0 == ~cond); {26048#true} is VALID [2022-04-08 12:37:29,555 INFO L290 TraceCheckUtils]: 68: Hoare triple {26048#true} ~cond := #in~cond; {26048#true} is VALID [2022-04-08 12:37:29,555 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-08 12:37:29,560 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-08 12:37:29,561 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-08 12:37:29,561 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-08 12:37:29,562 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {26048#true} {26401#(< ~counter~0 17)} #96#return; {26401#(< ~counter~0 17)} is VALID [2022-04-08 12:37:29,562 INFO L290 TraceCheckUtils]: 62: Hoare triple {26048#true} assume true; {26048#true} is VALID [2022-04-08 12:37:29,562 INFO L290 TraceCheckUtils]: 61: Hoare triple {26048#true} assume !(0 == ~cond); {26048#true} is VALID [2022-04-08 12:37:29,562 INFO L290 TraceCheckUtils]: 60: Hoare triple {26048#true} ~cond := #in~cond; {26048#true} is VALID [2022-04-08 12:37:29,562 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-08 12:37:29,562 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-08 12:37:29,563 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-08 12:37:29,563 INFO L290 TraceCheckUtils]: 56: Hoare triple {26426#(< ~counter~0 16)} assume !!(0 != ~r~0); {26426#(< ~counter~0 16)} is VALID [2022-04-08 12:37:29,564 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {26048#true} {26426#(< ~counter~0 16)} #94#return; {26426#(< ~counter~0 16)} is VALID [2022-04-08 12:37:29,564 INFO L290 TraceCheckUtils]: 54: Hoare triple {26048#true} assume true; {26048#true} is VALID [2022-04-08 12:37:29,564 INFO L290 TraceCheckUtils]: 53: Hoare triple {26048#true} assume !(0 == ~cond); {26048#true} is VALID [2022-04-08 12:37:29,564 INFO L290 TraceCheckUtils]: 52: Hoare triple {26048#true} ~cond := #in~cond; {26048#true} is VALID [2022-04-08 12:37:29,564 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-08 12:37:29,564 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-08 12:37:29,565 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-08 12:37:29,565 INFO L290 TraceCheckUtils]: 48: Hoare triple {26451#(< ~counter~0 15)} assume !(~r~0 < 0); {26451#(< ~counter~0 15)} is VALID [2022-04-08 12:37:29,565 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {26048#true} {26451#(< ~counter~0 15)} #98#return; {26451#(< ~counter~0 15)} is VALID [2022-04-08 12:37:29,565 INFO L290 TraceCheckUtils]: 46: Hoare triple {26048#true} assume true; {26048#true} is VALID [2022-04-08 12:37:29,565 INFO L290 TraceCheckUtils]: 45: Hoare triple {26048#true} assume !(0 == ~cond); {26048#true} is VALID [2022-04-08 12:37:29,566 INFO L290 TraceCheckUtils]: 44: Hoare triple {26048#true} ~cond := #in~cond; {26048#true} is VALID [2022-04-08 12:37:29,566 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-08 12:37:29,566 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-08 12:37:29,566 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-08 12:37:29,567 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-08 12:37:29,567 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {26048#true} {26476#(< ~counter~0 14)} #98#return; {26476#(< ~counter~0 14)} is VALID [2022-04-08 12:37:29,567 INFO L290 TraceCheckUtils]: 38: Hoare triple {26048#true} assume true; {26048#true} is VALID [2022-04-08 12:37:29,567 INFO L290 TraceCheckUtils]: 37: Hoare triple {26048#true} assume !(0 == ~cond); {26048#true} is VALID [2022-04-08 12:37:29,567 INFO L290 TraceCheckUtils]: 36: Hoare triple {26048#true} ~cond := #in~cond; {26048#true} is VALID [2022-04-08 12:37:29,567 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-08 12:37:29,568 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-08 12:37:29,568 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-08 12:37:29,568 INFO L290 TraceCheckUtils]: 32: Hoare triple {26501#(< ~counter~0 13)} assume !(~r~0 > 0); {26501#(< ~counter~0 13)} is VALID [2022-04-08 12:37:29,569 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {26048#true} {26501#(< ~counter~0 13)} #96#return; {26501#(< ~counter~0 13)} is VALID [2022-04-08 12:37:29,569 INFO L290 TraceCheckUtils]: 30: Hoare triple {26048#true} assume true; {26048#true} is VALID [2022-04-08 12:37:29,569 INFO L290 TraceCheckUtils]: 29: Hoare triple {26048#true} assume !(0 == ~cond); {26048#true} is VALID [2022-04-08 12:37:29,569 INFO L290 TraceCheckUtils]: 28: Hoare triple {26048#true} ~cond := #in~cond; {26048#true} is VALID [2022-04-08 12:37:29,569 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-08 12:37:29,569 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-08 12:37:29,570 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-08 12:37:29,570 INFO L290 TraceCheckUtils]: 24: Hoare triple {26526#(< ~counter~0 12)} assume !!(0 != ~r~0); {26526#(< ~counter~0 12)} is VALID [2022-04-08 12:37:29,571 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {26048#true} {26526#(< ~counter~0 12)} #94#return; {26526#(< ~counter~0 12)} is VALID [2022-04-08 12:37:29,571 INFO L290 TraceCheckUtils]: 22: Hoare triple {26048#true} assume true; {26048#true} is VALID [2022-04-08 12:37:29,571 INFO L290 TraceCheckUtils]: 21: Hoare triple {26048#true} assume !(0 == ~cond); {26048#true} is VALID [2022-04-08 12:37:29,571 INFO L290 TraceCheckUtils]: 20: Hoare triple {26048#true} ~cond := #in~cond; {26048#true} is VALID [2022-04-08 12:37:29,571 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-08 12:37:29,571 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-08 12:37:29,572 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-08 12:37:29,572 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-08 12:37:29,572 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {26048#true} {26551#(< ~counter~0 11)} #92#return; {26551#(< ~counter~0 11)} is VALID [2022-04-08 12:37:29,572 INFO L290 TraceCheckUtils]: 14: Hoare triple {26048#true} assume true; {26048#true} is VALID [2022-04-08 12:37:29,582 INFO L290 TraceCheckUtils]: 13: Hoare triple {26048#true} assume !(0 == ~cond); {26048#true} is VALID [2022-04-08 12:37:29,583 INFO L290 TraceCheckUtils]: 12: Hoare triple {26048#true} ~cond := #in~cond; {26048#true} is VALID [2022-04-08 12:37:29,583 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-08 12:37:29,583 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {26048#true} {26551#(< ~counter~0 11)} #90#return; {26551#(< ~counter~0 11)} is VALID [2022-04-08 12:37:29,584 INFO L290 TraceCheckUtils]: 9: Hoare triple {26048#true} assume true; {26048#true} is VALID [2022-04-08 12:37:29,584 INFO L290 TraceCheckUtils]: 8: Hoare triple {26048#true} assume !(0 == ~cond); {26048#true} is VALID [2022-04-08 12:37:29,584 INFO L290 TraceCheckUtils]: 7: Hoare triple {26048#true} ~cond := #in~cond; {26048#true} is VALID [2022-04-08 12:37:29,584 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-08 12:37:29,584 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-08 12:37:29,584 INFO L272 TraceCheckUtils]: 4: Hoare triple {26551#(< ~counter~0 11)} call #t~ret9 := main(); {26551#(< ~counter~0 11)} is VALID [2022-04-08 12:37:29,585 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26551#(< ~counter~0 11)} {26048#true} #102#return; {26551#(< ~counter~0 11)} is VALID [2022-04-08 12:37:29,585 INFO L290 TraceCheckUtils]: 2: Hoare triple {26551#(< ~counter~0 11)} assume true; {26551#(< ~counter~0 11)} is VALID [2022-04-08 12:37:29,585 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-08 12:37:29,585 INFO L272 TraceCheckUtils]: 0: Hoare triple {26048#true} call ULTIMATE.init(); {26048#true} is VALID [2022-04-08 12:37:29,586 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-08 12:37:29,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:37:29,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913223328] [2022-04-08 12:37:29,586 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:37:29,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2062465488] [2022-04-08 12:37:29,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2062465488] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:37:29,586 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:37:29,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-04-08 12:37:29,586 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:37:29,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [437062257] [2022-04-08 12:37:29,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [437062257] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:37:29,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:37:29,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 12:37:29,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807319644] [2022-04-08 12:37:29,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:37:29,587 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-08 12:37:29,587 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:37:29,587 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-08 12:37:29,642 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-08 12:37:29,642 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 12:37:29,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:37:29,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 12:37:29,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-08 12:37:29,643 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-08 12:37:30,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:37:30,636 INFO L93 Difference]: Finished difference Result 362 states and 486 transitions. [2022-04-08 12:37:30,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-08 12:37:30,636 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-08 12:37:30,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:37:30,637 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-08 12:37:30,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 197 transitions. [2022-04-08 12:37:30,638 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-08 12:37:30,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 197 transitions. [2022-04-08 12:37:30,639 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 197 transitions. [2022-04-08 12:37:30,802 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-08 12:37:30,808 INFO L225 Difference]: With dead ends: 362 [2022-04-08 12:37:30,808 INFO L226 Difference]: Without dead ends: 357 [2022-04-08 12:37:30,809 INFO L912 BasicCegarLoop]: 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-08 12:37:30,809 INFO L913 BasicCegarLoop]: 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-08 12:37:30,809 INFO L914 BasicCegarLoop]: 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-08 12:37:30,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2022-04-08 12:37:31,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 342. [2022-04-08 12:37:31,266 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:37:31,267 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-08 12:37:31,267 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-08 12:37:31,267 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-08 12:37:31,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:37:31,273 INFO L93 Difference]: Finished difference Result 357 states and 477 transitions. [2022-04-08 12:37:31,273 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 477 transitions. [2022-04-08 12:37:31,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:37:31,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:37:31,274 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-08 12:37:31,274 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-08 12:37:31,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:37:31,279 INFO L93 Difference]: Finished difference Result 357 states and 477 transitions. [2022-04-08 12:37:31,279 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 477 transitions. [2022-04-08 12:37:31,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:37:31,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:37:31,280 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:37:31,280 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:37:31,280 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-08 12:37:31,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 460 transitions. [2022-04-08 12:37:31,287 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 460 transitions. Word has length 89 [2022-04-08 12:37:31,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:37:31,287 INFO L478 AbstractCegarLoop]: Abstraction has 342 states and 460 transitions. [2022-04-08 12:37:31,287 INFO L479 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-08 12:37:31,287 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 342 states and 460 transitions. [2022-04-08 12:37:32,579 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-08 12:37:32,579 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 460 transitions. [2022-04-08 12:37:32,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-08 12:37:32,580 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:37:32,580 INFO L499 BasicCegarLoop]: 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-08 12:37:32,586 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-04-08 12:37:32,780 WARN L460 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-08 12:37:32,780 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:37:32,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:37:32,781 INFO L85 PathProgramCache]: Analyzing trace with hash -345961389, now seen corresponding path program 5 times [2022-04-08 12:37:32,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:37:32,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2039291997] [2022-04-08 12:37:32,781 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:37:32,781 INFO L85 PathProgramCache]: Analyzing trace with hash -345961389, now seen corresponding path program 6 times [2022-04-08 12:37:32,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:37:32,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395395556] [2022-04-08 12:37:32,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:37:32,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:37:32,792 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:37:32,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [314093077] [2022-04-08 12:37:32,792 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 12:37:32,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:37:32,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:37:32,793 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-08 12:37:32,794 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-08 12:37:32,936 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-08 12:37:32,936 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:37:32,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-08 12:37:32,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:37:32,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:37:33,330 INFO L272 TraceCheckUtils]: 0: Hoare triple {28739#true} call ULTIMATE.init(); {28739#true} is VALID [2022-04-08 12:37:33,331 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-08 12:37:33,331 INFO L290 TraceCheckUtils]: 2: Hoare triple {28747#(<= ~counter~0 0)} assume true; {28747#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:33,331 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28747#(<= ~counter~0 0)} {28739#true} #102#return; {28747#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:33,332 INFO L272 TraceCheckUtils]: 4: Hoare triple {28747#(<= ~counter~0 0)} call #t~ret9 := main(); {28747#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:33,332 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-08 12:37:33,332 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-08 12:37:33,332 INFO L290 TraceCheckUtils]: 7: Hoare triple {28747#(<= ~counter~0 0)} ~cond := #in~cond; {28747#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:33,333 INFO L290 TraceCheckUtils]: 8: Hoare triple {28747#(<= ~counter~0 0)} assume !(0 == ~cond); {28747#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:33,333 INFO L290 TraceCheckUtils]: 9: Hoare triple {28747#(<= ~counter~0 0)} assume true; {28747#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:33,333 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {28747#(<= ~counter~0 0)} {28747#(<= ~counter~0 0)} #90#return; {28747#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:33,334 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-08 12:37:33,334 INFO L290 TraceCheckUtils]: 12: Hoare triple {28747#(<= ~counter~0 0)} ~cond := #in~cond; {28747#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:33,334 INFO L290 TraceCheckUtils]: 13: Hoare triple {28747#(<= ~counter~0 0)} assume !(0 == ~cond); {28747#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:33,334 INFO L290 TraceCheckUtils]: 14: Hoare triple {28747#(<= ~counter~0 0)} assume true; {28747#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:33,335 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {28747#(<= ~counter~0 0)} {28747#(<= ~counter~0 0)} #92#return; {28747#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:33,335 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-08 12:37:33,336 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-08 12:37:33,336 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-08 12:37:33,337 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-08 12:37:33,337 INFO L290 TraceCheckUtils]: 20: Hoare triple {28796#(<= ~counter~0 1)} ~cond := #in~cond; {28796#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:33,337 INFO L290 TraceCheckUtils]: 21: Hoare triple {28796#(<= ~counter~0 1)} assume !(0 == ~cond); {28796#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:33,337 INFO L290 TraceCheckUtils]: 22: Hoare triple {28796#(<= ~counter~0 1)} assume true; {28796#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:33,338 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {28796#(<= ~counter~0 1)} {28796#(<= ~counter~0 1)} #94#return; {28796#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:33,338 INFO L290 TraceCheckUtils]: 24: Hoare triple {28796#(<= ~counter~0 1)} assume !!(0 != ~r~0); {28796#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:33,339 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-08 12:37:33,339 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-08 12:37:33,340 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-08 12:37:33,340 INFO L290 TraceCheckUtils]: 28: Hoare triple {28821#(<= ~counter~0 2)} ~cond := #in~cond; {28821#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:33,340 INFO L290 TraceCheckUtils]: 29: Hoare triple {28821#(<= ~counter~0 2)} assume !(0 == ~cond); {28821#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:33,341 INFO L290 TraceCheckUtils]: 30: Hoare triple {28821#(<= ~counter~0 2)} assume true; {28821#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:33,341 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {28821#(<= ~counter~0 2)} {28821#(<= ~counter~0 2)} #96#return; {28821#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:33,341 INFO L290 TraceCheckUtils]: 32: Hoare triple {28821#(<= ~counter~0 2)} assume !(~r~0 > 0); {28821#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:33,342 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-08 12:37:33,342 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-08 12:37:33,343 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-08 12:37:33,343 INFO L290 TraceCheckUtils]: 36: Hoare triple {28846#(<= ~counter~0 3)} ~cond := #in~cond; {28846#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:33,343 INFO L290 TraceCheckUtils]: 37: Hoare triple {28846#(<= ~counter~0 3)} assume !(0 == ~cond); {28846#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:33,343 INFO L290 TraceCheckUtils]: 38: Hoare triple {28846#(<= ~counter~0 3)} assume true; {28846#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:33,344 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {28846#(<= ~counter~0 3)} {28846#(<= ~counter~0 3)} #98#return; {28846#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:33,344 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-08 12:37:33,345 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-08 12:37:33,345 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-08 12:37:33,345 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-08 12:37:33,346 INFO L290 TraceCheckUtils]: 44: Hoare triple {28871#(<= ~counter~0 4)} ~cond := #in~cond; {28871#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:33,346 INFO L290 TraceCheckUtils]: 45: Hoare triple {28871#(<= ~counter~0 4)} assume !(0 == ~cond); {28871#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:33,346 INFO L290 TraceCheckUtils]: 46: Hoare triple {28871#(<= ~counter~0 4)} assume true; {28871#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:33,347 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {28871#(<= ~counter~0 4)} {28871#(<= ~counter~0 4)} #98#return; {28871#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:33,347 INFO L290 TraceCheckUtils]: 48: Hoare triple {28871#(<= ~counter~0 4)} assume !(~r~0 < 0); {28871#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:33,347 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-08 12:37:33,348 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-08 12:37:33,348 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-08 12:37:33,348 INFO L290 TraceCheckUtils]: 52: Hoare triple {28896#(<= ~counter~0 5)} ~cond := #in~cond; {28896#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:33,349 INFO L290 TraceCheckUtils]: 53: Hoare triple {28896#(<= ~counter~0 5)} assume !(0 == ~cond); {28896#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:33,349 INFO L290 TraceCheckUtils]: 54: Hoare triple {28896#(<= ~counter~0 5)} assume true; {28896#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:33,349 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {28896#(<= ~counter~0 5)} {28896#(<= ~counter~0 5)} #94#return; {28896#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:33,350 INFO L290 TraceCheckUtils]: 56: Hoare triple {28896#(<= ~counter~0 5)} assume !!(0 != ~r~0); {28896#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:33,350 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-08 12:37:33,350 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-08 12:37:33,351 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-08 12:37:33,351 INFO L290 TraceCheckUtils]: 60: Hoare triple {28921#(<= ~counter~0 6)} ~cond := #in~cond; {28921#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:33,351 INFO L290 TraceCheckUtils]: 61: Hoare triple {28921#(<= ~counter~0 6)} assume !(0 == ~cond); {28921#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:33,352 INFO L290 TraceCheckUtils]: 62: Hoare triple {28921#(<= ~counter~0 6)} assume true; {28921#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:33,352 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {28921#(<= ~counter~0 6)} {28921#(<= ~counter~0 6)} #96#return; {28921#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:33,352 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-08 12:37:33,353 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-08 12:37:33,353 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-08 12:37:33,353 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-08 12:37:33,354 INFO L290 TraceCheckUtils]: 68: Hoare triple {28946#(<= ~counter~0 7)} ~cond := #in~cond; {28946#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:33,354 INFO L290 TraceCheckUtils]: 69: Hoare triple {28946#(<= ~counter~0 7)} assume !(0 == ~cond); {28946#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:33,354 INFO L290 TraceCheckUtils]: 70: Hoare triple {28946#(<= ~counter~0 7)} assume true; {28946#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:33,355 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {28946#(<= ~counter~0 7)} {28946#(<= ~counter~0 7)} #96#return; {28946#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:33,355 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-08 12:37:33,356 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-08 12:37:33,356 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-08 12:37:33,356 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-08 12:37:33,356 INFO L290 TraceCheckUtils]: 76: Hoare triple {28971#(<= ~counter~0 8)} ~cond := #in~cond; {28971#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:33,357 INFO L290 TraceCheckUtils]: 77: Hoare triple {28971#(<= ~counter~0 8)} assume !(0 == ~cond); {28971#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:33,357 INFO L290 TraceCheckUtils]: 78: Hoare triple {28971#(<= ~counter~0 8)} assume true; {28971#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:33,357 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {28971#(<= ~counter~0 8)} {28971#(<= ~counter~0 8)} #96#return; {28971#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:33,358 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-08 12:37:33,358 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-08 12:37:33,358 INFO L290 TraceCheckUtils]: 82: Hoare triple {28996#(<= |main_#t~post7| 8)} assume !(#t~post7 < 20);havoc #t~post7; {28740#false} is VALID [2022-04-08 12:37:33,358 INFO L290 TraceCheckUtils]: 83: Hoare triple {28740#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {28740#false} is VALID [2022-04-08 12:37:33,359 INFO L290 TraceCheckUtils]: 84: Hoare triple {28740#false} assume !(#t~post8 < 20);havoc #t~post8; {28740#false} is VALID [2022-04-08 12:37:33,359 INFO L290 TraceCheckUtils]: 85: Hoare triple {28740#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {28740#false} is VALID [2022-04-08 12:37:33,359 INFO L290 TraceCheckUtils]: 86: Hoare triple {28740#false} assume !(#t~post6 < 20);havoc #t~post6; {28740#false} is VALID [2022-04-08 12:37:33,359 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-08 12:37:33,359 INFO L290 TraceCheckUtils]: 88: Hoare triple {28740#false} ~cond := #in~cond; {28740#false} is VALID [2022-04-08 12:37:33,359 INFO L290 TraceCheckUtils]: 89: Hoare triple {28740#false} assume 0 == ~cond; {28740#false} is VALID [2022-04-08 12:37:33,359 INFO L290 TraceCheckUtils]: 90: Hoare triple {28740#false} assume !false; {28740#false} is VALID [2022-04-08 12:37:33,359 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-08 12:37:33,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:37:33,805 INFO L290 TraceCheckUtils]: 90: Hoare triple {28740#false} assume !false; {28740#false} is VALID [2022-04-08 12:37:33,806 INFO L290 TraceCheckUtils]: 89: Hoare triple {28740#false} assume 0 == ~cond; {28740#false} is VALID [2022-04-08 12:37:33,806 INFO L290 TraceCheckUtils]: 88: Hoare triple {28740#false} ~cond := #in~cond; {28740#false} is VALID [2022-04-08 12:37:33,806 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-08 12:37:33,806 INFO L290 TraceCheckUtils]: 86: Hoare triple {28740#false} assume !(#t~post6 < 20);havoc #t~post6; {28740#false} is VALID [2022-04-08 12:37:33,806 INFO L290 TraceCheckUtils]: 85: Hoare triple {28740#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {28740#false} is VALID [2022-04-08 12:37:33,806 INFO L290 TraceCheckUtils]: 84: Hoare triple {28740#false} assume !(#t~post8 < 20);havoc #t~post8; {28740#false} is VALID [2022-04-08 12:37:33,806 INFO L290 TraceCheckUtils]: 83: Hoare triple {28740#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {28740#false} is VALID [2022-04-08 12:37:33,806 INFO L290 TraceCheckUtils]: 82: Hoare triple {29048#(< |main_#t~post7| 20)} assume !(#t~post7 < 20);havoc #t~post7; {28740#false} is VALID [2022-04-08 12:37:33,807 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-08 12:37:33,807 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-08 12:37:33,808 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {28739#true} {29052#(< ~counter~0 20)} #96#return; {29052#(< ~counter~0 20)} is VALID [2022-04-08 12:37:33,808 INFO L290 TraceCheckUtils]: 78: Hoare triple {28739#true} assume true; {28739#true} is VALID [2022-04-08 12:37:33,808 INFO L290 TraceCheckUtils]: 77: Hoare triple {28739#true} assume !(0 == ~cond); {28739#true} is VALID [2022-04-08 12:37:33,808 INFO L290 TraceCheckUtils]: 76: Hoare triple {28739#true} ~cond := #in~cond; {28739#true} is VALID [2022-04-08 12:37:33,808 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-08 12:37:33,808 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-08 12:37:33,809 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-08 12:37:33,809 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-08 12:37:33,810 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {28739#true} {29077#(< ~counter~0 19)} #96#return; {29077#(< ~counter~0 19)} is VALID [2022-04-08 12:37:33,810 INFO L290 TraceCheckUtils]: 70: Hoare triple {28739#true} assume true; {28739#true} is VALID [2022-04-08 12:37:33,810 INFO L290 TraceCheckUtils]: 69: Hoare triple {28739#true} assume !(0 == ~cond); {28739#true} is VALID [2022-04-08 12:37:33,810 INFO L290 TraceCheckUtils]: 68: Hoare triple {28739#true} ~cond := #in~cond; {28739#true} is VALID [2022-04-08 12:37:33,810 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-08 12:37:33,810 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-08 12:37:33,811 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-08 12:37:33,811 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-08 12:37:33,812 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {28739#true} {29102#(< ~counter~0 18)} #96#return; {29102#(< ~counter~0 18)} is VALID [2022-04-08 12:37:33,812 INFO L290 TraceCheckUtils]: 62: Hoare triple {28739#true} assume true; {28739#true} is VALID [2022-04-08 12:37:33,812 INFO L290 TraceCheckUtils]: 61: Hoare triple {28739#true} assume !(0 == ~cond); {28739#true} is VALID [2022-04-08 12:37:33,812 INFO L290 TraceCheckUtils]: 60: Hoare triple {28739#true} ~cond := #in~cond; {28739#true} is VALID [2022-04-08 12:37:33,812 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-08 12:37:33,812 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-08 12:37:33,813 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-08 12:37:33,813 INFO L290 TraceCheckUtils]: 56: Hoare triple {29127#(< ~counter~0 17)} assume !!(0 != ~r~0); {29127#(< ~counter~0 17)} is VALID [2022-04-08 12:37:33,814 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {28739#true} {29127#(< ~counter~0 17)} #94#return; {29127#(< ~counter~0 17)} is VALID [2022-04-08 12:37:33,814 INFO L290 TraceCheckUtils]: 54: Hoare triple {28739#true} assume true; {28739#true} is VALID [2022-04-08 12:37:33,814 INFO L290 TraceCheckUtils]: 53: Hoare triple {28739#true} assume !(0 == ~cond); {28739#true} is VALID [2022-04-08 12:37:33,814 INFO L290 TraceCheckUtils]: 52: Hoare triple {28739#true} ~cond := #in~cond; {28739#true} is VALID [2022-04-08 12:37:33,814 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-08 12:37:33,814 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-08 12:37:33,815 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-08 12:37:33,815 INFO L290 TraceCheckUtils]: 48: Hoare triple {29152#(< ~counter~0 16)} assume !(~r~0 < 0); {29152#(< ~counter~0 16)} is VALID [2022-04-08 12:37:33,816 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {28739#true} {29152#(< ~counter~0 16)} #98#return; {29152#(< ~counter~0 16)} is VALID [2022-04-08 12:37:33,816 INFO L290 TraceCheckUtils]: 46: Hoare triple {28739#true} assume true; {28739#true} is VALID [2022-04-08 12:37:33,816 INFO L290 TraceCheckUtils]: 45: Hoare triple {28739#true} assume !(0 == ~cond); {28739#true} is VALID [2022-04-08 12:37:33,816 INFO L290 TraceCheckUtils]: 44: Hoare triple {28739#true} ~cond := #in~cond; {28739#true} is VALID [2022-04-08 12:37:33,816 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-08 12:37:33,816 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-08 12:37:33,817 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-08 12:37:33,817 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-08 12:37:33,818 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {28739#true} {29177#(< ~counter~0 15)} #98#return; {29177#(< ~counter~0 15)} is VALID [2022-04-08 12:37:33,818 INFO L290 TraceCheckUtils]: 38: Hoare triple {28739#true} assume true; {28739#true} is VALID [2022-04-08 12:37:33,818 INFO L290 TraceCheckUtils]: 37: Hoare triple {28739#true} assume !(0 == ~cond); {28739#true} is VALID [2022-04-08 12:37:33,818 INFO L290 TraceCheckUtils]: 36: Hoare triple {28739#true} ~cond := #in~cond; {28739#true} is VALID [2022-04-08 12:37:33,818 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-08 12:37:33,818 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-08 12:37:33,819 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-08 12:37:33,819 INFO L290 TraceCheckUtils]: 32: Hoare triple {29202#(< ~counter~0 14)} assume !(~r~0 > 0); {29202#(< ~counter~0 14)} is VALID [2022-04-08 12:37:33,820 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {28739#true} {29202#(< ~counter~0 14)} #96#return; {29202#(< ~counter~0 14)} is VALID [2022-04-08 12:37:33,820 INFO L290 TraceCheckUtils]: 30: Hoare triple {28739#true} assume true; {28739#true} is VALID [2022-04-08 12:37:33,820 INFO L290 TraceCheckUtils]: 29: Hoare triple {28739#true} assume !(0 == ~cond); {28739#true} is VALID [2022-04-08 12:37:33,820 INFO L290 TraceCheckUtils]: 28: Hoare triple {28739#true} ~cond := #in~cond; {28739#true} is VALID [2022-04-08 12:37:33,820 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-08 12:37:33,820 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-08 12:37:33,821 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-08 12:37:33,821 INFO L290 TraceCheckUtils]: 24: Hoare triple {29227#(< ~counter~0 13)} assume !!(0 != ~r~0); {29227#(< ~counter~0 13)} is VALID [2022-04-08 12:37:33,822 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {28739#true} {29227#(< ~counter~0 13)} #94#return; {29227#(< ~counter~0 13)} is VALID [2022-04-08 12:37:33,822 INFO L290 TraceCheckUtils]: 22: Hoare triple {28739#true} assume true; {28739#true} is VALID [2022-04-08 12:37:33,822 INFO L290 TraceCheckUtils]: 21: Hoare triple {28739#true} assume !(0 == ~cond); {28739#true} is VALID [2022-04-08 12:37:33,822 INFO L290 TraceCheckUtils]: 20: Hoare triple {28739#true} ~cond := #in~cond; {28739#true} is VALID [2022-04-08 12:37:33,822 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-08 12:37:33,822 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-08 12:37:33,823 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-08 12:37:33,823 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-08 12:37:33,824 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {28739#true} {29252#(< ~counter~0 12)} #92#return; {29252#(< ~counter~0 12)} is VALID [2022-04-08 12:37:33,824 INFO L290 TraceCheckUtils]: 14: Hoare triple {28739#true} assume true; {28739#true} is VALID [2022-04-08 12:37:33,824 INFO L290 TraceCheckUtils]: 13: Hoare triple {28739#true} assume !(0 == ~cond); {28739#true} is VALID [2022-04-08 12:37:33,824 INFO L290 TraceCheckUtils]: 12: Hoare triple {28739#true} ~cond := #in~cond; {28739#true} is VALID [2022-04-08 12:37:33,824 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-08 12:37:33,825 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {28739#true} {29252#(< ~counter~0 12)} #90#return; {29252#(< ~counter~0 12)} is VALID [2022-04-08 12:37:33,825 INFO L290 TraceCheckUtils]: 9: Hoare triple {28739#true} assume true; {28739#true} is VALID [2022-04-08 12:37:33,825 INFO L290 TraceCheckUtils]: 8: Hoare triple {28739#true} assume !(0 == ~cond); {28739#true} is VALID [2022-04-08 12:37:33,825 INFO L290 TraceCheckUtils]: 7: Hoare triple {28739#true} ~cond := #in~cond; {28739#true} is VALID [2022-04-08 12:37:33,825 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-08 12:37:33,825 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-08 12:37:33,825 INFO L272 TraceCheckUtils]: 4: Hoare triple {29252#(< ~counter~0 12)} call #t~ret9 := main(); {29252#(< ~counter~0 12)} is VALID [2022-04-08 12:37:33,826 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29252#(< ~counter~0 12)} {28739#true} #102#return; {29252#(< ~counter~0 12)} is VALID [2022-04-08 12:37:33,826 INFO L290 TraceCheckUtils]: 2: Hoare triple {29252#(< ~counter~0 12)} assume true; {29252#(< ~counter~0 12)} is VALID [2022-04-08 12:37:33,827 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-08 12:37:33,827 INFO L272 TraceCheckUtils]: 0: Hoare triple {28739#true} call ULTIMATE.init(); {28739#true} is VALID [2022-04-08 12:37:33,827 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-08 12:37:33,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:37:33,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395395556] [2022-04-08 12:37:33,827 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:37:33,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314093077] [2022-04-08 12:37:33,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [314093077] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:37:33,827 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:37:33,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2022-04-08 12:37:33,828 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:37:33,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2039291997] [2022-04-08 12:37:33,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2039291997] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:37:33,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:37:33,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 12:37:33,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419820767] [2022-04-08 12:37:33,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:37:33,828 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-08 12:37:33,828 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:37:33,829 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-08 12:37:33,901 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-08 12:37:33,902 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 12:37:33,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:37:33,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 12:37:33,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=267, Unknown=0, NotChecked=0, Total=462 [2022-04-08 12:37:33,902 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-08 12:37:34,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:37:34,799 INFO L93 Difference]: Finished difference Result 427 states and 585 transitions. [2022-04-08 12:37:34,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-08 12:37:34,799 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-08 12:37:34,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:37:34,799 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-08 12:37:34,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 197 transitions. [2022-04-08 12:37:34,800 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-08 12:37:34,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 197 transitions. [2022-04-08 12:37:34,802 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 197 transitions. [2022-04-08 12:37:34,937 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-08 12:37:34,943 INFO L225 Difference]: With dead ends: 427 [2022-04-08 12:37:34,943 INFO L226 Difference]: Without dead ends: 342 [2022-04-08 12:37:34,943 INFO L912 BasicCegarLoop]: 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-08 12:37:34,944 INFO L913 BasicCegarLoop]: 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-08 12:37:34,944 INFO L914 BasicCegarLoop]: 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-08 12:37:34,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2022-04-08 12:37:35,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2022-04-08 12:37:35,430 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:37:35,431 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-08 12:37:35,431 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-08 12:37:35,431 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-08 12:37:35,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:37:35,436 INFO L93 Difference]: Finished difference Result 342 states and 456 transitions. [2022-04-08 12:37:35,436 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 456 transitions. [2022-04-08 12:37:35,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:37:35,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:37:35,437 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-08 12:37:35,438 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-08 12:37:35,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:37:35,443 INFO L93 Difference]: Finished difference Result 342 states and 456 transitions. [2022-04-08 12:37:35,443 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 456 transitions. [2022-04-08 12:37:35,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:37:35,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:37:35,443 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:37:35,443 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:37:35,444 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-08 12:37:35,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 456 transitions. [2022-04-08 12:37:35,450 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 456 transitions. Word has length 91 [2022-04-08 12:37:35,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:37:35,450 INFO L478 AbstractCegarLoop]: Abstraction has 342 states and 456 transitions. [2022-04-08 12:37:35,451 INFO L479 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-08 12:37:35,451 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 342 states and 456 transitions. [2022-04-08 12:37:38,160 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 456 edges. 455 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 12:37:38,160 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 456 transitions. [2022-04-08 12:37:38,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-04-08 12:37:38,161 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:37:38,161 INFO L499 BasicCegarLoop]: 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-08 12:37:38,167 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-08 12:37:38,363 WARN L460 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-08 12:37:38,363 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:37:38,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:37:38,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1660747519, now seen corresponding path program 7 times [2022-04-08 12:37:38,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:37:38,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1555064384] [2022-04-08 12:37:38,364 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:37:38,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1660747519, now seen corresponding path program 8 times [2022-04-08 12:37:38,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:37:38,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133988365] [2022-04-08 12:37:38,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:37:38,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:37:38,376 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:37:38,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2133988547] [2022-04-08 12:37:38,377 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:37:38,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:37:38,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:37:38,377 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-08 12:37:38,378 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-08 12:37:38,424 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:37:38,425 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:37:38,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-08 12:37:38,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:37:38,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:37:38,870 INFO L272 TraceCheckUtils]: 0: Hoare triple {31542#true} call ULTIMATE.init(); {31542#true} is VALID [2022-04-08 12:37:38,871 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-08 12:37:38,871 INFO L290 TraceCheckUtils]: 2: Hoare triple {31550#(<= ~counter~0 0)} assume true; {31550#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:38,871 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31550#(<= ~counter~0 0)} {31542#true} #102#return; {31550#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:38,872 INFO L272 TraceCheckUtils]: 4: Hoare triple {31550#(<= ~counter~0 0)} call #t~ret9 := main(); {31550#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:38,872 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-08 12:37:38,872 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-08 12:37:38,873 INFO L290 TraceCheckUtils]: 7: Hoare triple {31550#(<= ~counter~0 0)} ~cond := #in~cond; {31550#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:38,873 INFO L290 TraceCheckUtils]: 8: Hoare triple {31550#(<= ~counter~0 0)} assume !(0 == ~cond); {31550#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:38,873 INFO L290 TraceCheckUtils]: 9: Hoare triple {31550#(<= ~counter~0 0)} assume true; {31550#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:38,874 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {31550#(<= ~counter~0 0)} {31550#(<= ~counter~0 0)} #90#return; {31550#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:38,874 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-08 12:37:38,874 INFO L290 TraceCheckUtils]: 12: Hoare triple {31550#(<= ~counter~0 0)} ~cond := #in~cond; {31550#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:38,875 INFO L290 TraceCheckUtils]: 13: Hoare triple {31550#(<= ~counter~0 0)} assume !(0 == ~cond); {31550#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:38,875 INFO L290 TraceCheckUtils]: 14: Hoare triple {31550#(<= ~counter~0 0)} assume true; {31550#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:38,875 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {31550#(<= ~counter~0 0)} {31550#(<= ~counter~0 0)} #92#return; {31550#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:38,875 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-08 12:37:38,876 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-08 12:37:38,877 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-08 12:37:38,877 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-08 12:37:38,877 INFO L290 TraceCheckUtils]: 20: Hoare triple {31599#(<= ~counter~0 1)} ~cond := #in~cond; {31599#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:38,878 INFO L290 TraceCheckUtils]: 21: Hoare triple {31599#(<= ~counter~0 1)} assume !(0 == ~cond); {31599#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:38,878 INFO L290 TraceCheckUtils]: 22: Hoare triple {31599#(<= ~counter~0 1)} assume true; {31599#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:38,878 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {31599#(<= ~counter~0 1)} {31599#(<= ~counter~0 1)} #94#return; {31599#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:38,879 INFO L290 TraceCheckUtils]: 24: Hoare triple {31599#(<= ~counter~0 1)} assume !!(0 != ~r~0); {31599#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:38,879 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-08 12:37:38,879 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-08 12:37:38,880 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-08 12:37:38,880 INFO L290 TraceCheckUtils]: 28: Hoare triple {31624#(<= ~counter~0 2)} ~cond := #in~cond; {31624#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:38,880 INFO L290 TraceCheckUtils]: 29: Hoare triple {31624#(<= ~counter~0 2)} assume !(0 == ~cond); {31624#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:38,881 INFO L290 TraceCheckUtils]: 30: Hoare triple {31624#(<= ~counter~0 2)} assume true; {31624#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:38,881 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {31624#(<= ~counter~0 2)} {31624#(<= ~counter~0 2)} #96#return; {31624#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:38,881 INFO L290 TraceCheckUtils]: 32: Hoare triple {31624#(<= ~counter~0 2)} assume !(~r~0 > 0); {31624#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:38,882 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-08 12:37:38,882 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-08 12:37:38,883 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-08 12:37:38,883 INFO L290 TraceCheckUtils]: 36: Hoare triple {31649#(<= ~counter~0 3)} ~cond := #in~cond; {31649#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:38,883 INFO L290 TraceCheckUtils]: 37: Hoare triple {31649#(<= ~counter~0 3)} assume !(0 == ~cond); {31649#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:38,884 INFO L290 TraceCheckUtils]: 38: Hoare triple {31649#(<= ~counter~0 3)} assume true; {31649#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:38,884 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {31649#(<= ~counter~0 3)} {31649#(<= ~counter~0 3)} #98#return; {31649#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:38,884 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-08 12:37:38,885 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-08 12:37:38,885 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-08 12:37:38,885 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-08 12:37:38,886 INFO L290 TraceCheckUtils]: 44: Hoare triple {31674#(<= ~counter~0 4)} ~cond := #in~cond; {31674#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:38,886 INFO L290 TraceCheckUtils]: 45: Hoare triple {31674#(<= ~counter~0 4)} assume !(0 == ~cond); {31674#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:38,886 INFO L290 TraceCheckUtils]: 46: Hoare triple {31674#(<= ~counter~0 4)} assume true; {31674#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:38,887 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {31674#(<= ~counter~0 4)} {31674#(<= ~counter~0 4)} #98#return; {31674#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:38,887 INFO L290 TraceCheckUtils]: 48: Hoare triple {31674#(<= ~counter~0 4)} assume !(~r~0 < 0); {31674#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:38,888 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-08 12:37:38,888 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-08 12:37:38,888 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-08 12:37:38,889 INFO L290 TraceCheckUtils]: 52: Hoare triple {31699#(<= ~counter~0 5)} ~cond := #in~cond; {31699#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:38,889 INFO L290 TraceCheckUtils]: 53: Hoare triple {31699#(<= ~counter~0 5)} assume !(0 == ~cond); {31699#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:38,889 INFO L290 TraceCheckUtils]: 54: Hoare triple {31699#(<= ~counter~0 5)} assume true; {31699#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:38,889 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {31699#(<= ~counter~0 5)} {31699#(<= ~counter~0 5)} #94#return; {31699#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:38,890 INFO L290 TraceCheckUtils]: 56: Hoare triple {31699#(<= ~counter~0 5)} assume !!(0 != ~r~0); {31699#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:38,890 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-08 12:37:38,891 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-08 12:37:38,891 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-08 12:37:38,891 INFO L290 TraceCheckUtils]: 60: Hoare triple {31724#(<= ~counter~0 6)} ~cond := #in~cond; {31724#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:38,892 INFO L290 TraceCheckUtils]: 61: Hoare triple {31724#(<= ~counter~0 6)} assume !(0 == ~cond); {31724#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:38,892 INFO L290 TraceCheckUtils]: 62: Hoare triple {31724#(<= ~counter~0 6)} assume true; {31724#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:38,892 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {31724#(<= ~counter~0 6)} {31724#(<= ~counter~0 6)} #96#return; {31724#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:38,893 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-08 12:37:38,893 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-08 12:37:38,893 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-08 12:37:38,894 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-08 12:37:38,894 INFO L290 TraceCheckUtils]: 68: Hoare triple {31749#(<= ~counter~0 7)} ~cond := #in~cond; {31749#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:38,894 INFO L290 TraceCheckUtils]: 69: Hoare triple {31749#(<= ~counter~0 7)} assume !(0 == ~cond); {31749#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:38,895 INFO L290 TraceCheckUtils]: 70: Hoare triple {31749#(<= ~counter~0 7)} assume true; {31749#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:38,895 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {31749#(<= ~counter~0 7)} {31749#(<= ~counter~0 7)} #96#return; {31749#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:38,895 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-08 12:37:38,896 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-08 12:37:38,896 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-08 12:37:38,897 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-08 12:37:38,897 INFO L290 TraceCheckUtils]: 76: Hoare triple {31774#(<= ~counter~0 8)} ~cond := #in~cond; {31774#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:38,897 INFO L290 TraceCheckUtils]: 77: Hoare triple {31774#(<= ~counter~0 8)} assume !(0 == ~cond); {31774#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:38,897 INFO L290 TraceCheckUtils]: 78: Hoare triple {31774#(<= ~counter~0 8)} assume true; {31774#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:38,898 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {31774#(<= ~counter~0 8)} {31774#(<= ~counter~0 8)} #96#return; {31774#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:38,898 INFO L290 TraceCheckUtils]: 80: Hoare triple {31774#(<= ~counter~0 8)} assume !(~r~0 > 0); {31774#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:38,899 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-08 12:37:38,899 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-08 12:37:38,899 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-08 12:37:38,900 INFO L290 TraceCheckUtils]: 84: Hoare triple {31799#(<= ~counter~0 9)} ~cond := #in~cond; {31799#(<= ~counter~0 9)} is VALID [2022-04-08 12:37:38,900 INFO L290 TraceCheckUtils]: 85: Hoare triple {31799#(<= ~counter~0 9)} assume !(0 == ~cond); {31799#(<= ~counter~0 9)} is VALID [2022-04-08 12:37:38,900 INFO L290 TraceCheckUtils]: 86: Hoare triple {31799#(<= ~counter~0 9)} assume true; {31799#(<= ~counter~0 9)} is VALID [2022-04-08 12:37:38,901 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {31799#(<= ~counter~0 9)} {31799#(<= ~counter~0 9)} #98#return; {31799#(<= ~counter~0 9)} is VALID [2022-04-08 12:37:38,901 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-08 12:37:38,901 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-08 12:37:38,902 INFO L290 TraceCheckUtils]: 90: Hoare triple {31824#(<= |main_#t~post8| 9)} assume !(#t~post8 < 20);havoc #t~post8; {31543#false} is VALID [2022-04-08 12:37:38,902 INFO L290 TraceCheckUtils]: 91: Hoare triple {31543#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31543#false} is VALID [2022-04-08 12:37:38,902 INFO L290 TraceCheckUtils]: 92: Hoare triple {31543#false} assume !(#t~post6 < 20);havoc #t~post6; {31543#false} is VALID [2022-04-08 12:37:38,902 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-08 12:37:38,902 INFO L290 TraceCheckUtils]: 94: Hoare triple {31543#false} ~cond := #in~cond; {31543#false} is VALID [2022-04-08 12:37:38,902 INFO L290 TraceCheckUtils]: 95: Hoare triple {31543#false} assume 0 == ~cond; {31543#false} is VALID [2022-04-08 12:37:38,902 INFO L290 TraceCheckUtils]: 96: Hoare triple {31543#false} assume !false; {31543#false} is VALID [2022-04-08 12:37:38,902 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-08 12:37:38,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:37:39,390 INFO L290 TraceCheckUtils]: 96: Hoare triple {31543#false} assume !false; {31543#false} is VALID [2022-04-08 12:37:39,391 INFO L290 TraceCheckUtils]: 95: Hoare triple {31543#false} assume 0 == ~cond; {31543#false} is VALID [2022-04-08 12:37:39,391 INFO L290 TraceCheckUtils]: 94: Hoare triple {31543#false} ~cond := #in~cond; {31543#false} is VALID [2022-04-08 12:37:39,391 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-08 12:37:39,391 INFO L290 TraceCheckUtils]: 92: Hoare triple {31543#false} assume !(#t~post6 < 20);havoc #t~post6; {31543#false} is VALID [2022-04-08 12:37:39,391 INFO L290 TraceCheckUtils]: 91: Hoare triple {31543#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31543#false} is VALID [2022-04-08 12:37:39,391 INFO L290 TraceCheckUtils]: 90: Hoare triple {31864#(< |main_#t~post8| 20)} assume !(#t~post8 < 20);havoc #t~post8; {31543#false} is VALID [2022-04-08 12:37:39,392 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-08 12:37:39,392 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-08 12:37:39,392 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {31542#true} {31868#(< ~counter~0 20)} #98#return; {31868#(< ~counter~0 20)} is VALID [2022-04-08 12:37:39,392 INFO L290 TraceCheckUtils]: 86: Hoare triple {31542#true} assume true; {31542#true} is VALID [2022-04-08 12:37:39,393 INFO L290 TraceCheckUtils]: 85: Hoare triple {31542#true} assume !(0 == ~cond); {31542#true} is VALID [2022-04-08 12:37:39,393 INFO L290 TraceCheckUtils]: 84: Hoare triple {31542#true} ~cond := #in~cond; {31542#true} is VALID [2022-04-08 12:37:39,393 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-08 12:37:39,393 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-08 12:37:39,394 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-08 12:37:39,394 INFO L290 TraceCheckUtils]: 80: Hoare triple {31893#(< ~counter~0 19)} assume !(~r~0 > 0); {31893#(< ~counter~0 19)} is VALID [2022-04-08 12:37:39,395 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {31542#true} {31893#(< ~counter~0 19)} #96#return; {31893#(< ~counter~0 19)} is VALID [2022-04-08 12:37:39,395 INFO L290 TraceCheckUtils]: 78: Hoare triple {31542#true} assume true; {31542#true} is VALID [2022-04-08 12:37:39,395 INFO L290 TraceCheckUtils]: 77: Hoare triple {31542#true} assume !(0 == ~cond); {31542#true} is VALID [2022-04-08 12:37:39,395 INFO L290 TraceCheckUtils]: 76: Hoare triple {31542#true} ~cond := #in~cond; {31542#true} is VALID [2022-04-08 12:37:39,395 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-08 12:37:39,395 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-08 12:37:39,396 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-08 12:37:39,396 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-08 12:37:39,396 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {31542#true} {31918#(< ~counter~0 18)} #96#return; {31918#(< ~counter~0 18)} is VALID [2022-04-08 12:37:39,396 INFO L290 TraceCheckUtils]: 70: Hoare triple {31542#true} assume true; {31542#true} is VALID [2022-04-08 12:37:39,397 INFO L290 TraceCheckUtils]: 69: Hoare triple {31542#true} assume !(0 == ~cond); {31542#true} is VALID [2022-04-08 12:37:39,397 INFO L290 TraceCheckUtils]: 68: Hoare triple {31542#true} ~cond := #in~cond; {31542#true} is VALID [2022-04-08 12:37:39,397 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-08 12:37:39,397 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-08 12:37:39,397 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-08 12:37:39,398 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-08 12:37:39,398 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {31542#true} {31943#(< ~counter~0 17)} #96#return; {31943#(< ~counter~0 17)} is VALID [2022-04-08 12:37:39,398 INFO L290 TraceCheckUtils]: 62: Hoare triple {31542#true} assume true; {31542#true} is VALID [2022-04-08 12:37:39,398 INFO L290 TraceCheckUtils]: 61: Hoare triple {31542#true} assume !(0 == ~cond); {31542#true} is VALID [2022-04-08 12:37:39,398 INFO L290 TraceCheckUtils]: 60: Hoare triple {31542#true} ~cond := #in~cond; {31542#true} is VALID [2022-04-08 12:37:39,398 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-08 12:37:39,399 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-08 12:37:39,399 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-08 12:37:39,399 INFO L290 TraceCheckUtils]: 56: Hoare triple {31968#(< ~counter~0 16)} assume !!(0 != ~r~0); {31968#(< ~counter~0 16)} is VALID [2022-04-08 12:37:39,400 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {31542#true} {31968#(< ~counter~0 16)} #94#return; {31968#(< ~counter~0 16)} is VALID [2022-04-08 12:37:39,400 INFO L290 TraceCheckUtils]: 54: Hoare triple {31542#true} assume true; {31542#true} is VALID [2022-04-08 12:37:39,400 INFO L290 TraceCheckUtils]: 53: Hoare triple {31542#true} assume !(0 == ~cond); {31542#true} is VALID [2022-04-08 12:37:39,400 INFO L290 TraceCheckUtils]: 52: Hoare triple {31542#true} ~cond := #in~cond; {31542#true} is VALID [2022-04-08 12:37:39,400 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-08 12:37:39,400 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-08 12:37:39,401 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-08 12:37:39,401 INFO L290 TraceCheckUtils]: 48: Hoare triple {31993#(< ~counter~0 15)} assume !(~r~0 < 0); {31993#(< ~counter~0 15)} is VALID [2022-04-08 12:37:39,402 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {31542#true} {31993#(< ~counter~0 15)} #98#return; {31993#(< ~counter~0 15)} is VALID [2022-04-08 12:37:39,402 INFO L290 TraceCheckUtils]: 46: Hoare triple {31542#true} assume true; {31542#true} is VALID [2022-04-08 12:37:39,402 INFO L290 TraceCheckUtils]: 45: Hoare triple {31542#true} assume !(0 == ~cond); {31542#true} is VALID [2022-04-08 12:37:39,402 INFO L290 TraceCheckUtils]: 44: Hoare triple {31542#true} ~cond := #in~cond; {31542#true} is VALID [2022-04-08 12:37:39,402 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-08 12:37:39,402 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-08 12:37:39,403 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-08 12:37:39,403 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-08 12:37:39,404 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {31542#true} {32018#(< ~counter~0 14)} #98#return; {32018#(< ~counter~0 14)} is VALID [2022-04-08 12:37:39,404 INFO L290 TraceCheckUtils]: 38: Hoare triple {31542#true} assume true; {31542#true} is VALID [2022-04-08 12:37:39,404 INFO L290 TraceCheckUtils]: 37: Hoare triple {31542#true} assume !(0 == ~cond); {31542#true} is VALID [2022-04-08 12:37:39,404 INFO L290 TraceCheckUtils]: 36: Hoare triple {31542#true} ~cond := #in~cond; {31542#true} is VALID [2022-04-08 12:37:39,404 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-08 12:37:39,404 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-08 12:37:39,405 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-08 12:37:39,405 INFO L290 TraceCheckUtils]: 32: Hoare triple {32043#(< ~counter~0 13)} assume !(~r~0 > 0); {32043#(< ~counter~0 13)} is VALID [2022-04-08 12:37:39,405 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {31542#true} {32043#(< ~counter~0 13)} #96#return; {32043#(< ~counter~0 13)} is VALID [2022-04-08 12:37:39,405 INFO L290 TraceCheckUtils]: 30: Hoare triple {31542#true} assume true; {31542#true} is VALID [2022-04-08 12:37:39,406 INFO L290 TraceCheckUtils]: 29: Hoare triple {31542#true} assume !(0 == ~cond); {31542#true} is VALID [2022-04-08 12:37:39,406 INFO L290 TraceCheckUtils]: 28: Hoare triple {31542#true} ~cond := #in~cond; {31542#true} is VALID [2022-04-08 12:37:39,406 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-08 12:37:39,406 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-08 12:37:39,406 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-08 12:37:39,407 INFO L290 TraceCheckUtils]: 24: Hoare triple {32068#(< ~counter~0 12)} assume !!(0 != ~r~0); {32068#(< ~counter~0 12)} is VALID [2022-04-08 12:37:39,409 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {31542#true} {32068#(< ~counter~0 12)} #94#return; {32068#(< ~counter~0 12)} is VALID [2022-04-08 12:37:39,409 INFO L290 TraceCheckUtils]: 22: Hoare triple {31542#true} assume true; {31542#true} is VALID [2022-04-08 12:37:39,409 INFO L290 TraceCheckUtils]: 21: Hoare triple {31542#true} assume !(0 == ~cond); {31542#true} is VALID [2022-04-08 12:37:39,409 INFO L290 TraceCheckUtils]: 20: Hoare triple {31542#true} ~cond := #in~cond; {31542#true} is VALID [2022-04-08 12:37:39,409 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-08 12:37:39,409 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-08 12:37:39,410 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-08 12:37:39,410 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-08 12:37:39,410 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {31542#true} {32093#(< ~counter~0 11)} #92#return; {32093#(< ~counter~0 11)} is VALID [2022-04-08 12:37:39,410 INFO L290 TraceCheckUtils]: 14: Hoare triple {31542#true} assume true; {31542#true} is VALID [2022-04-08 12:37:39,410 INFO L290 TraceCheckUtils]: 13: Hoare triple {31542#true} assume !(0 == ~cond); {31542#true} is VALID [2022-04-08 12:37:39,411 INFO L290 TraceCheckUtils]: 12: Hoare triple {31542#true} ~cond := #in~cond; {31542#true} is VALID [2022-04-08 12:37:39,411 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-08 12:37:39,411 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {31542#true} {32093#(< ~counter~0 11)} #90#return; {32093#(< ~counter~0 11)} is VALID [2022-04-08 12:37:39,411 INFO L290 TraceCheckUtils]: 9: Hoare triple {31542#true} assume true; {31542#true} is VALID [2022-04-08 12:37:39,411 INFO L290 TraceCheckUtils]: 8: Hoare triple {31542#true} assume !(0 == ~cond); {31542#true} is VALID [2022-04-08 12:37:39,411 INFO L290 TraceCheckUtils]: 7: Hoare triple {31542#true} ~cond := #in~cond; {31542#true} is VALID [2022-04-08 12:37:39,411 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-08 12:37:39,412 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-08 12:37:39,412 INFO L272 TraceCheckUtils]: 4: Hoare triple {32093#(< ~counter~0 11)} call #t~ret9 := main(); {32093#(< ~counter~0 11)} is VALID [2022-04-08 12:37:39,412 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32093#(< ~counter~0 11)} {31542#true} #102#return; {32093#(< ~counter~0 11)} is VALID [2022-04-08 12:37:39,412 INFO L290 TraceCheckUtils]: 2: Hoare triple {32093#(< ~counter~0 11)} assume true; {32093#(< ~counter~0 11)} is VALID [2022-04-08 12:37:39,413 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-08 12:37:39,413 INFO L272 TraceCheckUtils]: 0: Hoare triple {31542#true} call ULTIMATE.init(); {31542#true} is VALID [2022-04-08 12:37:39,413 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-08 12:37:39,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:37:39,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133988365] [2022-04-08 12:37:39,413 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:37:39,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133988547] [2022-04-08 12:37:39,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133988547] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:37:39,414 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:37:39,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-04-08 12:37:39,414 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:37:39,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1555064384] [2022-04-08 12:37:39,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1555064384] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:37:39,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:37:39,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 12:37:39,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635815297] [2022-04-08 12:37:39,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:37:39,415 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-08 12:37:39,415 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:37:39,415 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-08 12:37:39,475 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-08 12:37:39,476 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 12:37:39,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:37:39,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 12:37:39,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-08 12:37:39,476 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-08 12:37:40,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:37:40,540 INFO L93 Difference]: Finished difference Result 467 states and 640 transitions. [2022-04-08 12:37:40,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-08 12:37:40,540 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-08 12:37:40,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:37:40,543 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-08 12:37:40,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 218 transitions. [2022-04-08 12:37:40,545 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-08 12:37:40,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 218 transitions. [2022-04-08 12:37:40,546 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 218 transitions. [2022-04-08 12:37:40,719 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-08 12:37:40,725 INFO L225 Difference]: With dead ends: 467 [2022-04-08 12:37:40,726 INFO L226 Difference]: Without dead ends: 352 [2022-04-08 12:37:40,726 INFO L912 BasicCegarLoop]: 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-08 12:37:40,727 INFO L913 BasicCegarLoop]: 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-08 12:37:40,727 INFO L914 BasicCegarLoop]: 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-08 12:37:40,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2022-04-08 12:37:41,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 344. [2022-04-08 12:37:41,221 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:37:41,227 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-08 12:37:41,228 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-08 12:37:41,228 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-08 12:37:41,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:37:41,233 INFO L93 Difference]: Finished difference Result 352 states and 465 transitions. [2022-04-08 12:37:41,233 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 465 transitions. [2022-04-08 12:37:41,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:37:41,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:37:41,234 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-08 12:37:41,235 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-08 12:37:41,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:37:41,240 INFO L93 Difference]: Finished difference Result 352 states and 465 transitions. [2022-04-08 12:37:41,240 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 465 transitions. [2022-04-08 12:37:41,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:37:41,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:37:41,240 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:37:41,240 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:37:41,241 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-08 12:37:41,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 457 transitions. [2022-04-08 12:37:41,247 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 457 transitions. Word has length 97 [2022-04-08 12:37:41,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:37:41,247 INFO L478 AbstractCegarLoop]: Abstraction has 344 states and 457 transitions. [2022-04-08 12:37:41,247 INFO L479 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-08 12:37:41,247 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 344 states and 457 transitions. [2022-04-08 12:37:43,921 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 457 edges. 456 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 12:37:43,922 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 457 transitions. [2022-04-08 12:37:43,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-08 12:37:43,922 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:37:43,922 INFO L499 BasicCegarLoop]: 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-08 12:37:43,941 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-08 12:37:44,123 WARN L460 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-08 12:37:44,123 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:37:44,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:37:44,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1020733748, now seen corresponding path program 7 times [2022-04-08 12:37:44,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:37:44,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [443963151] [2022-04-08 12:37:44,124 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:37:44,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1020733748, now seen corresponding path program 8 times [2022-04-08 12:37:44,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:37:44,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675972855] [2022-04-08 12:37:44,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:37:44,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:37:44,136 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:37:44,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [871381063] [2022-04-08 12:37:44,136 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:37:44,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:37:44,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:37:44,137 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-08 12:37:44,137 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-08 12:37:44,184 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:37:44,185 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:37:44,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-08 12:37:44,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:37:44,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:37:44,413 INFO L272 TraceCheckUtils]: 0: Hoare triple {34487#true} call ULTIMATE.init(); {34487#true} is VALID [2022-04-08 12:37:44,413 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-08 12:37:44,413 INFO L290 TraceCheckUtils]: 2: Hoare triple {34487#true} assume true; {34487#true} is VALID [2022-04-08 12:37:44,413 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34487#true} {34487#true} #102#return; {34487#true} is VALID [2022-04-08 12:37:44,413 INFO L272 TraceCheckUtils]: 4: Hoare triple {34487#true} call #t~ret9 := main(); {34487#true} is VALID [2022-04-08 12:37:44,413 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-08 12:37:44,413 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-08 12:37:44,413 INFO L290 TraceCheckUtils]: 7: Hoare triple {34487#true} ~cond := #in~cond; {34487#true} is VALID [2022-04-08 12:37:44,414 INFO L290 TraceCheckUtils]: 8: Hoare triple {34487#true} assume !(0 == ~cond); {34487#true} is VALID [2022-04-08 12:37:44,414 INFO L290 TraceCheckUtils]: 9: Hoare triple {34487#true} assume true; {34487#true} is VALID [2022-04-08 12:37:44,414 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {34487#true} {34487#true} #90#return; {34487#true} is VALID [2022-04-08 12:37:44,414 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-08 12:37:44,414 INFO L290 TraceCheckUtils]: 12: Hoare triple {34487#true} ~cond := #in~cond; {34487#true} is VALID [2022-04-08 12:37:44,414 INFO L290 TraceCheckUtils]: 13: Hoare triple {34487#true} assume !(0 == ~cond); {34487#true} is VALID [2022-04-08 12:37:44,414 INFO L290 TraceCheckUtils]: 14: Hoare triple {34487#true} assume true; {34487#true} is VALID [2022-04-08 12:37:44,414 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {34487#true} {34487#true} #92#return; {34487#true} is VALID [2022-04-08 12:37:44,414 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-08 12:37:44,414 INFO L290 TraceCheckUtils]: 17: Hoare triple {34487#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34487#true} is VALID [2022-04-08 12:37:44,414 INFO L290 TraceCheckUtils]: 18: Hoare triple {34487#true} assume !!(#t~post6 < 20);havoc #t~post6; {34487#true} is VALID [2022-04-08 12:37:44,414 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-08 12:37:44,414 INFO L290 TraceCheckUtils]: 20: Hoare triple {34487#true} ~cond := #in~cond; {34487#true} is VALID [2022-04-08 12:37:44,414 INFO L290 TraceCheckUtils]: 21: Hoare triple {34487#true} assume !(0 == ~cond); {34487#true} is VALID [2022-04-08 12:37:44,414 INFO L290 TraceCheckUtils]: 22: Hoare triple {34487#true} assume true; {34487#true} is VALID [2022-04-08 12:37:44,415 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {34487#true} {34487#true} #94#return; {34487#true} is VALID [2022-04-08 12:37:44,415 INFO L290 TraceCheckUtils]: 24: Hoare triple {34487#true} assume !!(0 != ~r~0); {34487#true} is VALID [2022-04-08 12:37:44,415 INFO L290 TraceCheckUtils]: 25: Hoare triple {34487#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {34487#true} is VALID [2022-04-08 12:37:44,415 INFO L290 TraceCheckUtils]: 26: Hoare triple {34487#true} assume !!(#t~post7 < 20);havoc #t~post7; {34487#true} is VALID [2022-04-08 12:37:44,415 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-08 12:37:44,415 INFO L290 TraceCheckUtils]: 28: Hoare triple {34487#true} ~cond := #in~cond; {34487#true} is VALID [2022-04-08 12:37:44,415 INFO L290 TraceCheckUtils]: 29: Hoare triple {34487#true} assume !(0 == ~cond); {34487#true} is VALID [2022-04-08 12:37:44,415 INFO L290 TraceCheckUtils]: 30: Hoare triple {34487#true} assume true; {34487#true} is VALID [2022-04-08 12:37:44,415 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {34487#true} {34487#true} #96#return; {34487#true} is VALID [2022-04-08 12:37:44,415 INFO L290 TraceCheckUtils]: 32: Hoare triple {34487#true} assume !(~r~0 > 0); {34487#true} is VALID [2022-04-08 12:37:44,415 INFO L290 TraceCheckUtils]: 33: Hoare triple {34487#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {34487#true} is VALID [2022-04-08 12:37:44,415 INFO L290 TraceCheckUtils]: 34: Hoare triple {34487#true} assume !!(#t~post8 < 20);havoc #t~post8; {34487#true} is VALID [2022-04-08 12:37:44,415 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-08 12:37:44,415 INFO L290 TraceCheckUtils]: 36: Hoare triple {34487#true} ~cond := #in~cond; {34487#true} is VALID [2022-04-08 12:37:44,416 INFO L290 TraceCheckUtils]: 37: Hoare triple {34487#true} assume !(0 == ~cond); {34487#true} is VALID [2022-04-08 12:37:44,416 INFO L290 TraceCheckUtils]: 38: Hoare triple {34487#true} assume true; {34487#true} is VALID [2022-04-08 12:37:44,416 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {34487#true} {34487#true} #98#return; {34487#true} is VALID [2022-04-08 12:37:44,416 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-08 12:37:44,416 INFO L290 TraceCheckUtils]: 41: Hoare triple {34487#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {34487#true} is VALID [2022-04-08 12:37:44,416 INFO L290 TraceCheckUtils]: 42: Hoare triple {34487#true} assume !!(#t~post8 < 20);havoc #t~post8; {34487#true} is VALID [2022-04-08 12:37:44,416 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-08 12:37:44,416 INFO L290 TraceCheckUtils]: 44: Hoare triple {34487#true} ~cond := #in~cond; {34487#true} is VALID [2022-04-08 12:37:44,416 INFO L290 TraceCheckUtils]: 45: Hoare triple {34487#true} assume !(0 == ~cond); {34487#true} is VALID [2022-04-08 12:37:44,416 INFO L290 TraceCheckUtils]: 46: Hoare triple {34487#true} assume true; {34487#true} is VALID [2022-04-08 12:37:44,416 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {34487#true} {34487#true} #98#return; {34487#true} is VALID [2022-04-08 12:37:44,416 INFO L290 TraceCheckUtils]: 48: Hoare triple {34487#true} assume !(~r~0 < 0); {34487#true} is VALID [2022-04-08 12:37:44,416 INFO L290 TraceCheckUtils]: 49: Hoare triple {34487#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34487#true} is VALID [2022-04-08 12:37:44,416 INFO L290 TraceCheckUtils]: 50: Hoare triple {34487#true} assume !!(#t~post6 < 20);havoc #t~post6; {34487#true} is VALID [2022-04-08 12:37:44,416 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-08 12:37:44,417 INFO L290 TraceCheckUtils]: 52: Hoare triple {34487#true} ~cond := #in~cond; {34487#true} is VALID [2022-04-08 12:37:44,417 INFO L290 TraceCheckUtils]: 53: Hoare triple {34487#true} assume !(0 == ~cond); {34487#true} is VALID [2022-04-08 12:37:44,417 INFO L290 TraceCheckUtils]: 54: Hoare triple {34487#true} assume true; {34487#true} is VALID [2022-04-08 12:37:44,417 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {34487#true} {34487#true} #94#return; {34487#true} is VALID [2022-04-08 12:37:44,417 INFO L290 TraceCheckUtils]: 56: Hoare triple {34487#true} assume !!(0 != ~r~0); {34487#true} is VALID [2022-04-08 12:37:44,417 INFO L290 TraceCheckUtils]: 57: Hoare triple {34487#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {34487#true} is VALID [2022-04-08 12:37:44,417 INFO L290 TraceCheckUtils]: 58: Hoare triple {34487#true} assume !!(#t~post7 < 20);havoc #t~post7; {34487#true} is VALID [2022-04-08 12:37:44,417 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-08 12:37:44,417 INFO L290 TraceCheckUtils]: 60: Hoare triple {34487#true} ~cond := #in~cond; {34487#true} is VALID [2022-04-08 12:37:44,417 INFO L290 TraceCheckUtils]: 61: Hoare triple {34487#true} assume !(0 == ~cond); {34487#true} is VALID [2022-04-08 12:37:44,417 INFO L290 TraceCheckUtils]: 62: Hoare triple {34487#true} assume true; {34487#true} is VALID [2022-04-08 12:37:44,417 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {34487#true} {34487#true} #96#return; {34487#true} is VALID [2022-04-08 12:37:44,417 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-08 12:37:44,417 INFO L290 TraceCheckUtils]: 65: Hoare triple {34487#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {34487#true} is VALID [2022-04-08 12:37:44,418 INFO L290 TraceCheckUtils]: 66: Hoare triple {34487#true} assume !!(#t~post7 < 20);havoc #t~post7; {34487#true} is VALID [2022-04-08 12:37:44,418 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-08 12:37:44,418 INFO L290 TraceCheckUtils]: 68: Hoare triple {34487#true} ~cond := #in~cond; {34487#true} is VALID [2022-04-08 12:37:44,418 INFO L290 TraceCheckUtils]: 69: Hoare triple {34487#true} assume !(0 == ~cond); {34487#true} is VALID [2022-04-08 12:37:44,418 INFO L290 TraceCheckUtils]: 70: Hoare triple {34487#true} assume true; {34487#true} is VALID [2022-04-08 12:37:44,418 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {34487#true} {34487#true} #96#return; {34487#true} is VALID [2022-04-08 12:37:44,431 INFO L290 TraceCheckUtils]: 72: Hoare triple {34487#true} assume !(~r~0 > 0); {34708#(not (< 0 main_~r~0))} is VALID [2022-04-08 12:37:44,431 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-08 12:37:44,432 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-08 12:37:44,432 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-08 12:37:44,432 INFO L290 TraceCheckUtils]: 76: Hoare triple {34487#true} ~cond := #in~cond; {34487#true} is VALID [2022-04-08 12:37:44,432 INFO L290 TraceCheckUtils]: 77: Hoare triple {34487#true} assume !(0 == ~cond); {34487#true} is VALID [2022-04-08 12:37:44,432 INFO L290 TraceCheckUtils]: 78: Hoare triple {34487#true} assume true; {34487#true} is VALID [2022-04-08 12:37:44,432 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-08 12:37:44,433 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-08 12:37:44,433 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-08 12:37:44,433 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-08 12:37:44,434 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-08 12:37:44,434 INFO L290 TraceCheckUtils]: 84: Hoare triple {34487#true} ~cond := #in~cond; {34487#true} is VALID [2022-04-08 12:37:44,434 INFO L290 TraceCheckUtils]: 85: Hoare triple {34487#true} assume !(0 == ~cond); {34487#true} is VALID [2022-04-08 12:37:44,434 INFO L290 TraceCheckUtils]: 86: Hoare triple {34487#true} assume true; {34487#true} is VALID [2022-04-08 12:37:44,434 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-08 12:37:44,435 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-08 12:37:44,435 INFO L290 TraceCheckUtils]: 89: Hoare triple {34488#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {34488#false} is VALID [2022-04-08 12:37:44,435 INFO L290 TraceCheckUtils]: 90: Hoare triple {34488#false} assume !(#t~post7 < 20);havoc #t~post7; {34488#false} is VALID [2022-04-08 12:37:44,435 INFO L290 TraceCheckUtils]: 91: Hoare triple {34488#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {34488#false} is VALID [2022-04-08 12:37:44,435 INFO L290 TraceCheckUtils]: 92: Hoare triple {34488#false} assume !(#t~post8 < 20);havoc #t~post8; {34488#false} is VALID [2022-04-08 12:37:44,435 INFO L290 TraceCheckUtils]: 93: Hoare triple {34488#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34488#false} is VALID [2022-04-08 12:37:44,435 INFO L290 TraceCheckUtils]: 94: Hoare triple {34488#false} assume !(#t~post6 < 20);havoc #t~post6; {34488#false} is VALID [2022-04-08 12:37:44,435 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-08 12:37:44,435 INFO L290 TraceCheckUtils]: 96: Hoare triple {34488#false} ~cond := #in~cond; {34488#false} is VALID [2022-04-08 12:37:44,435 INFO L290 TraceCheckUtils]: 97: Hoare triple {34488#false} assume 0 == ~cond; {34488#false} is VALID [2022-04-08 12:37:44,435 INFO L290 TraceCheckUtils]: 98: Hoare triple {34488#false} assume !false; {34488#false} is VALID [2022-04-08 12:37:44,436 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-08 12:37:44,436 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 12:37:44,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:37:44,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675972855] [2022-04-08 12:37:44,436 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:37:44,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [871381063] [2022-04-08 12:37:44,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [871381063] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:37:44,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:37:44,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 12:37:44,436 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:37:44,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [443963151] [2022-04-08 12:37:44,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [443963151] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:37:44,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:37:44,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 12:37:44,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000910324] [2022-04-08 12:37:44,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:37:44,437 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-08 12:37:44,437 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:37:44,437 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-08 12:37:44,473 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-08 12:37:44,474 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 12:37:44,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:37:44,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 12:37:44,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-08 12:37:44,474 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-08 12:37:45,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:37:45,177 INFO L93 Difference]: Finished difference Result 504 states and 675 transitions. [2022-04-08 12:37:45,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 12:37:45,177 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-08 12:37:45,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:37:45,177 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-08 12:37:45,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-04-08 12:37:45,183 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-08 12:37:45,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-04-08 12:37:45,184 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 94 transitions. [2022-04-08 12:37:45,252 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-08 12:37:45,259 INFO L225 Difference]: With dead ends: 504 [2022-04-08 12:37:45,259 INFO L226 Difference]: Without dead ends: 362 [2022-04-08 12:37:45,259 INFO L912 BasicCegarLoop]: 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-08 12:37:45,260 INFO L913 BasicCegarLoop]: 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-08 12:37:45,260 INFO L914 BasicCegarLoop]: 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-08 12:37:45,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2022-04-08 12:37:45,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 352. [2022-04-08 12:37:45,735 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:37:45,736 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-08 12:37:45,736 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-08 12:37:45,737 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-08 12:37:45,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:37:45,742 INFO L93 Difference]: Finished difference Result 362 states and 481 transitions. [2022-04-08 12:37:45,742 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 481 transitions. [2022-04-08 12:37:45,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:37:45,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:37:45,743 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-08 12:37:45,743 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-08 12:37:45,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:37:45,749 INFO L93 Difference]: Finished difference Result 362 states and 481 transitions. [2022-04-08 12:37:45,749 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 481 transitions. [2022-04-08 12:37:45,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:37:45,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:37:45,750 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:37:45,750 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:37:45,750 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-08 12:37:45,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 468 transitions. [2022-04-08 12:37:45,756 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 468 transitions. Word has length 99 [2022-04-08 12:37:45,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:37:45,757 INFO L478 AbstractCegarLoop]: Abstraction has 352 states and 468 transitions. [2022-04-08 12:37:45,757 INFO L479 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-08 12:37:45,757 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 352 states and 468 transitions. [2022-04-08 12:37:47,530 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-08 12:37:47,530 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 468 transitions. [2022-04-08 12:37:47,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-08 12:37:47,531 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:37:47,531 INFO L499 BasicCegarLoop]: 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-08 12:37:47,546 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-08 12:37:47,731 WARN L460 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-08 12:37:47,731 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:37:47,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:37:47,731 INFO L85 PathProgramCache]: Analyzing trace with hash 359487094, now seen corresponding path program 9 times [2022-04-08 12:37:47,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:37:47,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1286465309] [2022-04-08 12:37:47,732 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:37:47,732 INFO L85 PathProgramCache]: Analyzing trace with hash 359487094, now seen corresponding path program 10 times [2022-04-08 12:37:47,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:37:47,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913743798] [2022-04-08 12:37:47,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:37:47,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:37:47,742 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:37:47,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [976559870] [2022-04-08 12:37:47,742 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 12:37:47,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:37:47,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:37:47,743 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-08 12:37:47,744 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-08 12:37:47,892 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 12:37:47,893 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:37:47,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-08 12:37:47,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:37:47,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:37:48,325 INFO L272 TraceCheckUtils]: 0: Hoare triple {37223#true} call ULTIMATE.init(); {37223#true} is VALID [2022-04-08 12:37:48,326 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-08 12:37:48,326 INFO L290 TraceCheckUtils]: 2: Hoare triple {37231#(<= ~counter~0 0)} assume true; {37231#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:48,326 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37231#(<= ~counter~0 0)} {37223#true} #102#return; {37231#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:48,327 INFO L272 TraceCheckUtils]: 4: Hoare triple {37231#(<= ~counter~0 0)} call #t~ret9 := main(); {37231#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:48,327 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-08 12:37:48,327 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-08 12:37:48,328 INFO L290 TraceCheckUtils]: 7: Hoare triple {37231#(<= ~counter~0 0)} ~cond := #in~cond; {37231#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:48,328 INFO L290 TraceCheckUtils]: 8: Hoare triple {37231#(<= ~counter~0 0)} assume !(0 == ~cond); {37231#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:48,328 INFO L290 TraceCheckUtils]: 9: Hoare triple {37231#(<= ~counter~0 0)} assume true; {37231#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:48,329 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {37231#(<= ~counter~0 0)} {37231#(<= ~counter~0 0)} #90#return; {37231#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:48,329 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-08 12:37:48,329 INFO L290 TraceCheckUtils]: 12: Hoare triple {37231#(<= ~counter~0 0)} ~cond := #in~cond; {37231#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:48,329 INFO L290 TraceCheckUtils]: 13: Hoare triple {37231#(<= ~counter~0 0)} assume !(0 == ~cond); {37231#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:48,330 INFO L290 TraceCheckUtils]: 14: Hoare triple {37231#(<= ~counter~0 0)} assume true; {37231#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:48,330 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {37231#(<= ~counter~0 0)} {37231#(<= ~counter~0 0)} #92#return; {37231#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:48,330 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-08 12:37:48,331 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-08 12:37:48,332 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-08 12:37:48,332 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-08 12:37:48,332 INFO L290 TraceCheckUtils]: 20: Hoare triple {37280#(<= ~counter~0 1)} ~cond := #in~cond; {37280#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:48,333 INFO L290 TraceCheckUtils]: 21: Hoare triple {37280#(<= ~counter~0 1)} assume !(0 == ~cond); {37280#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:48,333 INFO L290 TraceCheckUtils]: 22: Hoare triple {37280#(<= ~counter~0 1)} assume true; {37280#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:48,333 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {37280#(<= ~counter~0 1)} {37280#(<= ~counter~0 1)} #94#return; {37280#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:48,333 INFO L290 TraceCheckUtils]: 24: Hoare triple {37280#(<= ~counter~0 1)} assume !!(0 != ~r~0); {37280#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:48,334 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-08 12:37:48,334 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-08 12:37:48,335 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-08 12:37:48,335 INFO L290 TraceCheckUtils]: 28: Hoare triple {37305#(<= ~counter~0 2)} ~cond := #in~cond; {37305#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:48,335 INFO L290 TraceCheckUtils]: 29: Hoare triple {37305#(<= ~counter~0 2)} assume !(0 == ~cond); {37305#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:48,336 INFO L290 TraceCheckUtils]: 30: Hoare triple {37305#(<= ~counter~0 2)} assume true; {37305#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:48,336 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {37305#(<= ~counter~0 2)} {37305#(<= ~counter~0 2)} #96#return; {37305#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:48,336 INFO L290 TraceCheckUtils]: 32: Hoare triple {37305#(<= ~counter~0 2)} assume !(~r~0 > 0); {37305#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:48,337 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-08 12:37:48,337 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-08 12:37:48,338 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-08 12:37:48,338 INFO L290 TraceCheckUtils]: 36: Hoare triple {37330#(<= ~counter~0 3)} ~cond := #in~cond; {37330#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:48,338 INFO L290 TraceCheckUtils]: 37: Hoare triple {37330#(<= ~counter~0 3)} assume !(0 == ~cond); {37330#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:48,338 INFO L290 TraceCheckUtils]: 38: Hoare triple {37330#(<= ~counter~0 3)} assume true; {37330#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:48,339 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {37330#(<= ~counter~0 3)} {37330#(<= ~counter~0 3)} #98#return; {37330#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:48,339 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-08 12:37:48,340 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-08 12:37:48,340 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-08 12:37:48,340 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-08 12:37:48,341 INFO L290 TraceCheckUtils]: 44: Hoare triple {37355#(<= ~counter~0 4)} ~cond := #in~cond; {37355#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:48,341 INFO L290 TraceCheckUtils]: 45: Hoare triple {37355#(<= ~counter~0 4)} assume !(0 == ~cond); {37355#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:48,341 INFO L290 TraceCheckUtils]: 46: Hoare triple {37355#(<= ~counter~0 4)} assume true; {37355#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:48,342 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {37355#(<= ~counter~0 4)} {37355#(<= ~counter~0 4)} #98#return; {37355#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:48,342 INFO L290 TraceCheckUtils]: 48: Hoare triple {37355#(<= ~counter~0 4)} assume !(~r~0 < 0); {37355#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:48,342 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-08 12:37:48,343 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-08 12:37:48,343 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-08 12:37:48,343 INFO L290 TraceCheckUtils]: 52: Hoare triple {37380#(<= ~counter~0 5)} ~cond := #in~cond; {37380#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:48,344 INFO L290 TraceCheckUtils]: 53: Hoare triple {37380#(<= ~counter~0 5)} assume !(0 == ~cond); {37380#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:48,344 INFO L290 TraceCheckUtils]: 54: Hoare triple {37380#(<= ~counter~0 5)} assume true; {37380#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:48,344 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {37380#(<= ~counter~0 5)} {37380#(<= ~counter~0 5)} #94#return; {37380#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:48,345 INFO L290 TraceCheckUtils]: 56: Hoare triple {37380#(<= ~counter~0 5)} assume !!(0 != ~r~0); {37380#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:48,345 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-08 12:37:48,345 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-08 12:37:48,346 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-08 12:37:48,346 INFO L290 TraceCheckUtils]: 60: Hoare triple {37405#(<= ~counter~0 6)} ~cond := #in~cond; {37405#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:48,346 INFO L290 TraceCheckUtils]: 61: Hoare triple {37405#(<= ~counter~0 6)} assume !(0 == ~cond); {37405#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:48,347 INFO L290 TraceCheckUtils]: 62: Hoare triple {37405#(<= ~counter~0 6)} assume true; {37405#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:48,347 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {37405#(<= ~counter~0 6)} {37405#(<= ~counter~0 6)} #96#return; {37405#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:48,347 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-08 12:37:48,348 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-08 12:37:48,348 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-08 12:37:48,349 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-08 12:37:48,349 INFO L290 TraceCheckUtils]: 68: Hoare triple {37430#(<= ~counter~0 7)} ~cond := #in~cond; {37430#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:48,349 INFO L290 TraceCheckUtils]: 69: Hoare triple {37430#(<= ~counter~0 7)} assume !(0 == ~cond); {37430#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:48,349 INFO L290 TraceCheckUtils]: 70: Hoare triple {37430#(<= ~counter~0 7)} assume true; {37430#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:48,350 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {37430#(<= ~counter~0 7)} {37430#(<= ~counter~0 7)} #96#return; {37430#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:48,350 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-08 12:37:48,351 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-08 12:37:48,351 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-08 12:37:48,351 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-08 12:37:48,352 INFO L290 TraceCheckUtils]: 76: Hoare triple {37455#(<= ~counter~0 8)} ~cond := #in~cond; {37455#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:48,352 INFO L290 TraceCheckUtils]: 77: Hoare triple {37455#(<= ~counter~0 8)} assume !(0 == ~cond); {37455#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:48,352 INFO L290 TraceCheckUtils]: 78: Hoare triple {37455#(<= ~counter~0 8)} assume true; {37455#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:48,353 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {37455#(<= ~counter~0 8)} {37455#(<= ~counter~0 8)} #96#return; {37455#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:48,353 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-08 12:37:48,353 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-08 12:37:48,354 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-08 12:37:48,354 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-08 12:37:48,354 INFO L290 TraceCheckUtils]: 84: Hoare triple {37480#(<= ~counter~0 9)} ~cond := #in~cond; {37480#(<= ~counter~0 9)} is VALID [2022-04-08 12:37:48,355 INFO L290 TraceCheckUtils]: 85: Hoare triple {37480#(<= ~counter~0 9)} assume !(0 == ~cond); {37480#(<= ~counter~0 9)} is VALID [2022-04-08 12:37:48,355 INFO L290 TraceCheckUtils]: 86: Hoare triple {37480#(<= ~counter~0 9)} assume true; {37480#(<= ~counter~0 9)} is VALID [2022-04-08 12:37:48,355 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {37480#(<= ~counter~0 9)} {37480#(<= ~counter~0 9)} #96#return; {37480#(<= ~counter~0 9)} is VALID [2022-04-08 12:37:48,356 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-08 12:37:48,356 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-08 12:37:48,357 INFO L290 TraceCheckUtils]: 90: Hoare triple {37505#(<= |main_#t~post7| 9)} assume !(#t~post7 < 20);havoc #t~post7; {37224#false} is VALID [2022-04-08 12:37:48,357 INFO L290 TraceCheckUtils]: 91: Hoare triple {37224#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {37224#false} is VALID [2022-04-08 12:37:48,357 INFO L290 TraceCheckUtils]: 92: Hoare triple {37224#false} assume !(#t~post8 < 20);havoc #t~post8; {37224#false} is VALID [2022-04-08 12:37:48,357 INFO L290 TraceCheckUtils]: 93: Hoare triple {37224#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37224#false} is VALID [2022-04-08 12:37:48,357 INFO L290 TraceCheckUtils]: 94: Hoare triple {37224#false} assume !(#t~post6 < 20);havoc #t~post6; {37224#false} is VALID [2022-04-08 12:37:48,357 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-08 12:37:48,357 INFO L290 TraceCheckUtils]: 96: Hoare triple {37224#false} ~cond := #in~cond; {37224#false} is VALID [2022-04-08 12:37:48,357 INFO L290 TraceCheckUtils]: 97: Hoare triple {37224#false} assume 0 == ~cond; {37224#false} is VALID [2022-04-08 12:37:48,357 INFO L290 TraceCheckUtils]: 98: Hoare triple {37224#false} assume !false; {37224#false} is VALID [2022-04-08 12:37:48,357 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-08 12:37:48,358 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:37:48,846 INFO L290 TraceCheckUtils]: 98: Hoare triple {37224#false} assume !false; {37224#false} is VALID [2022-04-08 12:37:48,846 INFO L290 TraceCheckUtils]: 97: Hoare triple {37224#false} assume 0 == ~cond; {37224#false} is VALID [2022-04-08 12:37:48,846 INFO L290 TraceCheckUtils]: 96: Hoare triple {37224#false} ~cond := #in~cond; {37224#false} is VALID [2022-04-08 12:37:48,846 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-08 12:37:48,846 INFO L290 TraceCheckUtils]: 94: Hoare triple {37224#false} assume !(#t~post6 < 20);havoc #t~post6; {37224#false} is VALID [2022-04-08 12:37:48,846 INFO L290 TraceCheckUtils]: 93: Hoare triple {37224#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37224#false} is VALID [2022-04-08 12:37:48,846 INFO L290 TraceCheckUtils]: 92: Hoare triple {37224#false} assume !(#t~post8 < 20);havoc #t~post8; {37224#false} is VALID [2022-04-08 12:37:48,846 INFO L290 TraceCheckUtils]: 91: Hoare triple {37224#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {37224#false} is VALID [2022-04-08 12:37:48,856 INFO L290 TraceCheckUtils]: 90: Hoare triple {37557#(< |main_#t~post7| 20)} assume !(#t~post7 < 20);havoc #t~post7; {37224#false} is VALID [2022-04-08 12:37:48,856 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-08 12:37:48,857 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-08 12:37:48,857 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {37223#true} {37561#(< ~counter~0 20)} #96#return; {37561#(< ~counter~0 20)} is VALID [2022-04-08 12:37:48,857 INFO L290 TraceCheckUtils]: 86: Hoare triple {37223#true} assume true; {37223#true} is VALID [2022-04-08 12:37:48,857 INFO L290 TraceCheckUtils]: 85: Hoare triple {37223#true} assume !(0 == ~cond); {37223#true} is VALID [2022-04-08 12:37:48,857 INFO L290 TraceCheckUtils]: 84: Hoare triple {37223#true} ~cond := #in~cond; {37223#true} is VALID [2022-04-08 12:37:48,858 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-08 12:37:48,858 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-08 12:37:48,859 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-08 12:37:48,859 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-08 12:37:48,859 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {37223#true} {37586#(< ~counter~0 19)} #96#return; {37586#(< ~counter~0 19)} is VALID [2022-04-08 12:37:48,860 INFO L290 TraceCheckUtils]: 78: Hoare triple {37223#true} assume true; {37223#true} is VALID [2022-04-08 12:37:48,860 INFO L290 TraceCheckUtils]: 77: Hoare triple {37223#true} assume !(0 == ~cond); {37223#true} is VALID [2022-04-08 12:37:48,860 INFO L290 TraceCheckUtils]: 76: Hoare triple {37223#true} ~cond := #in~cond; {37223#true} is VALID [2022-04-08 12:37:48,860 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-08 12:37:48,860 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-08 12:37:48,861 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-08 12:37:48,861 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-08 12:37:48,861 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {37223#true} {37611#(< ~counter~0 18)} #96#return; {37611#(< ~counter~0 18)} is VALID [2022-04-08 12:37:48,861 INFO L290 TraceCheckUtils]: 70: Hoare triple {37223#true} assume true; {37223#true} is VALID [2022-04-08 12:37:48,861 INFO L290 TraceCheckUtils]: 69: Hoare triple {37223#true} assume !(0 == ~cond); {37223#true} is VALID [2022-04-08 12:37:48,862 INFO L290 TraceCheckUtils]: 68: Hoare triple {37223#true} ~cond := #in~cond; {37223#true} is VALID [2022-04-08 12:37:48,862 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-08 12:37:48,862 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-08 12:37:48,862 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-08 12:37:48,863 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-08 12:37:48,863 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {37223#true} {37636#(< ~counter~0 17)} #96#return; {37636#(< ~counter~0 17)} is VALID [2022-04-08 12:37:48,863 INFO L290 TraceCheckUtils]: 62: Hoare triple {37223#true} assume true; {37223#true} is VALID [2022-04-08 12:37:48,863 INFO L290 TraceCheckUtils]: 61: Hoare triple {37223#true} assume !(0 == ~cond); {37223#true} is VALID [2022-04-08 12:37:48,863 INFO L290 TraceCheckUtils]: 60: Hoare triple {37223#true} ~cond := #in~cond; {37223#true} is VALID [2022-04-08 12:37:48,863 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-08 12:37:48,868 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-08 12:37:48,869 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-08 12:37:48,870 INFO L290 TraceCheckUtils]: 56: Hoare triple {37661#(< ~counter~0 16)} assume !!(0 != ~r~0); {37661#(< ~counter~0 16)} is VALID [2022-04-08 12:37:48,870 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {37223#true} {37661#(< ~counter~0 16)} #94#return; {37661#(< ~counter~0 16)} is VALID [2022-04-08 12:37:48,870 INFO L290 TraceCheckUtils]: 54: Hoare triple {37223#true} assume true; {37223#true} is VALID [2022-04-08 12:37:48,870 INFO L290 TraceCheckUtils]: 53: Hoare triple {37223#true} assume !(0 == ~cond); {37223#true} is VALID [2022-04-08 12:37:48,870 INFO L290 TraceCheckUtils]: 52: Hoare triple {37223#true} ~cond := #in~cond; {37223#true} is VALID [2022-04-08 12:37:48,870 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-08 12:37:48,871 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-08 12:37:48,871 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-08 12:37:48,872 INFO L290 TraceCheckUtils]: 48: Hoare triple {37686#(< ~counter~0 15)} assume !(~r~0 < 0); {37686#(< ~counter~0 15)} is VALID [2022-04-08 12:37:48,872 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {37223#true} {37686#(< ~counter~0 15)} #98#return; {37686#(< ~counter~0 15)} is VALID [2022-04-08 12:37:48,872 INFO L290 TraceCheckUtils]: 46: Hoare triple {37223#true} assume true; {37223#true} is VALID [2022-04-08 12:37:48,872 INFO L290 TraceCheckUtils]: 45: Hoare triple {37223#true} assume !(0 == ~cond); {37223#true} is VALID [2022-04-08 12:37:48,872 INFO L290 TraceCheckUtils]: 44: Hoare triple {37223#true} ~cond := #in~cond; {37223#true} is VALID [2022-04-08 12:37:48,872 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-08 12:37:48,873 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-08 12:37:48,873 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-08 12:37:48,873 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-08 12:37:48,874 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {37223#true} {37711#(< ~counter~0 14)} #98#return; {37711#(< ~counter~0 14)} is VALID [2022-04-08 12:37:48,874 INFO L290 TraceCheckUtils]: 38: Hoare triple {37223#true} assume true; {37223#true} is VALID [2022-04-08 12:37:48,874 INFO L290 TraceCheckUtils]: 37: Hoare triple {37223#true} assume !(0 == ~cond); {37223#true} is VALID [2022-04-08 12:37:48,874 INFO L290 TraceCheckUtils]: 36: Hoare triple {37223#true} ~cond := #in~cond; {37223#true} is VALID [2022-04-08 12:37:48,874 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-08 12:37:48,874 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-08 12:37:48,875 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-08 12:37:48,875 INFO L290 TraceCheckUtils]: 32: Hoare triple {37736#(< ~counter~0 13)} assume !(~r~0 > 0); {37736#(< ~counter~0 13)} is VALID [2022-04-08 12:37:48,876 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {37223#true} {37736#(< ~counter~0 13)} #96#return; {37736#(< ~counter~0 13)} is VALID [2022-04-08 12:37:48,876 INFO L290 TraceCheckUtils]: 30: Hoare triple {37223#true} assume true; {37223#true} is VALID [2022-04-08 12:37:48,876 INFO L290 TraceCheckUtils]: 29: Hoare triple {37223#true} assume !(0 == ~cond); {37223#true} is VALID [2022-04-08 12:37:48,876 INFO L290 TraceCheckUtils]: 28: Hoare triple {37223#true} ~cond := #in~cond; {37223#true} is VALID [2022-04-08 12:37:48,876 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-08 12:37:48,876 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-08 12:37:48,877 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-08 12:37:48,877 INFO L290 TraceCheckUtils]: 24: Hoare triple {37761#(< ~counter~0 12)} assume !!(0 != ~r~0); {37761#(< ~counter~0 12)} is VALID [2022-04-08 12:37:48,877 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {37223#true} {37761#(< ~counter~0 12)} #94#return; {37761#(< ~counter~0 12)} is VALID [2022-04-08 12:37:48,877 INFO L290 TraceCheckUtils]: 22: Hoare triple {37223#true} assume true; {37223#true} is VALID [2022-04-08 12:37:48,878 INFO L290 TraceCheckUtils]: 21: Hoare triple {37223#true} assume !(0 == ~cond); {37223#true} is VALID [2022-04-08 12:37:48,878 INFO L290 TraceCheckUtils]: 20: Hoare triple {37223#true} ~cond := #in~cond; {37223#true} is VALID [2022-04-08 12:37:48,878 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-08 12:37:48,878 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-08 12:37:48,878 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-08 12:37:48,879 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-08 12:37:48,879 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {37223#true} {37786#(< ~counter~0 11)} #92#return; {37786#(< ~counter~0 11)} is VALID [2022-04-08 12:37:48,879 INFO L290 TraceCheckUtils]: 14: Hoare triple {37223#true} assume true; {37223#true} is VALID [2022-04-08 12:37:48,879 INFO L290 TraceCheckUtils]: 13: Hoare triple {37223#true} assume !(0 == ~cond); {37223#true} is VALID [2022-04-08 12:37:48,879 INFO L290 TraceCheckUtils]: 12: Hoare triple {37223#true} ~cond := #in~cond; {37223#true} is VALID [2022-04-08 12:37:48,879 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-08 12:37:48,880 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {37223#true} {37786#(< ~counter~0 11)} #90#return; {37786#(< ~counter~0 11)} is VALID [2022-04-08 12:37:48,880 INFO L290 TraceCheckUtils]: 9: Hoare triple {37223#true} assume true; {37223#true} is VALID [2022-04-08 12:37:48,880 INFO L290 TraceCheckUtils]: 8: Hoare triple {37223#true} assume !(0 == ~cond); {37223#true} is VALID [2022-04-08 12:37:48,880 INFO L290 TraceCheckUtils]: 7: Hoare triple {37223#true} ~cond := #in~cond; {37223#true} is VALID [2022-04-08 12:37:48,880 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-08 12:37:48,880 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-08 12:37:48,881 INFO L272 TraceCheckUtils]: 4: Hoare triple {37786#(< ~counter~0 11)} call #t~ret9 := main(); {37786#(< ~counter~0 11)} is VALID [2022-04-08 12:37:48,881 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37786#(< ~counter~0 11)} {37223#true} #102#return; {37786#(< ~counter~0 11)} is VALID [2022-04-08 12:37:48,881 INFO L290 TraceCheckUtils]: 2: Hoare triple {37786#(< ~counter~0 11)} assume true; {37786#(< ~counter~0 11)} is VALID [2022-04-08 12:37:48,882 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-08 12:37:48,882 INFO L272 TraceCheckUtils]: 0: Hoare triple {37223#true} call ULTIMATE.init(); {37223#true} is VALID [2022-04-08 12:37:48,882 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-08 12:37:48,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:37:48,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913743798] [2022-04-08 12:37:48,882 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:37:48,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976559870] [2022-04-08 12:37:48,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [976559870] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:37:48,882 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:37:48,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-04-08 12:37:48,883 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:37:48,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1286465309] [2022-04-08 12:37:48,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1286465309] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:37:48,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:37:48,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 12:37:48,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407555719] [2022-04-08 12:37:48,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:37:48,883 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-08 12:37:48,883 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:37:48,884 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-08 12:37:48,946 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-08 12:37:48,946 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 12:37:48,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:37:48,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 12:37:48,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-08 12:37:48,947 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-08 12:37:49,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:37:49,993 INFO L93 Difference]: Finished difference Result 471 states and 642 transitions. [2022-04-08 12:37:49,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-08 12:37:49,993 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-08 12:37:49,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:37:49,994 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-08 12:37:49,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 216 transitions. [2022-04-08 12:37:49,998 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-08 12:37:49,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 216 transitions. [2022-04-08 12:37:49,999 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 216 transitions. [2022-04-08 12:37:50,145 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-08 12:37:50,151 INFO L225 Difference]: With dead ends: 471 [2022-04-08 12:37:50,151 INFO L226 Difference]: Without dead ends: 364 [2022-04-08 12:37:50,152 INFO L912 BasicCegarLoop]: 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-08 12:37:50,152 INFO L913 BasicCegarLoop]: 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-08 12:37:50,152 INFO L914 BasicCegarLoop]: 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-08 12:37:50,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2022-04-08 12:37:50,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 364. [2022-04-08 12:37:50,672 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:37:50,672 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-08 12:37:50,673 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-08 12:37:50,673 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-08 12:37:50,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:37:50,678 INFO L93 Difference]: Finished difference Result 364 states and 480 transitions. [2022-04-08 12:37:50,678 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 480 transitions. [2022-04-08 12:37:50,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:37:50,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:37:50,679 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-08 12:37:50,680 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-08 12:37:50,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:37:50,685 INFO L93 Difference]: Finished difference Result 364 states and 480 transitions. [2022-04-08 12:37:50,685 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 480 transitions. [2022-04-08 12:37:50,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:37:50,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:37:50,686 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:37:50,686 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:37:50,686 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-08 12:37:50,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 480 transitions. [2022-04-08 12:37:50,693 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 480 transitions. Word has length 99 [2022-04-08 12:37:50,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:37:50,693 INFO L478 AbstractCegarLoop]: Abstraction has 364 states and 480 transitions. [2022-04-08 12:37:50,693 INFO L479 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-08 12:37:50,693 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 364 states and 480 transitions. [2022-04-08 12:37:53,507 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 480 edges. 479 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 12:37:53,507 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 480 transitions. [2022-04-08 12:37:53,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-04-08 12:37:53,508 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:37:53,508 INFO L499 BasicCegarLoop]: 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-08 12:37:53,524 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-08 12:37:53,709 WARN L460 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-08 12:37:53,709 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:37:53,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:37:53,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1761003221, now seen corresponding path program 3 times [2022-04-08 12:37:53,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:37:53,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2099544188] [2022-04-08 12:37:53,710 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:37:53,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1761003221, now seen corresponding path program 4 times [2022-04-08 12:37:53,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:37:53,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594904110] [2022-04-08 12:37:53,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:37:53,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:37:53,722 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:37:53,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [839372965] [2022-04-08 12:37:53,722 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 12:37:53,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:37:53,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:37:53,723 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-08 12:37:53,724 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-08 12:37:53,827 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 12:37:53,827 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:37:53,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-08 12:37:53,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:37:53,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:37:54,333 INFO L272 TraceCheckUtils]: 0: Hoare triple {40254#true} call ULTIMATE.init(); {40254#true} is VALID [2022-04-08 12:37:54,334 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-08 12:37:54,334 INFO L290 TraceCheckUtils]: 2: Hoare triple {40262#(<= ~counter~0 0)} assume true; {40262#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:54,334 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40262#(<= ~counter~0 0)} {40254#true} #102#return; {40262#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:54,335 INFO L272 TraceCheckUtils]: 4: Hoare triple {40262#(<= ~counter~0 0)} call #t~ret9 := main(); {40262#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:54,335 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-08 12:37:54,335 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-08 12:37:54,336 INFO L290 TraceCheckUtils]: 7: Hoare triple {40262#(<= ~counter~0 0)} ~cond := #in~cond; {40262#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:54,336 INFO L290 TraceCheckUtils]: 8: Hoare triple {40262#(<= ~counter~0 0)} assume !(0 == ~cond); {40262#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:54,348 INFO L290 TraceCheckUtils]: 9: Hoare triple {40262#(<= ~counter~0 0)} assume true; {40262#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:54,349 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {40262#(<= ~counter~0 0)} {40262#(<= ~counter~0 0)} #90#return; {40262#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:54,349 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-08 12:37:54,349 INFO L290 TraceCheckUtils]: 12: Hoare triple {40262#(<= ~counter~0 0)} ~cond := #in~cond; {40262#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:54,349 INFO L290 TraceCheckUtils]: 13: Hoare triple {40262#(<= ~counter~0 0)} assume !(0 == ~cond); {40262#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:54,350 INFO L290 TraceCheckUtils]: 14: Hoare triple {40262#(<= ~counter~0 0)} assume true; {40262#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:54,350 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {40262#(<= ~counter~0 0)} {40262#(<= ~counter~0 0)} #92#return; {40262#(<= ~counter~0 0)} is VALID [2022-04-08 12:37:54,350 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-08 12:37:54,351 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-08 12:37:54,352 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-08 12:37:54,352 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-08 12:37:54,352 INFO L290 TraceCheckUtils]: 20: Hoare triple {40311#(<= ~counter~0 1)} ~cond := #in~cond; {40311#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:54,353 INFO L290 TraceCheckUtils]: 21: Hoare triple {40311#(<= ~counter~0 1)} assume !(0 == ~cond); {40311#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:54,353 INFO L290 TraceCheckUtils]: 22: Hoare triple {40311#(<= ~counter~0 1)} assume true; {40311#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:54,353 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {40311#(<= ~counter~0 1)} {40311#(<= ~counter~0 1)} #94#return; {40311#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:54,354 INFO L290 TraceCheckUtils]: 24: Hoare triple {40311#(<= ~counter~0 1)} assume !!(0 != ~r~0); {40311#(<= ~counter~0 1)} is VALID [2022-04-08 12:37:54,354 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-08 12:37:54,355 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-08 12:37:54,355 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-08 12:37:54,355 INFO L290 TraceCheckUtils]: 28: Hoare triple {40336#(<= ~counter~0 2)} ~cond := #in~cond; {40336#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:54,356 INFO L290 TraceCheckUtils]: 29: Hoare triple {40336#(<= ~counter~0 2)} assume !(0 == ~cond); {40336#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:54,356 INFO L290 TraceCheckUtils]: 30: Hoare triple {40336#(<= ~counter~0 2)} assume true; {40336#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:54,356 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {40336#(<= ~counter~0 2)} {40336#(<= ~counter~0 2)} #96#return; {40336#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:54,357 INFO L290 TraceCheckUtils]: 32: Hoare triple {40336#(<= ~counter~0 2)} assume !(~r~0 > 0); {40336#(<= ~counter~0 2)} is VALID [2022-04-08 12:37:54,357 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-08 12:37:54,357 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-08 12:37:54,358 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-08 12:37:54,358 INFO L290 TraceCheckUtils]: 36: Hoare triple {40361#(<= ~counter~0 3)} ~cond := #in~cond; {40361#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:54,358 INFO L290 TraceCheckUtils]: 37: Hoare triple {40361#(<= ~counter~0 3)} assume !(0 == ~cond); {40361#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:54,359 INFO L290 TraceCheckUtils]: 38: Hoare triple {40361#(<= ~counter~0 3)} assume true; {40361#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:54,359 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {40361#(<= ~counter~0 3)} {40361#(<= ~counter~0 3)} #98#return; {40361#(<= ~counter~0 3)} is VALID [2022-04-08 12:37:54,359 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-08 12:37:54,360 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-08 12:37:54,360 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-08 12:37:54,361 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-08 12:37:54,361 INFO L290 TraceCheckUtils]: 44: Hoare triple {40386#(<= ~counter~0 4)} ~cond := #in~cond; {40386#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:54,361 INFO L290 TraceCheckUtils]: 45: Hoare triple {40386#(<= ~counter~0 4)} assume !(0 == ~cond); {40386#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:54,361 INFO L290 TraceCheckUtils]: 46: Hoare triple {40386#(<= ~counter~0 4)} assume true; {40386#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:54,362 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {40386#(<= ~counter~0 4)} {40386#(<= ~counter~0 4)} #98#return; {40386#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:54,362 INFO L290 TraceCheckUtils]: 48: Hoare triple {40386#(<= ~counter~0 4)} assume !(~r~0 < 0); {40386#(<= ~counter~0 4)} is VALID [2022-04-08 12:37:54,363 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-08 12:37:54,363 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-08 12:37:54,363 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-08 12:37:54,364 INFO L290 TraceCheckUtils]: 52: Hoare triple {40411#(<= ~counter~0 5)} ~cond := #in~cond; {40411#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:54,364 INFO L290 TraceCheckUtils]: 53: Hoare triple {40411#(<= ~counter~0 5)} assume !(0 == ~cond); {40411#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:54,364 INFO L290 TraceCheckUtils]: 54: Hoare triple {40411#(<= ~counter~0 5)} assume true; {40411#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:54,365 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {40411#(<= ~counter~0 5)} {40411#(<= ~counter~0 5)} #94#return; {40411#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:54,365 INFO L290 TraceCheckUtils]: 56: Hoare triple {40411#(<= ~counter~0 5)} assume !!(0 != ~r~0); {40411#(<= ~counter~0 5)} is VALID [2022-04-08 12:37:54,367 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-08 12:37:54,368 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-08 12:37:54,368 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-08 12:37:54,369 INFO L290 TraceCheckUtils]: 60: Hoare triple {40436#(<= ~counter~0 6)} ~cond := #in~cond; {40436#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:54,369 INFO L290 TraceCheckUtils]: 61: Hoare triple {40436#(<= ~counter~0 6)} assume !(0 == ~cond); {40436#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:54,369 INFO L290 TraceCheckUtils]: 62: Hoare triple {40436#(<= ~counter~0 6)} assume true; {40436#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:54,370 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {40436#(<= ~counter~0 6)} {40436#(<= ~counter~0 6)} #96#return; {40436#(<= ~counter~0 6)} is VALID [2022-04-08 12:37:54,370 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-08 12:37:54,371 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-08 12:37:54,371 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-08 12:37:54,372 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-08 12:37:54,372 INFO L290 TraceCheckUtils]: 68: Hoare triple {40461#(<= ~counter~0 7)} ~cond := #in~cond; {40461#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:54,372 INFO L290 TraceCheckUtils]: 69: Hoare triple {40461#(<= ~counter~0 7)} assume !(0 == ~cond); {40461#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:54,372 INFO L290 TraceCheckUtils]: 70: Hoare triple {40461#(<= ~counter~0 7)} assume true; {40461#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:54,373 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {40461#(<= ~counter~0 7)} {40461#(<= ~counter~0 7)} #96#return; {40461#(<= ~counter~0 7)} is VALID [2022-04-08 12:37:54,373 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-08 12:37:54,374 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-08 12:37:54,374 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-08 12:37:54,374 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-08 12:37:54,375 INFO L290 TraceCheckUtils]: 76: Hoare triple {40486#(<= ~counter~0 8)} ~cond := #in~cond; {40486#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:54,375 INFO L290 TraceCheckUtils]: 77: Hoare triple {40486#(<= ~counter~0 8)} assume !(0 == ~cond); {40486#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:54,375 INFO L290 TraceCheckUtils]: 78: Hoare triple {40486#(<= ~counter~0 8)} assume true; {40486#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:54,376 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {40486#(<= ~counter~0 8)} {40486#(<= ~counter~0 8)} #96#return; {40486#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:54,376 INFO L290 TraceCheckUtils]: 80: Hoare triple {40486#(<= ~counter~0 8)} assume !(~r~0 > 0); {40486#(<= ~counter~0 8)} is VALID [2022-04-08 12:37:54,377 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-08 12:37:54,377 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-08 12:37:54,377 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-08 12:37:54,377 INFO L290 TraceCheckUtils]: 84: Hoare triple {40511#(<= ~counter~0 9)} ~cond := #in~cond; {40511#(<= ~counter~0 9)} is VALID [2022-04-08 12:37:54,378 INFO L290 TraceCheckUtils]: 85: Hoare triple {40511#(<= ~counter~0 9)} assume !(0 == ~cond); {40511#(<= ~counter~0 9)} is VALID [2022-04-08 12:37:54,378 INFO L290 TraceCheckUtils]: 86: Hoare triple {40511#(<= ~counter~0 9)} assume true; {40511#(<= ~counter~0 9)} is VALID [2022-04-08 12:37:54,378 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {40511#(<= ~counter~0 9)} {40511#(<= ~counter~0 9)} #98#return; {40511#(<= ~counter~0 9)} is VALID [2022-04-08 12:37:54,379 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-08 12:37:54,379 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-08 12:37:54,380 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-08 12:37:54,380 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-08 12:37:54,380 INFO L290 TraceCheckUtils]: 92: Hoare triple {40536#(<= ~counter~0 10)} ~cond := #in~cond; {40536#(<= ~counter~0 10)} is VALID [2022-04-08 12:37:54,381 INFO L290 TraceCheckUtils]: 93: Hoare triple {40536#(<= ~counter~0 10)} assume !(0 == ~cond); {40536#(<= ~counter~0 10)} is VALID [2022-04-08 12:37:54,381 INFO L290 TraceCheckUtils]: 94: Hoare triple {40536#(<= ~counter~0 10)} assume true; {40536#(<= ~counter~0 10)} is VALID [2022-04-08 12:37:54,381 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {40536#(<= ~counter~0 10)} {40536#(<= ~counter~0 10)} #98#return; {40536#(<= ~counter~0 10)} is VALID [2022-04-08 12:37:54,382 INFO L290 TraceCheckUtils]: 96: Hoare triple {40536#(<= ~counter~0 10)} assume !(~r~0 < 0); {40536#(<= ~counter~0 10)} is VALID [2022-04-08 12:37:54,382 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-08 12:37:54,382 INFO L290 TraceCheckUtils]: 98: Hoare triple {40561#(<= |main_#t~post6| 10)} assume !(#t~post6 < 20);havoc #t~post6; {40255#false} is VALID [2022-04-08 12:37:54,382 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-08 12:37:54,382 INFO L290 TraceCheckUtils]: 100: Hoare triple {40255#false} ~cond := #in~cond; {40255#false} is VALID [2022-04-08 12:37:54,382 INFO L290 TraceCheckUtils]: 101: Hoare triple {40255#false} assume 0 == ~cond; {40255#false} is VALID [2022-04-08 12:37:54,382 INFO L290 TraceCheckUtils]: 102: Hoare triple {40255#false} assume !false; {40255#false} is VALID [2022-04-08 12:37:54,383 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-08 12:37:54,383 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:37:54,908 INFO L290 TraceCheckUtils]: 102: Hoare triple {40255#false} assume !false; {40255#false} is VALID [2022-04-08 12:37:54,908 INFO L290 TraceCheckUtils]: 101: Hoare triple {40255#false} assume 0 == ~cond; {40255#false} is VALID [2022-04-08 12:37:54,908 INFO L290 TraceCheckUtils]: 100: Hoare triple {40255#false} ~cond := #in~cond; {40255#false} is VALID [2022-04-08 12:37:54,908 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-08 12:37:54,908 INFO L290 TraceCheckUtils]: 98: Hoare triple {40589#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {40255#false} is VALID [2022-04-08 12:37:54,909 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-08 12:37:54,909 INFO L290 TraceCheckUtils]: 96: Hoare triple {40593#(< ~counter~0 20)} assume !(~r~0 < 0); {40593#(< ~counter~0 20)} is VALID [2022-04-08 12:37:54,910 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {40254#true} {40593#(< ~counter~0 20)} #98#return; {40593#(< ~counter~0 20)} is VALID [2022-04-08 12:37:54,910 INFO L290 TraceCheckUtils]: 94: Hoare triple {40254#true} assume true; {40254#true} is VALID [2022-04-08 12:37:54,910 INFO L290 TraceCheckUtils]: 93: Hoare triple {40254#true} assume !(0 == ~cond); {40254#true} is VALID [2022-04-08 12:37:54,910 INFO L290 TraceCheckUtils]: 92: Hoare triple {40254#true} ~cond := #in~cond; {40254#true} is VALID [2022-04-08 12:37:54,910 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-08 12:37:54,910 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-08 12:37:54,911 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-08 12:37:54,911 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-08 12:37:54,912 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {40254#true} {40618#(< ~counter~0 19)} #98#return; {40618#(< ~counter~0 19)} is VALID [2022-04-08 12:37:54,912 INFO L290 TraceCheckUtils]: 86: Hoare triple {40254#true} assume true; {40254#true} is VALID [2022-04-08 12:37:54,912 INFO L290 TraceCheckUtils]: 85: Hoare triple {40254#true} assume !(0 == ~cond); {40254#true} is VALID [2022-04-08 12:37:54,912 INFO L290 TraceCheckUtils]: 84: Hoare triple {40254#true} ~cond := #in~cond; {40254#true} is VALID [2022-04-08 12:37:54,912 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-08 12:37:54,912 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-08 12:37:54,913 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-08 12:37:54,913 INFO L290 TraceCheckUtils]: 80: Hoare triple {40643#(< ~counter~0 18)} assume !(~r~0 > 0); {40643#(< ~counter~0 18)} is VALID [2022-04-08 12:37:54,914 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {40254#true} {40643#(< ~counter~0 18)} #96#return; {40643#(< ~counter~0 18)} is VALID [2022-04-08 12:37:54,914 INFO L290 TraceCheckUtils]: 78: Hoare triple {40254#true} assume true; {40254#true} is VALID [2022-04-08 12:37:54,914 INFO L290 TraceCheckUtils]: 77: Hoare triple {40254#true} assume !(0 == ~cond); {40254#true} is VALID [2022-04-08 12:37:54,914 INFO L290 TraceCheckUtils]: 76: Hoare triple {40254#true} ~cond := #in~cond; {40254#true} is VALID [2022-04-08 12:37:54,914 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-08 12:37:54,914 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-08 12:37:54,915 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-08 12:37:54,915 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-08 12:37:54,916 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {40254#true} {40668#(< ~counter~0 17)} #96#return; {40668#(< ~counter~0 17)} is VALID [2022-04-08 12:37:54,926 INFO L290 TraceCheckUtils]: 70: Hoare triple {40254#true} assume true; {40254#true} is VALID [2022-04-08 12:37:54,926 INFO L290 TraceCheckUtils]: 69: Hoare triple {40254#true} assume !(0 == ~cond); {40254#true} is VALID [2022-04-08 12:37:54,927 INFO L290 TraceCheckUtils]: 68: Hoare triple {40254#true} ~cond := #in~cond; {40254#true} is VALID [2022-04-08 12:37:54,927 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-08 12:37:54,927 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-08 12:37:54,928 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-08 12:37:54,929 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-08 12:37:54,929 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {40254#true} {40693#(< ~counter~0 16)} #96#return; {40693#(< ~counter~0 16)} is VALID [2022-04-08 12:37:54,929 INFO L290 TraceCheckUtils]: 62: Hoare triple {40254#true} assume true; {40254#true} is VALID [2022-04-08 12:37:54,929 INFO L290 TraceCheckUtils]: 61: Hoare triple {40254#true} assume !(0 == ~cond); {40254#true} is VALID [2022-04-08 12:37:54,929 INFO L290 TraceCheckUtils]: 60: Hoare triple {40254#true} ~cond := #in~cond; {40254#true} is VALID [2022-04-08 12:37:54,929 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-08 12:37:54,930 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-08 12:37:54,930 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-08 12:37:54,931 INFO L290 TraceCheckUtils]: 56: Hoare triple {40718#(< ~counter~0 15)} assume !!(0 != ~r~0); {40718#(< ~counter~0 15)} is VALID [2022-04-08 12:37:54,931 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {40254#true} {40718#(< ~counter~0 15)} #94#return; {40718#(< ~counter~0 15)} is VALID [2022-04-08 12:37:54,931 INFO L290 TraceCheckUtils]: 54: Hoare triple {40254#true} assume true; {40254#true} is VALID [2022-04-08 12:37:54,931 INFO L290 TraceCheckUtils]: 53: Hoare triple {40254#true} assume !(0 == ~cond); {40254#true} is VALID [2022-04-08 12:37:54,931 INFO L290 TraceCheckUtils]: 52: Hoare triple {40254#true} ~cond := #in~cond; {40254#true} is VALID [2022-04-08 12:37:54,931 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-08 12:37:54,931 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-08 12:37:54,932 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-08 12:37:54,932 INFO L290 TraceCheckUtils]: 48: Hoare triple {40743#(< ~counter~0 14)} assume !(~r~0 < 0); {40743#(< ~counter~0 14)} is VALID [2022-04-08 12:37:54,933 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {40254#true} {40743#(< ~counter~0 14)} #98#return; {40743#(< ~counter~0 14)} is VALID [2022-04-08 12:37:54,933 INFO L290 TraceCheckUtils]: 46: Hoare triple {40254#true} assume true; {40254#true} is VALID [2022-04-08 12:37:54,933 INFO L290 TraceCheckUtils]: 45: Hoare triple {40254#true} assume !(0 == ~cond); {40254#true} is VALID [2022-04-08 12:37:54,933 INFO L290 TraceCheckUtils]: 44: Hoare triple {40254#true} ~cond := #in~cond; {40254#true} is VALID [2022-04-08 12:37:54,933 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-08 12:37:54,933 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-08 12:37:54,934 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-08 12:37:54,934 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-08 12:37:54,935 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {40254#true} {40768#(< ~counter~0 13)} #98#return; {40768#(< ~counter~0 13)} is VALID [2022-04-08 12:37:54,935 INFO L290 TraceCheckUtils]: 38: Hoare triple {40254#true} assume true; {40254#true} is VALID [2022-04-08 12:37:54,935 INFO L290 TraceCheckUtils]: 37: Hoare triple {40254#true} assume !(0 == ~cond); {40254#true} is VALID [2022-04-08 12:37:54,935 INFO L290 TraceCheckUtils]: 36: Hoare triple {40254#true} ~cond := #in~cond; {40254#true} is VALID [2022-04-08 12:37:54,935 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-08 12:37:54,935 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-08 12:37:54,936 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-08 12:37:54,936 INFO L290 TraceCheckUtils]: 32: Hoare triple {40793#(< ~counter~0 12)} assume !(~r~0 > 0); {40793#(< ~counter~0 12)} is VALID [2022-04-08 12:37:54,936 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {40254#true} {40793#(< ~counter~0 12)} #96#return; {40793#(< ~counter~0 12)} is VALID [2022-04-08 12:37:54,936 INFO L290 TraceCheckUtils]: 30: Hoare triple {40254#true} assume true; {40254#true} is VALID [2022-04-08 12:37:54,937 INFO L290 TraceCheckUtils]: 29: Hoare triple {40254#true} assume !(0 == ~cond); {40254#true} is VALID [2022-04-08 12:37:54,937 INFO L290 TraceCheckUtils]: 28: Hoare triple {40254#true} ~cond := #in~cond; {40254#true} is VALID [2022-04-08 12:37:54,937 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-08 12:37:54,937 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-08 12:37:54,937 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-08 12:37:54,938 INFO L290 TraceCheckUtils]: 24: Hoare triple {40536#(<= ~counter~0 10)} assume !!(0 != ~r~0); {40536#(<= ~counter~0 10)} is VALID [2022-04-08 12:37:54,938 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {40254#true} {40536#(<= ~counter~0 10)} #94#return; {40536#(<= ~counter~0 10)} is VALID [2022-04-08 12:37:54,938 INFO L290 TraceCheckUtils]: 22: Hoare triple {40254#true} assume true; {40254#true} is VALID [2022-04-08 12:37:54,938 INFO L290 TraceCheckUtils]: 21: Hoare triple {40254#true} assume !(0 == ~cond); {40254#true} is VALID [2022-04-08 12:37:54,938 INFO L290 TraceCheckUtils]: 20: Hoare triple {40254#true} ~cond := #in~cond; {40254#true} is VALID [2022-04-08 12:37:54,938 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-08 12:37:54,939 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-08 12:37:54,939 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-08 12:37:54,940 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-08 12:37:54,940 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {40254#true} {40511#(<= ~counter~0 9)} #92#return; {40511#(<= ~counter~0 9)} is VALID [2022-04-08 12:37:54,940 INFO L290 TraceCheckUtils]: 14: Hoare triple {40254#true} assume true; {40254#true} is VALID [2022-04-08 12:37:54,940 INFO L290 TraceCheckUtils]: 13: Hoare triple {40254#true} assume !(0 == ~cond); {40254#true} is VALID [2022-04-08 12:37:54,940 INFO L290 TraceCheckUtils]: 12: Hoare triple {40254#true} ~cond := #in~cond; {40254#true} is VALID [2022-04-08 12:37:54,940 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-08 12:37:54,941 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {40254#true} {40511#(<= ~counter~0 9)} #90#return; {40511#(<= ~counter~0 9)} is VALID [2022-04-08 12:37:54,941 INFO L290 TraceCheckUtils]: 9: Hoare triple {40254#true} assume true; {40254#true} is VALID [2022-04-08 12:37:54,941 INFO L290 TraceCheckUtils]: 8: Hoare triple {40254#true} assume !(0 == ~cond); {40254#true} is VALID [2022-04-08 12:37:54,941 INFO L290 TraceCheckUtils]: 7: Hoare triple {40254#true} ~cond := #in~cond; {40254#true} is VALID [2022-04-08 12:37:54,941 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-08 12:37:54,941 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-08 12:37:54,941 INFO L272 TraceCheckUtils]: 4: Hoare triple {40511#(<= ~counter~0 9)} call #t~ret9 := main(); {40511#(<= ~counter~0 9)} is VALID [2022-04-08 12:37:54,942 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40511#(<= ~counter~0 9)} {40254#true} #102#return; {40511#(<= ~counter~0 9)} is VALID [2022-04-08 12:37:54,942 INFO L290 TraceCheckUtils]: 2: Hoare triple {40511#(<= ~counter~0 9)} assume true; {40511#(<= ~counter~0 9)} is VALID [2022-04-08 12:37:54,942 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-08 12:37:54,942 INFO L272 TraceCheckUtils]: 0: Hoare triple {40254#true} call ULTIMATE.init(); {40254#true} is VALID [2022-04-08 12:37:54,943 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-08 12:37:54,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:37:54,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594904110] [2022-04-08 12:37:54,943 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:37:54,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839372965] [2022-04-08 12:37:54,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839372965] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:37:54,943 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:37:54,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2022-04-08 12:37:54,943 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:37:54,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2099544188] [2022-04-08 12:37:54,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2099544188] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:37:54,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:37:54,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 12:37:54,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415492952] [2022-04-08 12:37:54,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:37:54,944 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-08 12:37:54,944 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:37:54,944 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-08 12:37:55,011 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-08 12:37:55,011 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 12:37:55,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:37:55,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 12:37:55,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-08 12:37:55,012 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-08 12:37:56,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:37:56,246 INFO L93 Difference]: Finished difference Result 407 states and 538 transitions. [2022-04-08 12:37:56,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-08 12:37:56,246 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-08 12:37:56,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:37:56,246 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-08 12:37:56,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 214 transitions. [2022-04-08 12:37:56,248 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-08 12:37:56,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 214 transitions. [2022-04-08 12:37:56,249 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 214 transitions. [2022-04-08 12:37:56,412 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-08 12:37:56,420 INFO L225 Difference]: With dead ends: 407 [2022-04-08 12:37:56,420 INFO L226 Difference]: Without dead ends: 396 [2022-04-08 12:37:56,420 INFO L912 BasicCegarLoop]: 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-08 12:37:56,421 INFO L913 BasicCegarLoop]: 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-08 12:37:56,421 INFO L914 BasicCegarLoop]: 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-08 12:37:56,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2022-04-08 12:37:56,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 377. [2022-04-08 12:37:56,940 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:37:56,940 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-08 12:37:56,941 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-08 12:37:56,941 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-08 12:37:56,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:37:56,948 INFO L93 Difference]: Finished difference Result 396 states and 523 transitions. [2022-04-08 12:37:56,948 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 523 transitions. [2022-04-08 12:37:56,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:37:56,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:37:56,949 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-08 12:37:56,949 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-08 12:37:56,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:37:56,956 INFO L93 Difference]: Finished difference Result 396 states and 523 transitions. [2022-04-08 12:37:56,956 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 523 transitions. [2022-04-08 12:37:56,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:37:56,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:37:56,957 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:37:56,957 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:37:56,957 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-08 12:37:56,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 501 transitions. [2022-04-08 12:37:56,964 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 501 transitions. Word has length 103 [2022-04-08 12:37:56,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:37:56,964 INFO L478 AbstractCegarLoop]: Abstraction has 377 states and 501 transitions. [2022-04-08 12:37:56,964 INFO L479 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-08 12:37:56,964 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 377 states and 501 transitions. [2022-04-08 12:37:59,203 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 501 edges. 501 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:37:59,203 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 501 transitions. [2022-04-08 12:37:59,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-04-08 12:37:59,204 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:37:59,204 INFO L499 BasicCegarLoop]: 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-08 12:37:59,220 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-08 12:37:59,407 WARN L460 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-08 12:37:59,407 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:37:59,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:37:59,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1733340336, now seen corresponding path program 9 times [2022-04-08 12:37:59,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:37:59,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [500614266] [2022-04-08 12:37:59,408 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:37:59,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1733340336, now seen corresponding path program 10 times [2022-04-08 12:37:59,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:37:59,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602207453] [2022-04-08 12:37:59,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:37:59,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:37:59,418 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:37:59,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1556723551] [2022-04-08 12:37:59,418 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 12:37:59,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:37:59,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:37:59,419 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-08 12:37:59,420 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-08 12:37:59,475 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 12:37:59,475 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:37:59,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 12:37:59,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:37:59,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:38:00,201 INFO L272 TraceCheckUtils]: 0: Hoare triple {43269#true} call ULTIMATE.init(); {43269#true} is VALID [2022-04-08 12:38:00,202 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-08 12:38:00,202 INFO L290 TraceCheckUtils]: 2: Hoare triple {43269#true} assume true; {43269#true} is VALID [2022-04-08 12:38:00,202 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43269#true} {43269#true} #102#return; {43269#true} is VALID [2022-04-08 12:38:00,202 INFO L272 TraceCheckUtils]: 4: Hoare triple {43269#true} call #t~ret9 := main(); {43269#true} is VALID [2022-04-08 12:38:00,202 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-08 12:38:00,202 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-08 12:38:00,202 INFO L290 TraceCheckUtils]: 7: Hoare triple {43269#true} ~cond := #in~cond; {43269#true} is VALID [2022-04-08 12:38:00,202 INFO L290 TraceCheckUtils]: 8: Hoare triple {43269#true} assume !(0 == ~cond); {43269#true} is VALID [2022-04-08 12:38:00,202 INFO L290 TraceCheckUtils]: 9: Hoare triple {43269#true} assume true; {43269#true} is VALID [2022-04-08 12:38:00,202 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {43269#true} {43269#true} #90#return; {43269#true} is VALID [2022-04-08 12:38:00,202 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-08 12:38:00,202 INFO L290 TraceCheckUtils]: 12: Hoare triple {43269#true} ~cond := #in~cond; {43269#true} is VALID [2022-04-08 12:38:00,202 INFO L290 TraceCheckUtils]: 13: Hoare triple {43269#true} assume !(0 == ~cond); {43269#true} is VALID [2022-04-08 12:38:00,202 INFO L290 TraceCheckUtils]: 14: Hoare triple {43269#true} assume true; {43269#true} is VALID [2022-04-08 12:38:00,203 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {43269#true} {43269#true} #92#return; {43269#true} is VALID [2022-04-08 12:38:00,203 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-08 12:38:00,203 INFO L290 TraceCheckUtils]: 17: Hoare triple {43269#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43269#true} is VALID [2022-04-08 12:38:00,203 INFO L290 TraceCheckUtils]: 18: Hoare triple {43269#true} assume !!(#t~post6 < 20);havoc #t~post6; {43269#true} is VALID [2022-04-08 12:38:00,203 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-08 12:38:00,203 INFO L290 TraceCheckUtils]: 20: Hoare triple {43269#true} ~cond := #in~cond; {43269#true} is VALID [2022-04-08 12:38:00,203 INFO L290 TraceCheckUtils]: 21: Hoare triple {43269#true} assume !(0 == ~cond); {43269#true} is VALID [2022-04-08 12:38:00,203 INFO L290 TraceCheckUtils]: 22: Hoare triple {43269#true} assume true; {43269#true} is VALID [2022-04-08 12:38:00,203 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {43269#true} {43269#true} #94#return; {43269#true} is VALID [2022-04-08 12:38:00,203 INFO L290 TraceCheckUtils]: 24: Hoare triple {43269#true} assume !!(0 != ~r~0); {43269#true} is VALID [2022-04-08 12:38:00,203 INFO L290 TraceCheckUtils]: 25: Hoare triple {43269#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43269#true} is VALID [2022-04-08 12:38:00,203 INFO L290 TraceCheckUtils]: 26: Hoare triple {43269#true} assume !!(#t~post7 < 20);havoc #t~post7; {43269#true} is VALID [2022-04-08 12:38:00,203 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-08 12:38:00,203 INFO L290 TraceCheckUtils]: 28: Hoare triple {43269#true} ~cond := #in~cond; {43269#true} is VALID [2022-04-08 12:38:00,203 INFO L290 TraceCheckUtils]: 29: Hoare triple {43269#true} assume !(0 == ~cond); {43269#true} is VALID [2022-04-08 12:38:00,204 INFO L290 TraceCheckUtils]: 30: Hoare triple {43269#true} assume true; {43269#true} is VALID [2022-04-08 12:38:00,204 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {43269#true} {43269#true} #96#return; {43269#true} is VALID [2022-04-08 12:38:00,204 INFO L290 TraceCheckUtils]: 32: Hoare triple {43269#true} assume !(~r~0 > 0); {43269#true} is VALID [2022-04-08 12:38:00,204 INFO L290 TraceCheckUtils]: 33: Hoare triple {43269#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43269#true} is VALID [2022-04-08 12:38:00,204 INFO L290 TraceCheckUtils]: 34: Hoare triple {43269#true} assume !!(#t~post8 < 20);havoc #t~post8; {43269#true} is VALID [2022-04-08 12:38:00,204 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-08 12:38:00,204 INFO L290 TraceCheckUtils]: 36: Hoare triple {43269#true} ~cond := #in~cond; {43269#true} is VALID [2022-04-08 12:38:00,204 INFO L290 TraceCheckUtils]: 37: Hoare triple {43269#true} assume !(0 == ~cond); {43269#true} is VALID [2022-04-08 12:38:00,204 INFO L290 TraceCheckUtils]: 38: Hoare triple {43269#true} assume true; {43269#true} is VALID [2022-04-08 12:38:00,204 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {43269#true} {43269#true} #98#return; {43269#true} is VALID [2022-04-08 12:38:00,205 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-08 12:38:00,206 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-08 12:38:00,206 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-08 12:38:00,206 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-08 12:38:00,206 INFO L290 TraceCheckUtils]: 44: Hoare triple {43269#true} ~cond := #in~cond; {43269#true} is VALID [2022-04-08 12:38:00,206 INFO L290 TraceCheckUtils]: 45: Hoare triple {43269#true} assume !(0 == ~cond); {43269#true} is VALID [2022-04-08 12:38:00,206 INFO L290 TraceCheckUtils]: 46: Hoare triple {43269#true} assume true; {43269#true} is VALID [2022-04-08 12:38:00,207 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-08 12:38:00,207 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-08 12:38:00,207 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-08 12:38:00,207 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-08 12:38:00,208 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-08 12:38:00,208 INFO L290 TraceCheckUtils]: 52: Hoare triple {43269#true} ~cond := #in~cond; {43269#true} is VALID [2022-04-08 12:38:00,208 INFO L290 TraceCheckUtils]: 53: Hoare triple {43269#true} assume !(0 == ~cond); {43269#true} is VALID [2022-04-08 12:38:00,208 INFO L290 TraceCheckUtils]: 54: Hoare triple {43269#true} assume true; {43269#true} is VALID [2022-04-08 12:38:00,208 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-08 12:38:00,208 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-08 12:38:00,209 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-08 12:38:00,209 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-08 12:38:00,209 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-08 12:38:00,209 INFO L290 TraceCheckUtils]: 60: Hoare triple {43269#true} ~cond := #in~cond; {43269#true} is VALID [2022-04-08 12:38:00,209 INFO L290 TraceCheckUtils]: 61: Hoare triple {43269#true} assume !(0 == ~cond); {43269#true} is VALID [2022-04-08 12:38:00,209 INFO L290 TraceCheckUtils]: 62: Hoare triple {43269#true} assume true; {43269#true} is VALID [2022-04-08 12:38:00,210 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-08 12:38:00,210 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-08 12:38:00,211 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-08 12:38:00,211 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-08 12:38:00,211 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-08 12:38:00,211 INFO L290 TraceCheckUtils]: 68: Hoare triple {43269#true} ~cond := #in~cond; {43269#true} is VALID [2022-04-08 12:38:00,211 INFO L290 TraceCheckUtils]: 69: Hoare triple {43269#true} assume !(0 == ~cond); {43269#true} is VALID [2022-04-08 12:38:00,211 INFO L290 TraceCheckUtils]: 70: Hoare triple {43269#true} assume true; {43269#true} is VALID [2022-04-08 12:38:00,212 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-08 12:38:00,212 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-08 12:38:00,212 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-08 12:38:00,213 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-08 12:38:00,213 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-08 12:38:00,213 INFO L290 TraceCheckUtils]: 76: Hoare triple {43269#true} ~cond := #in~cond; {43269#true} is VALID [2022-04-08 12:38:00,213 INFO L290 TraceCheckUtils]: 77: Hoare triple {43269#true} assume !(0 == ~cond); {43269#true} is VALID [2022-04-08 12:38:00,213 INFO L290 TraceCheckUtils]: 78: Hoare triple {43269#true} assume true; {43269#true} is VALID [2022-04-08 12:38:00,213 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-08 12:38:00,214 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-08 12:38:00,214 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-08 12:38:00,214 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-08 12:38:00,214 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-08 12:38:00,214 INFO L290 TraceCheckUtils]: 84: Hoare triple {43269#true} ~cond := #in~cond; {43269#true} is VALID [2022-04-08 12:38:00,214 INFO L290 TraceCheckUtils]: 85: Hoare triple {43269#true} assume !(0 == ~cond); {43269#true} is VALID [2022-04-08 12:38:00,214 INFO L290 TraceCheckUtils]: 86: Hoare triple {43269#true} assume true; {43269#true} is VALID [2022-04-08 12:38:00,215 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-08 12:38:00,216 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-08 12:38:00,216 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-08 12:38:00,216 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-08 12:38:00,216 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-08 12:38:00,216 INFO L290 TraceCheckUtils]: 92: Hoare triple {43269#true} ~cond := #in~cond; {43269#true} is VALID [2022-04-08 12:38:00,216 INFO L290 TraceCheckUtils]: 93: Hoare triple {43269#true} assume !(0 == ~cond); {43269#true} is VALID [2022-04-08 12:38:00,216 INFO L290 TraceCheckUtils]: 94: Hoare triple {43269#true} assume true; {43269#true} is VALID [2022-04-08 12:38:00,217 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-08 12:38:00,217 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-08 12:38:00,218 INFO L290 TraceCheckUtils]: 97: Hoare triple {43270#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43270#false} is VALID [2022-04-08 12:38:00,218 INFO L290 TraceCheckUtils]: 98: Hoare triple {43270#false} assume !(#t~post8 < 20);havoc #t~post8; {43270#false} is VALID [2022-04-08 12:38:00,218 INFO L290 TraceCheckUtils]: 99: Hoare triple {43270#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43270#false} is VALID [2022-04-08 12:38:00,218 INFO L290 TraceCheckUtils]: 100: Hoare triple {43270#false} assume !(#t~post6 < 20);havoc #t~post6; {43270#false} is VALID [2022-04-08 12:38:00,218 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-08 12:38:00,218 INFO L290 TraceCheckUtils]: 102: Hoare triple {43270#false} ~cond := #in~cond; {43270#false} is VALID [2022-04-08 12:38:00,218 INFO L290 TraceCheckUtils]: 103: Hoare triple {43270#false} assume 0 == ~cond; {43270#false} is VALID [2022-04-08 12:38:00,218 INFO L290 TraceCheckUtils]: 104: Hoare triple {43270#false} assume !false; {43270#false} is VALID [2022-04-08 12:38:00,218 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-08 12:38:00,218 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:38:00,581 INFO L290 TraceCheckUtils]: 104: Hoare triple {43270#false} assume !false; {43270#false} is VALID [2022-04-08 12:38:00,581 INFO L290 TraceCheckUtils]: 103: Hoare triple {43270#false} assume 0 == ~cond; {43270#false} is VALID [2022-04-08 12:38:00,581 INFO L290 TraceCheckUtils]: 102: Hoare triple {43270#false} ~cond := #in~cond; {43270#false} is VALID [2022-04-08 12:38:00,581 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-08 12:38:00,581 INFO L290 TraceCheckUtils]: 100: Hoare triple {43270#false} assume !(#t~post6 < 20);havoc #t~post6; {43270#false} is VALID [2022-04-08 12:38:00,581 INFO L290 TraceCheckUtils]: 99: Hoare triple {43270#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43270#false} is VALID [2022-04-08 12:38:00,581 INFO L290 TraceCheckUtils]: 98: Hoare triple {43270#false} assume !(#t~post8 < 20);havoc #t~post8; {43270#false} is VALID [2022-04-08 12:38:00,581 INFO L290 TraceCheckUtils]: 97: Hoare triple {43270#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43270#false} is VALID [2022-04-08 12:38:00,582 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-08 12:38:00,582 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-08 12:38:00,582 INFO L290 TraceCheckUtils]: 94: Hoare triple {43269#true} assume true; {43269#true} is VALID [2022-04-08 12:38:00,582 INFO L290 TraceCheckUtils]: 93: Hoare triple {43269#true} assume !(0 == ~cond); {43269#true} is VALID [2022-04-08 12:38:00,582 INFO L290 TraceCheckUtils]: 92: Hoare triple {43269#true} ~cond := #in~cond; {43269#true} is VALID [2022-04-08 12:38:00,582 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-08 12:38:00,583 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-08 12:38:00,583 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-08 12:38:00,584 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-08 12:38:00,584 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-08 12:38:00,584 INFO L290 TraceCheckUtils]: 86: Hoare triple {43269#true} assume true; {43269#true} is VALID [2022-04-08 12:38:00,584 INFO L290 TraceCheckUtils]: 85: Hoare triple {43269#true} assume !(0 == ~cond); {43269#true} is VALID [2022-04-08 12:38:00,584 INFO L290 TraceCheckUtils]: 84: Hoare triple {43269#true} ~cond := #in~cond; {43269#true} is VALID [2022-04-08 12:38:00,584 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-08 12:38:00,585 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-08 12:38:00,585 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-08 12:38:00,585 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-08 12:38:00,586 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-08 12:38:00,586 INFO L290 TraceCheckUtils]: 78: Hoare triple {43269#true} assume true; {43269#true} is VALID [2022-04-08 12:38:00,586 INFO L290 TraceCheckUtils]: 77: Hoare triple {43269#true} assume !(0 == ~cond); {43269#true} is VALID [2022-04-08 12:38:00,586 INFO L290 TraceCheckUtils]: 76: Hoare triple {43269#true} ~cond := #in~cond; {43269#true} is VALID [2022-04-08 12:38:00,586 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-08 12:38:00,586 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-08 12:38:00,586 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-08 12:38:00,587 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-08 12:38:00,588 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-08 12:38:00,588 INFO L290 TraceCheckUtils]: 70: Hoare triple {43269#true} assume true; {43269#true} is VALID [2022-04-08 12:38:00,588 INFO L290 TraceCheckUtils]: 69: Hoare triple {43269#true} assume !(0 == ~cond); {43269#true} is VALID [2022-04-08 12:38:00,588 INFO L290 TraceCheckUtils]: 68: Hoare triple {43269#true} ~cond := #in~cond; {43269#true} is VALID [2022-04-08 12:38:00,588 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-08 12:38:00,588 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-08 12:38:00,588 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-08 12:38:00,589 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-08 12:38:00,590 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-08 12:38:00,590 INFO L290 TraceCheckUtils]: 62: Hoare triple {43269#true} assume true; {43269#true} is VALID [2022-04-08 12:38:00,590 INFO L290 TraceCheckUtils]: 61: Hoare triple {43269#true} assume !(0 == ~cond); {43269#true} is VALID [2022-04-08 12:38:00,590 INFO L290 TraceCheckUtils]: 60: Hoare triple {43269#true} ~cond := #in~cond; {43269#true} is VALID [2022-04-08 12:38:00,590 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-08 12:38:00,591 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-08 12:38:00,591 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-08 12:38:00,591 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-08 12:38:00,591 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-08 12:38:00,592 INFO L290 TraceCheckUtils]: 54: Hoare triple {43269#true} assume true; {43269#true} is VALID [2022-04-08 12:38:00,592 INFO L290 TraceCheckUtils]: 53: Hoare triple {43269#true} assume !(0 == ~cond); {43269#true} is VALID [2022-04-08 12:38:00,592 INFO L290 TraceCheckUtils]: 52: Hoare triple {43269#true} ~cond := #in~cond; {43269#true} is VALID [2022-04-08 12:38:00,592 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-08 12:38:00,592 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-08 12:38:00,592 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-08 12:38:00,593 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-08 12:38:00,593 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-08 12:38:00,593 INFO L290 TraceCheckUtils]: 46: Hoare triple {43269#true} assume true; {43269#true} is VALID [2022-04-08 12:38:00,593 INFO L290 TraceCheckUtils]: 45: Hoare triple {43269#true} assume !(0 == ~cond); {43269#true} is VALID [2022-04-08 12:38:00,593 INFO L290 TraceCheckUtils]: 44: Hoare triple {43269#true} ~cond := #in~cond; {43269#true} is VALID [2022-04-08 12:38:00,593 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-08 12:38:00,594 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-08 12:38:00,594 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-08 12:38:00,595 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-08 12:38:00,595 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {43269#true} {43269#true} #98#return; {43269#true} is VALID [2022-04-08 12:38:00,595 INFO L290 TraceCheckUtils]: 38: Hoare triple {43269#true} assume true; {43269#true} is VALID [2022-04-08 12:38:00,595 INFO L290 TraceCheckUtils]: 37: Hoare triple {43269#true} assume !(0 == ~cond); {43269#true} is VALID [2022-04-08 12:38:00,595 INFO L290 TraceCheckUtils]: 36: Hoare triple {43269#true} ~cond := #in~cond; {43269#true} is VALID [2022-04-08 12:38:00,595 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-08 12:38:00,595 INFO L290 TraceCheckUtils]: 34: Hoare triple {43269#true} assume !!(#t~post8 < 20);havoc #t~post8; {43269#true} is VALID [2022-04-08 12:38:00,595 INFO L290 TraceCheckUtils]: 33: Hoare triple {43269#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43269#true} is VALID [2022-04-08 12:38:00,595 INFO L290 TraceCheckUtils]: 32: Hoare triple {43269#true} assume !(~r~0 > 0); {43269#true} is VALID [2022-04-08 12:38:00,596 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {43269#true} {43269#true} #96#return; {43269#true} is VALID [2022-04-08 12:38:00,596 INFO L290 TraceCheckUtils]: 30: Hoare triple {43269#true} assume true; {43269#true} is VALID [2022-04-08 12:38:00,596 INFO L290 TraceCheckUtils]: 29: Hoare triple {43269#true} assume !(0 == ~cond); {43269#true} is VALID [2022-04-08 12:38:00,596 INFO L290 TraceCheckUtils]: 28: Hoare triple {43269#true} ~cond := #in~cond; {43269#true} is VALID [2022-04-08 12:38:00,596 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-08 12:38:00,596 INFO L290 TraceCheckUtils]: 26: Hoare triple {43269#true} assume !!(#t~post7 < 20);havoc #t~post7; {43269#true} is VALID [2022-04-08 12:38:00,596 INFO L290 TraceCheckUtils]: 25: Hoare triple {43269#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43269#true} is VALID [2022-04-08 12:38:00,596 INFO L290 TraceCheckUtils]: 24: Hoare triple {43269#true} assume !!(0 != ~r~0); {43269#true} is VALID [2022-04-08 12:38:00,596 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {43269#true} {43269#true} #94#return; {43269#true} is VALID [2022-04-08 12:38:00,596 INFO L290 TraceCheckUtils]: 22: Hoare triple {43269#true} assume true; {43269#true} is VALID [2022-04-08 12:38:00,596 INFO L290 TraceCheckUtils]: 21: Hoare triple {43269#true} assume !(0 == ~cond); {43269#true} is VALID [2022-04-08 12:38:00,596 INFO L290 TraceCheckUtils]: 20: Hoare triple {43269#true} ~cond := #in~cond; {43269#true} is VALID [2022-04-08 12:38:00,596 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-08 12:38:00,596 INFO L290 TraceCheckUtils]: 18: Hoare triple {43269#true} assume !!(#t~post6 < 20);havoc #t~post6; {43269#true} is VALID [2022-04-08 12:38:00,596 INFO L290 TraceCheckUtils]: 17: Hoare triple {43269#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43269#true} is VALID [2022-04-08 12:38:00,596 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-08 12:38:00,597 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {43269#true} {43269#true} #92#return; {43269#true} is VALID [2022-04-08 12:38:00,597 INFO L290 TraceCheckUtils]: 14: Hoare triple {43269#true} assume true; {43269#true} is VALID [2022-04-08 12:38:00,597 INFO L290 TraceCheckUtils]: 13: Hoare triple {43269#true} assume !(0 == ~cond); {43269#true} is VALID [2022-04-08 12:38:00,597 INFO L290 TraceCheckUtils]: 12: Hoare triple {43269#true} ~cond := #in~cond; {43269#true} is VALID [2022-04-08 12:38:00,597 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-08 12:38:00,597 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {43269#true} {43269#true} #90#return; {43269#true} is VALID [2022-04-08 12:38:00,597 INFO L290 TraceCheckUtils]: 9: Hoare triple {43269#true} assume true; {43269#true} is VALID [2022-04-08 12:38:00,597 INFO L290 TraceCheckUtils]: 8: Hoare triple {43269#true} assume !(0 == ~cond); {43269#true} is VALID [2022-04-08 12:38:00,597 INFO L290 TraceCheckUtils]: 7: Hoare triple {43269#true} ~cond := #in~cond; {43269#true} is VALID [2022-04-08 12:38:00,597 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-08 12:38:00,597 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-08 12:38:00,597 INFO L272 TraceCheckUtils]: 4: Hoare triple {43269#true} call #t~ret9 := main(); {43269#true} is VALID [2022-04-08 12:38:00,597 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43269#true} {43269#true} #102#return; {43269#true} is VALID [2022-04-08 12:38:00,597 INFO L290 TraceCheckUtils]: 2: Hoare triple {43269#true} assume true; {43269#true} is VALID [2022-04-08 12:38:00,597 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-08 12:38:00,598 INFO L272 TraceCheckUtils]: 0: Hoare triple {43269#true} call ULTIMATE.init(); {43269#true} is VALID [2022-04-08 12:38:00,598 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-08 12:38:00,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:38:00,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602207453] [2022-04-08 12:38:00,598 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:38:00,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556723551] [2022-04-08 12:38:00,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1556723551] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:38:00,598 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:38:00,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-08 12:38:00,599 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:38:00,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [500614266] [2022-04-08 12:38:00,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [500614266] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:38:00,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:38:00,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 12:38:00,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394142177] [2022-04-08 12:38:00,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:38:00,600 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-08 12:38:00,601 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:38:00,601 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-08 12:38:00,663 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-08 12:38:00,663 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 12:38:00,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:38:00,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 12:38:00,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-08 12:38:00,664 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-08 12:38:02,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:38:02,360 INFO L93 Difference]: Finished difference Result 649 states and 907 transitions. [2022-04-08 12:38:02,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 12:38:02,360 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-08 12:38:02,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:38:02,360 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-08 12:38:02,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 171 transitions. [2022-04-08 12:38:02,361 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-08 12:38:02,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 171 transitions. [2022-04-08 12:38:02,362 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 171 transitions. [2022-04-08 12:38:02,506 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-08 12:38:02,520 INFO L225 Difference]: With dead ends: 649 [2022-04-08 12:38:02,520 INFO L226 Difference]: Without dead ends: 588 [2022-04-08 12:38:02,520 INFO L912 BasicCegarLoop]: 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-08 12:38:02,521 INFO L913 BasicCegarLoop]: 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-08 12:38:02,521 INFO L914 BasicCegarLoop]: 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-08 12:38:02,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2022-04-08 12:38:03,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 504. [2022-04-08 12:38:03,448 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:38:03,448 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-08 12:38:03,449 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-08 12:38:03,450 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-08 12:38:03,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:38:03,463 INFO L93 Difference]: Finished difference Result 588 states and 816 transitions. [2022-04-08 12:38:03,463 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 816 transitions. [2022-04-08 12:38:03,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:38:03,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:38:03,465 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-08 12:38:03,465 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-08 12:38:03,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:38:03,479 INFO L93 Difference]: Finished difference Result 588 states and 816 transitions. [2022-04-08 12:38:03,479 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 816 transitions. [2022-04-08 12:38:03,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:38:03,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:38:03,480 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:38:03,480 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:38:03,481 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-08 12:38:03,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 695 transitions. [2022-04-08 12:38:03,494 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 695 transitions. Word has length 105 [2022-04-08 12:38:03,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:38:03,494 INFO L478 AbstractCegarLoop]: Abstraction has 504 states and 695 transitions. [2022-04-08 12:38:03,494 INFO L479 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-08 12:38:03,494 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 504 states and 695 transitions. [2022-04-08 12:38:05,605 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 695 edges. 695 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:38:05,605 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 695 transitions. [2022-04-08 12:38:05,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-04-08 12:38:05,606 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:38:05,606 INFO L499 BasicCegarLoop]: 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-08 12:38:05,624 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-08 12:38:05,807 WARN L460 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-08 12:38:05,808 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:38:05,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:38:05,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1666981150, now seen corresponding path program 11 times [2022-04-08 12:38:05,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:38:05,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1117533134] [2022-04-08 12:38:05,808 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:38:05,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1666981150, now seen corresponding path program 12 times [2022-04-08 12:38:05,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:38:05,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218306612] [2022-04-08 12:38:05,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:38:05,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:38:05,819 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:38:05,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1718104978] [2022-04-08 12:38:05,820 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 12:38:05,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:38:05,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:38:05,820 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-08 12:38:05,821 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-08 12:38:05,941 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 12:38:05,941 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:38:05,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-08 12:38:05,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:38:05,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:38:06,437 INFO L272 TraceCheckUtils]: 0: Hoare triple {47396#true} call ULTIMATE.init(); {47396#true} is VALID [2022-04-08 12:38:06,437 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-08 12:38:06,438 INFO L290 TraceCheckUtils]: 2: Hoare triple {47404#(<= ~counter~0 0)} assume true; {47404#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:06,438 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47404#(<= ~counter~0 0)} {47396#true} #102#return; {47404#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:06,438 INFO L272 TraceCheckUtils]: 4: Hoare triple {47404#(<= ~counter~0 0)} call #t~ret9 := main(); {47404#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:06,439 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-08 12:38:06,439 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-08 12:38:06,439 INFO L290 TraceCheckUtils]: 7: Hoare triple {47404#(<= ~counter~0 0)} ~cond := #in~cond; {47404#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:06,439 INFO L290 TraceCheckUtils]: 8: Hoare triple {47404#(<= ~counter~0 0)} assume !(0 == ~cond); {47404#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:06,440 INFO L290 TraceCheckUtils]: 9: Hoare triple {47404#(<= ~counter~0 0)} assume true; {47404#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:06,440 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {47404#(<= ~counter~0 0)} {47404#(<= ~counter~0 0)} #90#return; {47404#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:06,440 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-08 12:38:06,441 INFO L290 TraceCheckUtils]: 12: Hoare triple {47404#(<= ~counter~0 0)} ~cond := #in~cond; {47404#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:06,441 INFO L290 TraceCheckUtils]: 13: Hoare triple {47404#(<= ~counter~0 0)} assume !(0 == ~cond); {47404#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:06,441 INFO L290 TraceCheckUtils]: 14: Hoare triple {47404#(<= ~counter~0 0)} assume true; {47404#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:06,442 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {47404#(<= ~counter~0 0)} {47404#(<= ~counter~0 0)} #92#return; {47404#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:06,442 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-08 12:38:06,443 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-08 12:38:06,443 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-08 12:38:06,444 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-08 12:38:06,444 INFO L290 TraceCheckUtils]: 20: Hoare triple {47453#(<= ~counter~0 1)} ~cond := #in~cond; {47453#(<= ~counter~0 1)} is VALID [2022-04-08 12:38:06,444 INFO L290 TraceCheckUtils]: 21: Hoare triple {47453#(<= ~counter~0 1)} assume !(0 == ~cond); {47453#(<= ~counter~0 1)} is VALID [2022-04-08 12:38:06,444 INFO L290 TraceCheckUtils]: 22: Hoare triple {47453#(<= ~counter~0 1)} assume true; {47453#(<= ~counter~0 1)} is VALID [2022-04-08 12:38:06,445 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {47453#(<= ~counter~0 1)} {47453#(<= ~counter~0 1)} #94#return; {47453#(<= ~counter~0 1)} is VALID [2022-04-08 12:38:06,445 INFO L290 TraceCheckUtils]: 24: Hoare triple {47453#(<= ~counter~0 1)} assume !!(0 != ~r~0); {47453#(<= ~counter~0 1)} is VALID [2022-04-08 12:38:06,471 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-08 12:38:06,472 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-08 12:38:06,473 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-08 12:38:06,473 INFO L290 TraceCheckUtils]: 28: Hoare triple {47478#(<= ~counter~0 2)} ~cond := #in~cond; {47478#(<= ~counter~0 2)} is VALID [2022-04-08 12:38:06,473 INFO L290 TraceCheckUtils]: 29: Hoare triple {47478#(<= ~counter~0 2)} assume !(0 == ~cond); {47478#(<= ~counter~0 2)} is VALID [2022-04-08 12:38:06,474 INFO L290 TraceCheckUtils]: 30: Hoare triple {47478#(<= ~counter~0 2)} assume true; {47478#(<= ~counter~0 2)} is VALID [2022-04-08 12:38:06,474 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {47478#(<= ~counter~0 2)} {47478#(<= ~counter~0 2)} #96#return; {47478#(<= ~counter~0 2)} is VALID [2022-04-08 12:38:06,474 INFO L290 TraceCheckUtils]: 32: Hoare triple {47478#(<= ~counter~0 2)} assume !(~r~0 > 0); {47478#(<= ~counter~0 2)} is VALID [2022-04-08 12:38:06,475 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-08 12:38:06,475 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-08 12:38:06,476 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-08 12:38:06,476 INFO L290 TraceCheckUtils]: 36: Hoare triple {47503#(<= ~counter~0 3)} ~cond := #in~cond; {47503#(<= ~counter~0 3)} is VALID [2022-04-08 12:38:06,476 INFO L290 TraceCheckUtils]: 37: Hoare triple {47503#(<= ~counter~0 3)} assume !(0 == ~cond); {47503#(<= ~counter~0 3)} is VALID [2022-04-08 12:38:06,476 INFO L290 TraceCheckUtils]: 38: Hoare triple {47503#(<= ~counter~0 3)} assume true; {47503#(<= ~counter~0 3)} is VALID [2022-04-08 12:38:06,477 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {47503#(<= ~counter~0 3)} {47503#(<= ~counter~0 3)} #98#return; {47503#(<= ~counter~0 3)} is VALID [2022-04-08 12:38:06,477 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-08 12:38:06,478 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-08 12:38:06,478 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-08 12:38:06,479 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-08 12:38:06,479 INFO L290 TraceCheckUtils]: 44: Hoare triple {47528#(<= ~counter~0 4)} ~cond := #in~cond; {47528#(<= ~counter~0 4)} is VALID [2022-04-08 12:38:06,479 INFO L290 TraceCheckUtils]: 45: Hoare triple {47528#(<= ~counter~0 4)} assume !(0 == ~cond); {47528#(<= ~counter~0 4)} is VALID [2022-04-08 12:38:06,479 INFO L290 TraceCheckUtils]: 46: Hoare triple {47528#(<= ~counter~0 4)} assume true; {47528#(<= ~counter~0 4)} is VALID [2022-04-08 12:38:06,480 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {47528#(<= ~counter~0 4)} {47528#(<= ~counter~0 4)} #98#return; {47528#(<= ~counter~0 4)} is VALID [2022-04-08 12:38:06,480 INFO L290 TraceCheckUtils]: 48: Hoare triple {47528#(<= ~counter~0 4)} assume !(~r~0 < 0); {47528#(<= ~counter~0 4)} is VALID [2022-04-08 12:38:06,481 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-08 12:38:06,481 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-08 12:38:06,481 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-08 12:38:06,482 INFO L290 TraceCheckUtils]: 52: Hoare triple {47553#(<= ~counter~0 5)} ~cond := #in~cond; {47553#(<= ~counter~0 5)} is VALID [2022-04-08 12:38:06,482 INFO L290 TraceCheckUtils]: 53: Hoare triple {47553#(<= ~counter~0 5)} assume !(0 == ~cond); {47553#(<= ~counter~0 5)} is VALID [2022-04-08 12:38:06,482 INFO L290 TraceCheckUtils]: 54: Hoare triple {47553#(<= ~counter~0 5)} assume true; {47553#(<= ~counter~0 5)} is VALID [2022-04-08 12:38:06,483 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {47553#(<= ~counter~0 5)} {47553#(<= ~counter~0 5)} #94#return; {47553#(<= ~counter~0 5)} is VALID [2022-04-08 12:38:06,483 INFO L290 TraceCheckUtils]: 56: Hoare triple {47553#(<= ~counter~0 5)} assume !!(0 != ~r~0); {47553#(<= ~counter~0 5)} is VALID [2022-04-08 12:38:06,483 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-08 12:38:06,484 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-08 12:38:06,484 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-08 12:38:06,484 INFO L290 TraceCheckUtils]: 60: Hoare triple {47578#(<= ~counter~0 6)} ~cond := #in~cond; {47578#(<= ~counter~0 6)} is VALID [2022-04-08 12:38:06,485 INFO L290 TraceCheckUtils]: 61: Hoare triple {47578#(<= ~counter~0 6)} assume !(0 == ~cond); {47578#(<= ~counter~0 6)} is VALID [2022-04-08 12:38:06,485 INFO L290 TraceCheckUtils]: 62: Hoare triple {47578#(<= ~counter~0 6)} assume true; {47578#(<= ~counter~0 6)} is VALID [2022-04-08 12:38:06,485 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {47578#(<= ~counter~0 6)} {47578#(<= ~counter~0 6)} #96#return; {47578#(<= ~counter~0 6)} is VALID [2022-04-08 12:38:06,486 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-08 12:38:06,486 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-08 12:38:06,486 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-08 12:38:06,487 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-08 12:38:06,487 INFO L290 TraceCheckUtils]: 68: Hoare triple {47603#(<= ~counter~0 7)} ~cond := #in~cond; {47603#(<= ~counter~0 7)} is VALID [2022-04-08 12:38:06,487 INFO L290 TraceCheckUtils]: 69: Hoare triple {47603#(<= ~counter~0 7)} assume !(0 == ~cond); {47603#(<= ~counter~0 7)} is VALID [2022-04-08 12:38:06,488 INFO L290 TraceCheckUtils]: 70: Hoare triple {47603#(<= ~counter~0 7)} assume true; {47603#(<= ~counter~0 7)} is VALID [2022-04-08 12:38:06,488 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {47603#(<= ~counter~0 7)} {47603#(<= ~counter~0 7)} #96#return; {47603#(<= ~counter~0 7)} is VALID [2022-04-08 12:38:06,488 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-08 12:38:06,489 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-08 12:38:06,489 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-08 12:38:06,490 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-08 12:38:06,490 INFO L290 TraceCheckUtils]: 76: Hoare triple {47628#(<= ~counter~0 8)} ~cond := #in~cond; {47628#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:06,490 INFO L290 TraceCheckUtils]: 77: Hoare triple {47628#(<= ~counter~0 8)} assume !(0 == ~cond); {47628#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:06,490 INFO L290 TraceCheckUtils]: 78: Hoare triple {47628#(<= ~counter~0 8)} assume true; {47628#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:06,491 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {47628#(<= ~counter~0 8)} {47628#(<= ~counter~0 8)} #96#return; {47628#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:06,491 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-08 12:38:06,492 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-08 12:38:06,492 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-08 12:38:06,492 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-08 12:38:06,493 INFO L290 TraceCheckUtils]: 84: Hoare triple {47653#(<= ~counter~0 9)} ~cond := #in~cond; {47653#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:06,493 INFO L290 TraceCheckUtils]: 85: Hoare triple {47653#(<= ~counter~0 9)} assume !(0 == ~cond); {47653#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:06,493 INFO L290 TraceCheckUtils]: 86: Hoare triple {47653#(<= ~counter~0 9)} assume true; {47653#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:06,494 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {47653#(<= ~counter~0 9)} {47653#(<= ~counter~0 9)} #96#return; {47653#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:06,494 INFO L290 TraceCheckUtils]: 88: Hoare triple {47653#(<= ~counter~0 9)} assume !(~r~0 > 0); {47653#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:06,494 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-08 12:38:06,495 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-08 12:38:06,495 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-08 12:38:06,495 INFO L290 TraceCheckUtils]: 92: Hoare triple {47678#(<= ~counter~0 10)} ~cond := #in~cond; {47678#(<= ~counter~0 10)} is VALID [2022-04-08 12:38:06,496 INFO L290 TraceCheckUtils]: 93: Hoare triple {47678#(<= ~counter~0 10)} assume !(0 == ~cond); {47678#(<= ~counter~0 10)} is VALID [2022-04-08 12:38:06,496 INFO L290 TraceCheckUtils]: 94: Hoare triple {47678#(<= ~counter~0 10)} assume true; {47678#(<= ~counter~0 10)} is VALID [2022-04-08 12:38:06,496 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {47678#(<= ~counter~0 10)} {47678#(<= ~counter~0 10)} #98#return; {47678#(<= ~counter~0 10)} is VALID [2022-04-08 12:38:06,497 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-08 12:38:06,497 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-08 12:38:06,497 INFO L290 TraceCheckUtils]: 98: Hoare triple {47703#(<= |main_#t~post8| 10)} assume !(#t~post8 < 20);havoc #t~post8; {47397#false} is VALID [2022-04-08 12:38:06,497 INFO L290 TraceCheckUtils]: 99: Hoare triple {47397#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47397#false} is VALID [2022-04-08 12:38:06,497 INFO L290 TraceCheckUtils]: 100: Hoare triple {47397#false} assume !(#t~post6 < 20);havoc #t~post6; {47397#false} is VALID [2022-04-08 12:38:06,497 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-08 12:38:06,498 INFO L290 TraceCheckUtils]: 102: Hoare triple {47397#false} ~cond := #in~cond; {47397#false} is VALID [2022-04-08 12:38:06,498 INFO L290 TraceCheckUtils]: 103: Hoare triple {47397#false} assume 0 == ~cond; {47397#false} is VALID [2022-04-08 12:38:06,498 INFO L290 TraceCheckUtils]: 104: Hoare triple {47397#false} assume !false; {47397#false} is VALID [2022-04-08 12:38:06,498 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-08 12:38:06,498 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:38:07,053 INFO L290 TraceCheckUtils]: 104: Hoare triple {47397#false} assume !false; {47397#false} is VALID [2022-04-08 12:38:07,053 INFO L290 TraceCheckUtils]: 103: Hoare triple {47397#false} assume 0 == ~cond; {47397#false} is VALID [2022-04-08 12:38:07,053 INFO L290 TraceCheckUtils]: 102: Hoare triple {47397#false} ~cond := #in~cond; {47397#false} is VALID [2022-04-08 12:38:07,053 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-08 12:38:07,053 INFO L290 TraceCheckUtils]: 100: Hoare triple {47397#false} assume !(#t~post6 < 20);havoc #t~post6; {47397#false} is VALID [2022-04-08 12:38:07,053 INFO L290 TraceCheckUtils]: 99: Hoare triple {47397#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47397#false} is VALID [2022-04-08 12:38:07,053 INFO L290 TraceCheckUtils]: 98: Hoare triple {47743#(< |main_#t~post8| 20)} assume !(#t~post8 < 20);havoc #t~post8; {47397#false} is VALID [2022-04-08 12:38:07,054 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-08 12:38:07,054 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-08 12:38:07,055 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {47396#true} {47747#(< ~counter~0 20)} #98#return; {47747#(< ~counter~0 20)} is VALID [2022-04-08 12:38:07,055 INFO L290 TraceCheckUtils]: 94: Hoare triple {47396#true} assume true; {47396#true} is VALID [2022-04-08 12:38:07,055 INFO L290 TraceCheckUtils]: 93: Hoare triple {47396#true} assume !(0 == ~cond); {47396#true} is VALID [2022-04-08 12:38:07,055 INFO L290 TraceCheckUtils]: 92: Hoare triple {47396#true} ~cond := #in~cond; {47396#true} is VALID [2022-04-08 12:38:07,055 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-08 12:38:07,055 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-08 12:38:07,056 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-08 12:38:07,063 INFO L290 TraceCheckUtils]: 88: Hoare triple {47772#(< ~counter~0 19)} assume !(~r~0 > 0); {47772#(< ~counter~0 19)} is VALID [2022-04-08 12:38:07,063 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {47396#true} {47772#(< ~counter~0 19)} #96#return; {47772#(< ~counter~0 19)} is VALID [2022-04-08 12:38:07,063 INFO L290 TraceCheckUtils]: 86: Hoare triple {47396#true} assume true; {47396#true} is VALID [2022-04-08 12:38:07,064 INFO L290 TraceCheckUtils]: 85: Hoare triple {47396#true} assume !(0 == ~cond); {47396#true} is VALID [2022-04-08 12:38:07,064 INFO L290 TraceCheckUtils]: 84: Hoare triple {47396#true} ~cond := #in~cond; {47396#true} is VALID [2022-04-08 12:38:07,064 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-08 12:38:07,064 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-08 12:38:07,065 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-08 12:38:07,065 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-08 12:38:07,066 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {47396#true} {47797#(< ~counter~0 18)} #96#return; {47797#(< ~counter~0 18)} is VALID [2022-04-08 12:38:07,066 INFO L290 TraceCheckUtils]: 78: Hoare triple {47396#true} assume true; {47396#true} is VALID [2022-04-08 12:38:07,066 INFO L290 TraceCheckUtils]: 77: Hoare triple {47396#true} assume !(0 == ~cond); {47396#true} is VALID [2022-04-08 12:38:07,066 INFO L290 TraceCheckUtils]: 76: Hoare triple {47396#true} ~cond := #in~cond; {47396#true} is VALID [2022-04-08 12:38:07,066 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-08 12:38:07,067 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-08 12:38:07,067 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-08 12:38:07,068 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-08 12:38:07,068 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {47396#true} {47822#(< ~counter~0 17)} #96#return; {47822#(< ~counter~0 17)} is VALID [2022-04-08 12:38:07,068 INFO L290 TraceCheckUtils]: 70: Hoare triple {47396#true} assume true; {47396#true} is VALID [2022-04-08 12:38:07,068 INFO L290 TraceCheckUtils]: 69: Hoare triple {47396#true} assume !(0 == ~cond); {47396#true} is VALID [2022-04-08 12:38:07,068 INFO L290 TraceCheckUtils]: 68: Hoare triple {47396#true} ~cond := #in~cond; {47396#true} is VALID [2022-04-08 12:38:07,068 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-08 12:38:07,069 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-08 12:38:07,069 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-08 12:38:07,069 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-08 12:38:07,070 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {47396#true} {47847#(< ~counter~0 16)} #96#return; {47847#(< ~counter~0 16)} is VALID [2022-04-08 12:38:07,070 INFO L290 TraceCheckUtils]: 62: Hoare triple {47396#true} assume true; {47396#true} is VALID [2022-04-08 12:38:07,070 INFO L290 TraceCheckUtils]: 61: Hoare triple {47396#true} assume !(0 == ~cond); {47396#true} is VALID [2022-04-08 12:38:07,070 INFO L290 TraceCheckUtils]: 60: Hoare triple {47396#true} ~cond := #in~cond; {47396#true} is VALID [2022-04-08 12:38:07,070 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-08 12:38:07,071 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-08 12:38:07,071 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-08 12:38:07,071 INFO L290 TraceCheckUtils]: 56: Hoare triple {47872#(< ~counter~0 15)} assume !!(0 != ~r~0); {47872#(< ~counter~0 15)} is VALID [2022-04-08 12:38:07,072 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {47396#true} {47872#(< ~counter~0 15)} #94#return; {47872#(< ~counter~0 15)} is VALID [2022-04-08 12:38:07,072 INFO L290 TraceCheckUtils]: 54: Hoare triple {47396#true} assume true; {47396#true} is VALID [2022-04-08 12:38:07,072 INFO L290 TraceCheckUtils]: 53: Hoare triple {47396#true} assume !(0 == ~cond); {47396#true} is VALID [2022-04-08 12:38:07,072 INFO L290 TraceCheckUtils]: 52: Hoare triple {47396#true} ~cond := #in~cond; {47396#true} is VALID [2022-04-08 12:38:07,072 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-08 12:38:07,073 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-08 12:38:07,073 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-08 12:38:07,073 INFO L290 TraceCheckUtils]: 48: Hoare triple {47897#(< ~counter~0 14)} assume !(~r~0 < 0); {47897#(< ~counter~0 14)} is VALID [2022-04-08 12:38:07,074 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {47396#true} {47897#(< ~counter~0 14)} #98#return; {47897#(< ~counter~0 14)} is VALID [2022-04-08 12:38:07,074 INFO L290 TraceCheckUtils]: 46: Hoare triple {47396#true} assume true; {47396#true} is VALID [2022-04-08 12:38:07,074 INFO L290 TraceCheckUtils]: 45: Hoare triple {47396#true} assume !(0 == ~cond); {47396#true} is VALID [2022-04-08 12:38:07,074 INFO L290 TraceCheckUtils]: 44: Hoare triple {47396#true} ~cond := #in~cond; {47396#true} is VALID [2022-04-08 12:38:07,074 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-08 12:38:07,075 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-08 12:38:07,075 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-08 12:38:07,075 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-08 12:38:07,076 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {47396#true} {47922#(< ~counter~0 13)} #98#return; {47922#(< ~counter~0 13)} is VALID [2022-04-08 12:38:07,076 INFO L290 TraceCheckUtils]: 38: Hoare triple {47396#true} assume true; {47396#true} is VALID [2022-04-08 12:38:07,076 INFO L290 TraceCheckUtils]: 37: Hoare triple {47396#true} assume !(0 == ~cond); {47396#true} is VALID [2022-04-08 12:38:07,076 INFO L290 TraceCheckUtils]: 36: Hoare triple {47396#true} ~cond := #in~cond; {47396#true} is VALID [2022-04-08 12:38:07,076 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-08 12:38:07,076 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-08 12:38:07,077 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-08 12:38:07,077 INFO L290 TraceCheckUtils]: 32: Hoare triple {47947#(< ~counter~0 12)} assume !(~r~0 > 0); {47947#(< ~counter~0 12)} is VALID [2022-04-08 12:38:07,078 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {47396#true} {47947#(< ~counter~0 12)} #96#return; {47947#(< ~counter~0 12)} is VALID [2022-04-08 12:38:07,078 INFO L290 TraceCheckUtils]: 30: Hoare triple {47396#true} assume true; {47396#true} is VALID [2022-04-08 12:38:07,078 INFO L290 TraceCheckUtils]: 29: Hoare triple {47396#true} assume !(0 == ~cond); {47396#true} is VALID [2022-04-08 12:38:07,078 INFO L290 TraceCheckUtils]: 28: Hoare triple {47396#true} ~cond := #in~cond; {47396#true} is VALID [2022-04-08 12:38:07,078 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-08 12:38:07,078 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-08 12:38:07,079 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-08 12:38:07,079 INFO L290 TraceCheckUtils]: 24: Hoare triple {47678#(<= ~counter~0 10)} assume !!(0 != ~r~0); {47678#(<= ~counter~0 10)} is VALID [2022-04-08 12:38:07,080 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {47396#true} {47678#(<= ~counter~0 10)} #94#return; {47678#(<= ~counter~0 10)} is VALID [2022-04-08 12:38:07,080 INFO L290 TraceCheckUtils]: 22: Hoare triple {47396#true} assume true; {47396#true} is VALID [2022-04-08 12:38:07,080 INFO L290 TraceCheckUtils]: 21: Hoare triple {47396#true} assume !(0 == ~cond); {47396#true} is VALID [2022-04-08 12:38:07,080 INFO L290 TraceCheckUtils]: 20: Hoare triple {47396#true} ~cond := #in~cond; {47396#true} is VALID [2022-04-08 12:38:07,080 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-08 12:38:07,080 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-08 12:38:07,081 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-08 12:38:07,081 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-08 12:38:07,082 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {47396#true} {47653#(<= ~counter~0 9)} #92#return; {47653#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:07,082 INFO L290 TraceCheckUtils]: 14: Hoare triple {47396#true} assume true; {47396#true} is VALID [2022-04-08 12:38:07,082 INFO L290 TraceCheckUtils]: 13: Hoare triple {47396#true} assume !(0 == ~cond); {47396#true} is VALID [2022-04-08 12:38:07,082 INFO L290 TraceCheckUtils]: 12: Hoare triple {47396#true} ~cond := #in~cond; {47396#true} is VALID [2022-04-08 12:38:07,082 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-08 12:38:07,082 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {47396#true} {47653#(<= ~counter~0 9)} #90#return; {47653#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:07,083 INFO L290 TraceCheckUtils]: 9: Hoare triple {47396#true} assume true; {47396#true} is VALID [2022-04-08 12:38:07,083 INFO L290 TraceCheckUtils]: 8: Hoare triple {47396#true} assume !(0 == ~cond); {47396#true} is VALID [2022-04-08 12:38:07,083 INFO L290 TraceCheckUtils]: 7: Hoare triple {47396#true} ~cond := #in~cond; {47396#true} is VALID [2022-04-08 12:38:07,083 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-08 12:38:07,083 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-08 12:38:07,083 INFO L272 TraceCheckUtils]: 4: Hoare triple {47653#(<= ~counter~0 9)} call #t~ret9 := main(); {47653#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:07,084 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47653#(<= ~counter~0 9)} {47396#true} #102#return; {47653#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:07,084 INFO L290 TraceCheckUtils]: 2: Hoare triple {47653#(<= ~counter~0 9)} assume true; {47653#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:07,084 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-08 12:38:07,084 INFO L272 TraceCheckUtils]: 0: Hoare triple {47396#true} call ULTIMATE.init(); {47396#true} is VALID [2022-04-08 12:38:07,085 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-08 12:38:07,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:38:07,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218306612] [2022-04-08 12:38:07,085 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:38:07,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1718104978] [2022-04-08 12:38:07,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1718104978] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:38:07,085 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:38:07,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2022-04-08 12:38:07,085 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:38:07,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1117533134] [2022-04-08 12:38:07,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1117533134] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:38:07,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:38:07,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 12:38:07,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745481983] [2022-04-08 12:38:07,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:38:07,086 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-08 12:38:07,087 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:38:07,087 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-08 12:38:07,161 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-08 12:38:07,161 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 12:38:07,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:38:07,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 12:38:07,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-08 12:38:07,162 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-08 12:38:08,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:38:08,767 INFO L93 Difference]: Finished difference Result 753 states and 1073 transitions. [2022-04-08 12:38:08,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-08 12:38:08,767 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-08 12:38:08,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:38:08,768 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-08 12:38:08,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 236 transitions. [2022-04-08 12:38:08,769 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-08 12:38:08,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 236 transitions. [2022-04-08 12:38:08,771 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 236 transitions. [2022-04-08 12:38:08,939 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-08 12:38:08,965 INFO L225 Difference]: With dead ends: 753 [2022-04-08 12:38:08,965 INFO L226 Difference]: Without dead ends: 532 [2022-04-08 12:38:08,966 INFO L912 BasicCegarLoop]: 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-08 12:38:08,966 INFO L913 BasicCegarLoop]: 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-08 12:38:08,966 INFO L914 BasicCegarLoop]: 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-08 12:38:08,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2022-04-08 12:38:09,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 522. [2022-04-08 12:38:09,966 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:38:09,967 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-08 12:38:09,967 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-08 12:38:09,967 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-08 12:38:09,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:38:09,978 INFO L93 Difference]: Finished difference Result 532 states and 727 transitions. [2022-04-08 12:38:09,978 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 727 transitions. [2022-04-08 12:38:09,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:38:09,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:38:09,980 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-08 12:38:09,980 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-08 12:38:09,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:38:09,991 INFO L93 Difference]: Finished difference Result 532 states and 727 transitions. [2022-04-08 12:38:09,991 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 727 transitions. [2022-04-08 12:38:09,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:38:09,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:38:09,992 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:38:09,992 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:38:09,992 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-08 12:38:10,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 717 transitions. [2022-04-08 12:38:10,005 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 717 transitions. Word has length 105 [2022-04-08 12:38:10,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:38:10,006 INFO L478 AbstractCegarLoop]: Abstraction has 522 states and 717 transitions. [2022-04-08 12:38:10,006 INFO L479 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-08 12:38:10,006 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 522 states and 717 transitions. [2022-04-08 12:38:13,337 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 717 edges. 716 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 12:38:13,337 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 717 transitions. [2022-04-08 12:38:13,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-04-08 12:38:13,338 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:38:13,338 INFO L499 BasicCegarLoop]: 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-08 12:38:13,356 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-08 12:38:13,555 WARN L460 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-08 12:38:13,555 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:38:13,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:38:13,555 INFO L85 PathProgramCache]: Analyzing trace with hash -2132095591, now seen corresponding path program 11 times [2022-04-08 12:38:13,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:38:13,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [144895126] [2022-04-08 12:38:13,556 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:38:13,556 INFO L85 PathProgramCache]: Analyzing trace with hash -2132095591, now seen corresponding path program 12 times [2022-04-08 12:38:13,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:38:13,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312280577] [2022-04-08 12:38:13,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:38:13,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:38:13,566 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:38:13,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [30479124] [2022-04-08 12:38:13,566 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 12:38:13,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:38:13,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:38:13,567 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-08 12:38:13,568 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-08 12:38:13,679 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 12:38:13,680 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:38:13,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-08 12:38:13,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:38:13,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:38:14,145 INFO L272 TraceCheckUtils]: 0: Hoare triple {51679#true} call ULTIMATE.init(); {51679#true} is VALID [2022-04-08 12:38:14,145 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-08 12:38:14,146 INFO L290 TraceCheckUtils]: 2: Hoare triple {51687#(<= ~counter~0 0)} assume true; {51687#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:14,146 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51687#(<= ~counter~0 0)} {51679#true} #102#return; {51687#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:14,146 INFO L272 TraceCheckUtils]: 4: Hoare triple {51687#(<= ~counter~0 0)} call #t~ret9 := main(); {51687#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:14,147 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-08 12:38:14,147 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-08 12:38:14,147 INFO L290 TraceCheckUtils]: 7: Hoare triple {51687#(<= ~counter~0 0)} ~cond := #in~cond; {51687#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:14,147 INFO L290 TraceCheckUtils]: 8: Hoare triple {51687#(<= ~counter~0 0)} assume !(0 == ~cond); {51687#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:14,148 INFO L290 TraceCheckUtils]: 9: Hoare triple {51687#(<= ~counter~0 0)} assume true; {51687#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:14,148 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {51687#(<= ~counter~0 0)} {51687#(<= ~counter~0 0)} #90#return; {51687#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:14,148 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-08 12:38:14,149 INFO L290 TraceCheckUtils]: 12: Hoare triple {51687#(<= ~counter~0 0)} ~cond := #in~cond; {51687#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:14,149 INFO L290 TraceCheckUtils]: 13: Hoare triple {51687#(<= ~counter~0 0)} assume !(0 == ~cond); {51687#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:14,149 INFO L290 TraceCheckUtils]: 14: Hoare triple {51687#(<= ~counter~0 0)} assume true; {51687#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:14,150 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {51687#(<= ~counter~0 0)} {51687#(<= ~counter~0 0)} #92#return; {51687#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:14,150 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-08 12:38:14,151 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-08 12:38:14,151 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-08 12:38:14,152 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-08 12:38:14,152 INFO L290 TraceCheckUtils]: 20: Hoare triple {51736#(<= ~counter~0 1)} ~cond := #in~cond; {51736#(<= ~counter~0 1)} is VALID [2022-04-08 12:38:14,152 INFO L290 TraceCheckUtils]: 21: Hoare triple {51736#(<= ~counter~0 1)} assume !(0 == ~cond); {51736#(<= ~counter~0 1)} is VALID [2022-04-08 12:38:14,153 INFO L290 TraceCheckUtils]: 22: Hoare triple {51736#(<= ~counter~0 1)} assume true; {51736#(<= ~counter~0 1)} is VALID [2022-04-08 12:38:14,153 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {51736#(<= ~counter~0 1)} {51736#(<= ~counter~0 1)} #94#return; {51736#(<= ~counter~0 1)} is VALID [2022-04-08 12:38:14,153 INFO L290 TraceCheckUtils]: 24: Hoare triple {51736#(<= ~counter~0 1)} assume !!(0 != ~r~0); {51736#(<= ~counter~0 1)} is VALID [2022-04-08 12:38:14,154 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-08 12:38:14,154 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-08 12:38:14,155 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-08 12:38:14,155 INFO L290 TraceCheckUtils]: 28: Hoare triple {51761#(<= ~counter~0 2)} ~cond := #in~cond; {51761#(<= ~counter~0 2)} is VALID [2022-04-08 12:38:14,155 INFO L290 TraceCheckUtils]: 29: Hoare triple {51761#(<= ~counter~0 2)} assume !(0 == ~cond); {51761#(<= ~counter~0 2)} is VALID [2022-04-08 12:38:14,155 INFO L290 TraceCheckUtils]: 30: Hoare triple {51761#(<= ~counter~0 2)} assume true; {51761#(<= ~counter~0 2)} is VALID [2022-04-08 12:38:14,156 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {51761#(<= ~counter~0 2)} {51761#(<= ~counter~0 2)} #96#return; {51761#(<= ~counter~0 2)} is VALID [2022-04-08 12:38:14,156 INFO L290 TraceCheckUtils]: 32: Hoare triple {51761#(<= ~counter~0 2)} assume !(~r~0 > 0); {51761#(<= ~counter~0 2)} is VALID [2022-04-08 12:38:14,157 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-08 12:38:14,157 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-08 12:38:14,157 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-08 12:38:14,158 INFO L290 TraceCheckUtils]: 36: Hoare triple {51786#(<= ~counter~0 3)} ~cond := #in~cond; {51786#(<= ~counter~0 3)} is VALID [2022-04-08 12:38:14,158 INFO L290 TraceCheckUtils]: 37: Hoare triple {51786#(<= ~counter~0 3)} assume !(0 == ~cond); {51786#(<= ~counter~0 3)} is VALID [2022-04-08 12:38:14,158 INFO L290 TraceCheckUtils]: 38: Hoare triple {51786#(<= ~counter~0 3)} assume true; {51786#(<= ~counter~0 3)} is VALID [2022-04-08 12:38:14,159 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {51786#(<= ~counter~0 3)} {51786#(<= ~counter~0 3)} #98#return; {51786#(<= ~counter~0 3)} is VALID [2022-04-08 12:38:14,159 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-08 12:38:14,159 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-08 12:38:14,160 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-08 12:38:14,160 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-08 12:38:14,160 INFO L290 TraceCheckUtils]: 44: Hoare triple {51811#(<= ~counter~0 4)} ~cond := #in~cond; {51811#(<= ~counter~0 4)} is VALID [2022-04-08 12:38:14,161 INFO L290 TraceCheckUtils]: 45: Hoare triple {51811#(<= ~counter~0 4)} assume !(0 == ~cond); {51811#(<= ~counter~0 4)} is VALID [2022-04-08 12:38:14,161 INFO L290 TraceCheckUtils]: 46: Hoare triple {51811#(<= ~counter~0 4)} assume true; {51811#(<= ~counter~0 4)} is VALID [2022-04-08 12:38:14,161 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {51811#(<= ~counter~0 4)} {51811#(<= ~counter~0 4)} #98#return; {51811#(<= ~counter~0 4)} is VALID [2022-04-08 12:38:14,162 INFO L290 TraceCheckUtils]: 48: Hoare triple {51811#(<= ~counter~0 4)} assume !(~r~0 < 0); {51811#(<= ~counter~0 4)} is VALID [2022-04-08 12:38:14,162 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-08 12:38:14,163 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-08 12:38:14,163 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-08 12:38:14,163 INFO L290 TraceCheckUtils]: 52: Hoare triple {51836#(<= ~counter~0 5)} ~cond := #in~cond; {51836#(<= ~counter~0 5)} is VALID [2022-04-08 12:38:14,163 INFO L290 TraceCheckUtils]: 53: Hoare triple {51836#(<= ~counter~0 5)} assume !(0 == ~cond); {51836#(<= ~counter~0 5)} is VALID [2022-04-08 12:38:14,164 INFO L290 TraceCheckUtils]: 54: Hoare triple {51836#(<= ~counter~0 5)} assume true; {51836#(<= ~counter~0 5)} is VALID [2022-04-08 12:38:14,164 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {51836#(<= ~counter~0 5)} {51836#(<= ~counter~0 5)} #94#return; {51836#(<= ~counter~0 5)} is VALID [2022-04-08 12:38:14,164 INFO L290 TraceCheckUtils]: 56: Hoare triple {51836#(<= ~counter~0 5)} assume !!(0 != ~r~0); {51836#(<= ~counter~0 5)} is VALID [2022-04-08 12:38:14,165 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-08 12:38:14,165 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-08 12:38:14,166 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-08 12:38:14,166 INFO L290 TraceCheckUtils]: 60: Hoare triple {51861#(<= ~counter~0 6)} ~cond := #in~cond; {51861#(<= ~counter~0 6)} is VALID [2022-04-08 12:38:14,166 INFO L290 TraceCheckUtils]: 61: Hoare triple {51861#(<= ~counter~0 6)} assume !(0 == ~cond); {51861#(<= ~counter~0 6)} is VALID [2022-04-08 12:38:14,167 INFO L290 TraceCheckUtils]: 62: Hoare triple {51861#(<= ~counter~0 6)} assume true; {51861#(<= ~counter~0 6)} is VALID [2022-04-08 12:38:14,167 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {51861#(<= ~counter~0 6)} {51861#(<= ~counter~0 6)} #96#return; {51861#(<= ~counter~0 6)} is VALID [2022-04-08 12:38:14,167 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-08 12:38:14,168 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-08 12:38:14,168 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-08 12:38:14,169 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-08 12:38:14,169 INFO L290 TraceCheckUtils]: 68: Hoare triple {51886#(<= ~counter~0 7)} ~cond := #in~cond; {51886#(<= ~counter~0 7)} is VALID [2022-04-08 12:38:14,169 INFO L290 TraceCheckUtils]: 69: Hoare triple {51886#(<= ~counter~0 7)} assume !(0 == ~cond); {51886#(<= ~counter~0 7)} is VALID [2022-04-08 12:38:14,169 INFO L290 TraceCheckUtils]: 70: Hoare triple {51886#(<= ~counter~0 7)} assume true; {51886#(<= ~counter~0 7)} is VALID [2022-04-08 12:38:14,170 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {51886#(<= ~counter~0 7)} {51886#(<= ~counter~0 7)} #96#return; {51886#(<= ~counter~0 7)} is VALID [2022-04-08 12:38:14,170 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-08 12:38:14,171 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-08 12:38:14,171 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-08 12:38:14,171 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-08 12:38:14,172 INFO L290 TraceCheckUtils]: 76: Hoare triple {51911#(<= ~counter~0 8)} ~cond := #in~cond; {51911#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:14,172 INFO L290 TraceCheckUtils]: 77: Hoare triple {51911#(<= ~counter~0 8)} assume !(0 == ~cond); {51911#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:14,172 INFO L290 TraceCheckUtils]: 78: Hoare triple {51911#(<= ~counter~0 8)} assume true; {51911#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:14,173 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {51911#(<= ~counter~0 8)} {51911#(<= ~counter~0 8)} #96#return; {51911#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:14,173 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-08 12:38:14,173 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-08 12:38:14,174 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-08 12:38:14,174 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-08 12:38:14,174 INFO L290 TraceCheckUtils]: 84: Hoare triple {51936#(<= ~counter~0 9)} ~cond := #in~cond; {51936#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:14,175 INFO L290 TraceCheckUtils]: 85: Hoare triple {51936#(<= ~counter~0 9)} assume !(0 == ~cond); {51936#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:14,175 INFO L290 TraceCheckUtils]: 86: Hoare triple {51936#(<= ~counter~0 9)} assume true; {51936#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:14,175 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {51936#(<= ~counter~0 9)} {51936#(<= ~counter~0 9)} #96#return; {51936#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:14,176 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-08 12:38:14,176 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-08 12:38:14,176 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-08 12:38:14,177 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-08 12:38:14,177 INFO L290 TraceCheckUtils]: 92: Hoare triple {51961#(<= ~counter~0 10)} ~cond := #in~cond; {51961#(<= ~counter~0 10)} is VALID [2022-04-08 12:38:14,177 INFO L290 TraceCheckUtils]: 93: Hoare triple {51961#(<= ~counter~0 10)} assume !(0 == ~cond); {51961#(<= ~counter~0 10)} is VALID [2022-04-08 12:38:14,178 INFO L290 TraceCheckUtils]: 94: Hoare triple {51961#(<= ~counter~0 10)} assume true; {51961#(<= ~counter~0 10)} is VALID [2022-04-08 12:38:14,178 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {51961#(<= ~counter~0 10)} {51961#(<= ~counter~0 10)} #96#return; {51961#(<= ~counter~0 10)} is VALID [2022-04-08 12:38:14,178 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-08 12:38:14,179 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-08 12:38:14,179 INFO L290 TraceCheckUtils]: 98: Hoare triple {51986#(<= |main_#t~post7| 10)} assume !(#t~post7 < 20);havoc #t~post7; {51680#false} is VALID [2022-04-08 12:38:14,179 INFO L290 TraceCheckUtils]: 99: Hoare triple {51680#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {51680#false} is VALID [2022-04-08 12:38:14,179 INFO L290 TraceCheckUtils]: 100: Hoare triple {51680#false} assume !(#t~post8 < 20);havoc #t~post8; {51680#false} is VALID [2022-04-08 12:38:14,179 INFO L290 TraceCheckUtils]: 101: Hoare triple {51680#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51680#false} is VALID [2022-04-08 12:38:14,179 INFO L290 TraceCheckUtils]: 102: Hoare triple {51680#false} assume !(#t~post6 < 20);havoc #t~post6; {51680#false} is VALID [2022-04-08 12:38:14,179 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-08 12:38:14,179 INFO L290 TraceCheckUtils]: 104: Hoare triple {51680#false} ~cond := #in~cond; {51680#false} is VALID [2022-04-08 12:38:14,179 INFO L290 TraceCheckUtils]: 105: Hoare triple {51680#false} assume 0 == ~cond; {51680#false} is VALID [2022-04-08 12:38:14,180 INFO L290 TraceCheckUtils]: 106: Hoare triple {51680#false} assume !false; {51680#false} is VALID [2022-04-08 12:38:14,180 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-08 12:38:14,180 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:38:14,711 INFO L290 TraceCheckUtils]: 106: Hoare triple {51680#false} assume !false; {51680#false} is VALID [2022-04-08 12:38:14,712 INFO L290 TraceCheckUtils]: 105: Hoare triple {51680#false} assume 0 == ~cond; {51680#false} is VALID [2022-04-08 12:38:14,712 INFO L290 TraceCheckUtils]: 104: Hoare triple {51680#false} ~cond := #in~cond; {51680#false} is VALID [2022-04-08 12:38:14,712 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-08 12:38:14,712 INFO L290 TraceCheckUtils]: 102: Hoare triple {51680#false} assume !(#t~post6 < 20);havoc #t~post6; {51680#false} is VALID [2022-04-08 12:38:14,712 INFO L290 TraceCheckUtils]: 101: Hoare triple {51680#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51680#false} is VALID [2022-04-08 12:38:14,712 INFO L290 TraceCheckUtils]: 100: Hoare triple {51680#false} assume !(#t~post8 < 20);havoc #t~post8; {51680#false} is VALID [2022-04-08 12:38:14,712 INFO L290 TraceCheckUtils]: 99: Hoare triple {51680#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {51680#false} is VALID [2022-04-08 12:38:14,712 INFO L290 TraceCheckUtils]: 98: Hoare triple {52038#(< |main_#t~post7| 20)} assume !(#t~post7 < 20);havoc #t~post7; {51680#false} is VALID [2022-04-08 12:38:14,713 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-08 12:38:14,713 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-08 12:38:14,713 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {51679#true} {52042#(< ~counter~0 20)} #96#return; {52042#(< ~counter~0 20)} is VALID [2022-04-08 12:38:14,714 INFO L290 TraceCheckUtils]: 94: Hoare triple {51679#true} assume true; {51679#true} is VALID [2022-04-08 12:38:14,714 INFO L290 TraceCheckUtils]: 93: Hoare triple {51679#true} assume !(0 == ~cond); {51679#true} is VALID [2022-04-08 12:38:14,714 INFO L290 TraceCheckUtils]: 92: Hoare triple {51679#true} ~cond := #in~cond; {51679#true} is VALID [2022-04-08 12:38:14,714 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-08 12:38:14,714 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-08 12:38:14,715 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-08 12:38:14,716 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-08 12:38:14,716 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {51679#true} {52067#(< ~counter~0 19)} #96#return; {52067#(< ~counter~0 19)} is VALID [2022-04-08 12:38:14,716 INFO L290 TraceCheckUtils]: 86: Hoare triple {51679#true} assume true; {51679#true} is VALID [2022-04-08 12:38:14,716 INFO L290 TraceCheckUtils]: 85: Hoare triple {51679#true} assume !(0 == ~cond); {51679#true} is VALID [2022-04-08 12:38:14,716 INFO L290 TraceCheckUtils]: 84: Hoare triple {51679#true} ~cond := #in~cond; {51679#true} is VALID [2022-04-08 12:38:14,716 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-08 12:38:14,717 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-08 12:38:14,717 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-08 12:38:14,717 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-08 12:38:14,718 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {51679#true} {52092#(< ~counter~0 18)} #96#return; {52092#(< ~counter~0 18)} is VALID [2022-04-08 12:38:14,718 INFO L290 TraceCheckUtils]: 78: Hoare triple {51679#true} assume true; {51679#true} is VALID [2022-04-08 12:38:14,718 INFO L290 TraceCheckUtils]: 77: Hoare triple {51679#true} assume !(0 == ~cond); {51679#true} is VALID [2022-04-08 12:38:14,718 INFO L290 TraceCheckUtils]: 76: Hoare triple {51679#true} ~cond := #in~cond; {51679#true} is VALID [2022-04-08 12:38:14,718 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-08 12:38:14,718 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-08 12:38:14,719 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-08 12:38:14,719 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-08 12:38:14,720 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {51679#true} {52117#(< ~counter~0 17)} #96#return; {52117#(< ~counter~0 17)} is VALID [2022-04-08 12:38:14,720 INFO L290 TraceCheckUtils]: 70: Hoare triple {51679#true} assume true; {51679#true} is VALID [2022-04-08 12:38:14,720 INFO L290 TraceCheckUtils]: 69: Hoare triple {51679#true} assume !(0 == ~cond); {51679#true} is VALID [2022-04-08 12:38:14,720 INFO L290 TraceCheckUtils]: 68: Hoare triple {51679#true} ~cond := #in~cond; {51679#true} is VALID [2022-04-08 12:38:14,720 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-08 12:38:14,720 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-08 12:38:14,721 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-08 12:38:14,721 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-08 12:38:14,722 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {51679#true} {52142#(< ~counter~0 16)} #96#return; {52142#(< ~counter~0 16)} is VALID [2022-04-08 12:38:14,722 INFO L290 TraceCheckUtils]: 62: Hoare triple {51679#true} assume true; {51679#true} is VALID [2022-04-08 12:38:14,722 INFO L290 TraceCheckUtils]: 61: Hoare triple {51679#true} assume !(0 == ~cond); {51679#true} is VALID [2022-04-08 12:38:14,722 INFO L290 TraceCheckUtils]: 60: Hoare triple {51679#true} ~cond := #in~cond; {51679#true} is VALID [2022-04-08 12:38:14,722 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-08 12:38:14,722 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-08 12:38:14,723 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-08 12:38:14,723 INFO L290 TraceCheckUtils]: 56: Hoare triple {52167#(< ~counter~0 15)} assume !!(0 != ~r~0); {52167#(< ~counter~0 15)} is VALID [2022-04-08 12:38:14,724 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {51679#true} {52167#(< ~counter~0 15)} #94#return; {52167#(< ~counter~0 15)} is VALID [2022-04-08 12:38:14,724 INFO L290 TraceCheckUtils]: 54: Hoare triple {51679#true} assume true; {51679#true} is VALID [2022-04-08 12:38:14,724 INFO L290 TraceCheckUtils]: 53: Hoare triple {51679#true} assume !(0 == ~cond); {51679#true} is VALID [2022-04-08 12:38:14,724 INFO L290 TraceCheckUtils]: 52: Hoare triple {51679#true} ~cond := #in~cond; {51679#true} is VALID [2022-04-08 12:38:14,724 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-08 12:38:14,724 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-08 12:38:14,725 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-08 12:38:14,725 INFO L290 TraceCheckUtils]: 48: Hoare triple {52192#(< ~counter~0 14)} assume !(~r~0 < 0); {52192#(< ~counter~0 14)} is VALID [2022-04-08 12:38:14,725 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {51679#true} {52192#(< ~counter~0 14)} #98#return; {52192#(< ~counter~0 14)} is VALID [2022-04-08 12:38:14,725 INFO L290 TraceCheckUtils]: 46: Hoare triple {51679#true} assume true; {51679#true} is VALID [2022-04-08 12:38:14,726 INFO L290 TraceCheckUtils]: 45: Hoare triple {51679#true} assume !(0 == ~cond); {51679#true} is VALID [2022-04-08 12:38:14,726 INFO L290 TraceCheckUtils]: 44: Hoare triple {51679#true} ~cond := #in~cond; {51679#true} is VALID [2022-04-08 12:38:14,726 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-08 12:38:14,726 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-08 12:38:14,727 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-08 12:38:14,727 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-08 12:38:14,727 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {51679#true} {52217#(< ~counter~0 13)} #98#return; {52217#(< ~counter~0 13)} is VALID [2022-04-08 12:38:14,727 INFO L290 TraceCheckUtils]: 38: Hoare triple {51679#true} assume true; {51679#true} is VALID [2022-04-08 12:38:14,727 INFO L290 TraceCheckUtils]: 37: Hoare triple {51679#true} assume !(0 == ~cond); {51679#true} is VALID [2022-04-08 12:38:14,727 INFO L290 TraceCheckUtils]: 36: Hoare triple {51679#true} ~cond := #in~cond; {51679#true} is VALID [2022-04-08 12:38:14,728 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-08 12:38:14,728 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-08 12:38:14,728 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-08 12:38:14,729 INFO L290 TraceCheckUtils]: 32: Hoare triple {52242#(< ~counter~0 12)} assume !(~r~0 > 0); {52242#(< ~counter~0 12)} is VALID [2022-04-08 12:38:14,729 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {51679#true} {52242#(< ~counter~0 12)} #96#return; {52242#(< ~counter~0 12)} is VALID [2022-04-08 12:38:14,729 INFO L290 TraceCheckUtils]: 30: Hoare triple {51679#true} assume true; {51679#true} is VALID [2022-04-08 12:38:14,729 INFO L290 TraceCheckUtils]: 29: Hoare triple {51679#true} assume !(0 == ~cond); {51679#true} is VALID [2022-04-08 12:38:14,729 INFO L290 TraceCheckUtils]: 28: Hoare triple {51679#true} ~cond := #in~cond; {51679#true} is VALID [2022-04-08 12:38:14,729 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-08 12:38:14,730 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-08 12:38:14,730 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-08 12:38:14,731 INFO L290 TraceCheckUtils]: 24: Hoare triple {51961#(<= ~counter~0 10)} assume !!(0 != ~r~0); {51961#(<= ~counter~0 10)} is VALID [2022-04-08 12:38:14,731 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {51679#true} {51961#(<= ~counter~0 10)} #94#return; {51961#(<= ~counter~0 10)} is VALID [2022-04-08 12:38:14,731 INFO L290 TraceCheckUtils]: 22: Hoare triple {51679#true} assume true; {51679#true} is VALID [2022-04-08 12:38:14,731 INFO L290 TraceCheckUtils]: 21: Hoare triple {51679#true} assume !(0 == ~cond); {51679#true} is VALID [2022-04-08 12:38:14,731 INFO L290 TraceCheckUtils]: 20: Hoare triple {51679#true} ~cond := #in~cond; {51679#true} is VALID [2022-04-08 12:38:14,731 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-08 12:38:14,732 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-08 12:38:14,732 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-08 12:38:14,732 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-08 12:38:14,733 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {51679#true} {51936#(<= ~counter~0 9)} #92#return; {51936#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:14,733 INFO L290 TraceCheckUtils]: 14: Hoare triple {51679#true} assume true; {51679#true} is VALID [2022-04-08 12:38:14,733 INFO L290 TraceCheckUtils]: 13: Hoare triple {51679#true} assume !(0 == ~cond); {51679#true} is VALID [2022-04-08 12:38:14,733 INFO L290 TraceCheckUtils]: 12: Hoare triple {51679#true} ~cond := #in~cond; {51679#true} is VALID [2022-04-08 12:38:14,733 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-08 12:38:14,733 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {51679#true} {51936#(<= ~counter~0 9)} #90#return; {51936#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:14,734 INFO L290 TraceCheckUtils]: 9: Hoare triple {51679#true} assume true; {51679#true} is VALID [2022-04-08 12:38:14,734 INFO L290 TraceCheckUtils]: 8: Hoare triple {51679#true} assume !(0 == ~cond); {51679#true} is VALID [2022-04-08 12:38:14,734 INFO L290 TraceCheckUtils]: 7: Hoare triple {51679#true} ~cond := #in~cond; {51679#true} is VALID [2022-04-08 12:38:14,734 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-08 12:38:14,734 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-08 12:38:14,734 INFO L272 TraceCheckUtils]: 4: Hoare triple {51936#(<= ~counter~0 9)} call #t~ret9 := main(); {51936#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:14,735 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51936#(<= ~counter~0 9)} {51679#true} #102#return; {51936#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:14,735 INFO L290 TraceCheckUtils]: 2: Hoare triple {51936#(<= ~counter~0 9)} assume true; {51936#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:14,735 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-08 12:38:14,735 INFO L272 TraceCheckUtils]: 0: Hoare triple {51679#true} call ULTIMATE.init(); {51679#true} is VALID [2022-04-08 12:38:14,736 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-08 12:38:14,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:38:14,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312280577] [2022-04-08 12:38:14,736 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:38:14,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30479124] [2022-04-08 12:38:14,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [30479124] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:38:14,736 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:38:14,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2022-04-08 12:38:14,736 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:38:14,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [144895126] [2022-04-08 12:38:14,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [144895126] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:38:14,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:38:14,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 12:38:14,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371289258] [2022-04-08 12:38:14,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:38:14,737 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-08 12:38:14,737 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:38:14,737 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-08 12:38:14,826 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-08 12:38:14,827 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 12:38:14,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:38:14,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 12:38:14,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-08 12:38:14,827 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-08 12:38:16,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:38:16,522 INFO L93 Difference]: Finished difference Result 735 states and 1041 transitions. [2022-04-08 12:38:16,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-08 12:38:16,523 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-08 12:38:16,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:38:16,523 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-08 12:38:16,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 236 transitions. [2022-04-08 12:38:16,524 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-08 12:38:16,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 236 transitions. [2022-04-08 12:38:16,526 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 236 transitions. [2022-04-08 12:38:16,700 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-08 12:38:16,712 INFO L225 Difference]: With dead ends: 735 [2022-04-08 12:38:16,713 INFO L226 Difference]: Without dead ends: 538 [2022-04-08 12:38:16,713 INFO L912 BasicCegarLoop]: 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-08 12:38:16,714 INFO L913 BasicCegarLoop]: 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-08 12:38:16,714 INFO L914 BasicCegarLoop]: 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-08 12:38:16,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2022-04-08 12:38:17,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2022-04-08 12:38:17,754 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:38:17,755 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-08 12:38:17,755 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-08 12:38:17,756 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-08 12:38:17,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:38:17,767 INFO L93 Difference]: Finished difference Result 538 states and 733 transitions. [2022-04-08 12:38:17,767 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 733 transitions. [2022-04-08 12:38:17,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:38:17,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:38:17,768 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-08 12:38:17,769 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-08 12:38:17,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:38:17,780 INFO L93 Difference]: Finished difference Result 538 states and 733 transitions. [2022-04-08 12:38:17,780 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 733 transitions. [2022-04-08 12:38:17,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:38:17,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:38:17,781 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:38:17,781 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:38:17,781 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-08 12:38:17,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 733 transitions. [2022-04-08 12:38:17,802 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 733 transitions. Word has length 107 [2022-04-08 12:38:17,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:38:17,803 INFO L478 AbstractCegarLoop]: Abstraction has 538 states and 733 transitions. [2022-04-08 12:38:17,803 INFO L479 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-08 12:38:17,803 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 538 states and 733 transitions. [2022-04-08 12:38:20,131 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 733 edges. 733 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:38:20,131 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 733 transitions. [2022-04-08 12:38:20,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-04-08 12:38:20,132 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:38:20,132 INFO L499 BasicCegarLoop]: 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-08 12:38:20,137 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-08 12:38:20,332 WARN L460 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-08 12:38:20,332 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:38:20,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:38:20,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1965005106, now seen corresponding path program 5 times [2022-04-08 12:38:20,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:38:20,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [661755601] [2022-04-08 12:38:20,333 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:38:20,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1965005106, now seen corresponding path program 6 times [2022-04-08 12:38:20,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:38:20,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087783720] [2022-04-08 12:38:20,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:38:20,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:38:20,343 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:38:20,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1401221038] [2022-04-08 12:38:20,343 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 12:38:20,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:38:20,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:38:20,344 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-08 12:38:20,345 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-08 12:38:20,481 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-08 12:38:20,481 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:38:20,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-08 12:38:20,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:38:20,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:38:21,057 INFO L272 TraceCheckUtils]: 0: Hoare triple {55984#true} call ULTIMATE.init(); {55984#true} is VALID [2022-04-08 12:38:21,058 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-08 12:38:21,058 INFO L290 TraceCheckUtils]: 2: Hoare triple {55992#(<= ~counter~0 0)} assume true; {55992#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:21,058 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55992#(<= ~counter~0 0)} {55984#true} #102#return; {55992#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:21,058 INFO L272 TraceCheckUtils]: 4: Hoare triple {55992#(<= ~counter~0 0)} call #t~ret9 := main(); {55992#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:21,059 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-08 12:38:21,059 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-08 12:38:21,059 INFO L290 TraceCheckUtils]: 7: Hoare triple {55992#(<= ~counter~0 0)} ~cond := #in~cond; {55992#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:21,060 INFO L290 TraceCheckUtils]: 8: Hoare triple {55992#(<= ~counter~0 0)} assume !(0 == ~cond); {55992#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:21,060 INFO L290 TraceCheckUtils]: 9: Hoare triple {55992#(<= ~counter~0 0)} assume true; {55992#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:21,060 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {55992#(<= ~counter~0 0)} {55992#(<= ~counter~0 0)} #90#return; {55992#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:21,061 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-08 12:38:21,061 INFO L290 TraceCheckUtils]: 12: Hoare triple {55992#(<= ~counter~0 0)} ~cond := #in~cond; {55992#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:21,061 INFO L290 TraceCheckUtils]: 13: Hoare triple {55992#(<= ~counter~0 0)} assume !(0 == ~cond); {55992#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:21,062 INFO L290 TraceCheckUtils]: 14: Hoare triple {55992#(<= ~counter~0 0)} assume true; {55992#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:21,062 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {55992#(<= ~counter~0 0)} {55992#(<= ~counter~0 0)} #92#return; {55992#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:21,062 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-08 12:38:21,064 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-08 12:38:21,064 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-08 12:38:21,064 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-08 12:38:21,065 INFO L290 TraceCheckUtils]: 20: Hoare triple {56041#(<= ~counter~0 1)} ~cond := #in~cond; {56041#(<= ~counter~0 1)} is VALID [2022-04-08 12:38:21,065 INFO L290 TraceCheckUtils]: 21: Hoare triple {56041#(<= ~counter~0 1)} assume !(0 == ~cond); {56041#(<= ~counter~0 1)} is VALID [2022-04-08 12:38:21,065 INFO L290 TraceCheckUtils]: 22: Hoare triple {56041#(<= ~counter~0 1)} assume true; {56041#(<= ~counter~0 1)} is VALID [2022-04-08 12:38:21,066 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {56041#(<= ~counter~0 1)} {56041#(<= ~counter~0 1)} #94#return; {56041#(<= ~counter~0 1)} is VALID [2022-04-08 12:38:21,066 INFO L290 TraceCheckUtils]: 24: Hoare triple {56041#(<= ~counter~0 1)} assume !!(0 != ~r~0); {56041#(<= ~counter~0 1)} is VALID [2022-04-08 12:38:21,067 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-08 12:38:21,067 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-08 12:38:21,067 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-08 12:38:21,068 INFO L290 TraceCheckUtils]: 28: Hoare triple {56066#(<= ~counter~0 2)} ~cond := #in~cond; {56066#(<= ~counter~0 2)} is VALID [2022-04-08 12:38:21,068 INFO L290 TraceCheckUtils]: 29: Hoare triple {56066#(<= ~counter~0 2)} assume !(0 == ~cond); {56066#(<= ~counter~0 2)} is VALID [2022-04-08 12:38:21,068 INFO L290 TraceCheckUtils]: 30: Hoare triple {56066#(<= ~counter~0 2)} assume true; {56066#(<= ~counter~0 2)} is VALID [2022-04-08 12:38:21,069 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {56066#(<= ~counter~0 2)} {56066#(<= ~counter~0 2)} #96#return; {56066#(<= ~counter~0 2)} is VALID [2022-04-08 12:38:21,069 INFO L290 TraceCheckUtils]: 32: Hoare triple {56066#(<= ~counter~0 2)} assume !(~r~0 > 0); {56066#(<= ~counter~0 2)} is VALID [2022-04-08 12:38:21,069 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-08 12:38:21,070 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-08 12:38:21,070 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-08 12:38:21,070 INFO L290 TraceCheckUtils]: 36: Hoare triple {56091#(<= ~counter~0 3)} ~cond := #in~cond; {56091#(<= ~counter~0 3)} is VALID [2022-04-08 12:38:21,071 INFO L290 TraceCheckUtils]: 37: Hoare triple {56091#(<= ~counter~0 3)} assume !(0 == ~cond); {56091#(<= ~counter~0 3)} is VALID [2022-04-08 12:38:21,071 INFO L290 TraceCheckUtils]: 38: Hoare triple {56091#(<= ~counter~0 3)} assume true; {56091#(<= ~counter~0 3)} is VALID [2022-04-08 12:38:21,072 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {56091#(<= ~counter~0 3)} {56091#(<= ~counter~0 3)} #98#return; {56091#(<= ~counter~0 3)} is VALID [2022-04-08 12:38:21,072 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-08 12:38:21,073 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-08 12:38:21,073 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-08 12:38:21,073 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-08 12:38:21,074 INFO L290 TraceCheckUtils]: 44: Hoare triple {56116#(<= ~counter~0 4)} ~cond := #in~cond; {56116#(<= ~counter~0 4)} is VALID [2022-04-08 12:38:21,074 INFO L290 TraceCheckUtils]: 45: Hoare triple {56116#(<= ~counter~0 4)} assume !(0 == ~cond); {56116#(<= ~counter~0 4)} is VALID [2022-04-08 12:38:21,074 INFO L290 TraceCheckUtils]: 46: Hoare triple {56116#(<= ~counter~0 4)} assume true; {56116#(<= ~counter~0 4)} is VALID [2022-04-08 12:38:21,075 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {56116#(<= ~counter~0 4)} {56116#(<= ~counter~0 4)} #98#return; {56116#(<= ~counter~0 4)} is VALID [2022-04-08 12:38:21,075 INFO L290 TraceCheckUtils]: 48: Hoare triple {56116#(<= ~counter~0 4)} assume !(~r~0 < 0); {56116#(<= ~counter~0 4)} is VALID [2022-04-08 12:38:21,076 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-08 12:38:21,076 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-08 12:38:21,076 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-08 12:38:21,077 INFO L290 TraceCheckUtils]: 52: Hoare triple {56141#(<= ~counter~0 5)} ~cond := #in~cond; {56141#(<= ~counter~0 5)} is VALID [2022-04-08 12:38:21,077 INFO L290 TraceCheckUtils]: 53: Hoare triple {56141#(<= ~counter~0 5)} assume !(0 == ~cond); {56141#(<= ~counter~0 5)} is VALID [2022-04-08 12:38:21,077 INFO L290 TraceCheckUtils]: 54: Hoare triple {56141#(<= ~counter~0 5)} assume true; {56141#(<= ~counter~0 5)} is VALID [2022-04-08 12:38:21,078 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {56141#(<= ~counter~0 5)} {56141#(<= ~counter~0 5)} #94#return; {56141#(<= ~counter~0 5)} is VALID [2022-04-08 12:38:21,078 INFO L290 TraceCheckUtils]: 56: Hoare triple {56141#(<= ~counter~0 5)} assume !!(0 != ~r~0); {56141#(<= ~counter~0 5)} is VALID [2022-04-08 12:38:21,078 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-08 12:38:21,079 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-08 12:38:21,079 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-08 12:38:21,079 INFO L290 TraceCheckUtils]: 60: Hoare triple {56166#(<= ~counter~0 6)} ~cond := #in~cond; {56166#(<= ~counter~0 6)} is VALID [2022-04-08 12:38:21,080 INFO L290 TraceCheckUtils]: 61: Hoare triple {56166#(<= ~counter~0 6)} assume !(0 == ~cond); {56166#(<= ~counter~0 6)} is VALID [2022-04-08 12:38:21,080 INFO L290 TraceCheckUtils]: 62: Hoare triple {56166#(<= ~counter~0 6)} assume true; {56166#(<= ~counter~0 6)} is VALID [2022-04-08 12:38:21,080 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {56166#(<= ~counter~0 6)} {56166#(<= ~counter~0 6)} #96#return; {56166#(<= ~counter~0 6)} is VALID [2022-04-08 12:38:21,081 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-08 12:38:21,081 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-08 12:38:21,082 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-08 12:38:21,082 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-08 12:38:21,082 INFO L290 TraceCheckUtils]: 68: Hoare triple {56191#(<= ~counter~0 7)} ~cond := #in~cond; {56191#(<= ~counter~0 7)} is VALID [2022-04-08 12:38:21,083 INFO L290 TraceCheckUtils]: 69: Hoare triple {56191#(<= ~counter~0 7)} assume !(0 == ~cond); {56191#(<= ~counter~0 7)} is VALID [2022-04-08 12:38:21,083 INFO L290 TraceCheckUtils]: 70: Hoare triple {56191#(<= ~counter~0 7)} assume true; {56191#(<= ~counter~0 7)} is VALID [2022-04-08 12:38:21,083 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {56191#(<= ~counter~0 7)} {56191#(<= ~counter~0 7)} #96#return; {56191#(<= ~counter~0 7)} is VALID [2022-04-08 12:38:21,084 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-08 12:38:21,084 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-08 12:38:21,085 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-08 12:38:21,085 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-08 12:38:21,085 INFO L290 TraceCheckUtils]: 76: Hoare triple {56216#(<= ~counter~0 8)} ~cond := #in~cond; {56216#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:21,086 INFO L290 TraceCheckUtils]: 77: Hoare triple {56216#(<= ~counter~0 8)} assume !(0 == ~cond); {56216#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:21,086 INFO L290 TraceCheckUtils]: 78: Hoare triple {56216#(<= ~counter~0 8)} assume true; {56216#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:21,086 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {56216#(<= ~counter~0 8)} {56216#(<= ~counter~0 8)} #96#return; {56216#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:21,087 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-08 12:38:21,087 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-08 12:38:21,088 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-08 12:38:21,088 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-08 12:38:21,088 INFO L290 TraceCheckUtils]: 84: Hoare triple {56241#(<= ~counter~0 9)} ~cond := #in~cond; {56241#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:21,089 INFO L290 TraceCheckUtils]: 85: Hoare triple {56241#(<= ~counter~0 9)} assume !(0 == ~cond); {56241#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:21,089 INFO L290 TraceCheckUtils]: 86: Hoare triple {56241#(<= ~counter~0 9)} assume true; {56241#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:21,089 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {56241#(<= ~counter~0 9)} {56241#(<= ~counter~0 9)} #96#return; {56241#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:21,090 INFO L290 TraceCheckUtils]: 88: Hoare triple {56241#(<= ~counter~0 9)} assume !(~r~0 > 0); {56241#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:21,090 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-08 12:38:21,091 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-08 12:38:21,091 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-08 12:38:21,092 INFO L290 TraceCheckUtils]: 92: Hoare triple {56266#(<= ~counter~0 10)} ~cond := #in~cond; {56266#(<= ~counter~0 10)} is VALID [2022-04-08 12:38:21,092 INFO L290 TraceCheckUtils]: 93: Hoare triple {56266#(<= ~counter~0 10)} assume !(0 == ~cond); {56266#(<= ~counter~0 10)} is VALID [2022-04-08 12:38:21,092 INFO L290 TraceCheckUtils]: 94: Hoare triple {56266#(<= ~counter~0 10)} assume true; {56266#(<= ~counter~0 10)} is VALID [2022-04-08 12:38:21,093 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {56266#(<= ~counter~0 10)} {56266#(<= ~counter~0 10)} #98#return; {56266#(<= ~counter~0 10)} is VALID [2022-04-08 12:38:21,093 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-08 12:38:21,094 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-08 12:38:21,094 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-08 12:38:21,094 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-08 12:38:21,095 INFO L290 TraceCheckUtils]: 100: Hoare triple {56291#(<= ~counter~0 11)} ~cond := #in~cond; {56291#(<= ~counter~0 11)} is VALID [2022-04-08 12:38:21,095 INFO L290 TraceCheckUtils]: 101: Hoare triple {56291#(<= ~counter~0 11)} assume !(0 == ~cond); {56291#(<= ~counter~0 11)} is VALID [2022-04-08 12:38:21,095 INFO L290 TraceCheckUtils]: 102: Hoare triple {56291#(<= ~counter~0 11)} assume true; {56291#(<= ~counter~0 11)} is VALID [2022-04-08 12:38:21,096 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {56291#(<= ~counter~0 11)} {56291#(<= ~counter~0 11)} #98#return; {56291#(<= ~counter~0 11)} is VALID [2022-04-08 12:38:21,096 INFO L290 TraceCheckUtils]: 104: Hoare triple {56291#(<= ~counter~0 11)} assume !(~r~0 < 0); {56291#(<= ~counter~0 11)} is VALID [2022-04-08 12:38:21,096 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-08 12:38:21,097 INFO L290 TraceCheckUtils]: 106: Hoare triple {56316#(<= |main_#t~post6| 11)} assume !(#t~post6 < 20);havoc #t~post6; {55985#false} is VALID [2022-04-08 12:38:21,097 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-08 12:38:21,097 INFO L290 TraceCheckUtils]: 108: Hoare triple {55985#false} ~cond := #in~cond; {55985#false} is VALID [2022-04-08 12:38:21,097 INFO L290 TraceCheckUtils]: 109: Hoare triple {55985#false} assume 0 == ~cond; {55985#false} is VALID [2022-04-08 12:38:21,097 INFO L290 TraceCheckUtils]: 110: Hoare triple {55985#false} assume !false; {55985#false} is VALID [2022-04-08 12:38:21,097 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-08 12:38:21,097 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:38:21,674 INFO L290 TraceCheckUtils]: 110: Hoare triple {55985#false} assume !false; {55985#false} is VALID [2022-04-08 12:38:21,674 INFO L290 TraceCheckUtils]: 109: Hoare triple {55985#false} assume 0 == ~cond; {55985#false} is VALID [2022-04-08 12:38:21,674 INFO L290 TraceCheckUtils]: 108: Hoare triple {55985#false} ~cond := #in~cond; {55985#false} is VALID [2022-04-08 12:38:21,674 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-08 12:38:21,674 INFO L290 TraceCheckUtils]: 106: Hoare triple {56344#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {55985#false} is VALID [2022-04-08 12:38:21,674 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-08 12:38:21,675 INFO L290 TraceCheckUtils]: 104: Hoare triple {56348#(< ~counter~0 20)} assume !(~r~0 < 0); {56348#(< ~counter~0 20)} is VALID [2022-04-08 12:38:21,675 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {55984#true} {56348#(< ~counter~0 20)} #98#return; {56348#(< ~counter~0 20)} is VALID [2022-04-08 12:38:21,675 INFO L290 TraceCheckUtils]: 102: Hoare triple {55984#true} assume true; {55984#true} is VALID [2022-04-08 12:38:21,675 INFO L290 TraceCheckUtils]: 101: Hoare triple {55984#true} assume !(0 == ~cond); {55984#true} is VALID [2022-04-08 12:38:21,675 INFO L290 TraceCheckUtils]: 100: Hoare triple {55984#true} ~cond := #in~cond; {55984#true} is VALID [2022-04-08 12:38:21,676 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-08 12:38:21,676 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-08 12:38:21,677 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-08 12:38:21,677 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-08 12:38:21,678 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {55984#true} {56373#(< ~counter~0 19)} #98#return; {56373#(< ~counter~0 19)} is VALID [2022-04-08 12:38:21,678 INFO L290 TraceCheckUtils]: 94: Hoare triple {55984#true} assume true; {55984#true} is VALID [2022-04-08 12:38:21,678 INFO L290 TraceCheckUtils]: 93: Hoare triple {55984#true} assume !(0 == ~cond); {55984#true} is VALID [2022-04-08 12:38:21,678 INFO L290 TraceCheckUtils]: 92: Hoare triple {55984#true} ~cond := #in~cond; {55984#true} is VALID [2022-04-08 12:38:21,678 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-08 12:38:21,678 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-08 12:38:21,679 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-08 12:38:21,679 INFO L290 TraceCheckUtils]: 88: Hoare triple {56398#(< ~counter~0 18)} assume !(~r~0 > 0); {56398#(< ~counter~0 18)} is VALID [2022-04-08 12:38:21,680 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {55984#true} {56398#(< ~counter~0 18)} #96#return; {56398#(< ~counter~0 18)} is VALID [2022-04-08 12:38:21,680 INFO L290 TraceCheckUtils]: 86: Hoare triple {55984#true} assume true; {55984#true} is VALID [2022-04-08 12:38:21,680 INFO L290 TraceCheckUtils]: 85: Hoare triple {55984#true} assume !(0 == ~cond); {55984#true} is VALID [2022-04-08 12:38:21,680 INFO L290 TraceCheckUtils]: 84: Hoare triple {55984#true} ~cond := #in~cond; {55984#true} is VALID [2022-04-08 12:38:21,680 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-08 12:38:21,680 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-08 12:38:21,681 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-08 12:38:21,681 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-08 12:38:21,682 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {55984#true} {56423#(< ~counter~0 17)} #96#return; {56423#(< ~counter~0 17)} is VALID [2022-04-08 12:38:21,682 INFO L290 TraceCheckUtils]: 78: Hoare triple {55984#true} assume true; {55984#true} is VALID [2022-04-08 12:38:21,682 INFO L290 TraceCheckUtils]: 77: Hoare triple {55984#true} assume !(0 == ~cond); {55984#true} is VALID [2022-04-08 12:38:21,682 INFO L290 TraceCheckUtils]: 76: Hoare triple {55984#true} ~cond := #in~cond; {55984#true} is VALID [2022-04-08 12:38:21,682 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-08 12:38:21,682 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-08 12:38:21,683 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-08 12:38:21,683 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-08 12:38:21,684 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {55984#true} {56448#(< ~counter~0 16)} #96#return; {56448#(< ~counter~0 16)} is VALID [2022-04-08 12:38:21,684 INFO L290 TraceCheckUtils]: 70: Hoare triple {55984#true} assume true; {55984#true} is VALID [2022-04-08 12:38:21,684 INFO L290 TraceCheckUtils]: 69: Hoare triple {55984#true} assume !(0 == ~cond); {55984#true} is VALID [2022-04-08 12:38:21,684 INFO L290 TraceCheckUtils]: 68: Hoare triple {55984#true} ~cond := #in~cond; {55984#true} is VALID [2022-04-08 12:38:21,684 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-08 12:38:21,684 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-08 12:38:21,685 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-08 12:38:21,685 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-08 12:38:21,685 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {55984#true} {56473#(< ~counter~0 15)} #96#return; {56473#(< ~counter~0 15)} is VALID [2022-04-08 12:38:21,686 INFO L290 TraceCheckUtils]: 62: Hoare triple {55984#true} assume true; {55984#true} is VALID [2022-04-08 12:38:21,686 INFO L290 TraceCheckUtils]: 61: Hoare triple {55984#true} assume !(0 == ~cond); {55984#true} is VALID [2022-04-08 12:38:21,686 INFO L290 TraceCheckUtils]: 60: Hoare triple {55984#true} ~cond := #in~cond; {55984#true} is VALID [2022-04-08 12:38:21,686 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-08 12:38:21,686 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-08 12:38:21,687 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-08 12:38:21,687 INFO L290 TraceCheckUtils]: 56: Hoare triple {56498#(< ~counter~0 14)} assume !!(0 != ~r~0); {56498#(< ~counter~0 14)} is VALID [2022-04-08 12:38:21,687 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {55984#true} {56498#(< ~counter~0 14)} #94#return; {56498#(< ~counter~0 14)} is VALID [2022-04-08 12:38:21,687 INFO L290 TraceCheckUtils]: 54: Hoare triple {55984#true} assume true; {55984#true} is VALID [2022-04-08 12:38:21,688 INFO L290 TraceCheckUtils]: 53: Hoare triple {55984#true} assume !(0 == ~cond); {55984#true} is VALID [2022-04-08 12:38:21,688 INFO L290 TraceCheckUtils]: 52: Hoare triple {55984#true} ~cond := #in~cond; {55984#true} is VALID [2022-04-08 12:38:21,688 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-08 12:38:21,688 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-08 12:38:21,689 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-08 12:38:21,689 INFO L290 TraceCheckUtils]: 48: Hoare triple {56523#(< ~counter~0 13)} assume !(~r~0 < 0); {56523#(< ~counter~0 13)} is VALID [2022-04-08 12:38:21,689 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {55984#true} {56523#(< ~counter~0 13)} #98#return; {56523#(< ~counter~0 13)} is VALID [2022-04-08 12:38:21,689 INFO L290 TraceCheckUtils]: 46: Hoare triple {55984#true} assume true; {55984#true} is VALID [2022-04-08 12:38:21,689 INFO L290 TraceCheckUtils]: 45: Hoare triple {55984#true} assume !(0 == ~cond); {55984#true} is VALID [2022-04-08 12:38:21,689 INFO L290 TraceCheckUtils]: 44: Hoare triple {55984#true} ~cond := #in~cond; {55984#true} is VALID [2022-04-08 12:38:21,690 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-08 12:38:21,690 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-08 12:38:21,690 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-08 12:38:21,691 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-08 12:38:21,691 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {55984#true} {56291#(<= ~counter~0 11)} #98#return; {56291#(<= ~counter~0 11)} is VALID [2022-04-08 12:38:21,691 INFO L290 TraceCheckUtils]: 38: Hoare triple {55984#true} assume true; {55984#true} is VALID [2022-04-08 12:38:21,691 INFO L290 TraceCheckUtils]: 37: Hoare triple {55984#true} assume !(0 == ~cond); {55984#true} is VALID [2022-04-08 12:38:21,691 INFO L290 TraceCheckUtils]: 36: Hoare triple {55984#true} ~cond := #in~cond; {55984#true} is VALID [2022-04-08 12:38:21,691 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-08 12:38:21,692 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-08 12:38:21,692 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-08 12:38:21,693 INFO L290 TraceCheckUtils]: 32: Hoare triple {56266#(<= ~counter~0 10)} assume !(~r~0 > 0); {56266#(<= ~counter~0 10)} is VALID [2022-04-08 12:38:21,693 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {55984#true} {56266#(<= ~counter~0 10)} #96#return; {56266#(<= ~counter~0 10)} is VALID [2022-04-08 12:38:21,693 INFO L290 TraceCheckUtils]: 30: Hoare triple {55984#true} assume true; {55984#true} is VALID [2022-04-08 12:38:21,693 INFO L290 TraceCheckUtils]: 29: Hoare triple {55984#true} assume !(0 == ~cond); {55984#true} is VALID [2022-04-08 12:38:21,693 INFO L290 TraceCheckUtils]: 28: Hoare triple {55984#true} ~cond := #in~cond; {55984#true} is VALID [2022-04-08 12:38:21,693 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-08 12:38:21,694 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-08 12:38:21,694 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-08 12:38:21,694 INFO L290 TraceCheckUtils]: 24: Hoare triple {56241#(<= ~counter~0 9)} assume !!(0 != ~r~0); {56241#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:21,695 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {55984#true} {56241#(<= ~counter~0 9)} #94#return; {56241#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:21,695 INFO L290 TraceCheckUtils]: 22: Hoare triple {55984#true} assume true; {55984#true} is VALID [2022-04-08 12:38:21,695 INFO L290 TraceCheckUtils]: 21: Hoare triple {55984#true} assume !(0 == ~cond); {55984#true} is VALID [2022-04-08 12:38:21,695 INFO L290 TraceCheckUtils]: 20: Hoare triple {55984#true} ~cond := #in~cond; {55984#true} is VALID [2022-04-08 12:38:21,695 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-08 12:38:21,695 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-08 12:38:21,696 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-08 12:38:21,696 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-08 12:38:21,697 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {55984#true} {56216#(<= ~counter~0 8)} #92#return; {56216#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:21,697 INFO L290 TraceCheckUtils]: 14: Hoare triple {55984#true} assume true; {55984#true} is VALID [2022-04-08 12:38:21,697 INFO L290 TraceCheckUtils]: 13: Hoare triple {55984#true} assume !(0 == ~cond); {55984#true} is VALID [2022-04-08 12:38:21,697 INFO L290 TraceCheckUtils]: 12: Hoare triple {55984#true} ~cond := #in~cond; {55984#true} is VALID [2022-04-08 12:38:21,697 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-08 12:38:21,697 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {55984#true} {56216#(<= ~counter~0 8)} #90#return; {56216#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:21,698 INFO L290 TraceCheckUtils]: 9: Hoare triple {55984#true} assume true; {55984#true} is VALID [2022-04-08 12:38:21,698 INFO L290 TraceCheckUtils]: 8: Hoare triple {55984#true} assume !(0 == ~cond); {55984#true} is VALID [2022-04-08 12:38:21,698 INFO L290 TraceCheckUtils]: 7: Hoare triple {55984#true} ~cond := #in~cond; {55984#true} is VALID [2022-04-08 12:38:21,698 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-08 12:38:21,698 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-08 12:38:21,698 INFO L272 TraceCheckUtils]: 4: Hoare triple {56216#(<= ~counter~0 8)} call #t~ret9 := main(); {56216#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:21,699 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56216#(<= ~counter~0 8)} {55984#true} #102#return; {56216#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:21,699 INFO L290 TraceCheckUtils]: 2: Hoare triple {56216#(<= ~counter~0 8)} assume true; {56216#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:21,699 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-08 12:38:21,699 INFO L272 TraceCheckUtils]: 0: Hoare triple {55984#true} call ULTIMATE.init(); {55984#true} is VALID [2022-04-08 12:38:21,700 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-08 12:38:21,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:38:21,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087783720] [2022-04-08 12:38:21,700 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:38:21,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401221038] [2022-04-08 12:38:21,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401221038] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:38:21,700 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:38:21,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 24 [2022-04-08 12:38:21,701 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:38:21,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [661755601] [2022-04-08 12:38:21,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [661755601] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:38:21,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:38:21,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 12:38:21,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677061803] [2022-04-08 12:38:21,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:38:21,701 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-08 12:38:21,701 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:38:21,702 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-08 12:38:21,778 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-08 12:38:21,778 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 12:38:21,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:38:21,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 12:38:21,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-08 12:38:21,779 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-08 12:38:23,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:38:23,772 INFO L93 Difference]: Finished difference Result 593 states and 810 transitions. [2022-04-08 12:38:23,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-08 12:38:23,772 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-08 12:38:23,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:38:23,772 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-08 12:38:23,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 234 transitions. [2022-04-08 12:38:23,774 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-08 12:38:23,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 234 transitions. [2022-04-08 12:38:23,775 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 234 transitions. [2022-04-08 12:38:23,954 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-08 12:38:23,968 INFO L225 Difference]: With dead ends: 593 [2022-04-08 12:38:23,969 INFO L226 Difference]: Without dead ends: 582 [2022-04-08 12:38:23,969 INFO L912 BasicCegarLoop]: 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-08 12:38:23,969 INFO L913 BasicCegarLoop]: 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-08 12:38:23,969 INFO L914 BasicCegarLoop]: 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-08 12:38:23,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2022-04-08 12:38:25,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 560. [2022-04-08 12:38:25,098 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:38:25,098 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-08 12:38:25,099 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-08 12:38:25,099 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-08 12:38:25,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:38:25,112 INFO L93 Difference]: Finished difference Result 582 states and 794 transitions. [2022-04-08 12:38:25,112 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 794 transitions. [2022-04-08 12:38:25,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:38:25,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:38:25,113 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-08 12:38:25,114 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-08 12:38:25,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:38:25,126 INFO L93 Difference]: Finished difference Result 582 states and 794 transitions. [2022-04-08 12:38:25,126 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 794 transitions. [2022-04-08 12:38:25,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:38:25,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:38:25,127 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:38:25,127 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:38:25,128 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-08 12:38:25,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 768 transitions. [2022-04-08 12:38:25,143 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 768 transitions. Word has length 111 [2022-04-08 12:38:25,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:38:25,143 INFO L478 AbstractCegarLoop]: Abstraction has 560 states and 768 transitions. [2022-04-08 12:38:25,144 INFO L479 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-08 12:38:25,144 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 560 states and 768 transitions. [2022-04-08 12:38:28,707 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-08 12:38:28,707 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 768 transitions. [2022-04-08 12:38:28,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-04-08 12:38:28,708 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:38:28,708 INFO L499 BasicCegarLoop]: 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-08 12:38:28,714 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-08 12:38:28,909 WARN L460 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-08 12:38:28,909 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:38:28,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:38:28,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1038942829, now seen corresponding path program 13 times [2022-04-08 12:38:28,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:38:28,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [284699090] [2022-04-08 12:38:28,910 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:38:28,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1038942829, now seen corresponding path program 14 times [2022-04-08 12:38:28,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:38:28,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827205274] [2022-04-08 12:38:28,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:38:28,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:38:28,927 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:38:28,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1424533140] [2022-04-08 12:38:28,928 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:38:28,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:38:28,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:38:28,928 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-08 12:38:28,929 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-08 12:38:28,983 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:38:28,983 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:38:28,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 12:38:29,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:38:29,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:38:29,820 INFO L272 TraceCheckUtils]: 0: Hoare triple {60159#true} call ULTIMATE.init(); {60159#true} is VALID [2022-04-08 12:38:29,821 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-08 12:38:29,821 INFO L290 TraceCheckUtils]: 2: Hoare triple {60159#true} assume true; {60159#true} is VALID [2022-04-08 12:38:29,821 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60159#true} {60159#true} #102#return; {60159#true} is VALID [2022-04-08 12:38:29,821 INFO L272 TraceCheckUtils]: 4: Hoare triple {60159#true} call #t~ret9 := main(); {60159#true} is VALID [2022-04-08 12:38:29,821 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-08 12:38:29,821 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-08 12:38:29,821 INFO L290 TraceCheckUtils]: 7: Hoare triple {60159#true} ~cond := #in~cond; {60159#true} is VALID [2022-04-08 12:38:29,821 INFO L290 TraceCheckUtils]: 8: Hoare triple {60159#true} assume !(0 == ~cond); {60159#true} is VALID [2022-04-08 12:38:29,821 INFO L290 TraceCheckUtils]: 9: Hoare triple {60159#true} assume true; {60159#true} is VALID [2022-04-08 12:38:29,821 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {60159#true} {60159#true} #90#return; {60159#true} is VALID [2022-04-08 12:38:29,821 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-08 12:38:29,821 INFO L290 TraceCheckUtils]: 12: Hoare triple {60159#true} ~cond := #in~cond; {60159#true} is VALID [2022-04-08 12:38:29,821 INFO L290 TraceCheckUtils]: 13: Hoare triple {60159#true} assume !(0 == ~cond); {60159#true} is VALID [2022-04-08 12:38:29,822 INFO L290 TraceCheckUtils]: 14: Hoare triple {60159#true} assume true; {60159#true} is VALID [2022-04-08 12:38:29,822 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {60159#true} {60159#true} #92#return; {60159#true} is VALID [2022-04-08 12:38:29,822 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-08 12:38:29,822 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-08 12:38:29,822 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-08 12:38:29,823 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-08 12:38:29,823 INFO L290 TraceCheckUtils]: 20: Hoare triple {60159#true} ~cond := #in~cond; {60159#true} is VALID [2022-04-08 12:38:29,823 INFO L290 TraceCheckUtils]: 21: Hoare triple {60159#true} assume !(0 == ~cond); {60159#true} is VALID [2022-04-08 12:38:29,823 INFO L290 TraceCheckUtils]: 22: Hoare triple {60159#true} assume true; {60159#true} is VALID [2022-04-08 12:38:29,823 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {60159#true} {60212#(<= 1 main_~v~0)} #94#return; {60212#(<= 1 main_~v~0)} is VALID [2022-04-08 12:38:29,823 INFO L290 TraceCheckUtils]: 24: Hoare triple {60212#(<= 1 main_~v~0)} assume !!(0 != ~r~0); {60212#(<= 1 main_~v~0)} is VALID [2022-04-08 12:38:29,824 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-08 12:38:29,824 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-08 12:38:29,824 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-08 12:38:29,824 INFO L290 TraceCheckUtils]: 28: Hoare triple {60159#true} ~cond := #in~cond; {60159#true} is VALID [2022-04-08 12:38:29,824 INFO L290 TraceCheckUtils]: 29: Hoare triple {60159#true} assume !(0 == ~cond); {60159#true} is VALID [2022-04-08 12:38:29,824 INFO L290 TraceCheckUtils]: 30: Hoare triple {60159#true} assume true; {60159#true} is VALID [2022-04-08 12:38:29,825 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {60159#true} {60212#(<= 1 main_~v~0)} #96#return; {60212#(<= 1 main_~v~0)} is VALID [2022-04-08 12:38:29,825 INFO L290 TraceCheckUtils]: 32: Hoare triple {60212#(<= 1 main_~v~0)} assume !(~r~0 > 0); {60212#(<= 1 main_~v~0)} is VALID [2022-04-08 12:38:29,825 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-08 12:38:29,825 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-08 12:38:29,826 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-08 12:38:29,826 INFO L290 TraceCheckUtils]: 36: Hoare triple {60159#true} ~cond := #in~cond; {60159#true} is VALID [2022-04-08 12:38:29,826 INFO L290 TraceCheckUtils]: 37: Hoare triple {60159#true} assume !(0 == ~cond); {60159#true} is VALID [2022-04-08 12:38:29,826 INFO L290 TraceCheckUtils]: 38: Hoare triple {60159#true} assume true; {60159#true} is VALID [2022-04-08 12:38:29,826 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {60159#true} {60212#(<= 1 main_~v~0)} #98#return; {60212#(<= 1 main_~v~0)} is VALID [2022-04-08 12:38:29,828 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-08 12:38:29,828 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-08 12:38:29,828 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-08 12:38:29,829 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-08 12:38:29,829 INFO L290 TraceCheckUtils]: 44: Hoare triple {60159#true} ~cond := #in~cond; {60159#true} is VALID [2022-04-08 12:38:29,829 INFO L290 TraceCheckUtils]: 45: Hoare triple {60159#true} assume !(0 == ~cond); {60159#true} is VALID [2022-04-08 12:38:29,829 INFO L290 TraceCheckUtils]: 46: Hoare triple {60159#true} assume true; {60159#true} is VALID [2022-04-08 12:38:29,829 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-08 12:38:29,829 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-08 12:38:29,830 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-08 12:38:29,830 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-08 12:38:29,830 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-08 12:38:29,830 INFO L290 TraceCheckUtils]: 52: Hoare triple {60159#true} ~cond := #in~cond; {60159#true} is VALID [2022-04-08 12:38:29,830 INFO L290 TraceCheckUtils]: 53: Hoare triple {60159#true} assume !(0 == ~cond); {60159#true} is VALID [2022-04-08 12:38:29,830 INFO L290 TraceCheckUtils]: 54: Hoare triple {60159#true} assume true; {60159#true} is VALID [2022-04-08 12:38:29,831 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-08 12:38:29,831 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-08 12:38:29,832 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-08 12:38:29,832 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-08 12:38:29,832 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-08 12:38:29,832 INFO L290 TraceCheckUtils]: 60: Hoare triple {60159#true} ~cond := #in~cond; {60159#true} is VALID [2022-04-08 12:38:29,832 INFO L290 TraceCheckUtils]: 61: Hoare triple {60159#true} assume !(0 == ~cond); {60159#true} is VALID [2022-04-08 12:38:29,832 INFO L290 TraceCheckUtils]: 62: Hoare triple {60159#true} assume true; {60159#true} is VALID [2022-04-08 12:38:29,833 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-08 12:38:29,833 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-08 12:38:29,834 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-08 12:38:29,834 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-08 12:38:29,834 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-08 12:38:29,834 INFO L290 TraceCheckUtils]: 68: Hoare triple {60159#true} ~cond := #in~cond; {60159#true} is VALID [2022-04-08 12:38:29,834 INFO L290 TraceCheckUtils]: 69: Hoare triple {60159#true} assume !(0 == ~cond); {60159#true} is VALID [2022-04-08 12:38:29,834 INFO L290 TraceCheckUtils]: 70: Hoare triple {60159#true} assume true; {60159#true} is VALID [2022-04-08 12:38:29,835 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-08 12:38:29,835 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-08 12:38:29,836 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-08 12:38:29,836 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-08 12:38:29,836 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-08 12:38:29,836 INFO L290 TraceCheckUtils]: 76: Hoare triple {60159#true} ~cond := #in~cond; {60159#true} is VALID [2022-04-08 12:38:29,836 INFO L290 TraceCheckUtils]: 77: Hoare triple {60159#true} assume !(0 == ~cond); {60159#true} is VALID [2022-04-08 12:38:29,836 INFO L290 TraceCheckUtils]: 78: Hoare triple {60159#true} assume true; {60159#true} is VALID [2022-04-08 12:38:29,836 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-08 12:38:29,837 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-08 12:38:29,837 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-08 12:38:29,838 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-08 12:38:29,838 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-08 12:38:29,838 INFO L290 TraceCheckUtils]: 84: Hoare triple {60159#true} ~cond := #in~cond; {60159#true} is VALID [2022-04-08 12:38:29,838 INFO L290 TraceCheckUtils]: 85: Hoare triple {60159#true} assume !(0 == ~cond); {60159#true} is VALID [2022-04-08 12:38:29,838 INFO L290 TraceCheckUtils]: 86: Hoare triple {60159#true} assume true; {60159#true} is VALID [2022-04-08 12:38:29,838 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-08 12:38:29,838 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-08 12:38:29,839 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-08 12:38:29,839 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-08 12:38:29,839 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-08 12:38:29,839 INFO L290 TraceCheckUtils]: 92: Hoare triple {60159#true} ~cond := #in~cond; {60159#true} is VALID [2022-04-08 12:38:29,839 INFO L290 TraceCheckUtils]: 93: Hoare triple {60159#true} assume !(0 == ~cond); {60159#true} is VALID [2022-04-08 12:38:29,839 INFO L290 TraceCheckUtils]: 94: Hoare triple {60159#true} assume true; {60159#true} is VALID [2022-04-08 12:38:29,840 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-08 12:38:29,841 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-08 12:38:29,841 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-08 12:38:29,841 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-08 12:38:29,841 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-08 12:38:29,841 INFO L290 TraceCheckUtils]: 100: Hoare triple {60159#true} ~cond := #in~cond; {60159#true} is VALID [2022-04-08 12:38:29,841 INFO L290 TraceCheckUtils]: 101: Hoare triple {60159#true} assume !(0 == ~cond); {60159#true} is VALID [2022-04-08 12:38:29,841 INFO L290 TraceCheckUtils]: 102: Hoare triple {60159#true} assume true; {60159#true} is VALID [2022-04-08 12:38:29,842 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-08 12:38:29,843 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-08 12:38:29,843 INFO L290 TraceCheckUtils]: 105: Hoare triple {60160#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {60160#false} is VALID [2022-04-08 12:38:29,843 INFO L290 TraceCheckUtils]: 106: Hoare triple {60160#false} assume !(#t~post8 < 20);havoc #t~post8; {60160#false} is VALID [2022-04-08 12:38:29,843 INFO L290 TraceCheckUtils]: 107: Hoare triple {60160#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {60160#false} is VALID [2022-04-08 12:38:29,843 INFO L290 TraceCheckUtils]: 108: Hoare triple {60160#false} assume !(#t~post6 < 20);havoc #t~post6; {60160#false} is VALID [2022-04-08 12:38:29,843 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-08 12:38:29,843 INFO L290 TraceCheckUtils]: 110: Hoare triple {60160#false} ~cond := #in~cond; {60160#false} is VALID [2022-04-08 12:38:29,843 INFO L290 TraceCheckUtils]: 111: Hoare triple {60160#false} assume 0 == ~cond; {60160#false} is VALID [2022-04-08 12:38:29,843 INFO L290 TraceCheckUtils]: 112: Hoare triple {60160#false} assume !false; {60160#false} is VALID [2022-04-08 12:38:29,844 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-08 12:38:29,844 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:38:30,288 INFO L290 TraceCheckUtils]: 112: Hoare triple {60160#false} assume !false; {60160#false} is VALID [2022-04-08 12:38:30,288 INFO L290 TraceCheckUtils]: 111: Hoare triple {60160#false} assume 0 == ~cond; {60160#false} is VALID [2022-04-08 12:38:30,288 INFO L290 TraceCheckUtils]: 110: Hoare triple {60160#false} ~cond := #in~cond; {60160#false} is VALID [2022-04-08 12:38:30,288 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-08 12:38:30,288 INFO L290 TraceCheckUtils]: 108: Hoare triple {60160#false} assume !(#t~post6 < 20);havoc #t~post6; {60160#false} is VALID [2022-04-08 12:38:30,288 INFO L290 TraceCheckUtils]: 107: Hoare triple {60160#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {60160#false} is VALID [2022-04-08 12:38:30,288 INFO L290 TraceCheckUtils]: 106: Hoare triple {60160#false} assume !(#t~post8 < 20);havoc #t~post8; {60160#false} is VALID [2022-04-08 12:38:30,288 INFO L290 TraceCheckUtils]: 105: Hoare triple {60160#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {60160#false} is VALID [2022-04-08 12:38:30,288 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-08 12:38:30,289 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-08 12:38:30,289 INFO L290 TraceCheckUtils]: 102: Hoare triple {60159#true} assume true; {60159#true} is VALID [2022-04-08 12:38:30,289 INFO L290 TraceCheckUtils]: 101: Hoare triple {60159#true} assume !(0 == ~cond); {60159#true} is VALID [2022-04-08 12:38:30,289 INFO L290 TraceCheckUtils]: 100: Hoare triple {60159#true} ~cond := #in~cond; {60159#true} is VALID [2022-04-08 12:38:30,289 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-08 12:38:30,289 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-08 12:38:30,290 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-08 12:38:30,290 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-08 12:38:30,291 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-08 12:38:30,291 INFO L290 TraceCheckUtils]: 94: Hoare triple {60159#true} assume true; {60159#true} is VALID [2022-04-08 12:38:30,291 INFO L290 TraceCheckUtils]: 93: Hoare triple {60159#true} assume !(0 == ~cond); {60159#true} is VALID [2022-04-08 12:38:30,291 INFO L290 TraceCheckUtils]: 92: Hoare triple {60159#true} ~cond := #in~cond; {60159#true} is VALID [2022-04-08 12:38:30,291 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-08 12:38:30,291 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-08 12:38:30,292 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-08 12:38:30,292 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-08 12:38:30,292 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-08 12:38:30,292 INFO L290 TraceCheckUtils]: 86: Hoare triple {60159#true} assume true; {60159#true} is VALID [2022-04-08 12:38:30,292 INFO L290 TraceCheckUtils]: 85: Hoare triple {60159#true} assume !(0 == ~cond); {60159#true} is VALID [2022-04-08 12:38:30,293 INFO L290 TraceCheckUtils]: 84: Hoare triple {60159#true} ~cond := #in~cond; {60159#true} is VALID [2022-04-08 12:38:30,293 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-08 12:38:30,293 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-08 12:38:30,293 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-08 12:38:30,294 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-08 12:38:30,294 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-08 12:38:30,294 INFO L290 TraceCheckUtils]: 78: Hoare triple {60159#true} assume true; {60159#true} is VALID [2022-04-08 12:38:30,294 INFO L290 TraceCheckUtils]: 77: Hoare triple {60159#true} assume !(0 == ~cond); {60159#true} is VALID [2022-04-08 12:38:30,294 INFO L290 TraceCheckUtils]: 76: Hoare triple {60159#true} ~cond := #in~cond; {60159#true} is VALID [2022-04-08 12:38:30,294 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-08 12:38:30,295 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-08 12:38:30,295 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-08 12:38:30,296 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-08 12:38:30,297 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-08 12:38:30,297 INFO L290 TraceCheckUtils]: 70: Hoare triple {60159#true} assume true; {60159#true} is VALID [2022-04-08 12:38:30,297 INFO L290 TraceCheckUtils]: 69: Hoare triple {60159#true} assume !(0 == ~cond); {60159#true} is VALID [2022-04-08 12:38:30,297 INFO L290 TraceCheckUtils]: 68: Hoare triple {60159#true} ~cond := #in~cond; {60159#true} is VALID [2022-04-08 12:38:30,297 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-08 12:38:30,297 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-08 12:38:30,298 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-08 12:38:30,298 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-08 12:38:30,298 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-08 12:38:30,299 INFO L290 TraceCheckUtils]: 62: Hoare triple {60159#true} assume true; {60159#true} is VALID [2022-04-08 12:38:30,299 INFO L290 TraceCheckUtils]: 61: Hoare triple {60159#true} assume !(0 == ~cond); {60159#true} is VALID [2022-04-08 12:38:30,299 INFO L290 TraceCheckUtils]: 60: Hoare triple {60159#true} ~cond := #in~cond; {60159#true} is VALID [2022-04-08 12:38:30,299 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-08 12:38:30,299 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-08 12:38:30,299 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-08 12:38:30,300 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-08 12:38:30,300 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-08 12:38:30,300 INFO L290 TraceCheckUtils]: 54: Hoare triple {60159#true} assume true; {60159#true} is VALID [2022-04-08 12:38:30,300 INFO L290 TraceCheckUtils]: 53: Hoare triple {60159#true} assume !(0 == ~cond); {60159#true} is VALID [2022-04-08 12:38:30,300 INFO L290 TraceCheckUtils]: 52: Hoare triple {60159#true} ~cond := #in~cond; {60159#true} is VALID [2022-04-08 12:38:30,300 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-08 12:38:30,301 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-08 12:38:30,301 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-08 12:38:30,301 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-08 12:38:30,302 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-08 12:38:30,302 INFO L290 TraceCheckUtils]: 46: Hoare triple {60159#true} assume true; {60159#true} is VALID [2022-04-08 12:38:30,302 INFO L290 TraceCheckUtils]: 45: Hoare triple {60159#true} assume !(0 == ~cond); {60159#true} is VALID [2022-04-08 12:38:30,302 INFO L290 TraceCheckUtils]: 44: Hoare triple {60159#true} ~cond := #in~cond; {60159#true} is VALID [2022-04-08 12:38:30,302 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-08 12:38:30,302 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-08 12:38:30,303 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-08 12:38:30,303 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-08 12:38:30,303 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-08 12:38:30,312 INFO L290 TraceCheckUtils]: 38: Hoare triple {60159#true} assume true; {60159#true} is VALID [2022-04-08 12:38:30,312 INFO L290 TraceCheckUtils]: 37: Hoare triple {60159#true} assume !(0 == ~cond); {60159#true} is VALID [2022-04-08 12:38:30,312 INFO L290 TraceCheckUtils]: 36: Hoare triple {60159#true} ~cond := #in~cond; {60159#true} is VALID [2022-04-08 12:38:30,312 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-08 12:38:30,313 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-08 12:38:30,314 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-08 12:38:30,314 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-08 12:38:30,314 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-08 12:38:30,315 INFO L290 TraceCheckUtils]: 30: Hoare triple {60159#true} assume true; {60159#true} is VALID [2022-04-08 12:38:30,315 INFO L290 TraceCheckUtils]: 29: Hoare triple {60159#true} assume !(0 == ~cond); {60159#true} is VALID [2022-04-08 12:38:30,315 INFO L290 TraceCheckUtils]: 28: Hoare triple {60159#true} ~cond := #in~cond; {60159#true} is VALID [2022-04-08 12:38:30,315 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-08 12:38:30,315 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-08 12:38:30,315 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-08 12:38:30,316 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-08 12:38:30,316 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-08 12:38:30,316 INFO L290 TraceCheckUtils]: 22: Hoare triple {60159#true} assume true; {60159#true} is VALID [2022-04-08 12:38:30,316 INFO L290 TraceCheckUtils]: 21: Hoare triple {60159#true} assume !(0 == ~cond); {60159#true} is VALID [2022-04-08 12:38:30,316 INFO L290 TraceCheckUtils]: 20: Hoare triple {60159#true} ~cond := #in~cond; {60159#true} is VALID [2022-04-08 12:38:30,316 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-08 12:38:30,317 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-08 12:38:30,317 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-08 12:38:30,317 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-08 12:38:30,317 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {60159#true} {60159#true} #92#return; {60159#true} is VALID [2022-04-08 12:38:30,317 INFO L290 TraceCheckUtils]: 14: Hoare triple {60159#true} assume true; {60159#true} is VALID [2022-04-08 12:38:30,317 INFO L290 TraceCheckUtils]: 13: Hoare triple {60159#true} assume !(0 == ~cond); {60159#true} is VALID [2022-04-08 12:38:30,317 INFO L290 TraceCheckUtils]: 12: Hoare triple {60159#true} ~cond := #in~cond; {60159#true} is VALID [2022-04-08 12:38:30,318 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-08 12:38:30,318 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {60159#true} {60159#true} #90#return; {60159#true} is VALID [2022-04-08 12:38:30,318 INFO L290 TraceCheckUtils]: 9: Hoare triple {60159#true} assume true; {60159#true} is VALID [2022-04-08 12:38:30,318 INFO L290 TraceCheckUtils]: 8: Hoare triple {60159#true} assume !(0 == ~cond); {60159#true} is VALID [2022-04-08 12:38:30,318 INFO L290 TraceCheckUtils]: 7: Hoare triple {60159#true} ~cond := #in~cond; {60159#true} is VALID [2022-04-08 12:38:30,318 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-08 12:38:30,318 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-08 12:38:30,318 INFO L272 TraceCheckUtils]: 4: Hoare triple {60159#true} call #t~ret9 := main(); {60159#true} is VALID [2022-04-08 12:38:30,318 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60159#true} {60159#true} #102#return; {60159#true} is VALID [2022-04-08 12:38:30,318 INFO L290 TraceCheckUtils]: 2: Hoare triple {60159#true} assume true; {60159#true} is VALID [2022-04-08 12:38:30,318 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-08 12:38:30,318 INFO L272 TraceCheckUtils]: 0: Hoare triple {60159#true} call ULTIMATE.init(); {60159#true} is VALID [2022-04-08 12:38:30,319 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-08 12:38:30,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:38:30,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827205274] [2022-04-08 12:38:30,319 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:38:30,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424533140] [2022-04-08 12:38:30,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424533140] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:38:30,319 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:38:30,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-08 12:38:30,319 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:38:30,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [284699090] [2022-04-08 12:38:30,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [284699090] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:38:30,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:38:30,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 12:38:30,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868006819] [2022-04-08 12:38:30,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:38:30,320 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-08 12:38:30,320 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:38:30,320 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-08 12:38:30,385 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-08 12:38:30,385 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 12:38:30,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:38:30,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 12:38:30,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-04-08 12:38:30,386 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-08 12:38:33,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:38:33,561 INFO L93 Difference]: Finished difference Result 862 states and 1224 transitions. [2022-04-08 12:38:33,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 12:38:33,562 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-08 12:38:33,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:38:33,562 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-08 12:38:33,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 190 transitions. [2022-04-08 12:38:33,563 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-08 12:38:33,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 190 transitions. [2022-04-08 12:38:33,564 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 190 transitions. [2022-04-08 12:38:33,730 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-08 12:38:33,757 INFO L225 Difference]: With dead ends: 862 [2022-04-08 12:38:33,757 INFO L226 Difference]: Without dead ends: 711 [2022-04-08 12:38:33,757 INFO L912 BasicCegarLoop]: 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-08 12:38:33,758 INFO L913 BasicCegarLoop]: 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-08 12:38:33,758 INFO L914 BasicCegarLoop]: 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-08 12:38:33,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2022-04-08 12:38:35,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 560. [2022-04-08 12:38:35,245 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:38:35,245 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-08 12:38:35,246 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-08 12:38:35,246 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-08 12:38:35,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:38:35,271 INFO L93 Difference]: Finished difference Result 711 states and 989 transitions. [2022-04-08 12:38:35,271 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 989 transitions. [2022-04-08 12:38:35,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:38:35,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:38:35,273 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-08 12:38:35,273 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-08 12:38:35,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:38:35,293 INFO L93 Difference]: Finished difference Result 711 states and 989 transitions. [2022-04-08 12:38:35,293 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 989 transitions. [2022-04-08 12:38:35,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:38:35,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:38:35,293 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:38:35,293 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:38:35,294 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-08 12:38:35,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 768 transitions. [2022-04-08 12:38:35,309 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 768 transitions. Word has length 113 [2022-04-08 12:38:35,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:38:35,309 INFO L478 AbstractCegarLoop]: Abstraction has 560 states and 768 transitions. [2022-04-08 12:38:35,309 INFO L479 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-08 12:38:35,309 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 560 states and 768 transitions. [2022-04-08 12:38:37,149 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-08 12:38:37,150 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 768 transitions. [2022-04-08 12:38:37,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-04-08 12:38:37,151 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:38:37,151 INFO L499 BasicCegarLoop]: 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-08 12:38:37,167 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-08 12:38:37,351 WARN L460 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-08 12:38:37,351 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:38:37,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:38:37,352 INFO L85 PathProgramCache]: Analyzing trace with hash -144297019, now seen corresponding path program 15 times [2022-04-08 12:38:37,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:38:37,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1848371672] [2022-04-08 12:38:37,352 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:38:37,352 INFO L85 PathProgramCache]: Analyzing trace with hash -144297019, now seen corresponding path program 16 times [2022-04-08 12:38:37,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:38:37,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736198782] [2022-04-08 12:38:37,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:38:37,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:38:37,365 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:38:37,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [114885474] [2022-04-08 12:38:37,365 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 12:38:37,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:38:37,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:38:37,366 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-08 12:38:37,367 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-08 12:38:37,749 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 12:38:37,749 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:38:37,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-08 12:38:37,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:38:37,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:38:38,274 INFO L272 TraceCheckUtils]: 0: Hoare triple {65126#true} call ULTIMATE.init(); {65126#true} is VALID [2022-04-08 12:38:38,274 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-08 12:38:38,274 INFO L290 TraceCheckUtils]: 2: Hoare triple {65134#(<= ~counter~0 0)} assume true; {65134#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:38,275 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65134#(<= ~counter~0 0)} {65126#true} #102#return; {65134#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:38,275 INFO L272 TraceCheckUtils]: 4: Hoare triple {65134#(<= ~counter~0 0)} call #t~ret9 := main(); {65134#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:38,275 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-08 12:38:38,276 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-08 12:38:38,276 INFO L290 TraceCheckUtils]: 7: Hoare triple {65134#(<= ~counter~0 0)} ~cond := #in~cond; {65134#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:38,276 INFO L290 TraceCheckUtils]: 8: Hoare triple {65134#(<= ~counter~0 0)} assume !(0 == ~cond); {65134#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:38,276 INFO L290 TraceCheckUtils]: 9: Hoare triple {65134#(<= ~counter~0 0)} assume true; {65134#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:38,277 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {65134#(<= ~counter~0 0)} {65134#(<= ~counter~0 0)} #90#return; {65134#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:38,277 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-08 12:38:38,277 INFO L290 TraceCheckUtils]: 12: Hoare triple {65134#(<= ~counter~0 0)} ~cond := #in~cond; {65134#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:38,278 INFO L290 TraceCheckUtils]: 13: Hoare triple {65134#(<= ~counter~0 0)} assume !(0 == ~cond); {65134#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:38,278 INFO L290 TraceCheckUtils]: 14: Hoare triple {65134#(<= ~counter~0 0)} assume true; {65134#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:38,278 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {65134#(<= ~counter~0 0)} {65134#(<= ~counter~0 0)} #92#return; {65134#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:38,279 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-08 12:38:38,280 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-08 12:38:38,280 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-08 12:38:38,281 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-08 12:38:38,281 INFO L290 TraceCheckUtils]: 20: Hoare triple {65183#(<= ~counter~0 1)} ~cond := #in~cond; {65183#(<= ~counter~0 1)} is VALID [2022-04-08 12:38:38,281 INFO L290 TraceCheckUtils]: 21: Hoare triple {65183#(<= ~counter~0 1)} assume !(0 == ~cond); {65183#(<= ~counter~0 1)} is VALID [2022-04-08 12:38:38,281 INFO L290 TraceCheckUtils]: 22: Hoare triple {65183#(<= ~counter~0 1)} assume true; {65183#(<= ~counter~0 1)} is VALID [2022-04-08 12:38:38,282 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {65183#(<= ~counter~0 1)} {65183#(<= ~counter~0 1)} #94#return; {65183#(<= ~counter~0 1)} is VALID [2022-04-08 12:38:38,282 INFO L290 TraceCheckUtils]: 24: Hoare triple {65183#(<= ~counter~0 1)} assume !!(0 != ~r~0); {65183#(<= ~counter~0 1)} is VALID [2022-04-08 12:38:38,283 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-08 12:38:38,283 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-08 12:38:38,284 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-08 12:38:38,284 INFO L290 TraceCheckUtils]: 28: Hoare triple {65208#(<= ~counter~0 2)} ~cond := #in~cond; {65208#(<= ~counter~0 2)} is VALID [2022-04-08 12:38:38,284 INFO L290 TraceCheckUtils]: 29: Hoare triple {65208#(<= ~counter~0 2)} assume !(0 == ~cond); {65208#(<= ~counter~0 2)} is VALID [2022-04-08 12:38:38,284 INFO L290 TraceCheckUtils]: 30: Hoare triple {65208#(<= ~counter~0 2)} assume true; {65208#(<= ~counter~0 2)} is VALID [2022-04-08 12:38:38,285 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {65208#(<= ~counter~0 2)} {65208#(<= ~counter~0 2)} #96#return; {65208#(<= ~counter~0 2)} is VALID [2022-04-08 12:38:38,285 INFO L290 TraceCheckUtils]: 32: Hoare triple {65208#(<= ~counter~0 2)} assume !(~r~0 > 0); {65208#(<= ~counter~0 2)} is VALID [2022-04-08 12:38:38,286 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-08 12:38:38,286 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-08 12:38:38,286 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-08 12:38:38,287 INFO L290 TraceCheckUtils]: 36: Hoare triple {65233#(<= ~counter~0 3)} ~cond := #in~cond; {65233#(<= ~counter~0 3)} is VALID [2022-04-08 12:38:38,287 INFO L290 TraceCheckUtils]: 37: Hoare triple {65233#(<= ~counter~0 3)} assume !(0 == ~cond); {65233#(<= ~counter~0 3)} is VALID [2022-04-08 12:38:38,287 INFO L290 TraceCheckUtils]: 38: Hoare triple {65233#(<= ~counter~0 3)} assume true; {65233#(<= ~counter~0 3)} is VALID [2022-04-08 12:38:38,288 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {65233#(<= ~counter~0 3)} {65233#(<= ~counter~0 3)} #98#return; {65233#(<= ~counter~0 3)} is VALID [2022-04-08 12:38:38,288 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-08 12:38:38,289 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-08 12:38:38,289 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-08 12:38:38,289 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-08 12:38:38,290 INFO L290 TraceCheckUtils]: 44: Hoare triple {65258#(<= ~counter~0 4)} ~cond := #in~cond; {65258#(<= ~counter~0 4)} is VALID [2022-04-08 12:38:38,290 INFO L290 TraceCheckUtils]: 45: Hoare triple {65258#(<= ~counter~0 4)} assume !(0 == ~cond); {65258#(<= ~counter~0 4)} is VALID [2022-04-08 12:38:38,290 INFO L290 TraceCheckUtils]: 46: Hoare triple {65258#(<= ~counter~0 4)} assume true; {65258#(<= ~counter~0 4)} is VALID [2022-04-08 12:38:38,291 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {65258#(<= ~counter~0 4)} {65258#(<= ~counter~0 4)} #98#return; {65258#(<= ~counter~0 4)} is VALID [2022-04-08 12:38:38,291 INFO L290 TraceCheckUtils]: 48: Hoare triple {65258#(<= ~counter~0 4)} assume !(~r~0 < 0); {65258#(<= ~counter~0 4)} is VALID [2022-04-08 12:38:38,291 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-08 12:38:38,292 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-08 12:38:38,292 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-08 12:38:38,292 INFO L290 TraceCheckUtils]: 52: Hoare triple {65283#(<= ~counter~0 5)} ~cond := #in~cond; {65283#(<= ~counter~0 5)} is VALID [2022-04-08 12:38:38,293 INFO L290 TraceCheckUtils]: 53: Hoare triple {65283#(<= ~counter~0 5)} assume !(0 == ~cond); {65283#(<= ~counter~0 5)} is VALID [2022-04-08 12:38:38,293 INFO L290 TraceCheckUtils]: 54: Hoare triple {65283#(<= ~counter~0 5)} assume true; {65283#(<= ~counter~0 5)} is VALID [2022-04-08 12:38:38,293 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {65283#(<= ~counter~0 5)} {65283#(<= ~counter~0 5)} #94#return; {65283#(<= ~counter~0 5)} is VALID [2022-04-08 12:38:38,294 INFO L290 TraceCheckUtils]: 56: Hoare triple {65283#(<= ~counter~0 5)} assume !!(0 != ~r~0); {65283#(<= ~counter~0 5)} is VALID [2022-04-08 12:38:38,294 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-08 12:38:38,295 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-08 12:38:38,295 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-08 12:38:38,295 INFO L290 TraceCheckUtils]: 60: Hoare triple {65308#(<= ~counter~0 6)} ~cond := #in~cond; {65308#(<= ~counter~0 6)} is VALID [2022-04-08 12:38:38,295 INFO L290 TraceCheckUtils]: 61: Hoare triple {65308#(<= ~counter~0 6)} assume !(0 == ~cond); {65308#(<= ~counter~0 6)} is VALID [2022-04-08 12:38:38,296 INFO L290 TraceCheckUtils]: 62: Hoare triple {65308#(<= ~counter~0 6)} assume true; {65308#(<= ~counter~0 6)} is VALID [2022-04-08 12:38:38,296 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {65308#(<= ~counter~0 6)} {65308#(<= ~counter~0 6)} #96#return; {65308#(<= ~counter~0 6)} is VALID [2022-04-08 12:38:38,296 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-08 12:38:38,297 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-08 12:38:38,297 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-08 12:38:38,298 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-08 12:38:38,298 INFO L290 TraceCheckUtils]: 68: Hoare triple {65333#(<= ~counter~0 7)} ~cond := #in~cond; {65333#(<= ~counter~0 7)} is VALID [2022-04-08 12:38:38,298 INFO L290 TraceCheckUtils]: 69: Hoare triple {65333#(<= ~counter~0 7)} assume !(0 == ~cond); {65333#(<= ~counter~0 7)} is VALID [2022-04-08 12:38:38,299 INFO L290 TraceCheckUtils]: 70: Hoare triple {65333#(<= ~counter~0 7)} assume true; {65333#(<= ~counter~0 7)} is VALID [2022-04-08 12:38:38,299 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {65333#(<= ~counter~0 7)} {65333#(<= ~counter~0 7)} #96#return; {65333#(<= ~counter~0 7)} is VALID [2022-04-08 12:38:38,299 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-08 12:38:38,300 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-08 12:38:38,300 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-08 12:38:38,301 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-08 12:38:38,301 INFO L290 TraceCheckUtils]: 76: Hoare triple {65358#(<= ~counter~0 8)} ~cond := #in~cond; {65358#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:38,301 INFO L290 TraceCheckUtils]: 77: Hoare triple {65358#(<= ~counter~0 8)} assume !(0 == ~cond); {65358#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:38,301 INFO L290 TraceCheckUtils]: 78: Hoare triple {65358#(<= ~counter~0 8)} assume true; {65358#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:38,302 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {65358#(<= ~counter~0 8)} {65358#(<= ~counter~0 8)} #96#return; {65358#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:38,302 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-08 12:38:38,303 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-08 12:38:38,303 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-08 12:38:38,304 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-08 12:38:38,304 INFO L290 TraceCheckUtils]: 84: Hoare triple {65383#(<= ~counter~0 9)} ~cond := #in~cond; {65383#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:38,304 INFO L290 TraceCheckUtils]: 85: Hoare triple {65383#(<= ~counter~0 9)} assume !(0 == ~cond); {65383#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:38,304 INFO L290 TraceCheckUtils]: 86: Hoare triple {65383#(<= ~counter~0 9)} assume true; {65383#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:38,305 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {65383#(<= ~counter~0 9)} {65383#(<= ~counter~0 9)} #96#return; {65383#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:38,305 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-08 12:38:38,306 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-08 12:38:38,306 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-08 12:38:38,306 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-08 12:38:38,307 INFO L290 TraceCheckUtils]: 92: Hoare triple {65408#(<= ~counter~0 10)} ~cond := #in~cond; {65408#(<= ~counter~0 10)} is VALID [2022-04-08 12:38:38,307 INFO L290 TraceCheckUtils]: 93: Hoare triple {65408#(<= ~counter~0 10)} assume !(0 == ~cond); {65408#(<= ~counter~0 10)} is VALID [2022-04-08 12:38:38,307 INFO L290 TraceCheckUtils]: 94: Hoare triple {65408#(<= ~counter~0 10)} assume true; {65408#(<= ~counter~0 10)} is VALID [2022-04-08 12:38:38,308 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {65408#(<= ~counter~0 10)} {65408#(<= ~counter~0 10)} #96#return; {65408#(<= ~counter~0 10)} is VALID [2022-04-08 12:38:38,308 INFO L290 TraceCheckUtils]: 96: Hoare triple {65408#(<= ~counter~0 10)} assume !(~r~0 > 0); {65408#(<= ~counter~0 10)} is VALID [2022-04-08 12:38:38,309 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-08 12:38:38,309 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-08 12:38:38,309 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-08 12:38:38,309 INFO L290 TraceCheckUtils]: 100: Hoare triple {65433#(<= ~counter~0 11)} ~cond := #in~cond; {65433#(<= ~counter~0 11)} is VALID [2022-04-08 12:38:38,310 INFO L290 TraceCheckUtils]: 101: Hoare triple {65433#(<= ~counter~0 11)} assume !(0 == ~cond); {65433#(<= ~counter~0 11)} is VALID [2022-04-08 12:38:38,310 INFO L290 TraceCheckUtils]: 102: Hoare triple {65433#(<= ~counter~0 11)} assume true; {65433#(<= ~counter~0 11)} is VALID [2022-04-08 12:38:38,310 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {65433#(<= ~counter~0 11)} {65433#(<= ~counter~0 11)} #98#return; {65433#(<= ~counter~0 11)} is VALID [2022-04-08 12:38:38,311 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-08 12:38:38,311 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-08 12:38:38,311 INFO L290 TraceCheckUtils]: 106: Hoare triple {65458#(<= |main_#t~post8| 11)} assume !(#t~post8 < 20);havoc #t~post8; {65127#false} is VALID [2022-04-08 12:38:38,311 INFO L290 TraceCheckUtils]: 107: Hoare triple {65127#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {65127#false} is VALID [2022-04-08 12:38:38,311 INFO L290 TraceCheckUtils]: 108: Hoare triple {65127#false} assume !(#t~post6 < 20);havoc #t~post6; {65127#false} is VALID [2022-04-08 12:38:38,312 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-08 12:38:38,312 INFO L290 TraceCheckUtils]: 110: Hoare triple {65127#false} ~cond := #in~cond; {65127#false} is VALID [2022-04-08 12:38:38,312 INFO L290 TraceCheckUtils]: 111: Hoare triple {65127#false} assume 0 == ~cond; {65127#false} is VALID [2022-04-08 12:38:38,312 INFO L290 TraceCheckUtils]: 112: Hoare triple {65127#false} assume !false; {65127#false} is VALID [2022-04-08 12:38:38,312 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-08 12:38:38,312 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:38:38,824 INFO L290 TraceCheckUtils]: 112: Hoare triple {65127#false} assume !false; {65127#false} is VALID [2022-04-08 12:38:38,824 INFO L290 TraceCheckUtils]: 111: Hoare triple {65127#false} assume 0 == ~cond; {65127#false} is VALID [2022-04-08 12:38:38,824 INFO L290 TraceCheckUtils]: 110: Hoare triple {65127#false} ~cond := #in~cond; {65127#false} is VALID [2022-04-08 12:38:38,824 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-08 12:38:38,824 INFO L290 TraceCheckUtils]: 108: Hoare triple {65127#false} assume !(#t~post6 < 20);havoc #t~post6; {65127#false} is VALID [2022-04-08 12:38:38,824 INFO L290 TraceCheckUtils]: 107: Hoare triple {65127#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {65127#false} is VALID [2022-04-08 12:38:38,825 INFO L290 TraceCheckUtils]: 106: Hoare triple {65498#(< |main_#t~post8| 20)} assume !(#t~post8 < 20);havoc #t~post8; {65127#false} is VALID [2022-04-08 12:38:38,825 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-08 12:38:38,825 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-08 12:38:38,826 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {65126#true} {65502#(< ~counter~0 20)} #98#return; {65502#(< ~counter~0 20)} is VALID [2022-04-08 12:38:38,826 INFO L290 TraceCheckUtils]: 102: Hoare triple {65126#true} assume true; {65126#true} is VALID [2022-04-08 12:38:38,826 INFO L290 TraceCheckUtils]: 101: Hoare triple {65126#true} assume !(0 == ~cond); {65126#true} is VALID [2022-04-08 12:38:38,826 INFO L290 TraceCheckUtils]: 100: Hoare triple {65126#true} ~cond := #in~cond; {65126#true} is VALID [2022-04-08 12:38:38,826 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-08 12:38:38,826 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-08 12:38:38,828 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-08 12:38:38,828 INFO L290 TraceCheckUtils]: 96: Hoare triple {65527#(< ~counter~0 19)} assume !(~r~0 > 0); {65527#(< ~counter~0 19)} is VALID [2022-04-08 12:38:38,828 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {65126#true} {65527#(< ~counter~0 19)} #96#return; {65527#(< ~counter~0 19)} is VALID [2022-04-08 12:38:38,829 INFO L290 TraceCheckUtils]: 94: Hoare triple {65126#true} assume true; {65126#true} is VALID [2022-04-08 12:38:38,829 INFO L290 TraceCheckUtils]: 93: Hoare triple {65126#true} assume !(0 == ~cond); {65126#true} is VALID [2022-04-08 12:38:38,829 INFO L290 TraceCheckUtils]: 92: Hoare triple {65126#true} ~cond := #in~cond; {65126#true} is VALID [2022-04-08 12:38:38,829 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-08 12:38:38,829 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-08 12:38:38,830 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-08 12:38:38,830 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-08 12:38:38,830 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {65126#true} {65552#(< ~counter~0 18)} #96#return; {65552#(< ~counter~0 18)} is VALID [2022-04-08 12:38:38,831 INFO L290 TraceCheckUtils]: 86: Hoare triple {65126#true} assume true; {65126#true} is VALID [2022-04-08 12:38:38,831 INFO L290 TraceCheckUtils]: 85: Hoare triple {65126#true} assume !(0 == ~cond); {65126#true} is VALID [2022-04-08 12:38:38,831 INFO L290 TraceCheckUtils]: 84: Hoare triple {65126#true} ~cond := #in~cond; {65126#true} is VALID [2022-04-08 12:38:38,831 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-08 12:38:38,831 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-08 12:38:38,832 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-08 12:38:38,832 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-08 12:38:38,833 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {65126#true} {65577#(< ~counter~0 17)} #96#return; {65577#(< ~counter~0 17)} is VALID [2022-04-08 12:38:38,833 INFO L290 TraceCheckUtils]: 78: Hoare triple {65126#true} assume true; {65126#true} is VALID [2022-04-08 12:38:38,833 INFO L290 TraceCheckUtils]: 77: Hoare triple {65126#true} assume !(0 == ~cond); {65126#true} is VALID [2022-04-08 12:38:38,833 INFO L290 TraceCheckUtils]: 76: Hoare triple {65126#true} ~cond := #in~cond; {65126#true} is VALID [2022-04-08 12:38:38,833 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-08 12:38:38,833 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-08 12:38:38,834 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-08 12:38:38,834 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-08 12:38:38,835 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {65126#true} {65602#(< ~counter~0 16)} #96#return; {65602#(< ~counter~0 16)} is VALID [2022-04-08 12:38:38,835 INFO L290 TraceCheckUtils]: 70: Hoare triple {65126#true} assume true; {65126#true} is VALID [2022-04-08 12:38:38,835 INFO L290 TraceCheckUtils]: 69: Hoare triple {65126#true} assume !(0 == ~cond); {65126#true} is VALID [2022-04-08 12:38:38,835 INFO L290 TraceCheckUtils]: 68: Hoare triple {65126#true} ~cond := #in~cond; {65126#true} is VALID [2022-04-08 12:38:38,835 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-08 12:38:38,841 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-08 12:38:38,843 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-08 12:38:38,843 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-08 12:38:38,844 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {65126#true} {65627#(< ~counter~0 15)} #96#return; {65627#(< ~counter~0 15)} is VALID [2022-04-08 12:38:38,844 INFO L290 TraceCheckUtils]: 62: Hoare triple {65126#true} assume true; {65126#true} is VALID [2022-04-08 12:38:38,844 INFO L290 TraceCheckUtils]: 61: Hoare triple {65126#true} assume !(0 == ~cond); {65126#true} is VALID [2022-04-08 12:38:38,844 INFO L290 TraceCheckUtils]: 60: Hoare triple {65126#true} ~cond := #in~cond; {65126#true} is VALID [2022-04-08 12:38:38,844 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-08 12:38:38,844 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-08 12:38:38,845 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-08 12:38:38,845 INFO L290 TraceCheckUtils]: 56: Hoare triple {65652#(< ~counter~0 14)} assume !!(0 != ~r~0); {65652#(< ~counter~0 14)} is VALID [2022-04-08 12:38:38,846 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {65126#true} {65652#(< ~counter~0 14)} #94#return; {65652#(< ~counter~0 14)} is VALID [2022-04-08 12:38:38,846 INFO L290 TraceCheckUtils]: 54: Hoare triple {65126#true} assume true; {65126#true} is VALID [2022-04-08 12:38:38,846 INFO L290 TraceCheckUtils]: 53: Hoare triple {65126#true} assume !(0 == ~cond); {65126#true} is VALID [2022-04-08 12:38:38,846 INFO L290 TraceCheckUtils]: 52: Hoare triple {65126#true} ~cond := #in~cond; {65126#true} is VALID [2022-04-08 12:38:38,846 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-08 12:38:38,846 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-08 12:38:38,847 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-08 12:38:38,847 INFO L290 TraceCheckUtils]: 48: Hoare triple {65677#(< ~counter~0 13)} assume !(~r~0 < 0); {65677#(< ~counter~0 13)} is VALID [2022-04-08 12:38:38,848 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {65126#true} {65677#(< ~counter~0 13)} #98#return; {65677#(< ~counter~0 13)} is VALID [2022-04-08 12:38:38,848 INFO L290 TraceCheckUtils]: 46: Hoare triple {65126#true} assume true; {65126#true} is VALID [2022-04-08 12:38:38,848 INFO L290 TraceCheckUtils]: 45: Hoare triple {65126#true} assume !(0 == ~cond); {65126#true} is VALID [2022-04-08 12:38:38,848 INFO L290 TraceCheckUtils]: 44: Hoare triple {65126#true} ~cond := #in~cond; {65126#true} is VALID [2022-04-08 12:38:38,848 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-08 12:38:38,848 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-08 12:38:38,849 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-08 12:38:38,849 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-08 12:38:38,850 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {65126#true} {65433#(<= ~counter~0 11)} #98#return; {65433#(<= ~counter~0 11)} is VALID [2022-04-08 12:38:38,850 INFO L290 TraceCheckUtils]: 38: Hoare triple {65126#true} assume true; {65126#true} is VALID [2022-04-08 12:38:38,850 INFO L290 TraceCheckUtils]: 37: Hoare triple {65126#true} assume !(0 == ~cond); {65126#true} is VALID [2022-04-08 12:38:38,850 INFO L290 TraceCheckUtils]: 36: Hoare triple {65126#true} ~cond := #in~cond; {65126#true} is VALID [2022-04-08 12:38:38,850 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-08 12:38:38,850 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-08 12:38:38,851 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-08 12:38:38,851 INFO L290 TraceCheckUtils]: 32: Hoare triple {65408#(<= ~counter~0 10)} assume !(~r~0 > 0); {65408#(<= ~counter~0 10)} is VALID [2022-04-08 12:38:38,852 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {65126#true} {65408#(<= ~counter~0 10)} #96#return; {65408#(<= ~counter~0 10)} is VALID [2022-04-08 12:38:38,852 INFO L290 TraceCheckUtils]: 30: Hoare triple {65126#true} assume true; {65126#true} is VALID [2022-04-08 12:38:38,852 INFO L290 TraceCheckUtils]: 29: Hoare triple {65126#true} assume !(0 == ~cond); {65126#true} is VALID [2022-04-08 12:38:38,852 INFO L290 TraceCheckUtils]: 28: Hoare triple {65126#true} ~cond := #in~cond; {65126#true} is VALID [2022-04-08 12:38:38,852 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-08 12:38:38,852 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-08 12:38:38,853 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-08 12:38:38,853 INFO L290 TraceCheckUtils]: 24: Hoare triple {65383#(<= ~counter~0 9)} assume !!(0 != ~r~0); {65383#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:38,854 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {65126#true} {65383#(<= ~counter~0 9)} #94#return; {65383#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:38,854 INFO L290 TraceCheckUtils]: 22: Hoare triple {65126#true} assume true; {65126#true} is VALID [2022-04-08 12:38:38,854 INFO L290 TraceCheckUtils]: 21: Hoare triple {65126#true} assume !(0 == ~cond); {65126#true} is VALID [2022-04-08 12:38:38,854 INFO L290 TraceCheckUtils]: 20: Hoare triple {65126#true} ~cond := #in~cond; {65126#true} is VALID [2022-04-08 12:38:38,854 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-08 12:38:38,854 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-08 12:38:38,855 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-08 12:38:38,855 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-08 12:38:38,855 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {65126#true} {65358#(<= ~counter~0 8)} #92#return; {65358#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:38,856 INFO L290 TraceCheckUtils]: 14: Hoare triple {65126#true} assume true; {65126#true} is VALID [2022-04-08 12:38:38,856 INFO L290 TraceCheckUtils]: 13: Hoare triple {65126#true} assume !(0 == ~cond); {65126#true} is VALID [2022-04-08 12:38:38,856 INFO L290 TraceCheckUtils]: 12: Hoare triple {65126#true} ~cond := #in~cond; {65126#true} is VALID [2022-04-08 12:38:38,856 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-08 12:38:38,856 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {65126#true} {65358#(<= ~counter~0 8)} #90#return; {65358#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:38,856 INFO L290 TraceCheckUtils]: 9: Hoare triple {65126#true} assume true; {65126#true} is VALID [2022-04-08 12:38:38,856 INFO L290 TraceCheckUtils]: 8: Hoare triple {65126#true} assume !(0 == ~cond); {65126#true} is VALID [2022-04-08 12:38:38,856 INFO L290 TraceCheckUtils]: 7: Hoare triple {65126#true} ~cond := #in~cond; {65126#true} is VALID [2022-04-08 12:38:38,856 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-08 12:38:38,857 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-08 12:38:38,857 INFO L272 TraceCheckUtils]: 4: Hoare triple {65358#(<= ~counter~0 8)} call #t~ret9 := main(); {65358#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:38,857 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65358#(<= ~counter~0 8)} {65126#true} #102#return; {65358#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:38,858 INFO L290 TraceCheckUtils]: 2: Hoare triple {65358#(<= ~counter~0 8)} assume true; {65358#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:38,858 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-08 12:38:38,858 INFO L272 TraceCheckUtils]: 0: Hoare triple {65126#true} call ULTIMATE.init(); {65126#true} is VALID [2022-04-08 12:38:38,858 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-08 12:38:38,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:38:38,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736198782] [2022-04-08 12:38:38,859 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:38:38,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114885474] [2022-04-08 12:38:38,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [114885474] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:38:38,859 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:38:38,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 24 [2022-04-08 12:38:38,859 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:38:38,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1848371672] [2022-04-08 12:38:38,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1848371672] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:38:38,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:38:38,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 12:38:38,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695329267] [2022-04-08 12:38:38,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:38:38,860 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-08 12:38:38,860 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:38:38,860 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-08 12:38:38,949 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-08 12:38:38,950 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 12:38:38,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:38:38,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 12:38:38,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-08 12:38:38,950 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-08 12:38:41,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:38:41,415 INFO L93 Difference]: Finished difference Result 781 states and 1101 transitions. [2022-04-08 12:38:41,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-08 12:38:41,415 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-08 12:38:41,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:38:41,415 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-08 12:38:41,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 256 transitions. [2022-04-08 12:38:41,417 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-08 12:38:41,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 256 transitions. [2022-04-08 12:38:41,419 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 256 transitions. [2022-04-08 12:38:41,664 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-08 12:38:41,681 INFO L225 Difference]: With dead ends: 781 [2022-04-08 12:38:41,682 INFO L226 Difference]: Without dead ends: 588 [2022-04-08 12:38:41,682 INFO L912 BasicCegarLoop]: 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-08 12:38:41,683 INFO L913 BasicCegarLoop]: 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-08 12:38:41,683 INFO L914 BasicCegarLoop]: 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-08 12:38:41,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2022-04-08 12:38:43,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 578. [2022-04-08 12:38:43,264 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:38:43,264 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-08 12:38:43,265 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-08 12:38:43,265 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-08 12:38:43,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:38:43,277 INFO L93 Difference]: Finished difference Result 588 states and 800 transitions. [2022-04-08 12:38:43,277 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 800 transitions. [2022-04-08 12:38:43,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:38:43,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:38:43,279 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-08 12:38:43,279 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-08 12:38:43,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:38:43,291 INFO L93 Difference]: Finished difference Result 588 states and 800 transitions. [2022-04-08 12:38:43,291 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 800 transitions. [2022-04-08 12:38:43,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:38:43,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:38:43,292 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:38:43,292 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:38:43,293 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-08 12:38:43,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 790 transitions. [2022-04-08 12:38:43,308 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 790 transitions. Word has length 113 [2022-04-08 12:38:43,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:38:43,308 INFO L478 AbstractCegarLoop]: Abstraction has 578 states and 790 transitions. [2022-04-08 12:38:43,308 INFO L479 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-08 12:38:43,308 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 578 states and 790 transitions. [2022-04-08 12:38:47,061 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-08 12:38:47,061 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 790 transitions. [2022-04-08 12:38:47,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-04-08 12:38:47,062 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:38:47,062 INFO L499 BasicCegarLoop]: 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-08 12:38:47,066 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-08 12:38:47,263 WARN L460 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-08 12:38:47,263 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:38:47,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:38:47,263 INFO L85 PathProgramCache]: Analyzing trace with hash 533963976, now seen corresponding path program 13 times [2022-04-08 12:38:47,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:38:47,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [539350637] [2022-04-08 12:38:47,264 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:38:47,264 INFO L85 PathProgramCache]: Analyzing trace with hash 533963976, now seen corresponding path program 14 times [2022-04-08 12:38:47,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:38:47,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609045453] [2022-04-08 12:38:47,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:38:47,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:38:47,282 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:38:47,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [979988034] [2022-04-08 12:38:47,283 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:38:47,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:38:47,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:38:47,283 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-08 12:38:47,284 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-08 12:38:47,349 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:38:47,349 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:38:47,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-08 12:38:47,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:38:47,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:38:47,886 INFO L272 TraceCheckUtils]: 0: Hoare triple {69739#true} call ULTIMATE.init(); {69739#true} is VALID [2022-04-08 12:38:47,887 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-08 12:38:47,887 INFO L290 TraceCheckUtils]: 2: Hoare triple {69747#(<= ~counter~0 0)} assume true; {69747#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:47,887 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {69747#(<= ~counter~0 0)} {69739#true} #102#return; {69747#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:47,888 INFO L272 TraceCheckUtils]: 4: Hoare triple {69747#(<= ~counter~0 0)} call #t~ret9 := main(); {69747#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:47,888 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-08 12:38:47,888 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-08 12:38:47,888 INFO L290 TraceCheckUtils]: 7: Hoare triple {69747#(<= ~counter~0 0)} ~cond := #in~cond; {69747#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:47,889 INFO L290 TraceCheckUtils]: 8: Hoare triple {69747#(<= ~counter~0 0)} assume !(0 == ~cond); {69747#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:47,889 INFO L290 TraceCheckUtils]: 9: Hoare triple {69747#(<= ~counter~0 0)} assume true; {69747#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:47,889 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {69747#(<= ~counter~0 0)} {69747#(<= ~counter~0 0)} #90#return; {69747#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:47,890 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-08 12:38:47,890 INFO L290 TraceCheckUtils]: 12: Hoare triple {69747#(<= ~counter~0 0)} ~cond := #in~cond; {69747#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:47,890 INFO L290 TraceCheckUtils]: 13: Hoare triple {69747#(<= ~counter~0 0)} assume !(0 == ~cond); {69747#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:47,891 INFO L290 TraceCheckUtils]: 14: Hoare triple {69747#(<= ~counter~0 0)} assume true; {69747#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:47,891 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {69747#(<= ~counter~0 0)} {69747#(<= ~counter~0 0)} #92#return; {69747#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:47,891 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-08 12:38:47,893 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-08 12:38:47,893 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-08 12:38:47,893 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-08 12:38:47,894 INFO L290 TraceCheckUtils]: 20: Hoare triple {69796#(<= ~counter~0 1)} ~cond := #in~cond; {69796#(<= ~counter~0 1)} is VALID [2022-04-08 12:38:47,894 INFO L290 TraceCheckUtils]: 21: Hoare triple {69796#(<= ~counter~0 1)} assume !(0 == ~cond); {69796#(<= ~counter~0 1)} is VALID [2022-04-08 12:38:47,894 INFO L290 TraceCheckUtils]: 22: Hoare triple {69796#(<= ~counter~0 1)} assume true; {69796#(<= ~counter~0 1)} is VALID [2022-04-08 12:38:47,895 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {69796#(<= ~counter~0 1)} {69796#(<= ~counter~0 1)} #94#return; {69796#(<= ~counter~0 1)} is VALID [2022-04-08 12:38:47,895 INFO L290 TraceCheckUtils]: 24: Hoare triple {69796#(<= ~counter~0 1)} assume !!(0 != ~r~0); {69796#(<= ~counter~0 1)} is VALID [2022-04-08 12:38:47,896 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-08 12:38:47,896 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-08 12:38:47,896 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-08 12:38:47,897 INFO L290 TraceCheckUtils]: 28: Hoare triple {69821#(<= ~counter~0 2)} ~cond := #in~cond; {69821#(<= ~counter~0 2)} is VALID [2022-04-08 12:38:47,897 INFO L290 TraceCheckUtils]: 29: Hoare triple {69821#(<= ~counter~0 2)} assume !(0 == ~cond); {69821#(<= ~counter~0 2)} is VALID [2022-04-08 12:38:47,897 INFO L290 TraceCheckUtils]: 30: Hoare triple {69821#(<= ~counter~0 2)} assume true; {69821#(<= ~counter~0 2)} is VALID [2022-04-08 12:38:47,898 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {69821#(<= ~counter~0 2)} {69821#(<= ~counter~0 2)} #96#return; {69821#(<= ~counter~0 2)} is VALID [2022-04-08 12:38:47,898 INFO L290 TraceCheckUtils]: 32: Hoare triple {69821#(<= ~counter~0 2)} assume !(~r~0 > 0); {69821#(<= ~counter~0 2)} is VALID [2022-04-08 12:38:47,899 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-08 12:38:47,899 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-08 12:38:47,899 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-08 12:38:47,900 INFO L290 TraceCheckUtils]: 36: Hoare triple {69846#(<= ~counter~0 3)} ~cond := #in~cond; {69846#(<= ~counter~0 3)} is VALID [2022-04-08 12:38:47,900 INFO L290 TraceCheckUtils]: 37: Hoare triple {69846#(<= ~counter~0 3)} assume !(0 == ~cond); {69846#(<= ~counter~0 3)} is VALID [2022-04-08 12:38:47,900 INFO L290 TraceCheckUtils]: 38: Hoare triple {69846#(<= ~counter~0 3)} assume true; {69846#(<= ~counter~0 3)} is VALID [2022-04-08 12:38:47,901 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {69846#(<= ~counter~0 3)} {69846#(<= ~counter~0 3)} #98#return; {69846#(<= ~counter~0 3)} is VALID [2022-04-08 12:38:47,901 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-08 12:38:47,902 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-08 12:38:47,902 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-08 12:38:47,902 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-08 12:38:47,902 INFO L290 TraceCheckUtils]: 44: Hoare triple {69871#(<= ~counter~0 4)} ~cond := #in~cond; {69871#(<= ~counter~0 4)} is VALID [2022-04-08 12:38:47,903 INFO L290 TraceCheckUtils]: 45: Hoare triple {69871#(<= ~counter~0 4)} assume !(0 == ~cond); {69871#(<= ~counter~0 4)} is VALID [2022-04-08 12:38:47,903 INFO L290 TraceCheckUtils]: 46: Hoare triple {69871#(<= ~counter~0 4)} assume true; {69871#(<= ~counter~0 4)} is VALID [2022-04-08 12:38:47,903 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {69871#(<= ~counter~0 4)} {69871#(<= ~counter~0 4)} #98#return; {69871#(<= ~counter~0 4)} is VALID [2022-04-08 12:38:47,904 INFO L290 TraceCheckUtils]: 48: Hoare triple {69871#(<= ~counter~0 4)} assume !(~r~0 < 0); {69871#(<= ~counter~0 4)} is VALID [2022-04-08 12:38:47,904 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-08 12:38:47,905 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-08 12:38:47,905 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-08 12:38:47,905 INFO L290 TraceCheckUtils]: 52: Hoare triple {69896#(<= ~counter~0 5)} ~cond := #in~cond; {69896#(<= ~counter~0 5)} is VALID [2022-04-08 12:38:47,906 INFO L290 TraceCheckUtils]: 53: Hoare triple {69896#(<= ~counter~0 5)} assume !(0 == ~cond); {69896#(<= ~counter~0 5)} is VALID [2022-04-08 12:38:47,906 INFO L290 TraceCheckUtils]: 54: Hoare triple {69896#(<= ~counter~0 5)} assume true; {69896#(<= ~counter~0 5)} is VALID [2022-04-08 12:38:47,906 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {69896#(<= ~counter~0 5)} {69896#(<= ~counter~0 5)} #94#return; {69896#(<= ~counter~0 5)} is VALID [2022-04-08 12:38:47,907 INFO L290 TraceCheckUtils]: 56: Hoare triple {69896#(<= ~counter~0 5)} assume !!(0 != ~r~0); {69896#(<= ~counter~0 5)} is VALID [2022-04-08 12:38:47,907 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-08 12:38:47,908 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-08 12:38:47,908 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-08 12:38:47,908 INFO L290 TraceCheckUtils]: 60: Hoare triple {69921#(<= ~counter~0 6)} ~cond := #in~cond; {69921#(<= ~counter~0 6)} is VALID [2022-04-08 12:38:47,909 INFO L290 TraceCheckUtils]: 61: Hoare triple {69921#(<= ~counter~0 6)} assume !(0 == ~cond); {69921#(<= ~counter~0 6)} is VALID [2022-04-08 12:38:47,909 INFO L290 TraceCheckUtils]: 62: Hoare triple {69921#(<= ~counter~0 6)} assume true; {69921#(<= ~counter~0 6)} is VALID [2022-04-08 12:38:47,909 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {69921#(<= ~counter~0 6)} {69921#(<= ~counter~0 6)} #96#return; {69921#(<= ~counter~0 6)} is VALID [2022-04-08 12:38:47,909 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-08 12:38:47,910 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-08 12:38:47,910 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-08 12:38:47,911 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-08 12:38:47,911 INFO L290 TraceCheckUtils]: 68: Hoare triple {69946#(<= ~counter~0 7)} ~cond := #in~cond; {69946#(<= ~counter~0 7)} is VALID [2022-04-08 12:38:47,911 INFO L290 TraceCheckUtils]: 69: Hoare triple {69946#(<= ~counter~0 7)} assume !(0 == ~cond); {69946#(<= ~counter~0 7)} is VALID [2022-04-08 12:38:47,912 INFO L290 TraceCheckUtils]: 70: Hoare triple {69946#(<= ~counter~0 7)} assume true; {69946#(<= ~counter~0 7)} is VALID [2022-04-08 12:38:47,912 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {69946#(<= ~counter~0 7)} {69946#(<= ~counter~0 7)} #96#return; {69946#(<= ~counter~0 7)} is VALID [2022-04-08 12:38:47,912 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-08 12:38:47,913 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-08 12:38:47,913 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-08 12:38:47,914 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-08 12:38:47,914 INFO L290 TraceCheckUtils]: 76: Hoare triple {69971#(<= ~counter~0 8)} ~cond := #in~cond; {69971#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:47,914 INFO L290 TraceCheckUtils]: 77: Hoare triple {69971#(<= ~counter~0 8)} assume !(0 == ~cond); {69971#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:47,915 INFO L290 TraceCheckUtils]: 78: Hoare triple {69971#(<= ~counter~0 8)} assume true; {69971#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:47,915 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {69971#(<= ~counter~0 8)} {69971#(<= ~counter~0 8)} #96#return; {69971#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:47,915 INFO L290 TraceCheckUtils]: 80: Hoare triple {69971#(<= ~counter~0 8)} assume !(~r~0 > 0); {69971#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:47,916 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-08 12:38:47,916 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-08 12:38:47,917 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-08 12:38:47,917 INFO L290 TraceCheckUtils]: 84: Hoare triple {69996#(<= ~counter~0 9)} ~cond := #in~cond; {69996#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:47,917 INFO L290 TraceCheckUtils]: 85: Hoare triple {69996#(<= ~counter~0 9)} assume !(0 == ~cond); {69996#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:47,917 INFO L290 TraceCheckUtils]: 86: Hoare triple {69996#(<= ~counter~0 9)} assume true; {69996#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:47,918 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {69996#(<= ~counter~0 9)} {69996#(<= ~counter~0 9)} #98#return; {69996#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:47,918 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-08 12:38:47,919 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-08 12:38:47,919 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-08 12:38:47,920 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-08 12:38:47,920 INFO L290 TraceCheckUtils]: 92: Hoare triple {70021#(<= ~counter~0 10)} ~cond := #in~cond; {70021#(<= ~counter~0 10)} is VALID [2022-04-08 12:38:47,920 INFO L290 TraceCheckUtils]: 93: Hoare triple {70021#(<= ~counter~0 10)} assume !(0 == ~cond); {70021#(<= ~counter~0 10)} is VALID [2022-04-08 12:38:47,920 INFO L290 TraceCheckUtils]: 94: Hoare triple {70021#(<= ~counter~0 10)} assume true; {70021#(<= ~counter~0 10)} is VALID [2022-04-08 12:38:47,921 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {70021#(<= ~counter~0 10)} {70021#(<= ~counter~0 10)} #98#return; {70021#(<= ~counter~0 10)} is VALID [2022-04-08 12:38:47,921 INFO L290 TraceCheckUtils]: 96: Hoare triple {70021#(<= ~counter~0 10)} assume !(~r~0 < 0); {70021#(<= ~counter~0 10)} is VALID [2022-04-08 12:38:47,922 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-08 12:38:47,922 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-08 12:38:47,923 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-08 12:38:47,923 INFO L290 TraceCheckUtils]: 100: Hoare triple {70046#(<= ~counter~0 11)} ~cond := #in~cond; {70046#(<= ~counter~0 11)} is VALID [2022-04-08 12:38:47,923 INFO L290 TraceCheckUtils]: 101: Hoare triple {70046#(<= ~counter~0 11)} assume !(0 == ~cond); {70046#(<= ~counter~0 11)} is VALID [2022-04-08 12:38:47,923 INFO L290 TraceCheckUtils]: 102: Hoare triple {70046#(<= ~counter~0 11)} assume true; {70046#(<= ~counter~0 11)} is VALID [2022-04-08 12:38:47,924 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {70046#(<= ~counter~0 11)} {70046#(<= ~counter~0 11)} #94#return; {70046#(<= ~counter~0 11)} is VALID [2022-04-08 12:38:47,924 INFO L290 TraceCheckUtils]: 104: Hoare triple {70046#(<= ~counter~0 11)} assume !!(0 != ~r~0); {70046#(<= ~counter~0 11)} is VALID [2022-04-08 12:38:47,924 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-08 12:38:47,925 INFO L290 TraceCheckUtils]: 106: Hoare triple {70071#(<= |main_#t~post7| 11)} assume !(#t~post7 < 20);havoc #t~post7; {69740#false} is VALID [2022-04-08 12:38:47,925 INFO L290 TraceCheckUtils]: 107: Hoare triple {69740#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {69740#false} is VALID [2022-04-08 12:38:47,925 INFO L290 TraceCheckUtils]: 108: Hoare triple {69740#false} assume !(#t~post8 < 20);havoc #t~post8; {69740#false} is VALID [2022-04-08 12:38:47,925 INFO L290 TraceCheckUtils]: 109: Hoare triple {69740#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {69740#false} is VALID [2022-04-08 12:38:47,925 INFO L290 TraceCheckUtils]: 110: Hoare triple {69740#false} assume !(#t~post6 < 20);havoc #t~post6; {69740#false} is VALID [2022-04-08 12:38:47,925 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-08 12:38:47,925 INFO L290 TraceCheckUtils]: 112: Hoare triple {69740#false} ~cond := #in~cond; {69740#false} is VALID [2022-04-08 12:38:47,925 INFO L290 TraceCheckUtils]: 113: Hoare triple {69740#false} assume 0 == ~cond; {69740#false} is VALID [2022-04-08 12:38:47,925 INFO L290 TraceCheckUtils]: 114: Hoare triple {69740#false} assume !false; {69740#false} is VALID [2022-04-08 12:38:47,926 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-08 12:38:47,926 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:38:48,469 INFO L290 TraceCheckUtils]: 114: Hoare triple {69740#false} assume !false; {69740#false} is VALID [2022-04-08 12:38:48,469 INFO L290 TraceCheckUtils]: 113: Hoare triple {69740#false} assume 0 == ~cond; {69740#false} is VALID [2022-04-08 12:38:48,469 INFO L290 TraceCheckUtils]: 112: Hoare triple {69740#false} ~cond := #in~cond; {69740#false} is VALID [2022-04-08 12:38:48,469 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-08 12:38:48,469 INFO L290 TraceCheckUtils]: 110: Hoare triple {69740#false} assume !(#t~post6 < 20);havoc #t~post6; {69740#false} is VALID [2022-04-08 12:38:48,469 INFO L290 TraceCheckUtils]: 109: Hoare triple {69740#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {69740#false} is VALID [2022-04-08 12:38:48,469 INFO L290 TraceCheckUtils]: 108: Hoare triple {69740#false} assume !(#t~post8 < 20);havoc #t~post8; {69740#false} is VALID [2022-04-08 12:38:48,469 INFO L290 TraceCheckUtils]: 107: Hoare triple {69740#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {69740#false} is VALID [2022-04-08 12:38:48,470 INFO L290 TraceCheckUtils]: 106: Hoare triple {70123#(< |main_#t~post7| 20)} assume !(#t~post7 < 20);havoc #t~post7; {69740#false} is VALID [2022-04-08 12:38:48,470 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-08 12:38:48,470 INFO L290 TraceCheckUtils]: 104: Hoare triple {70127#(< ~counter~0 20)} assume !!(0 != ~r~0); {70127#(< ~counter~0 20)} is VALID [2022-04-08 12:38:48,471 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {69739#true} {70127#(< ~counter~0 20)} #94#return; {70127#(< ~counter~0 20)} is VALID [2022-04-08 12:38:48,471 INFO L290 TraceCheckUtils]: 102: Hoare triple {69739#true} assume true; {69739#true} is VALID [2022-04-08 12:38:48,471 INFO L290 TraceCheckUtils]: 101: Hoare triple {69739#true} assume !(0 == ~cond); {69739#true} is VALID [2022-04-08 12:38:48,471 INFO L290 TraceCheckUtils]: 100: Hoare triple {69739#true} ~cond := #in~cond; {69739#true} is VALID [2022-04-08 12:38:48,471 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-08 12:38:48,471 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-08 12:38:48,473 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-08 12:38:48,473 INFO L290 TraceCheckUtils]: 96: Hoare triple {70152#(< ~counter~0 19)} assume !(~r~0 < 0); {70152#(< ~counter~0 19)} is VALID [2022-04-08 12:38:48,474 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {69739#true} {70152#(< ~counter~0 19)} #98#return; {70152#(< ~counter~0 19)} is VALID [2022-04-08 12:38:48,474 INFO L290 TraceCheckUtils]: 94: Hoare triple {69739#true} assume true; {69739#true} is VALID [2022-04-08 12:38:48,474 INFO L290 TraceCheckUtils]: 93: Hoare triple {69739#true} assume !(0 == ~cond); {69739#true} is VALID [2022-04-08 12:38:48,474 INFO L290 TraceCheckUtils]: 92: Hoare triple {69739#true} ~cond := #in~cond; {69739#true} is VALID [2022-04-08 12:38:48,474 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-08 12:38:48,474 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-08 12:38:48,475 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-08 12:38:48,475 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-08 12:38:48,476 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {69739#true} {70177#(< ~counter~0 18)} #98#return; {70177#(< ~counter~0 18)} is VALID [2022-04-08 12:38:48,476 INFO L290 TraceCheckUtils]: 86: Hoare triple {69739#true} assume true; {69739#true} is VALID [2022-04-08 12:38:48,476 INFO L290 TraceCheckUtils]: 85: Hoare triple {69739#true} assume !(0 == ~cond); {69739#true} is VALID [2022-04-08 12:38:48,476 INFO L290 TraceCheckUtils]: 84: Hoare triple {69739#true} ~cond := #in~cond; {69739#true} is VALID [2022-04-08 12:38:48,476 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-08 12:38:48,476 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-08 12:38:48,477 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-08 12:38:48,477 INFO L290 TraceCheckUtils]: 80: Hoare triple {70202#(< ~counter~0 17)} assume !(~r~0 > 0); {70202#(< ~counter~0 17)} is VALID [2022-04-08 12:38:48,478 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {69739#true} {70202#(< ~counter~0 17)} #96#return; {70202#(< ~counter~0 17)} is VALID [2022-04-08 12:38:48,478 INFO L290 TraceCheckUtils]: 78: Hoare triple {69739#true} assume true; {69739#true} is VALID [2022-04-08 12:38:48,478 INFO L290 TraceCheckUtils]: 77: Hoare triple {69739#true} assume !(0 == ~cond); {69739#true} is VALID [2022-04-08 12:38:48,478 INFO L290 TraceCheckUtils]: 76: Hoare triple {69739#true} ~cond := #in~cond; {69739#true} is VALID [2022-04-08 12:38:48,478 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-08 12:38:48,485 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-08 12:38:48,486 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-08 12:38:48,487 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-08 12:38:48,487 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {69739#true} {70227#(< ~counter~0 16)} #96#return; {70227#(< ~counter~0 16)} is VALID [2022-04-08 12:38:48,487 INFO L290 TraceCheckUtils]: 70: Hoare triple {69739#true} assume true; {69739#true} is VALID [2022-04-08 12:38:48,487 INFO L290 TraceCheckUtils]: 69: Hoare triple {69739#true} assume !(0 == ~cond); {69739#true} is VALID [2022-04-08 12:38:48,487 INFO L290 TraceCheckUtils]: 68: Hoare triple {69739#true} ~cond := #in~cond; {69739#true} is VALID [2022-04-08 12:38:48,487 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-08 12:38:48,488 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-08 12:38:48,488 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-08 12:38:48,489 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-08 12:38:48,489 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {69739#true} {70252#(< ~counter~0 15)} #96#return; {70252#(< ~counter~0 15)} is VALID [2022-04-08 12:38:48,489 INFO L290 TraceCheckUtils]: 62: Hoare triple {69739#true} assume true; {69739#true} is VALID [2022-04-08 12:38:48,489 INFO L290 TraceCheckUtils]: 61: Hoare triple {69739#true} assume !(0 == ~cond); {69739#true} is VALID [2022-04-08 12:38:48,489 INFO L290 TraceCheckUtils]: 60: Hoare triple {69739#true} ~cond := #in~cond; {69739#true} is VALID [2022-04-08 12:38:48,489 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-08 12:38:48,490 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-08 12:38:48,490 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-08 12:38:48,491 INFO L290 TraceCheckUtils]: 56: Hoare triple {70277#(< ~counter~0 14)} assume !!(0 != ~r~0); {70277#(< ~counter~0 14)} is VALID [2022-04-08 12:38:48,491 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {69739#true} {70277#(< ~counter~0 14)} #94#return; {70277#(< ~counter~0 14)} is VALID [2022-04-08 12:38:48,491 INFO L290 TraceCheckUtils]: 54: Hoare triple {69739#true} assume true; {69739#true} is VALID [2022-04-08 12:38:48,491 INFO L290 TraceCheckUtils]: 53: Hoare triple {69739#true} assume !(0 == ~cond); {69739#true} is VALID [2022-04-08 12:38:48,491 INFO L290 TraceCheckUtils]: 52: Hoare triple {69739#true} ~cond := #in~cond; {69739#true} is VALID [2022-04-08 12:38:48,491 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-08 12:38:48,492 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-08 12:38:48,492 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-08 12:38:48,493 INFO L290 TraceCheckUtils]: 48: Hoare triple {70302#(< ~counter~0 13)} assume !(~r~0 < 0); {70302#(< ~counter~0 13)} is VALID [2022-04-08 12:38:48,493 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {69739#true} {70302#(< ~counter~0 13)} #98#return; {70302#(< ~counter~0 13)} is VALID [2022-04-08 12:38:48,493 INFO L290 TraceCheckUtils]: 46: Hoare triple {69739#true} assume true; {69739#true} is VALID [2022-04-08 12:38:48,493 INFO L290 TraceCheckUtils]: 45: Hoare triple {69739#true} assume !(0 == ~cond); {69739#true} is VALID [2022-04-08 12:38:48,493 INFO L290 TraceCheckUtils]: 44: Hoare triple {69739#true} ~cond := #in~cond; {69739#true} is VALID [2022-04-08 12:38:48,493 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-08 12:38:48,494 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-08 12:38:48,494 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-08 12:38:48,495 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-08 12:38:48,495 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {69739#true} {70046#(<= ~counter~0 11)} #98#return; {70046#(<= ~counter~0 11)} is VALID [2022-04-08 12:38:48,495 INFO L290 TraceCheckUtils]: 38: Hoare triple {69739#true} assume true; {69739#true} is VALID [2022-04-08 12:38:48,495 INFO L290 TraceCheckUtils]: 37: Hoare triple {69739#true} assume !(0 == ~cond); {69739#true} is VALID [2022-04-08 12:38:48,495 INFO L290 TraceCheckUtils]: 36: Hoare triple {69739#true} ~cond := #in~cond; {69739#true} is VALID [2022-04-08 12:38:48,495 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-08 12:38:48,496 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-08 12:38:48,496 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-08 12:38:48,497 INFO L290 TraceCheckUtils]: 32: Hoare triple {70021#(<= ~counter~0 10)} assume !(~r~0 > 0); {70021#(<= ~counter~0 10)} is VALID [2022-04-08 12:38:48,497 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {69739#true} {70021#(<= ~counter~0 10)} #96#return; {70021#(<= ~counter~0 10)} is VALID [2022-04-08 12:38:48,497 INFO L290 TraceCheckUtils]: 30: Hoare triple {69739#true} assume true; {69739#true} is VALID [2022-04-08 12:38:48,497 INFO L290 TraceCheckUtils]: 29: Hoare triple {69739#true} assume !(0 == ~cond); {69739#true} is VALID [2022-04-08 12:38:48,497 INFO L290 TraceCheckUtils]: 28: Hoare triple {69739#true} ~cond := #in~cond; {69739#true} is VALID [2022-04-08 12:38:48,497 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-08 12:38:48,498 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-08 12:38:48,498 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-08 12:38:48,499 INFO L290 TraceCheckUtils]: 24: Hoare triple {69996#(<= ~counter~0 9)} assume !!(0 != ~r~0); {69996#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:48,499 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {69739#true} {69996#(<= ~counter~0 9)} #94#return; {69996#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:48,499 INFO L290 TraceCheckUtils]: 22: Hoare triple {69739#true} assume true; {69739#true} is VALID [2022-04-08 12:38:48,499 INFO L290 TraceCheckUtils]: 21: Hoare triple {69739#true} assume !(0 == ~cond); {69739#true} is VALID [2022-04-08 12:38:48,499 INFO L290 TraceCheckUtils]: 20: Hoare triple {69739#true} ~cond := #in~cond; {69739#true} is VALID [2022-04-08 12:38:48,499 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-08 12:38:48,500 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-08 12:38:48,500 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-08 12:38:48,501 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-08 12:38:48,501 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {69739#true} {69971#(<= ~counter~0 8)} #92#return; {69971#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:48,501 INFO L290 TraceCheckUtils]: 14: Hoare triple {69739#true} assume true; {69739#true} is VALID [2022-04-08 12:38:48,501 INFO L290 TraceCheckUtils]: 13: Hoare triple {69739#true} assume !(0 == ~cond); {69739#true} is VALID [2022-04-08 12:38:48,501 INFO L290 TraceCheckUtils]: 12: Hoare triple {69739#true} ~cond := #in~cond; {69739#true} is VALID [2022-04-08 12:38:48,501 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-08 12:38:48,502 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {69739#true} {69971#(<= ~counter~0 8)} #90#return; {69971#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:48,502 INFO L290 TraceCheckUtils]: 9: Hoare triple {69739#true} assume true; {69739#true} is VALID [2022-04-08 12:38:48,502 INFO L290 TraceCheckUtils]: 8: Hoare triple {69739#true} assume !(0 == ~cond); {69739#true} is VALID [2022-04-08 12:38:48,502 INFO L290 TraceCheckUtils]: 7: Hoare triple {69739#true} ~cond := #in~cond; {69739#true} is VALID [2022-04-08 12:38:48,502 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-08 12:38:48,502 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-08 12:38:48,502 INFO L272 TraceCheckUtils]: 4: Hoare triple {69971#(<= ~counter~0 8)} call #t~ret9 := main(); {69971#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:48,503 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {69971#(<= ~counter~0 8)} {69739#true} #102#return; {69971#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:48,503 INFO L290 TraceCheckUtils]: 2: Hoare triple {69971#(<= ~counter~0 8)} assume true; {69971#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:48,503 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-08 12:38:48,503 INFO L272 TraceCheckUtils]: 0: Hoare triple {69739#true} call ULTIMATE.init(); {69739#true} is VALID [2022-04-08 12:38:48,504 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-08 12:38:48,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:38:48,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609045453] [2022-04-08 12:38:48,504 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:38:48,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [979988034] [2022-04-08 12:38:48,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [979988034] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:38:48,504 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:38:48,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 24 [2022-04-08 12:38:48,504 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:38:48,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [539350637] [2022-04-08 12:38:48,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [539350637] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:38:48,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:38:48,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 12:38:48,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305737391] [2022-04-08 12:38:48,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:38:48,505 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-08 12:38:48,505 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:38:48,505 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-08 12:38:48,585 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-08 12:38:48,586 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 12:38:48,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:38:48,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 12:38:48,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-08 12:38:48,586 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-08 12:38:51,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:38:51,089 INFO L93 Difference]: Finished difference Result 791 states and 1114 transitions. [2022-04-08 12:38:51,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-08 12:38:51,089 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-08 12:38:51,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:38:51,089 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-08 12:38:51,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 256 transitions. [2022-04-08 12:38:51,091 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-08 12:38:51,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 256 transitions. [2022-04-08 12:38:51,093 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 256 transitions. [2022-04-08 12:38:51,302 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-08 12:38:51,319 INFO L225 Difference]: With dead ends: 791 [2022-04-08 12:38:51,319 INFO L226 Difference]: Without dead ends: 594 [2022-04-08 12:38:51,320 INFO L912 BasicCegarLoop]: 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-08 12:38:51,320 INFO L913 BasicCegarLoop]: 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-08 12:38:51,320 INFO L914 BasicCegarLoop]: 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-08 12:38:51,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2022-04-08 12:38:52,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 594. [2022-04-08 12:38:52,933 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:38:52,934 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-08 12:38:52,935 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-08 12:38:52,935 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-08 12:38:52,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:38:52,953 INFO L93 Difference]: Finished difference Result 594 states and 806 transitions. [2022-04-08 12:38:52,953 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 806 transitions. [2022-04-08 12:38:52,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:38:52,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:38:52,954 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-08 12:38:52,955 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-08 12:38:52,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:38:52,970 INFO L93 Difference]: Finished difference Result 594 states and 806 transitions. [2022-04-08 12:38:52,970 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 806 transitions. [2022-04-08 12:38:52,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:38:52,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:38:52,972 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:38:52,972 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:38:52,972 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-08 12:38:52,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 806 transitions. [2022-04-08 12:38:52,995 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 806 transitions. Word has length 115 [2022-04-08 12:38:52,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:38:52,996 INFO L478 AbstractCegarLoop]: Abstraction has 594 states and 806 transitions. [2022-04-08 12:38:52,996 INFO L479 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-08 12:38:52,996 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 594 states and 806 transitions. [2022-04-08 12:38:55,605 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-08 12:38:55,605 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 806 transitions. [2022-04-08 12:38:55,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-04-08 12:38:55,606 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:38:55,606 INFO L499 BasicCegarLoop]: 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-08 12:38:55,612 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-08 12:38:55,810 WARN L460 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-08 12:38:55,810 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:38:55,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:38:55,810 INFO L85 PathProgramCache]: Analyzing trace with hash 650985841, now seen corresponding path program 7 times [2022-04-08 12:38:55,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:38:55,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1102492556] [2022-04-08 12:38:55,811 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:38:55,811 INFO L85 PathProgramCache]: Analyzing trace with hash 650985841, now seen corresponding path program 8 times [2022-04-08 12:38:55,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:38:55,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619714889] [2022-04-08 12:38:55,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:38:55,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:38:55,822 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:38:55,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1146750054] [2022-04-08 12:38:55,822 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:38:55,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:38:55,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:38:55,823 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-08 12:38:55,824 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-08 12:38:55,876 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:38:55,877 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:38:55,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-08 12:38:55,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:38:55,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:38:56,454 INFO L272 TraceCheckUtils]: 0: Hoare triple {74430#true} call ULTIMATE.init(); {74430#true} is VALID [2022-04-08 12:38:56,455 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-08 12:38:56,455 INFO L290 TraceCheckUtils]: 2: Hoare triple {74438#(<= ~counter~0 0)} assume true; {74438#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:56,455 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {74438#(<= ~counter~0 0)} {74430#true} #102#return; {74438#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:56,456 INFO L272 TraceCheckUtils]: 4: Hoare triple {74438#(<= ~counter~0 0)} call #t~ret9 := main(); {74438#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:56,456 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-08 12:38:56,456 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-08 12:38:56,457 INFO L290 TraceCheckUtils]: 7: Hoare triple {74438#(<= ~counter~0 0)} ~cond := #in~cond; {74438#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:56,457 INFO L290 TraceCheckUtils]: 8: Hoare triple {74438#(<= ~counter~0 0)} assume !(0 == ~cond); {74438#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:56,457 INFO L290 TraceCheckUtils]: 9: Hoare triple {74438#(<= ~counter~0 0)} assume true; {74438#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:56,457 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {74438#(<= ~counter~0 0)} {74438#(<= ~counter~0 0)} #90#return; {74438#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:56,458 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-08 12:38:56,458 INFO L290 TraceCheckUtils]: 12: Hoare triple {74438#(<= ~counter~0 0)} ~cond := #in~cond; {74438#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:56,458 INFO L290 TraceCheckUtils]: 13: Hoare triple {74438#(<= ~counter~0 0)} assume !(0 == ~cond); {74438#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:56,459 INFO L290 TraceCheckUtils]: 14: Hoare triple {74438#(<= ~counter~0 0)} assume true; {74438#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:56,459 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {74438#(<= ~counter~0 0)} {74438#(<= ~counter~0 0)} #92#return; {74438#(<= ~counter~0 0)} is VALID [2022-04-08 12:38:56,459 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-08 12:38:56,461 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-08 12:38:56,461 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-08 12:38:56,462 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-08 12:38:56,462 INFO L290 TraceCheckUtils]: 20: Hoare triple {74487#(<= ~counter~0 1)} ~cond := #in~cond; {74487#(<= ~counter~0 1)} is VALID [2022-04-08 12:38:56,462 INFO L290 TraceCheckUtils]: 21: Hoare triple {74487#(<= ~counter~0 1)} assume !(0 == ~cond); {74487#(<= ~counter~0 1)} is VALID [2022-04-08 12:38:56,462 INFO L290 TraceCheckUtils]: 22: Hoare triple {74487#(<= ~counter~0 1)} assume true; {74487#(<= ~counter~0 1)} is VALID [2022-04-08 12:38:56,463 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {74487#(<= ~counter~0 1)} {74487#(<= ~counter~0 1)} #94#return; {74487#(<= ~counter~0 1)} is VALID [2022-04-08 12:38:56,463 INFO L290 TraceCheckUtils]: 24: Hoare triple {74487#(<= ~counter~0 1)} assume !!(0 != ~r~0); {74487#(<= ~counter~0 1)} is VALID [2022-04-08 12:38:56,464 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-08 12:38:56,464 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-08 12:38:56,465 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-08 12:38:56,465 INFO L290 TraceCheckUtils]: 28: Hoare triple {74512#(<= ~counter~0 2)} ~cond := #in~cond; {74512#(<= ~counter~0 2)} is VALID [2022-04-08 12:38:56,465 INFO L290 TraceCheckUtils]: 29: Hoare triple {74512#(<= ~counter~0 2)} assume !(0 == ~cond); {74512#(<= ~counter~0 2)} is VALID [2022-04-08 12:38:56,465 INFO L290 TraceCheckUtils]: 30: Hoare triple {74512#(<= ~counter~0 2)} assume true; {74512#(<= ~counter~0 2)} is VALID [2022-04-08 12:38:56,466 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {74512#(<= ~counter~0 2)} {74512#(<= ~counter~0 2)} #96#return; {74512#(<= ~counter~0 2)} is VALID [2022-04-08 12:38:56,466 INFO L290 TraceCheckUtils]: 32: Hoare triple {74512#(<= ~counter~0 2)} assume !(~r~0 > 0); {74512#(<= ~counter~0 2)} is VALID [2022-04-08 12:38:56,467 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-08 12:38:56,467 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-08 12:38:56,468 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-08 12:38:56,468 INFO L290 TraceCheckUtils]: 36: Hoare triple {74537#(<= ~counter~0 3)} ~cond := #in~cond; {74537#(<= ~counter~0 3)} is VALID [2022-04-08 12:38:56,468 INFO L290 TraceCheckUtils]: 37: Hoare triple {74537#(<= ~counter~0 3)} assume !(0 == ~cond); {74537#(<= ~counter~0 3)} is VALID [2022-04-08 12:38:56,468 INFO L290 TraceCheckUtils]: 38: Hoare triple {74537#(<= ~counter~0 3)} assume true; {74537#(<= ~counter~0 3)} is VALID [2022-04-08 12:38:56,469 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {74537#(<= ~counter~0 3)} {74537#(<= ~counter~0 3)} #98#return; {74537#(<= ~counter~0 3)} is VALID [2022-04-08 12:38:56,469 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-08 12:38:56,470 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-08 12:38:56,470 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-08 12:38:56,471 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-08 12:38:56,471 INFO L290 TraceCheckUtils]: 44: Hoare triple {74562#(<= ~counter~0 4)} ~cond := #in~cond; {74562#(<= ~counter~0 4)} is VALID [2022-04-08 12:38:56,471 INFO L290 TraceCheckUtils]: 45: Hoare triple {74562#(<= ~counter~0 4)} assume !(0 == ~cond); {74562#(<= ~counter~0 4)} is VALID [2022-04-08 12:38:56,471 INFO L290 TraceCheckUtils]: 46: Hoare triple {74562#(<= ~counter~0 4)} assume true; {74562#(<= ~counter~0 4)} is VALID [2022-04-08 12:38:56,472 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {74562#(<= ~counter~0 4)} {74562#(<= ~counter~0 4)} #98#return; {74562#(<= ~counter~0 4)} is VALID [2022-04-08 12:38:56,472 INFO L290 TraceCheckUtils]: 48: Hoare triple {74562#(<= ~counter~0 4)} assume !(~r~0 < 0); {74562#(<= ~counter~0 4)} is VALID [2022-04-08 12:38:56,473 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-08 12:38:56,473 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-08 12:38:56,474 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-08 12:38:56,474 INFO L290 TraceCheckUtils]: 52: Hoare triple {74587#(<= ~counter~0 5)} ~cond := #in~cond; {74587#(<= ~counter~0 5)} is VALID [2022-04-08 12:38:56,474 INFO L290 TraceCheckUtils]: 53: Hoare triple {74587#(<= ~counter~0 5)} assume !(0 == ~cond); {74587#(<= ~counter~0 5)} is VALID [2022-04-08 12:38:56,474 INFO L290 TraceCheckUtils]: 54: Hoare triple {74587#(<= ~counter~0 5)} assume true; {74587#(<= ~counter~0 5)} is VALID [2022-04-08 12:38:56,475 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {74587#(<= ~counter~0 5)} {74587#(<= ~counter~0 5)} #94#return; {74587#(<= ~counter~0 5)} is VALID [2022-04-08 12:38:56,475 INFO L290 TraceCheckUtils]: 56: Hoare triple {74587#(<= ~counter~0 5)} assume !!(0 != ~r~0); {74587#(<= ~counter~0 5)} is VALID [2022-04-08 12:38:56,476 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-08 12:38:56,476 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-08 12:38:56,477 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-08 12:38:56,477 INFO L290 TraceCheckUtils]: 60: Hoare triple {74612#(<= ~counter~0 6)} ~cond := #in~cond; {74612#(<= ~counter~0 6)} is VALID [2022-04-08 12:38:56,477 INFO L290 TraceCheckUtils]: 61: Hoare triple {74612#(<= ~counter~0 6)} assume !(0 == ~cond); {74612#(<= ~counter~0 6)} is VALID [2022-04-08 12:38:56,477 INFO L290 TraceCheckUtils]: 62: Hoare triple {74612#(<= ~counter~0 6)} assume true; {74612#(<= ~counter~0 6)} is VALID [2022-04-08 12:38:56,478 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {74612#(<= ~counter~0 6)} {74612#(<= ~counter~0 6)} #96#return; {74612#(<= ~counter~0 6)} is VALID [2022-04-08 12:38:56,478 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-08 12:38:56,479 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-08 12:38:56,479 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-08 12:38:56,480 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-08 12:38:56,483 INFO L290 TraceCheckUtils]: 68: Hoare triple {74637#(<= ~counter~0 7)} ~cond := #in~cond; {74637#(<= ~counter~0 7)} is VALID [2022-04-08 12:38:56,483 INFO L290 TraceCheckUtils]: 69: Hoare triple {74637#(<= ~counter~0 7)} assume !(0 == ~cond); {74637#(<= ~counter~0 7)} is VALID [2022-04-08 12:38:56,484 INFO L290 TraceCheckUtils]: 70: Hoare triple {74637#(<= ~counter~0 7)} assume true; {74637#(<= ~counter~0 7)} is VALID [2022-04-08 12:38:56,484 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {74637#(<= ~counter~0 7)} {74637#(<= ~counter~0 7)} #96#return; {74637#(<= ~counter~0 7)} is VALID [2022-04-08 12:38:56,485 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-08 12:38:56,486 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-08 12:38:56,486 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-08 12:38:56,486 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-08 12:38:56,487 INFO L290 TraceCheckUtils]: 76: Hoare triple {74662#(<= ~counter~0 8)} ~cond := #in~cond; {74662#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:56,487 INFO L290 TraceCheckUtils]: 77: Hoare triple {74662#(<= ~counter~0 8)} assume !(0 == ~cond); {74662#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:56,487 INFO L290 TraceCheckUtils]: 78: Hoare triple {74662#(<= ~counter~0 8)} assume true; {74662#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:56,488 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {74662#(<= ~counter~0 8)} {74662#(<= ~counter~0 8)} #96#return; {74662#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:56,488 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-08 12:38:56,489 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-08 12:38:56,490 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-08 12:38:56,490 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-08 12:38:56,490 INFO L290 TraceCheckUtils]: 84: Hoare triple {74687#(<= ~counter~0 9)} ~cond := #in~cond; {74687#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:56,491 INFO L290 TraceCheckUtils]: 85: Hoare triple {74687#(<= ~counter~0 9)} assume !(0 == ~cond); {74687#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:56,491 INFO L290 TraceCheckUtils]: 86: Hoare triple {74687#(<= ~counter~0 9)} assume true; {74687#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:56,492 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {74687#(<= ~counter~0 9)} {74687#(<= ~counter~0 9)} #96#return; {74687#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:56,492 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-08 12:38:56,493 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-08 12:38:56,493 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-08 12:38:56,494 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-08 12:38:56,494 INFO L290 TraceCheckUtils]: 92: Hoare triple {74712#(<= ~counter~0 10)} ~cond := #in~cond; {74712#(<= ~counter~0 10)} is VALID [2022-04-08 12:38:56,494 INFO L290 TraceCheckUtils]: 93: Hoare triple {74712#(<= ~counter~0 10)} assume !(0 == ~cond); {74712#(<= ~counter~0 10)} is VALID [2022-04-08 12:38:56,495 INFO L290 TraceCheckUtils]: 94: Hoare triple {74712#(<= ~counter~0 10)} assume true; {74712#(<= ~counter~0 10)} is VALID [2022-04-08 12:38:56,495 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {74712#(<= ~counter~0 10)} {74712#(<= ~counter~0 10)} #96#return; {74712#(<= ~counter~0 10)} is VALID [2022-04-08 12:38:56,495 INFO L290 TraceCheckUtils]: 96: Hoare triple {74712#(<= ~counter~0 10)} assume !(~r~0 > 0); {74712#(<= ~counter~0 10)} is VALID [2022-04-08 12:38:56,496 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-08 12:38:56,496 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-08 12:38:56,497 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-08 12:38:56,497 INFO L290 TraceCheckUtils]: 100: Hoare triple {74737#(<= ~counter~0 11)} ~cond := #in~cond; {74737#(<= ~counter~0 11)} is VALID [2022-04-08 12:38:56,497 INFO L290 TraceCheckUtils]: 101: Hoare triple {74737#(<= ~counter~0 11)} assume !(0 == ~cond); {74737#(<= ~counter~0 11)} is VALID [2022-04-08 12:38:56,498 INFO L290 TraceCheckUtils]: 102: Hoare triple {74737#(<= ~counter~0 11)} assume true; {74737#(<= ~counter~0 11)} is VALID [2022-04-08 12:38:56,498 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {74737#(<= ~counter~0 11)} {74737#(<= ~counter~0 11)} #98#return; {74737#(<= ~counter~0 11)} is VALID [2022-04-08 12:38:56,498 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-08 12:38:56,499 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-08 12:38:56,499 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-08 12:38:56,500 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-08 12:38:56,500 INFO L290 TraceCheckUtils]: 108: Hoare triple {74762#(<= ~counter~0 12)} ~cond := #in~cond; {74762#(<= ~counter~0 12)} is VALID [2022-04-08 12:38:56,500 INFO L290 TraceCheckUtils]: 109: Hoare triple {74762#(<= ~counter~0 12)} assume !(0 == ~cond); {74762#(<= ~counter~0 12)} is VALID [2022-04-08 12:38:56,501 INFO L290 TraceCheckUtils]: 110: Hoare triple {74762#(<= ~counter~0 12)} assume true; {74762#(<= ~counter~0 12)} is VALID [2022-04-08 12:38:56,501 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {74762#(<= ~counter~0 12)} {74762#(<= ~counter~0 12)} #98#return; {74762#(<= ~counter~0 12)} is VALID [2022-04-08 12:38:56,501 INFO L290 TraceCheckUtils]: 112: Hoare triple {74762#(<= ~counter~0 12)} assume !(~r~0 < 0); {74762#(<= ~counter~0 12)} is VALID [2022-04-08 12:38:56,502 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-08 12:38:56,502 INFO L290 TraceCheckUtils]: 114: Hoare triple {74787#(<= |main_#t~post6| 12)} assume !(#t~post6 < 20);havoc #t~post6; {74431#false} is VALID [2022-04-08 12:38:56,502 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-08 12:38:56,502 INFO L290 TraceCheckUtils]: 116: Hoare triple {74431#false} ~cond := #in~cond; {74431#false} is VALID [2022-04-08 12:38:56,502 INFO L290 TraceCheckUtils]: 117: Hoare triple {74431#false} assume 0 == ~cond; {74431#false} is VALID [2022-04-08 12:38:56,502 INFO L290 TraceCheckUtils]: 118: Hoare triple {74431#false} assume !false; {74431#false} is VALID [2022-04-08 12:38:56,503 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-08 12:38:56,503 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:38:57,108 INFO L290 TraceCheckUtils]: 118: Hoare triple {74431#false} assume !false; {74431#false} is VALID [2022-04-08 12:38:57,108 INFO L290 TraceCheckUtils]: 117: Hoare triple {74431#false} assume 0 == ~cond; {74431#false} is VALID [2022-04-08 12:38:57,108 INFO L290 TraceCheckUtils]: 116: Hoare triple {74431#false} ~cond := #in~cond; {74431#false} is VALID [2022-04-08 12:38:57,108 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-08 12:38:57,108 INFO L290 TraceCheckUtils]: 114: Hoare triple {74815#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {74431#false} is VALID [2022-04-08 12:38:57,109 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-08 12:38:57,109 INFO L290 TraceCheckUtils]: 112: Hoare triple {74819#(< ~counter~0 20)} assume !(~r~0 < 0); {74819#(< ~counter~0 20)} is VALID [2022-04-08 12:38:57,109 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {74430#true} {74819#(< ~counter~0 20)} #98#return; {74819#(< ~counter~0 20)} is VALID [2022-04-08 12:38:57,110 INFO L290 TraceCheckUtils]: 110: Hoare triple {74430#true} assume true; {74430#true} is VALID [2022-04-08 12:38:57,110 INFO L290 TraceCheckUtils]: 109: Hoare triple {74430#true} assume !(0 == ~cond); {74430#true} is VALID [2022-04-08 12:38:57,110 INFO L290 TraceCheckUtils]: 108: Hoare triple {74430#true} ~cond := #in~cond; {74430#true} is VALID [2022-04-08 12:38:57,110 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-08 12:38:57,110 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-08 12:38:57,112 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-08 12:38:57,112 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-08 12:38:57,113 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {74430#true} {74844#(< ~counter~0 19)} #98#return; {74844#(< ~counter~0 19)} is VALID [2022-04-08 12:38:57,113 INFO L290 TraceCheckUtils]: 102: Hoare triple {74430#true} assume true; {74430#true} is VALID [2022-04-08 12:38:57,113 INFO L290 TraceCheckUtils]: 101: Hoare triple {74430#true} assume !(0 == ~cond); {74430#true} is VALID [2022-04-08 12:38:57,113 INFO L290 TraceCheckUtils]: 100: Hoare triple {74430#true} ~cond := #in~cond; {74430#true} is VALID [2022-04-08 12:38:57,113 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-08 12:38:57,113 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-08 12:38:57,114 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-08 12:38:57,114 INFO L290 TraceCheckUtils]: 96: Hoare triple {74869#(< ~counter~0 18)} assume !(~r~0 > 0); {74869#(< ~counter~0 18)} is VALID [2022-04-08 12:38:57,115 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {74430#true} {74869#(< ~counter~0 18)} #96#return; {74869#(< ~counter~0 18)} is VALID [2022-04-08 12:38:57,115 INFO L290 TraceCheckUtils]: 94: Hoare triple {74430#true} assume true; {74430#true} is VALID [2022-04-08 12:38:57,115 INFO L290 TraceCheckUtils]: 93: Hoare triple {74430#true} assume !(0 == ~cond); {74430#true} is VALID [2022-04-08 12:38:57,115 INFO L290 TraceCheckUtils]: 92: Hoare triple {74430#true} ~cond := #in~cond; {74430#true} is VALID [2022-04-08 12:38:57,115 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-08 12:38:57,115 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-08 12:38:57,116 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-08 12:38:57,116 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-08 12:38:57,117 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {74430#true} {74894#(< ~counter~0 17)} #96#return; {74894#(< ~counter~0 17)} is VALID [2022-04-08 12:38:57,117 INFO L290 TraceCheckUtils]: 86: Hoare triple {74430#true} assume true; {74430#true} is VALID [2022-04-08 12:38:57,117 INFO L290 TraceCheckUtils]: 85: Hoare triple {74430#true} assume !(0 == ~cond); {74430#true} is VALID [2022-04-08 12:38:57,117 INFO L290 TraceCheckUtils]: 84: Hoare triple {74430#true} ~cond := #in~cond; {74430#true} is VALID [2022-04-08 12:38:57,117 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-08 12:38:57,118 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-08 12:38:57,118 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-08 12:38:57,119 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-08 12:38:57,119 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {74430#true} {74919#(< ~counter~0 16)} #96#return; {74919#(< ~counter~0 16)} is VALID [2022-04-08 12:38:57,119 INFO L290 TraceCheckUtils]: 78: Hoare triple {74430#true} assume true; {74430#true} is VALID [2022-04-08 12:38:57,119 INFO L290 TraceCheckUtils]: 77: Hoare triple {74430#true} assume !(0 == ~cond); {74430#true} is VALID [2022-04-08 12:38:57,119 INFO L290 TraceCheckUtils]: 76: Hoare triple {74430#true} ~cond := #in~cond; {74430#true} is VALID [2022-04-08 12:38:57,120 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-08 12:38:57,120 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-08 12:38:57,121 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-08 12:38:57,121 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-08 12:38:57,121 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {74430#true} {74944#(< ~counter~0 15)} #96#return; {74944#(< ~counter~0 15)} is VALID [2022-04-08 12:38:57,122 INFO L290 TraceCheckUtils]: 70: Hoare triple {74430#true} assume true; {74430#true} is VALID [2022-04-08 12:38:57,122 INFO L290 TraceCheckUtils]: 69: Hoare triple {74430#true} assume !(0 == ~cond); {74430#true} is VALID [2022-04-08 12:38:57,122 INFO L290 TraceCheckUtils]: 68: Hoare triple {74430#true} ~cond := #in~cond; {74430#true} is VALID [2022-04-08 12:38:57,122 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-08 12:38:57,122 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-08 12:38:57,123 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-08 12:38:57,123 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-08 12:38:57,124 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {74430#true} {74969#(< ~counter~0 14)} #96#return; {74969#(< ~counter~0 14)} is VALID [2022-04-08 12:38:57,124 INFO L290 TraceCheckUtils]: 62: Hoare triple {74430#true} assume true; {74430#true} is VALID [2022-04-08 12:38:57,124 INFO L290 TraceCheckUtils]: 61: Hoare triple {74430#true} assume !(0 == ~cond); {74430#true} is VALID [2022-04-08 12:38:57,124 INFO L290 TraceCheckUtils]: 60: Hoare triple {74430#true} ~cond := #in~cond; {74430#true} is VALID [2022-04-08 12:38:57,124 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-08 12:38:57,124 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-08 12:38:57,125 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-08 12:38:57,125 INFO L290 TraceCheckUtils]: 56: Hoare triple {74762#(<= ~counter~0 12)} assume !!(0 != ~r~0); {74762#(<= ~counter~0 12)} is VALID [2022-04-08 12:38:57,126 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {74430#true} {74762#(<= ~counter~0 12)} #94#return; {74762#(<= ~counter~0 12)} is VALID [2022-04-08 12:38:57,126 INFO L290 TraceCheckUtils]: 54: Hoare triple {74430#true} assume true; {74430#true} is VALID [2022-04-08 12:38:57,126 INFO L290 TraceCheckUtils]: 53: Hoare triple {74430#true} assume !(0 == ~cond); {74430#true} is VALID [2022-04-08 12:38:57,126 INFO L290 TraceCheckUtils]: 52: Hoare triple {74430#true} ~cond := #in~cond; {74430#true} is VALID [2022-04-08 12:38:57,126 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-08 12:38:57,127 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-08 12:38:57,127 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-08 12:38:57,128 INFO L290 TraceCheckUtils]: 48: Hoare triple {74737#(<= ~counter~0 11)} assume !(~r~0 < 0); {74737#(<= ~counter~0 11)} is VALID [2022-04-08 12:38:57,128 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {74430#true} {74737#(<= ~counter~0 11)} #98#return; {74737#(<= ~counter~0 11)} is VALID [2022-04-08 12:38:57,128 INFO L290 TraceCheckUtils]: 46: Hoare triple {74430#true} assume true; {74430#true} is VALID [2022-04-08 12:38:57,129 INFO L290 TraceCheckUtils]: 45: Hoare triple {74430#true} assume !(0 == ~cond); {74430#true} is VALID [2022-04-08 12:38:57,129 INFO L290 TraceCheckUtils]: 44: Hoare triple {74430#true} ~cond := #in~cond; {74430#true} is VALID [2022-04-08 12:38:57,129 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-08 12:38:57,129 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-08 12:38:57,130 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-08 12:38:57,130 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-08 12:38:57,131 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {74430#true} {74712#(<= ~counter~0 10)} #98#return; {74712#(<= ~counter~0 10)} is VALID [2022-04-08 12:38:57,131 INFO L290 TraceCheckUtils]: 38: Hoare triple {74430#true} assume true; {74430#true} is VALID [2022-04-08 12:38:57,131 INFO L290 TraceCheckUtils]: 37: Hoare triple {74430#true} assume !(0 == ~cond); {74430#true} is VALID [2022-04-08 12:38:57,131 INFO L290 TraceCheckUtils]: 36: Hoare triple {74430#true} ~cond := #in~cond; {74430#true} is VALID [2022-04-08 12:38:57,131 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-08 12:38:57,131 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-08 12:38:57,132 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-08 12:38:57,133 INFO L290 TraceCheckUtils]: 32: Hoare triple {74687#(<= ~counter~0 9)} assume !(~r~0 > 0); {74687#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:57,133 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {74430#true} {74687#(<= ~counter~0 9)} #96#return; {74687#(<= ~counter~0 9)} is VALID [2022-04-08 12:38:57,133 INFO L290 TraceCheckUtils]: 30: Hoare triple {74430#true} assume true; {74430#true} is VALID [2022-04-08 12:38:57,133 INFO L290 TraceCheckUtils]: 29: Hoare triple {74430#true} assume !(0 == ~cond); {74430#true} is VALID [2022-04-08 12:38:57,134 INFO L290 TraceCheckUtils]: 28: Hoare triple {74430#true} ~cond := #in~cond; {74430#true} is VALID [2022-04-08 12:38:57,134 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-08 12:38:57,134 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-08 12:38:57,135 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-08 12:38:57,135 INFO L290 TraceCheckUtils]: 24: Hoare triple {74662#(<= ~counter~0 8)} assume !!(0 != ~r~0); {74662#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:57,136 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {74430#true} {74662#(<= ~counter~0 8)} #94#return; {74662#(<= ~counter~0 8)} is VALID [2022-04-08 12:38:57,136 INFO L290 TraceCheckUtils]: 22: Hoare triple {74430#true} assume true; {74430#true} is VALID [2022-04-08 12:38:57,136 INFO L290 TraceCheckUtils]: 21: Hoare triple {74430#true} assume !(0 == ~cond); {74430#true} is VALID [2022-04-08 12:38:57,136 INFO L290 TraceCheckUtils]: 20: Hoare triple {74430#true} ~cond := #in~cond; {74430#true} is VALID [2022-04-08 12:38:57,136 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-08 12:38:57,136 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-08 12:38:57,137 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-08 12:38:57,138 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-08 12:38:57,138 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {74430#true} {74637#(<= ~counter~0 7)} #92#return; {74637#(<= ~counter~0 7)} is VALID [2022-04-08 12:38:57,138 INFO L290 TraceCheckUtils]: 14: Hoare triple {74430#true} assume true; {74430#true} is VALID [2022-04-08 12:38:57,138 INFO L290 TraceCheckUtils]: 13: Hoare triple {74430#true} assume !(0 == ~cond); {74430#true} is VALID [2022-04-08 12:38:57,138 INFO L290 TraceCheckUtils]: 12: Hoare triple {74430#true} ~cond := #in~cond; {74430#true} is VALID [2022-04-08 12:38:57,139 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-08 12:38:57,139 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {74430#true} {74637#(<= ~counter~0 7)} #90#return; {74637#(<= ~counter~0 7)} is VALID [2022-04-08 12:38:57,139 INFO L290 TraceCheckUtils]: 9: Hoare triple {74430#true} assume true; {74430#true} is VALID [2022-04-08 12:38:57,139 INFO L290 TraceCheckUtils]: 8: Hoare triple {74430#true} assume !(0 == ~cond); {74430#true} is VALID [2022-04-08 12:38:57,139 INFO L290 TraceCheckUtils]: 7: Hoare triple {74430#true} ~cond := #in~cond; {74430#true} is VALID [2022-04-08 12:38:57,139 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-08 12:38:57,140 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-08 12:38:57,140 INFO L272 TraceCheckUtils]: 4: Hoare triple {74637#(<= ~counter~0 7)} call #t~ret9 := main(); {74637#(<= ~counter~0 7)} is VALID [2022-04-08 12:38:57,140 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {74637#(<= ~counter~0 7)} {74430#true} #102#return; {74637#(<= ~counter~0 7)} is VALID [2022-04-08 12:38:57,141 INFO L290 TraceCheckUtils]: 2: Hoare triple {74637#(<= ~counter~0 7)} assume true; {74637#(<= ~counter~0 7)} is VALID [2022-04-08 12:38:57,141 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-08 12:38:57,141 INFO L272 TraceCheckUtils]: 0: Hoare triple {74430#true} call ULTIMATE.init(); {74430#true} is VALID [2022-04-08 12:38:57,142 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-08 12:38:57,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:38:57,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619714889] [2022-04-08 12:38:57,142 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:38:57,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146750054] [2022-04-08 12:38:57,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1146750054] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:38:57,142 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:38:57,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 24 [2022-04-08 12:38:57,143 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:38:57,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1102492556] [2022-04-08 12:38:57,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1102492556] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:38:57,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:38:57,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 12:38:57,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194986934] [2022-04-08 12:38:57,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:38:57,144 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-08 12:38:57,144 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:38:57,144 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-08 12:38:57,264 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-08 12:38:57,264 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 12:38:57,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:38:57,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 12:38:57,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-08 12:38:57,265 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-08 12:39:00,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:39:00,056 INFO L93 Difference]: Finished difference Result 649 states and 883 transitions. [2022-04-08 12:39:00,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-08 12:39:00,056 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-08 12:39:00,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:39:00,056 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-08 12:39:00,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 254 transitions. [2022-04-08 12:39:00,058 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-08 12:39:00,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 254 transitions. [2022-04-08 12:39:00,060 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 254 transitions. [2022-04-08 12:39:00,275 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-08 12:39:00,291 INFO L225 Difference]: With dead ends: 649 [2022-04-08 12:39:00,291 INFO L226 Difference]: Without dead ends: 638 [2022-04-08 12:39:00,291 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 214 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=419, Invalid=637, Unknown=0, NotChecked=0, Total=1056 [2022-04-08 12:39:00,291 INFO L913 BasicCegarLoop]: 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-08 12:39:00,292 INFO L914 BasicCegarLoop]: 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-08 12:39:00,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2022-04-08 12:39:01,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 616. [2022-04-08 12:39:01,969 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:39:01,970 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-08 12:39:01,970 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-08 12:39:01,971 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-08 12:39:01,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:39:01,985 INFO L93 Difference]: Finished difference Result 638 states and 867 transitions. [2022-04-08 12:39:01,985 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 867 transitions. [2022-04-08 12:39:01,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:39:01,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:39:01,987 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-08 12:39:01,987 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-08 12:39:02,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:39:02,002 INFO L93 Difference]: Finished difference Result 638 states and 867 transitions. [2022-04-08 12:39:02,002 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 867 transitions. [2022-04-08 12:39:02,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:39:02,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:39:02,002 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:39:02,002 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:39:02,003 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-08 12:39:02,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 841 transitions. [2022-04-08 12:39:02,021 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 841 transitions. Word has length 119 [2022-04-08 12:39:02,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:39:02,021 INFO L478 AbstractCegarLoop]: Abstraction has 616 states and 841 transitions. [2022-04-08 12:39:02,021 INFO L479 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-08 12:39:02,021 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 616 states and 841 transitions. [2022-04-08 12:39:04,857 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 841 edges. 841 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:39:04,858 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 841 transitions. [2022-04-08 12:39:04,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-04-08 12:39:04,859 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:39:04,859 INFO L499 BasicCegarLoop]: 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-08 12:39:04,875 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-08 12:39:05,059 WARN L460 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-08 12:39:05,059 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:39:05,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:39:05,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1267134888, now seen corresponding path program 17 times [2022-04-08 12:39:05,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:39:05,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1548359561] [2022-04-08 12:39:05,060 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:39:05,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1267134888, now seen corresponding path program 18 times [2022-04-08 12:39:05,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:39:05,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038561470] [2022-04-08 12:39:05,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:39:05,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:39:05,072 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:39:05,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1795594263] [2022-04-08 12:39:05,072 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 12:39:05,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:39:05,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:39:05,073 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-08 12:39:05,075 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-08 12:39:05,638 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-04-08 12:39:05,638 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:39:05,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-08 12:39:05,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:39:05,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:39:06,228 INFO L272 TraceCheckUtils]: 0: Hoare triple {78991#true} call ULTIMATE.init(); {78991#true} is VALID [2022-04-08 12:39:06,229 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-08 12:39:06,229 INFO L290 TraceCheckUtils]: 2: Hoare triple {78999#(<= ~counter~0 0)} assume true; {78999#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:06,230 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {78999#(<= ~counter~0 0)} {78991#true} #102#return; {78999#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:06,230 INFO L272 TraceCheckUtils]: 4: Hoare triple {78999#(<= ~counter~0 0)} call #t~ret9 := main(); {78999#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:06,230 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-08 12:39:06,231 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-08 12:39:06,231 INFO L290 TraceCheckUtils]: 7: Hoare triple {78999#(<= ~counter~0 0)} ~cond := #in~cond; {78999#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:06,231 INFO L290 TraceCheckUtils]: 8: Hoare triple {78999#(<= ~counter~0 0)} assume !(0 == ~cond); {78999#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:06,232 INFO L290 TraceCheckUtils]: 9: Hoare triple {78999#(<= ~counter~0 0)} assume true; {78999#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:06,232 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {78999#(<= ~counter~0 0)} {78999#(<= ~counter~0 0)} #90#return; {78999#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:06,233 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-08 12:39:06,233 INFO L290 TraceCheckUtils]: 12: Hoare triple {78999#(<= ~counter~0 0)} ~cond := #in~cond; {78999#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:06,233 INFO L290 TraceCheckUtils]: 13: Hoare triple {78999#(<= ~counter~0 0)} assume !(0 == ~cond); {78999#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:06,233 INFO L290 TraceCheckUtils]: 14: Hoare triple {78999#(<= ~counter~0 0)} assume true; {78999#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:06,234 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {78999#(<= ~counter~0 0)} {78999#(<= ~counter~0 0)} #92#return; {78999#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:06,234 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-08 12:39:06,236 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-08 12:39:06,236 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-08 12:39:06,237 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-08 12:39:06,237 INFO L290 TraceCheckUtils]: 20: Hoare triple {79048#(<= ~counter~0 1)} ~cond := #in~cond; {79048#(<= ~counter~0 1)} is VALID [2022-04-08 12:39:06,237 INFO L290 TraceCheckUtils]: 21: Hoare triple {79048#(<= ~counter~0 1)} assume !(0 == ~cond); {79048#(<= ~counter~0 1)} is VALID [2022-04-08 12:39:06,238 INFO L290 TraceCheckUtils]: 22: Hoare triple {79048#(<= ~counter~0 1)} assume true; {79048#(<= ~counter~0 1)} is VALID [2022-04-08 12:39:06,238 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {79048#(<= ~counter~0 1)} {79048#(<= ~counter~0 1)} #94#return; {79048#(<= ~counter~0 1)} is VALID [2022-04-08 12:39:06,238 INFO L290 TraceCheckUtils]: 24: Hoare triple {79048#(<= ~counter~0 1)} assume !!(0 != ~r~0); {79048#(<= ~counter~0 1)} is VALID [2022-04-08 12:39:06,239 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-08 12:39:06,240 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-08 12:39:06,240 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-08 12:39:06,240 INFO L290 TraceCheckUtils]: 28: Hoare triple {79073#(<= ~counter~0 2)} ~cond := #in~cond; {79073#(<= ~counter~0 2)} is VALID [2022-04-08 12:39:06,241 INFO L290 TraceCheckUtils]: 29: Hoare triple {79073#(<= ~counter~0 2)} assume !(0 == ~cond); {79073#(<= ~counter~0 2)} is VALID [2022-04-08 12:39:06,241 INFO L290 TraceCheckUtils]: 30: Hoare triple {79073#(<= ~counter~0 2)} assume true; {79073#(<= ~counter~0 2)} is VALID [2022-04-08 12:39:06,242 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {79073#(<= ~counter~0 2)} {79073#(<= ~counter~0 2)} #96#return; {79073#(<= ~counter~0 2)} is VALID [2022-04-08 12:39:06,242 INFO L290 TraceCheckUtils]: 32: Hoare triple {79073#(<= ~counter~0 2)} assume !(~r~0 > 0); {79073#(<= ~counter~0 2)} is VALID [2022-04-08 12:39:06,243 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-08 12:39:06,243 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-08 12:39:06,244 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-08 12:39:06,244 INFO L290 TraceCheckUtils]: 36: Hoare triple {79098#(<= ~counter~0 3)} ~cond := #in~cond; {79098#(<= ~counter~0 3)} is VALID [2022-04-08 12:39:06,244 INFO L290 TraceCheckUtils]: 37: Hoare triple {79098#(<= ~counter~0 3)} assume !(0 == ~cond); {79098#(<= ~counter~0 3)} is VALID [2022-04-08 12:39:06,244 INFO L290 TraceCheckUtils]: 38: Hoare triple {79098#(<= ~counter~0 3)} assume true; {79098#(<= ~counter~0 3)} is VALID [2022-04-08 12:39:06,245 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {79098#(<= ~counter~0 3)} {79098#(<= ~counter~0 3)} #98#return; {79098#(<= ~counter~0 3)} is VALID [2022-04-08 12:39:06,245 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-08 12:39:06,246 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-08 12:39:06,246 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-08 12:39:06,247 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-08 12:39:06,247 INFO L290 TraceCheckUtils]: 44: Hoare triple {79123#(<= ~counter~0 4)} ~cond := #in~cond; {79123#(<= ~counter~0 4)} is VALID [2022-04-08 12:39:06,247 INFO L290 TraceCheckUtils]: 45: Hoare triple {79123#(<= ~counter~0 4)} assume !(0 == ~cond); {79123#(<= ~counter~0 4)} is VALID [2022-04-08 12:39:06,248 INFO L290 TraceCheckUtils]: 46: Hoare triple {79123#(<= ~counter~0 4)} assume true; {79123#(<= ~counter~0 4)} is VALID [2022-04-08 12:39:06,248 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {79123#(<= ~counter~0 4)} {79123#(<= ~counter~0 4)} #98#return; {79123#(<= ~counter~0 4)} is VALID [2022-04-08 12:39:06,249 INFO L290 TraceCheckUtils]: 48: Hoare triple {79123#(<= ~counter~0 4)} assume !(~r~0 < 0); {79123#(<= ~counter~0 4)} is VALID [2022-04-08 12:39:06,249 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-08 12:39:06,250 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-08 12:39:06,250 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-08 12:39:06,250 INFO L290 TraceCheckUtils]: 52: Hoare triple {79148#(<= ~counter~0 5)} ~cond := #in~cond; {79148#(<= ~counter~0 5)} is VALID [2022-04-08 12:39:06,251 INFO L290 TraceCheckUtils]: 53: Hoare triple {79148#(<= ~counter~0 5)} assume !(0 == ~cond); {79148#(<= ~counter~0 5)} is VALID [2022-04-08 12:39:06,251 INFO L290 TraceCheckUtils]: 54: Hoare triple {79148#(<= ~counter~0 5)} assume true; {79148#(<= ~counter~0 5)} is VALID [2022-04-08 12:39:06,252 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {79148#(<= ~counter~0 5)} {79148#(<= ~counter~0 5)} #94#return; {79148#(<= ~counter~0 5)} is VALID [2022-04-08 12:39:06,252 INFO L290 TraceCheckUtils]: 56: Hoare triple {79148#(<= ~counter~0 5)} assume !!(0 != ~r~0); {79148#(<= ~counter~0 5)} is VALID [2022-04-08 12:39:06,253 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-08 12:39:06,253 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-08 12:39:06,253 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-08 12:39:06,254 INFO L290 TraceCheckUtils]: 60: Hoare triple {79173#(<= ~counter~0 6)} ~cond := #in~cond; {79173#(<= ~counter~0 6)} is VALID [2022-04-08 12:39:06,254 INFO L290 TraceCheckUtils]: 61: Hoare triple {79173#(<= ~counter~0 6)} assume !(0 == ~cond); {79173#(<= ~counter~0 6)} is VALID [2022-04-08 12:39:06,254 INFO L290 TraceCheckUtils]: 62: Hoare triple {79173#(<= ~counter~0 6)} assume true; {79173#(<= ~counter~0 6)} is VALID [2022-04-08 12:39:06,255 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {79173#(<= ~counter~0 6)} {79173#(<= ~counter~0 6)} #96#return; {79173#(<= ~counter~0 6)} is VALID [2022-04-08 12:39:06,255 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-08 12:39:06,256 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-08 12:39:06,256 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-08 12:39:06,257 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-08 12:39:06,257 INFO L290 TraceCheckUtils]: 68: Hoare triple {79198#(<= ~counter~0 7)} ~cond := #in~cond; {79198#(<= ~counter~0 7)} is VALID [2022-04-08 12:39:06,257 INFO L290 TraceCheckUtils]: 69: Hoare triple {79198#(<= ~counter~0 7)} assume !(0 == ~cond); {79198#(<= ~counter~0 7)} is VALID [2022-04-08 12:39:06,258 INFO L290 TraceCheckUtils]: 70: Hoare triple {79198#(<= ~counter~0 7)} assume true; {79198#(<= ~counter~0 7)} is VALID [2022-04-08 12:39:06,258 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {79198#(<= ~counter~0 7)} {79198#(<= ~counter~0 7)} #96#return; {79198#(<= ~counter~0 7)} is VALID [2022-04-08 12:39:06,258 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-08 12:39:06,259 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-08 12:39:06,260 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-08 12:39:06,260 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-08 12:39:06,260 INFO L290 TraceCheckUtils]: 76: Hoare triple {79223#(<= ~counter~0 8)} ~cond := #in~cond; {79223#(<= ~counter~0 8)} is VALID [2022-04-08 12:39:06,261 INFO L290 TraceCheckUtils]: 77: Hoare triple {79223#(<= ~counter~0 8)} assume !(0 == ~cond); {79223#(<= ~counter~0 8)} is VALID [2022-04-08 12:39:06,261 INFO L290 TraceCheckUtils]: 78: Hoare triple {79223#(<= ~counter~0 8)} assume true; {79223#(<= ~counter~0 8)} is VALID [2022-04-08 12:39:06,262 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {79223#(<= ~counter~0 8)} {79223#(<= ~counter~0 8)} #96#return; {79223#(<= ~counter~0 8)} is VALID [2022-04-08 12:39:06,262 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-08 12:39:06,263 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-08 12:39:06,263 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-08 12:39:06,264 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-08 12:39:06,264 INFO L290 TraceCheckUtils]: 84: Hoare triple {79248#(<= ~counter~0 9)} ~cond := #in~cond; {79248#(<= ~counter~0 9)} is VALID [2022-04-08 12:39:06,264 INFO L290 TraceCheckUtils]: 85: Hoare triple {79248#(<= ~counter~0 9)} assume !(0 == ~cond); {79248#(<= ~counter~0 9)} is VALID [2022-04-08 12:39:06,264 INFO L290 TraceCheckUtils]: 86: Hoare triple {79248#(<= ~counter~0 9)} assume true; {79248#(<= ~counter~0 9)} is VALID [2022-04-08 12:39:06,265 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {79248#(<= ~counter~0 9)} {79248#(<= ~counter~0 9)} #96#return; {79248#(<= ~counter~0 9)} is VALID [2022-04-08 12:39:06,265 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-08 12:39:06,266 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-08 12:39:06,266 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-08 12:39:06,267 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-08 12:39:06,267 INFO L290 TraceCheckUtils]: 92: Hoare triple {79273#(<= ~counter~0 10)} ~cond := #in~cond; {79273#(<= ~counter~0 10)} is VALID [2022-04-08 12:39:06,267 INFO L290 TraceCheckUtils]: 93: Hoare triple {79273#(<= ~counter~0 10)} assume !(0 == ~cond); {79273#(<= ~counter~0 10)} is VALID [2022-04-08 12:39:06,268 INFO L290 TraceCheckUtils]: 94: Hoare triple {79273#(<= ~counter~0 10)} assume true; {79273#(<= ~counter~0 10)} is VALID [2022-04-08 12:39:06,268 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {79273#(<= ~counter~0 10)} {79273#(<= ~counter~0 10)} #96#return; {79273#(<= ~counter~0 10)} is VALID [2022-04-08 12:39:06,269 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-08 12:39:06,269 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-08 12:39:06,270 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-08 12:39:06,270 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-08 12:39:06,270 INFO L290 TraceCheckUtils]: 100: Hoare triple {79298#(<= ~counter~0 11)} ~cond := #in~cond; {79298#(<= ~counter~0 11)} is VALID [2022-04-08 12:39:06,271 INFO L290 TraceCheckUtils]: 101: Hoare triple {79298#(<= ~counter~0 11)} assume !(0 == ~cond); {79298#(<= ~counter~0 11)} is VALID [2022-04-08 12:39:06,271 INFO L290 TraceCheckUtils]: 102: Hoare triple {79298#(<= ~counter~0 11)} assume true; {79298#(<= ~counter~0 11)} is VALID [2022-04-08 12:39:06,272 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {79298#(<= ~counter~0 11)} {79298#(<= ~counter~0 11)} #96#return; {79298#(<= ~counter~0 11)} is VALID [2022-04-08 12:39:06,272 INFO L290 TraceCheckUtils]: 104: Hoare triple {79298#(<= ~counter~0 11)} assume !(~r~0 > 0); {79298#(<= ~counter~0 11)} is VALID [2022-04-08 12:39:06,273 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-08 12:39:06,273 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-08 12:39:06,274 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-08 12:39:06,274 INFO L290 TraceCheckUtils]: 108: Hoare triple {79323#(<= ~counter~0 12)} ~cond := #in~cond; {79323#(<= ~counter~0 12)} is VALID [2022-04-08 12:39:06,274 INFO L290 TraceCheckUtils]: 109: Hoare triple {79323#(<= ~counter~0 12)} assume !(0 == ~cond); {79323#(<= ~counter~0 12)} is VALID [2022-04-08 12:39:06,274 INFO L290 TraceCheckUtils]: 110: Hoare triple {79323#(<= ~counter~0 12)} assume true; {79323#(<= ~counter~0 12)} is VALID [2022-04-08 12:39:06,275 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {79323#(<= ~counter~0 12)} {79323#(<= ~counter~0 12)} #98#return; {79323#(<= ~counter~0 12)} is VALID [2022-04-08 12:39:06,275 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-08 12:39:06,276 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-08 12:39:06,276 INFO L290 TraceCheckUtils]: 114: Hoare triple {79348#(<= |main_#t~post8| 12)} assume !(#t~post8 < 20);havoc #t~post8; {78992#false} is VALID [2022-04-08 12:39:06,276 INFO L290 TraceCheckUtils]: 115: Hoare triple {78992#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {78992#false} is VALID [2022-04-08 12:39:06,276 INFO L290 TraceCheckUtils]: 116: Hoare triple {78992#false} assume !(#t~post6 < 20);havoc #t~post6; {78992#false} is VALID [2022-04-08 12:39:06,276 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-08 12:39:06,276 INFO L290 TraceCheckUtils]: 118: Hoare triple {78992#false} ~cond := #in~cond; {78992#false} is VALID [2022-04-08 12:39:06,276 INFO L290 TraceCheckUtils]: 119: Hoare triple {78992#false} assume 0 == ~cond; {78992#false} is VALID [2022-04-08 12:39:06,276 INFO L290 TraceCheckUtils]: 120: Hoare triple {78992#false} assume !false; {78992#false} is VALID [2022-04-08 12:39:06,277 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-08 12:39:06,277 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:39:06,852 INFO L290 TraceCheckUtils]: 120: Hoare triple {78992#false} assume !false; {78992#false} is VALID [2022-04-08 12:39:06,852 INFO L290 TraceCheckUtils]: 119: Hoare triple {78992#false} assume 0 == ~cond; {78992#false} is VALID [2022-04-08 12:39:06,852 INFO L290 TraceCheckUtils]: 118: Hoare triple {78992#false} ~cond := #in~cond; {78992#false} is VALID [2022-04-08 12:39:06,852 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-08 12:39:06,852 INFO L290 TraceCheckUtils]: 116: Hoare triple {78992#false} assume !(#t~post6 < 20);havoc #t~post6; {78992#false} is VALID [2022-04-08 12:39:06,852 INFO L290 TraceCheckUtils]: 115: Hoare triple {78992#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {78992#false} is VALID [2022-04-08 12:39:06,852 INFO L290 TraceCheckUtils]: 114: Hoare triple {79388#(< |main_#t~post8| 20)} assume !(#t~post8 < 20);havoc #t~post8; {78992#false} is VALID [2022-04-08 12:39:06,853 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-08 12:39:06,853 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-08 12:39:06,854 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {78991#true} {79392#(< ~counter~0 20)} #98#return; {79392#(< ~counter~0 20)} is VALID [2022-04-08 12:39:06,854 INFO L290 TraceCheckUtils]: 110: Hoare triple {78991#true} assume true; {78991#true} is VALID [2022-04-08 12:39:06,854 INFO L290 TraceCheckUtils]: 109: Hoare triple {78991#true} assume !(0 == ~cond); {78991#true} is VALID [2022-04-08 12:39:06,854 INFO L290 TraceCheckUtils]: 108: Hoare triple {78991#true} ~cond := #in~cond; {78991#true} is VALID [2022-04-08 12:39:06,854 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-08 12:39:06,854 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-08 12:39:06,856 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-08 12:39:06,856 INFO L290 TraceCheckUtils]: 104: Hoare triple {79417#(< ~counter~0 19)} assume !(~r~0 > 0); {79417#(< ~counter~0 19)} is VALID [2022-04-08 12:39:06,857 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {78991#true} {79417#(< ~counter~0 19)} #96#return; {79417#(< ~counter~0 19)} is VALID [2022-04-08 12:39:06,857 INFO L290 TraceCheckUtils]: 102: Hoare triple {78991#true} assume true; {78991#true} is VALID [2022-04-08 12:39:06,857 INFO L290 TraceCheckUtils]: 101: Hoare triple {78991#true} assume !(0 == ~cond); {78991#true} is VALID [2022-04-08 12:39:06,857 INFO L290 TraceCheckUtils]: 100: Hoare triple {78991#true} ~cond := #in~cond; {78991#true} is VALID [2022-04-08 12:39:06,857 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-08 12:39:06,857 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-08 12:39:06,858 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-08 12:39:06,858 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-08 12:39:06,859 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {78991#true} {79442#(< ~counter~0 18)} #96#return; {79442#(< ~counter~0 18)} is VALID [2022-04-08 12:39:06,859 INFO L290 TraceCheckUtils]: 94: Hoare triple {78991#true} assume true; {78991#true} is VALID [2022-04-08 12:39:06,859 INFO L290 TraceCheckUtils]: 93: Hoare triple {78991#true} assume !(0 == ~cond); {78991#true} is VALID [2022-04-08 12:39:06,859 INFO L290 TraceCheckUtils]: 92: Hoare triple {78991#true} ~cond := #in~cond; {78991#true} is VALID [2022-04-08 12:39:06,859 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-08 12:39:06,859 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-08 12:39:06,860 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-08 12:39:06,860 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-08 12:39:06,861 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {78991#true} {79467#(< ~counter~0 17)} #96#return; {79467#(< ~counter~0 17)} is VALID [2022-04-08 12:39:06,861 INFO L290 TraceCheckUtils]: 86: Hoare triple {78991#true} assume true; {78991#true} is VALID [2022-04-08 12:39:06,861 INFO L290 TraceCheckUtils]: 85: Hoare triple {78991#true} assume !(0 == ~cond); {78991#true} is VALID [2022-04-08 12:39:06,861 INFO L290 TraceCheckUtils]: 84: Hoare triple {78991#true} ~cond := #in~cond; {78991#true} is VALID [2022-04-08 12:39:06,861 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-08 12:39:06,861 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-08 12:39:06,862 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-08 12:39:06,862 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-08 12:39:06,863 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {78991#true} {79492#(< ~counter~0 16)} #96#return; {79492#(< ~counter~0 16)} is VALID [2022-04-08 12:39:06,863 INFO L290 TraceCheckUtils]: 78: Hoare triple {78991#true} assume true; {78991#true} is VALID [2022-04-08 12:39:06,863 INFO L290 TraceCheckUtils]: 77: Hoare triple {78991#true} assume !(0 == ~cond); {78991#true} is VALID [2022-04-08 12:39:06,863 INFO L290 TraceCheckUtils]: 76: Hoare triple {78991#true} ~cond := #in~cond; {78991#true} is VALID [2022-04-08 12:39:06,863 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-08 12:39:06,864 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-08 12:39:06,864 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-08 12:39:06,865 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-08 12:39:06,865 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {78991#true} {79517#(< ~counter~0 15)} #96#return; {79517#(< ~counter~0 15)} is VALID [2022-04-08 12:39:06,865 INFO L290 TraceCheckUtils]: 70: Hoare triple {78991#true} assume true; {78991#true} is VALID [2022-04-08 12:39:06,865 INFO L290 TraceCheckUtils]: 69: Hoare triple {78991#true} assume !(0 == ~cond); {78991#true} is VALID [2022-04-08 12:39:06,865 INFO L290 TraceCheckUtils]: 68: Hoare triple {78991#true} ~cond := #in~cond; {78991#true} is VALID [2022-04-08 12:39:06,866 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-08 12:39:06,866 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-08 12:39:06,867 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-08 12:39:06,867 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-08 12:39:06,867 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {78991#true} {79542#(< ~counter~0 14)} #96#return; {79542#(< ~counter~0 14)} is VALID [2022-04-08 12:39:06,867 INFO L290 TraceCheckUtils]: 62: Hoare triple {78991#true} assume true; {78991#true} is VALID [2022-04-08 12:39:06,867 INFO L290 TraceCheckUtils]: 61: Hoare triple {78991#true} assume !(0 == ~cond); {78991#true} is VALID [2022-04-08 12:39:06,868 INFO L290 TraceCheckUtils]: 60: Hoare triple {78991#true} ~cond := #in~cond; {78991#true} is VALID [2022-04-08 12:39:06,868 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-08 12:39:06,868 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-08 12:39:06,869 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-08 12:39:06,869 INFO L290 TraceCheckUtils]: 56: Hoare triple {79323#(<= ~counter~0 12)} assume !!(0 != ~r~0); {79323#(<= ~counter~0 12)} is VALID [2022-04-08 12:39:06,869 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {78991#true} {79323#(<= ~counter~0 12)} #94#return; {79323#(<= ~counter~0 12)} is VALID [2022-04-08 12:39:06,869 INFO L290 TraceCheckUtils]: 54: Hoare triple {78991#true} assume true; {78991#true} is VALID [2022-04-08 12:39:06,870 INFO L290 TraceCheckUtils]: 53: Hoare triple {78991#true} assume !(0 == ~cond); {78991#true} is VALID [2022-04-08 12:39:06,870 INFO L290 TraceCheckUtils]: 52: Hoare triple {78991#true} ~cond := #in~cond; {78991#true} is VALID [2022-04-08 12:39:06,870 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-08 12:39:06,870 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-08 12:39:06,871 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-08 12:39:06,871 INFO L290 TraceCheckUtils]: 48: Hoare triple {79298#(<= ~counter~0 11)} assume !(~r~0 < 0); {79298#(<= ~counter~0 11)} is VALID [2022-04-08 12:39:06,871 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {78991#true} {79298#(<= ~counter~0 11)} #98#return; {79298#(<= ~counter~0 11)} is VALID [2022-04-08 12:39:06,872 INFO L290 TraceCheckUtils]: 46: Hoare triple {78991#true} assume true; {78991#true} is VALID [2022-04-08 12:39:06,872 INFO L290 TraceCheckUtils]: 45: Hoare triple {78991#true} assume !(0 == ~cond); {78991#true} is VALID [2022-04-08 12:39:06,872 INFO L290 TraceCheckUtils]: 44: Hoare triple {78991#true} ~cond := #in~cond; {78991#true} is VALID [2022-04-08 12:39:06,872 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-08 12:39:06,872 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-08 12:39:06,873 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-08 12:39:06,873 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-08 12:39:06,873 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {78991#true} {79273#(<= ~counter~0 10)} #98#return; {79273#(<= ~counter~0 10)} is VALID [2022-04-08 12:39:06,874 INFO L290 TraceCheckUtils]: 38: Hoare triple {78991#true} assume true; {78991#true} is VALID [2022-04-08 12:39:06,874 INFO L290 TraceCheckUtils]: 37: Hoare triple {78991#true} assume !(0 == ~cond); {78991#true} is VALID [2022-04-08 12:39:06,874 INFO L290 TraceCheckUtils]: 36: Hoare triple {78991#true} ~cond := #in~cond; {78991#true} is VALID [2022-04-08 12:39:06,874 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-08 12:39:06,874 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-08 12:39:06,875 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-08 12:39:06,875 INFO L290 TraceCheckUtils]: 32: Hoare triple {79248#(<= ~counter~0 9)} assume !(~r~0 > 0); {79248#(<= ~counter~0 9)} is VALID [2022-04-08 12:39:06,876 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {78991#true} {79248#(<= ~counter~0 9)} #96#return; {79248#(<= ~counter~0 9)} is VALID [2022-04-08 12:39:06,876 INFO L290 TraceCheckUtils]: 30: Hoare triple {78991#true} assume true; {78991#true} is VALID [2022-04-08 12:39:06,876 INFO L290 TraceCheckUtils]: 29: Hoare triple {78991#true} assume !(0 == ~cond); {78991#true} is VALID [2022-04-08 12:39:06,876 INFO L290 TraceCheckUtils]: 28: Hoare triple {78991#true} ~cond := #in~cond; {78991#true} is VALID [2022-04-08 12:39:06,876 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-08 12:39:06,876 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-08 12:39:06,877 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-08 12:39:06,877 INFO L290 TraceCheckUtils]: 24: Hoare triple {79223#(<= ~counter~0 8)} assume !!(0 != ~r~0); {79223#(<= ~counter~0 8)} is VALID [2022-04-08 12:39:06,878 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {78991#true} {79223#(<= ~counter~0 8)} #94#return; {79223#(<= ~counter~0 8)} is VALID [2022-04-08 12:39:06,878 INFO L290 TraceCheckUtils]: 22: Hoare triple {78991#true} assume true; {78991#true} is VALID [2022-04-08 12:39:06,878 INFO L290 TraceCheckUtils]: 21: Hoare triple {78991#true} assume !(0 == ~cond); {78991#true} is VALID [2022-04-08 12:39:06,878 INFO L290 TraceCheckUtils]: 20: Hoare triple {78991#true} ~cond := #in~cond; {78991#true} is VALID [2022-04-08 12:39:06,878 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-08 12:39:06,878 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-08 12:39:06,879 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-08 12:39:06,880 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-08 12:39:06,880 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {78991#true} {79198#(<= ~counter~0 7)} #92#return; {79198#(<= ~counter~0 7)} is VALID [2022-04-08 12:39:06,880 INFO L290 TraceCheckUtils]: 14: Hoare triple {78991#true} assume true; {78991#true} is VALID [2022-04-08 12:39:06,880 INFO L290 TraceCheckUtils]: 13: Hoare triple {78991#true} assume !(0 == ~cond); {78991#true} is VALID [2022-04-08 12:39:06,880 INFO L290 TraceCheckUtils]: 12: Hoare triple {78991#true} ~cond := #in~cond; {78991#true} is VALID [2022-04-08 12:39:06,880 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-08 12:39:06,881 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {78991#true} {79198#(<= ~counter~0 7)} #90#return; {79198#(<= ~counter~0 7)} is VALID [2022-04-08 12:39:06,881 INFO L290 TraceCheckUtils]: 9: Hoare triple {78991#true} assume true; {78991#true} is VALID [2022-04-08 12:39:06,881 INFO L290 TraceCheckUtils]: 8: Hoare triple {78991#true} assume !(0 == ~cond); {78991#true} is VALID [2022-04-08 12:39:06,881 INFO L290 TraceCheckUtils]: 7: Hoare triple {78991#true} ~cond := #in~cond; {78991#true} is VALID [2022-04-08 12:39:06,881 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-08 12:39:06,881 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-08 12:39:06,881 INFO L272 TraceCheckUtils]: 4: Hoare triple {79198#(<= ~counter~0 7)} call #t~ret9 := main(); {79198#(<= ~counter~0 7)} is VALID [2022-04-08 12:39:06,882 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {79198#(<= ~counter~0 7)} {78991#true} #102#return; {79198#(<= ~counter~0 7)} is VALID [2022-04-08 12:39:06,882 INFO L290 TraceCheckUtils]: 2: Hoare triple {79198#(<= ~counter~0 7)} assume true; {79198#(<= ~counter~0 7)} is VALID [2022-04-08 12:39:06,882 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-08 12:39:06,883 INFO L272 TraceCheckUtils]: 0: Hoare triple {78991#true} call ULTIMATE.init(); {78991#true} is VALID [2022-04-08 12:39:06,883 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-08 12:39:06,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:39:06,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038561470] [2022-04-08 12:39:06,883 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:39:06,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795594263] [2022-04-08 12:39:06,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1795594263] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:39:06,883 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:39:06,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 24 [2022-04-08 12:39:06,884 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:39:06,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1548359561] [2022-04-08 12:39:06,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1548359561] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:39:06,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:39:06,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 12:39:06,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217271402] [2022-04-08 12:39:06,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:39:06,884 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-08 12:39:06,884 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:39:06,884 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-08 12:39:06,978 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-08 12:39:06,979 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 12:39:06,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:39:06,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 12:39:06,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-08 12:39:06,979 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-08 12:39:09,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:39:09,803 INFO L93 Difference]: Finished difference Result 837 states and 1174 transitions. [2022-04-08 12:39:09,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-08 12:39:09,803 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-08 12:39:09,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:39:09,803 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-08 12:39:09,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 276 transitions. [2022-04-08 12:39:09,805 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-08 12:39:09,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 276 transitions. [2022-04-08 12:39:09,806 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 276 transitions. [2022-04-08 12:39:10,025 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-08 12:39:10,042 INFO L225 Difference]: With dead ends: 837 [2022-04-08 12:39:10,042 INFO L226 Difference]: Without dead ends: 644 [2022-04-08 12:39:10,043 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 218 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=446, Invalid=676, Unknown=0, NotChecked=0, Total=1122 [2022-04-08 12:39:10,043 INFO L913 BasicCegarLoop]: 66 mSDtfsCounter, 184 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-08 12:39:10,043 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [184 Valid, 278 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 12:39:10,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2022-04-08 12:39:11,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 634. [2022-04-08 12:39:11,787 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:39:11,787 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-08 12:39:11,788 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-08 12:39:11,788 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-08 12:39:11,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:39:11,802 INFO L93 Difference]: Finished difference Result 644 states and 873 transitions. [2022-04-08 12:39:11,802 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 873 transitions. [2022-04-08 12:39:11,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:39:11,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:39:11,803 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-08 12:39:11,804 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-08 12:39:11,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:39:11,822 INFO L93 Difference]: Finished difference Result 644 states and 873 transitions. [2022-04-08 12:39:11,822 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 873 transitions. [2022-04-08 12:39:11,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:39:11,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:39:11,822 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:39:11,822 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:39:11,823 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-08 12:39:11,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 863 transitions. [2022-04-08 12:39:11,841 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 863 transitions. Word has length 121 [2022-04-08 12:39:11,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:39:11,841 INFO L478 AbstractCegarLoop]: Abstraction has 634 states and 863 transitions. [2022-04-08 12:39:11,841 INFO L479 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-08 12:39:11,841 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 634 states and 863 transitions. [2022-04-08 12:39:15,940 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-08 12:39:15,941 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 863 transitions. [2022-04-08 12:39:15,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-04-08 12:39:15,942 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:39:15,942 INFO L499 BasicCegarLoop]: 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-08 12:39:15,950 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-08 12:39:16,142 WARN L460 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-08 12:39:16,142 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:39:16,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:39:16,143 INFO L85 PathProgramCache]: Analyzing trace with hash 487500267, now seen corresponding path program 15 times [2022-04-08 12:39:16,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:39:16,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1466522116] [2022-04-08 12:39:16,143 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:39:16,143 INFO L85 PathProgramCache]: Analyzing trace with hash 487500267, now seen corresponding path program 16 times [2022-04-08 12:39:16,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:39:16,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861788329] [2022-04-08 12:39:16,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:39:16,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:39:16,154 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:39:16,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1739310904] [2022-04-08 12:39:16,154 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 12:39:16,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:39:16,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:39:16,155 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-08 12:39:16,156 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-08 12:39:16,267 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 12:39:16,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:39:16,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-08 12:39:16,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:39:16,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:39:16,836 INFO L272 TraceCheckUtils]: 0: Hoare triple {83990#true} call ULTIMATE.init(); {83990#true} is VALID [2022-04-08 12:39:16,837 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-08 12:39:16,837 INFO L290 TraceCheckUtils]: 2: Hoare triple {83998#(<= ~counter~0 0)} assume true; {83998#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:16,837 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {83998#(<= ~counter~0 0)} {83990#true} #102#return; {83998#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:16,837 INFO L272 TraceCheckUtils]: 4: Hoare triple {83998#(<= ~counter~0 0)} call #t~ret9 := main(); {83998#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:16,838 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-08 12:39:16,838 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-08 12:39:16,838 INFO L290 TraceCheckUtils]: 7: Hoare triple {83998#(<= ~counter~0 0)} ~cond := #in~cond; {83998#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:16,839 INFO L290 TraceCheckUtils]: 8: Hoare triple {83998#(<= ~counter~0 0)} assume !(0 == ~cond); {83998#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:16,839 INFO L290 TraceCheckUtils]: 9: Hoare triple {83998#(<= ~counter~0 0)} assume true; {83998#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:16,839 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {83998#(<= ~counter~0 0)} {83998#(<= ~counter~0 0)} #90#return; {83998#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:16,840 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-08 12:39:16,840 INFO L290 TraceCheckUtils]: 12: Hoare triple {83998#(<= ~counter~0 0)} ~cond := #in~cond; {83998#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:16,840 INFO L290 TraceCheckUtils]: 13: Hoare triple {83998#(<= ~counter~0 0)} assume !(0 == ~cond); {83998#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:16,840 INFO L290 TraceCheckUtils]: 14: Hoare triple {83998#(<= ~counter~0 0)} assume true; {83998#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:16,841 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {83998#(<= ~counter~0 0)} {83998#(<= ~counter~0 0)} #92#return; {83998#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:16,841 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-08 12:39:16,843 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-08 12:39:16,843 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-08 12:39:16,843 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-08 12:39:16,844 INFO L290 TraceCheckUtils]: 20: Hoare triple {84047#(<= ~counter~0 1)} ~cond := #in~cond; {84047#(<= ~counter~0 1)} is VALID [2022-04-08 12:39:16,844 INFO L290 TraceCheckUtils]: 21: Hoare triple {84047#(<= ~counter~0 1)} assume !(0 == ~cond); {84047#(<= ~counter~0 1)} is VALID [2022-04-08 12:39:16,844 INFO L290 TraceCheckUtils]: 22: Hoare triple {84047#(<= ~counter~0 1)} assume true; {84047#(<= ~counter~0 1)} is VALID [2022-04-08 12:39:16,845 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {84047#(<= ~counter~0 1)} {84047#(<= ~counter~0 1)} #94#return; {84047#(<= ~counter~0 1)} is VALID [2022-04-08 12:39:16,845 INFO L290 TraceCheckUtils]: 24: Hoare triple {84047#(<= ~counter~0 1)} assume !!(0 != ~r~0); {84047#(<= ~counter~0 1)} is VALID [2022-04-08 12:39:16,846 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-08 12:39:16,846 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-08 12:39:16,847 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-08 12:39:16,847 INFO L290 TraceCheckUtils]: 28: Hoare triple {84072#(<= ~counter~0 2)} ~cond := #in~cond; {84072#(<= ~counter~0 2)} is VALID [2022-04-08 12:39:16,847 INFO L290 TraceCheckUtils]: 29: Hoare triple {84072#(<= ~counter~0 2)} assume !(0 == ~cond); {84072#(<= ~counter~0 2)} is VALID [2022-04-08 12:39:16,847 INFO L290 TraceCheckUtils]: 30: Hoare triple {84072#(<= ~counter~0 2)} assume true; {84072#(<= ~counter~0 2)} is VALID [2022-04-08 12:39:16,848 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {84072#(<= ~counter~0 2)} {84072#(<= ~counter~0 2)} #96#return; {84072#(<= ~counter~0 2)} is VALID [2022-04-08 12:39:16,848 INFO L290 TraceCheckUtils]: 32: Hoare triple {84072#(<= ~counter~0 2)} assume !(~r~0 > 0); {84072#(<= ~counter~0 2)} is VALID [2022-04-08 12:39:16,849 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-08 12:39:16,849 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-08 12:39:16,850 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-08 12:39:16,850 INFO L290 TraceCheckUtils]: 36: Hoare triple {84097#(<= ~counter~0 3)} ~cond := #in~cond; {84097#(<= ~counter~0 3)} is VALID [2022-04-08 12:39:16,850 INFO L290 TraceCheckUtils]: 37: Hoare triple {84097#(<= ~counter~0 3)} assume !(0 == ~cond); {84097#(<= ~counter~0 3)} is VALID [2022-04-08 12:39:16,850 INFO L290 TraceCheckUtils]: 38: Hoare triple {84097#(<= ~counter~0 3)} assume true; {84097#(<= ~counter~0 3)} is VALID [2022-04-08 12:39:16,851 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {84097#(<= ~counter~0 3)} {84097#(<= ~counter~0 3)} #98#return; {84097#(<= ~counter~0 3)} is VALID [2022-04-08 12:39:16,851 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-08 12:39:16,852 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-08 12:39:16,852 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-08 12:39:16,853 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-08 12:39:16,853 INFO L290 TraceCheckUtils]: 44: Hoare triple {84122#(<= ~counter~0 4)} ~cond := #in~cond; {84122#(<= ~counter~0 4)} is VALID [2022-04-08 12:39:16,853 INFO L290 TraceCheckUtils]: 45: Hoare triple {84122#(<= ~counter~0 4)} assume !(0 == ~cond); {84122#(<= ~counter~0 4)} is VALID [2022-04-08 12:39:16,853 INFO L290 TraceCheckUtils]: 46: Hoare triple {84122#(<= ~counter~0 4)} assume true; {84122#(<= ~counter~0 4)} is VALID [2022-04-08 12:39:16,854 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {84122#(<= ~counter~0 4)} {84122#(<= ~counter~0 4)} #98#return; {84122#(<= ~counter~0 4)} is VALID [2022-04-08 12:39:16,854 INFO L290 TraceCheckUtils]: 48: Hoare triple {84122#(<= ~counter~0 4)} assume !(~r~0 < 0); {84122#(<= ~counter~0 4)} is VALID [2022-04-08 12:39:16,855 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-08 12:39:16,855 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-08 12:39:16,856 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-08 12:39:16,856 INFO L290 TraceCheckUtils]: 52: Hoare triple {84147#(<= ~counter~0 5)} ~cond := #in~cond; {84147#(<= ~counter~0 5)} is VALID [2022-04-08 12:39:16,856 INFO L290 TraceCheckUtils]: 53: Hoare triple {84147#(<= ~counter~0 5)} assume !(0 == ~cond); {84147#(<= ~counter~0 5)} is VALID [2022-04-08 12:39:16,856 INFO L290 TraceCheckUtils]: 54: Hoare triple {84147#(<= ~counter~0 5)} assume true; {84147#(<= ~counter~0 5)} is VALID [2022-04-08 12:39:16,857 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {84147#(<= ~counter~0 5)} {84147#(<= ~counter~0 5)} #94#return; {84147#(<= ~counter~0 5)} is VALID [2022-04-08 12:39:16,857 INFO L290 TraceCheckUtils]: 56: Hoare triple {84147#(<= ~counter~0 5)} assume !!(0 != ~r~0); {84147#(<= ~counter~0 5)} is VALID [2022-04-08 12:39:16,858 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-08 12:39:16,858 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-08 12:39:16,859 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-08 12:39:16,859 INFO L290 TraceCheckUtils]: 60: Hoare triple {84172#(<= ~counter~0 6)} ~cond := #in~cond; {84172#(<= ~counter~0 6)} is VALID [2022-04-08 12:39:16,859 INFO L290 TraceCheckUtils]: 61: Hoare triple {84172#(<= ~counter~0 6)} assume !(0 == ~cond); {84172#(<= ~counter~0 6)} is VALID [2022-04-08 12:39:16,859 INFO L290 TraceCheckUtils]: 62: Hoare triple {84172#(<= ~counter~0 6)} assume true; {84172#(<= ~counter~0 6)} is VALID [2022-04-08 12:39:16,860 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {84172#(<= ~counter~0 6)} {84172#(<= ~counter~0 6)} #96#return; {84172#(<= ~counter~0 6)} is VALID [2022-04-08 12:39:16,860 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-08 12:39:16,861 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-08 12:39:16,861 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-08 12:39:16,862 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-08 12:39:16,862 INFO L290 TraceCheckUtils]: 68: Hoare triple {84197#(<= ~counter~0 7)} ~cond := #in~cond; {84197#(<= ~counter~0 7)} is VALID [2022-04-08 12:39:16,862 INFO L290 TraceCheckUtils]: 69: Hoare triple {84197#(<= ~counter~0 7)} assume !(0 == ~cond); {84197#(<= ~counter~0 7)} is VALID [2022-04-08 12:39:16,862 INFO L290 TraceCheckUtils]: 70: Hoare triple {84197#(<= ~counter~0 7)} assume true; {84197#(<= ~counter~0 7)} is VALID [2022-04-08 12:39:16,863 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {84197#(<= ~counter~0 7)} {84197#(<= ~counter~0 7)} #96#return; {84197#(<= ~counter~0 7)} is VALID [2022-04-08 12:39:16,863 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-08 12:39:16,864 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-08 12:39:16,864 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-08 12:39:16,865 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-08 12:39:16,865 INFO L290 TraceCheckUtils]: 76: Hoare triple {84222#(<= ~counter~0 8)} ~cond := #in~cond; {84222#(<= ~counter~0 8)} is VALID [2022-04-08 12:39:16,865 INFO L290 TraceCheckUtils]: 77: Hoare triple {84222#(<= ~counter~0 8)} assume !(0 == ~cond); {84222#(<= ~counter~0 8)} is VALID [2022-04-08 12:39:16,865 INFO L290 TraceCheckUtils]: 78: Hoare triple {84222#(<= ~counter~0 8)} assume true; {84222#(<= ~counter~0 8)} is VALID [2022-04-08 12:39:16,866 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {84222#(<= ~counter~0 8)} {84222#(<= ~counter~0 8)} #96#return; {84222#(<= ~counter~0 8)} is VALID [2022-04-08 12:39:16,866 INFO L290 TraceCheckUtils]: 80: Hoare triple {84222#(<= ~counter~0 8)} assume !(~r~0 > 0); {84222#(<= ~counter~0 8)} is VALID [2022-04-08 12:39:16,867 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-08 12:39:16,867 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-08 12:39:16,868 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-08 12:39:16,868 INFO L290 TraceCheckUtils]: 84: Hoare triple {84247#(<= ~counter~0 9)} ~cond := #in~cond; {84247#(<= ~counter~0 9)} is VALID [2022-04-08 12:39:16,868 INFO L290 TraceCheckUtils]: 85: Hoare triple {84247#(<= ~counter~0 9)} assume !(0 == ~cond); {84247#(<= ~counter~0 9)} is VALID [2022-04-08 12:39:16,868 INFO L290 TraceCheckUtils]: 86: Hoare triple {84247#(<= ~counter~0 9)} assume true; {84247#(<= ~counter~0 9)} is VALID [2022-04-08 12:39:16,869 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {84247#(<= ~counter~0 9)} {84247#(<= ~counter~0 9)} #98#return; {84247#(<= ~counter~0 9)} is VALID [2022-04-08 12:39:16,869 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-08 12:39:16,870 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-08 12:39:16,870 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-08 12:39:16,871 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-08 12:39:16,871 INFO L290 TraceCheckUtils]: 92: Hoare triple {84272#(<= ~counter~0 10)} ~cond := #in~cond; {84272#(<= ~counter~0 10)} is VALID [2022-04-08 12:39:16,871 INFO L290 TraceCheckUtils]: 93: Hoare triple {84272#(<= ~counter~0 10)} assume !(0 == ~cond); {84272#(<= ~counter~0 10)} is VALID [2022-04-08 12:39:16,871 INFO L290 TraceCheckUtils]: 94: Hoare triple {84272#(<= ~counter~0 10)} assume true; {84272#(<= ~counter~0 10)} is VALID [2022-04-08 12:39:16,872 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {84272#(<= ~counter~0 10)} {84272#(<= ~counter~0 10)} #98#return; {84272#(<= ~counter~0 10)} is VALID [2022-04-08 12:39:16,872 INFO L290 TraceCheckUtils]: 96: Hoare triple {84272#(<= ~counter~0 10)} assume !(~r~0 < 0); {84272#(<= ~counter~0 10)} is VALID [2022-04-08 12:39:16,873 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-08 12:39:16,873 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-08 12:39:16,874 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-08 12:39:16,874 INFO L290 TraceCheckUtils]: 100: Hoare triple {84297#(<= ~counter~0 11)} ~cond := #in~cond; {84297#(<= ~counter~0 11)} is VALID [2022-04-08 12:39:16,874 INFO L290 TraceCheckUtils]: 101: Hoare triple {84297#(<= ~counter~0 11)} assume !(0 == ~cond); {84297#(<= ~counter~0 11)} is VALID [2022-04-08 12:39:16,874 INFO L290 TraceCheckUtils]: 102: Hoare triple {84297#(<= ~counter~0 11)} assume true; {84297#(<= ~counter~0 11)} is VALID [2022-04-08 12:39:16,875 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {84297#(<= ~counter~0 11)} {84297#(<= ~counter~0 11)} #94#return; {84297#(<= ~counter~0 11)} is VALID [2022-04-08 12:39:16,875 INFO L290 TraceCheckUtils]: 104: Hoare triple {84297#(<= ~counter~0 11)} assume !!(0 != ~r~0); {84297#(<= ~counter~0 11)} is VALID [2022-04-08 12:39:16,876 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-08 12:39:16,876 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-08 12:39:16,877 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-08 12:39:16,877 INFO L290 TraceCheckUtils]: 108: Hoare triple {84322#(<= ~counter~0 12)} ~cond := #in~cond; {84322#(<= ~counter~0 12)} is VALID [2022-04-08 12:39:16,877 INFO L290 TraceCheckUtils]: 109: Hoare triple {84322#(<= ~counter~0 12)} assume !(0 == ~cond); {84322#(<= ~counter~0 12)} is VALID [2022-04-08 12:39:16,877 INFO L290 TraceCheckUtils]: 110: Hoare triple {84322#(<= ~counter~0 12)} assume true; {84322#(<= ~counter~0 12)} is VALID [2022-04-08 12:39:16,878 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {84322#(<= ~counter~0 12)} {84322#(<= ~counter~0 12)} #96#return; {84322#(<= ~counter~0 12)} is VALID [2022-04-08 12:39:16,878 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-08 12:39:16,878 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-08 12:39:16,879 INFO L290 TraceCheckUtils]: 114: Hoare triple {84347#(<= |main_#t~post7| 12)} assume !(#t~post7 < 20);havoc #t~post7; {83991#false} is VALID [2022-04-08 12:39:16,879 INFO L290 TraceCheckUtils]: 115: Hoare triple {83991#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {83991#false} is VALID [2022-04-08 12:39:16,879 INFO L290 TraceCheckUtils]: 116: Hoare triple {83991#false} assume !(#t~post8 < 20);havoc #t~post8; {83991#false} is VALID [2022-04-08 12:39:16,879 INFO L290 TraceCheckUtils]: 117: Hoare triple {83991#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {83991#false} is VALID [2022-04-08 12:39:16,879 INFO L290 TraceCheckUtils]: 118: Hoare triple {83991#false} assume !(#t~post6 < 20);havoc #t~post6; {83991#false} is VALID [2022-04-08 12:39:16,879 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-08 12:39:16,879 INFO L290 TraceCheckUtils]: 120: Hoare triple {83991#false} ~cond := #in~cond; {83991#false} is VALID [2022-04-08 12:39:16,879 INFO L290 TraceCheckUtils]: 121: Hoare triple {83991#false} assume 0 == ~cond; {83991#false} is VALID [2022-04-08 12:39:16,879 INFO L290 TraceCheckUtils]: 122: Hoare triple {83991#false} assume !false; {83991#false} is VALID [2022-04-08 12:39:16,880 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-08 12:39:16,880 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:39:17,444 INFO L290 TraceCheckUtils]: 122: Hoare triple {83991#false} assume !false; {83991#false} is VALID [2022-04-08 12:39:17,444 INFO L290 TraceCheckUtils]: 121: Hoare triple {83991#false} assume 0 == ~cond; {83991#false} is VALID [2022-04-08 12:39:17,444 INFO L290 TraceCheckUtils]: 120: Hoare triple {83991#false} ~cond := #in~cond; {83991#false} is VALID [2022-04-08 12:39:17,444 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-08 12:39:17,444 INFO L290 TraceCheckUtils]: 118: Hoare triple {83991#false} assume !(#t~post6 < 20);havoc #t~post6; {83991#false} is VALID [2022-04-08 12:39:17,445 INFO L290 TraceCheckUtils]: 117: Hoare triple {83991#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {83991#false} is VALID [2022-04-08 12:39:17,445 INFO L290 TraceCheckUtils]: 116: Hoare triple {83991#false} assume !(#t~post8 < 20);havoc #t~post8; {83991#false} is VALID [2022-04-08 12:39:17,445 INFO L290 TraceCheckUtils]: 115: Hoare triple {83991#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {83991#false} is VALID [2022-04-08 12:39:17,445 INFO L290 TraceCheckUtils]: 114: Hoare triple {84399#(< |main_#t~post7| 20)} assume !(#t~post7 < 20);havoc #t~post7; {83991#false} is VALID [2022-04-08 12:39:17,445 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-08 12:39:17,445 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-08 12:39:17,446 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {83990#true} {84403#(< ~counter~0 20)} #96#return; {84403#(< ~counter~0 20)} is VALID [2022-04-08 12:39:17,446 INFO L290 TraceCheckUtils]: 110: Hoare triple {83990#true} assume true; {83990#true} is VALID [2022-04-08 12:39:17,446 INFO L290 TraceCheckUtils]: 109: Hoare triple {83990#true} assume !(0 == ~cond); {83990#true} is VALID [2022-04-08 12:39:17,446 INFO L290 TraceCheckUtils]: 108: Hoare triple {83990#true} ~cond := #in~cond; {83990#true} is VALID [2022-04-08 12:39:17,446 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-08 12:39:17,447 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-08 12:39:17,448 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-08 12:39:17,449 INFO L290 TraceCheckUtils]: 104: Hoare triple {84428#(< ~counter~0 19)} assume !!(0 != ~r~0); {84428#(< ~counter~0 19)} is VALID [2022-04-08 12:39:17,449 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {83990#true} {84428#(< ~counter~0 19)} #94#return; {84428#(< ~counter~0 19)} is VALID [2022-04-08 12:39:17,449 INFO L290 TraceCheckUtils]: 102: Hoare triple {83990#true} assume true; {83990#true} is VALID [2022-04-08 12:39:17,449 INFO L290 TraceCheckUtils]: 101: Hoare triple {83990#true} assume !(0 == ~cond); {83990#true} is VALID [2022-04-08 12:39:17,449 INFO L290 TraceCheckUtils]: 100: Hoare triple {83990#true} ~cond := #in~cond; {83990#true} is VALID [2022-04-08 12:39:17,449 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-08 12:39:17,450 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-08 12:39:17,450 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-08 12:39:17,451 INFO L290 TraceCheckUtils]: 96: Hoare triple {84453#(< ~counter~0 18)} assume !(~r~0 < 0); {84453#(< ~counter~0 18)} is VALID [2022-04-08 12:39:17,451 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {83990#true} {84453#(< ~counter~0 18)} #98#return; {84453#(< ~counter~0 18)} is VALID [2022-04-08 12:39:17,451 INFO L290 TraceCheckUtils]: 94: Hoare triple {83990#true} assume true; {83990#true} is VALID [2022-04-08 12:39:17,451 INFO L290 TraceCheckUtils]: 93: Hoare triple {83990#true} assume !(0 == ~cond); {83990#true} is VALID [2022-04-08 12:39:17,451 INFO L290 TraceCheckUtils]: 92: Hoare triple {83990#true} ~cond := #in~cond; {83990#true} is VALID [2022-04-08 12:39:17,451 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-08 12:39:17,452 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-08 12:39:17,452 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-08 12:39:17,453 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-08 12:39:17,453 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {83990#true} {84478#(< ~counter~0 17)} #98#return; {84478#(< ~counter~0 17)} is VALID [2022-04-08 12:39:17,453 INFO L290 TraceCheckUtils]: 86: Hoare triple {83990#true} assume true; {83990#true} is VALID [2022-04-08 12:39:17,453 INFO L290 TraceCheckUtils]: 85: Hoare triple {83990#true} assume !(0 == ~cond); {83990#true} is VALID [2022-04-08 12:39:17,453 INFO L290 TraceCheckUtils]: 84: Hoare triple {83990#true} ~cond := #in~cond; {83990#true} is VALID [2022-04-08 12:39:17,454 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-08 12:39:17,454 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-08 12:39:17,455 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-08 12:39:17,455 INFO L290 TraceCheckUtils]: 80: Hoare triple {84503#(< ~counter~0 16)} assume !(~r~0 > 0); {84503#(< ~counter~0 16)} is VALID [2022-04-08 12:39:17,455 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {83990#true} {84503#(< ~counter~0 16)} #96#return; {84503#(< ~counter~0 16)} is VALID [2022-04-08 12:39:17,455 INFO L290 TraceCheckUtils]: 78: Hoare triple {83990#true} assume true; {83990#true} is VALID [2022-04-08 12:39:17,455 INFO L290 TraceCheckUtils]: 77: Hoare triple {83990#true} assume !(0 == ~cond); {83990#true} is VALID [2022-04-08 12:39:17,456 INFO L290 TraceCheckUtils]: 76: Hoare triple {83990#true} ~cond := #in~cond; {83990#true} is VALID [2022-04-08 12:39:17,456 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-08 12:39:17,456 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-08 12:39:17,457 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-08 12:39:17,457 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-08 12:39:17,457 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {83990#true} {84528#(< ~counter~0 15)} #96#return; {84528#(< ~counter~0 15)} is VALID [2022-04-08 12:39:17,457 INFO L290 TraceCheckUtils]: 70: Hoare triple {83990#true} assume true; {83990#true} is VALID [2022-04-08 12:39:17,458 INFO L290 TraceCheckUtils]: 69: Hoare triple {83990#true} assume !(0 == ~cond); {83990#true} is VALID [2022-04-08 12:39:17,458 INFO L290 TraceCheckUtils]: 68: Hoare triple {83990#true} ~cond := #in~cond; {83990#true} is VALID [2022-04-08 12:39:17,458 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-08 12:39:17,458 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-08 12:39:17,459 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-08 12:39:17,459 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-08 12:39:17,459 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {83990#true} {84553#(< ~counter~0 14)} #96#return; {84553#(< ~counter~0 14)} is VALID [2022-04-08 12:39:17,460 INFO L290 TraceCheckUtils]: 62: Hoare triple {83990#true} assume true; {83990#true} is VALID [2022-04-08 12:39:17,460 INFO L290 TraceCheckUtils]: 61: Hoare triple {83990#true} assume !(0 == ~cond); {83990#true} is VALID [2022-04-08 12:39:17,460 INFO L290 TraceCheckUtils]: 60: Hoare triple {83990#true} ~cond := #in~cond; {83990#true} is VALID [2022-04-08 12:39:17,460 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-08 12:39:17,460 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-08 12:39:17,461 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-08 12:39:17,461 INFO L290 TraceCheckUtils]: 56: Hoare triple {84322#(<= ~counter~0 12)} assume !!(0 != ~r~0); {84322#(<= ~counter~0 12)} is VALID [2022-04-08 12:39:17,462 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {83990#true} {84322#(<= ~counter~0 12)} #94#return; {84322#(<= ~counter~0 12)} is VALID [2022-04-08 12:39:17,462 INFO L290 TraceCheckUtils]: 54: Hoare triple {83990#true} assume true; {83990#true} is VALID [2022-04-08 12:39:17,462 INFO L290 TraceCheckUtils]: 53: Hoare triple {83990#true} assume !(0 == ~cond); {83990#true} is VALID [2022-04-08 12:39:17,462 INFO L290 TraceCheckUtils]: 52: Hoare triple {83990#true} ~cond := #in~cond; {83990#true} is VALID [2022-04-08 12:39:17,462 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-08 12:39:17,462 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-08 12:39:17,463 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-08 12:39:17,463 INFO L290 TraceCheckUtils]: 48: Hoare triple {84297#(<= ~counter~0 11)} assume !(~r~0 < 0); {84297#(<= ~counter~0 11)} is VALID [2022-04-08 12:39:17,464 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {83990#true} {84297#(<= ~counter~0 11)} #98#return; {84297#(<= ~counter~0 11)} is VALID [2022-04-08 12:39:17,464 INFO L290 TraceCheckUtils]: 46: Hoare triple {83990#true} assume true; {83990#true} is VALID [2022-04-08 12:39:17,464 INFO L290 TraceCheckUtils]: 45: Hoare triple {83990#true} assume !(0 == ~cond); {83990#true} is VALID [2022-04-08 12:39:17,464 INFO L290 TraceCheckUtils]: 44: Hoare triple {83990#true} ~cond := #in~cond; {83990#true} is VALID [2022-04-08 12:39:17,464 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-08 12:39:17,464 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-08 12:39:17,465 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-08 12:39:17,465 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-08 12:39:17,466 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {83990#true} {84272#(<= ~counter~0 10)} #98#return; {84272#(<= ~counter~0 10)} is VALID [2022-04-08 12:39:17,466 INFO L290 TraceCheckUtils]: 38: Hoare triple {83990#true} assume true; {83990#true} is VALID [2022-04-08 12:39:17,466 INFO L290 TraceCheckUtils]: 37: Hoare triple {83990#true} assume !(0 == ~cond); {83990#true} is VALID [2022-04-08 12:39:17,466 INFO L290 TraceCheckUtils]: 36: Hoare triple {83990#true} ~cond := #in~cond; {83990#true} is VALID [2022-04-08 12:39:17,466 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-08 12:39:17,466 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-08 12:39:17,467 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-08 12:39:17,467 INFO L290 TraceCheckUtils]: 32: Hoare triple {84247#(<= ~counter~0 9)} assume !(~r~0 > 0); {84247#(<= ~counter~0 9)} is VALID [2022-04-08 12:39:17,468 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {83990#true} {84247#(<= ~counter~0 9)} #96#return; {84247#(<= ~counter~0 9)} is VALID [2022-04-08 12:39:17,468 INFO L290 TraceCheckUtils]: 30: Hoare triple {83990#true} assume true; {83990#true} is VALID [2022-04-08 12:39:17,468 INFO L290 TraceCheckUtils]: 29: Hoare triple {83990#true} assume !(0 == ~cond); {83990#true} is VALID [2022-04-08 12:39:17,468 INFO L290 TraceCheckUtils]: 28: Hoare triple {83990#true} ~cond := #in~cond; {83990#true} is VALID [2022-04-08 12:39:17,468 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-08 12:39:17,468 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-08 12:39:17,469 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-08 12:39:17,470 INFO L290 TraceCheckUtils]: 24: Hoare triple {84222#(<= ~counter~0 8)} assume !!(0 != ~r~0); {84222#(<= ~counter~0 8)} is VALID [2022-04-08 12:39:17,470 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {83990#true} {84222#(<= ~counter~0 8)} #94#return; {84222#(<= ~counter~0 8)} is VALID [2022-04-08 12:39:17,470 INFO L290 TraceCheckUtils]: 22: Hoare triple {83990#true} assume true; {83990#true} is VALID [2022-04-08 12:39:17,470 INFO L290 TraceCheckUtils]: 21: Hoare triple {83990#true} assume !(0 == ~cond); {83990#true} is VALID [2022-04-08 12:39:17,470 INFO L290 TraceCheckUtils]: 20: Hoare triple {83990#true} ~cond := #in~cond; {83990#true} is VALID [2022-04-08 12:39:17,470 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-08 12:39:17,471 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-08 12:39:17,471 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-08 12:39:17,472 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-08 12:39:17,472 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {83990#true} {84197#(<= ~counter~0 7)} #92#return; {84197#(<= ~counter~0 7)} is VALID [2022-04-08 12:39:17,472 INFO L290 TraceCheckUtils]: 14: Hoare triple {83990#true} assume true; {83990#true} is VALID [2022-04-08 12:39:17,472 INFO L290 TraceCheckUtils]: 13: Hoare triple {83990#true} assume !(0 == ~cond); {83990#true} is VALID [2022-04-08 12:39:17,472 INFO L290 TraceCheckUtils]: 12: Hoare triple {83990#true} ~cond := #in~cond; {83990#true} is VALID [2022-04-08 12:39:17,472 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-08 12:39:17,473 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {83990#true} {84197#(<= ~counter~0 7)} #90#return; {84197#(<= ~counter~0 7)} is VALID [2022-04-08 12:39:17,473 INFO L290 TraceCheckUtils]: 9: Hoare triple {83990#true} assume true; {83990#true} is VALID [2022-04-08 12:39:17,473 INFO L290 TraceCheckUtils]: 8: Hoare triple {83990#true} assume !(0 == ~cond); {83990#true} is VALID [2022-04-08 12:39:17,473 INFO L290 TraceCheckUtils]: 7: Hoare triple {83990#true} ~cond := #in~cond; {83990#true} is VALID [2022-04-08 12:39:17,473 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-08 12:39:17,473 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-08 12:39:17,473 INFO L272 TraceCheckUtils]: 4: Hoare triple {84197#(<= ~counter~0 7)} call #t~ret9 := main(); {84197#(<= ~counter~0 7)} is VALID [2022-04-08 12:39:17,474 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {84197#(<= ~counter~0 7)} {83990#true} #102#return; {84197#(<= ~counter~0 7)} is VALID [2022-04-08 12:39:17,474 INFO L290 TraceCheckUtils]: 2: Hoare triple {84197#(<= ~counter~0 7)} assume true; {84197#(<= ~counter~0 7)} is VALID [2022-04-08 12:39:17,474 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-08 12:39:17,475 INFO L272 TraceCheckUtils]: 0: Hoare triple {83990#true} call ULTIMATE.init(); {83990#true} is VALID [2022-04-08 12:39:17,475 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-08 12:39:17,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:39:17,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861788329] [2022-04-08 12:39:17,475 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:39:17,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739310904] [2022-04-08 12:39:17,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1739310904] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:39:17,475 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:39:17,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 24 [2022-04-08 12:39:17,476 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:39:17,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1466522116] [2022-04-08 12:39:17,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1466522116] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:39:17,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:39:17,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 12:39:17,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197759545] [2022-04-08 12:39:17,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:39:17,476 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-08 12:39:17,476 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:39:17,476 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-08 12:39:17,586 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-08 12:39:17,587 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 12:39:17,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:39:17,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 12:39:17,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-08 12:39:17,587 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-08 12:39:20,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:39:20,530 INFO L93 Difference]: Finished difference Result 847 states and 1187 transitions. [2022-04-08 12:39:20,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-08 12:39:20,531 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-08 12:39:20,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:39:20,531 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-08 12:39:20,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 276 transitions. [2022-04-08 12:39:20,533 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-08 12:39:20,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 276 transitions. [2022-04-08 12:39:20,534 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 276 transitions. [2022-04-08 12:39:20,774 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-08 12:39:20,791 INFO L225 Difference]: With dead ends: 847 [2022-04-08 12:39:20,791 INFO L226 Difference]: Without dead ends: 650 [2022-04-08 12:39:20,792 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 222 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=478, Invalid=712, Unknown=0, NotChecked=0, Total=1190 [2022-04-08 12:39:20,793 INFO L913 BasicCegarLoop]: 66 mSDtfsCounter, 181 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-08 12:39:20,793 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [181 Valid, 297 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 12:39:20,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2022-04-08 12:39:22,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2022-04-08 12:39:22,671 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:39:22,672 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-08 12:39:22,672 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-08 12:39:22,673 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-08 12:39:22,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:39:22,687 INFO L93 Difference]: Finished difference Result 650 states and 879 transitions. [2022-04-08 12:39:22,687 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 879 transitions. [2022-04-08 12:39:22,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:39:22,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:39:22,688 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-08 12:39:22,689 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-08 12:39:22,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:39:22,707 INFO L93 Difference]: Finished difference Result 650 states and 879 transitions. [2022-04-08 12:39:22,707 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 879 transitions. [2022-04-08 12:39:22,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:39:22,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:39:22,708 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:39:22,708 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:39:22,709 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-08 12:39:22,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 879 transitions. [2022-04-08 12:39:22,737 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 879 transitions. Word has length 123 [2022-04-08 12:39:22,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:39:22,737 INFO L478 AbstractCegarLoop]: Abstraction has 650 states and 879 transitions. [2022-04-08 12:39:22,737 INFO L479 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-08 12:39:22,737 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 650 states and 879 transitions. [2022-04-08 12:39:26,408 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-08 12:39:26,408 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 879 transitions. [2022-04-08 12:39:26,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-04-08 12:39:26,409 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:39:26,409 INFO L499 BasicCegarLoop]: 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-08 12:39:26,425 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-08 12:39:26,622 WARN L460 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-08 12:39:26,622 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:39:26,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:39:26,622 INFO L85 PathProgramCache]: Analyzing trace with hash -992818924, now seen corresponding path program 9 times [2022-04-08 12:39:26,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:39:26,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1216801386] [2022-04-08 12:39:26,623 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:39:26,623 INFO L85 PathProgramCache]: Analyzing trace with hash -992818924, now seen corresponding path program 10 times [2022-04-08 12:39:26,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:39:26,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74583814] [2022-04-08 12:39:26,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:39:26,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:39:26,637 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:39:26,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [291155426] [2022-04-08 12:39:26,637 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 12:39:26,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:39:26,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:39:26,638 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-08 12:39:26,639 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-08 12:39:26,697 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 12:39:26,697 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:39:26,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-08 12:39:26,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:39:26,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:39:27,315 INFO L272 TraceCheckUtils]: 0: Hoare triple {89067#true} call ULTIMATE.init(); {89067#true} is VALID [2022-04-08 12:39:27,315 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-08 12:39:27,315 INFO L290 TraceCheckUtils]: 2: Hoare triple {89075#(<= ~counter~0 0)} assume true; {89075#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:27,316 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {89075#(<= ~counter~0 0)} {89067#true} #102#return; {89075#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:27,316 INFO L272 TraceCheckUtils]: 4: Hoare triple {89075#(<= ~counter~0 0)} call #t~ret9 := main(); {89075#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:27,316 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-08 12:39:27,317 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-08 12:39:27,317 INFO L290 TraceCheckUtils]: 7: Hoare triple {89075#(<= ~counter~0 0)} ~cond := #in~cond; {89075#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:27,317 INFO L290 TraceCheckUtils]: 8: Hoare triple {89075#(<= ~counter~0 0)} assume !(0 == ~cond); {89075#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:27,317 INFO L290 TraceCheckUtils]: 9: Hoare triple {89075#(<= ~counter~0 0)} assume true; {89075#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:27,318 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {89075#(<= ~counter~0 0)} {89075#(<= ~counter~0 0)} #90#return; {89075#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:27,318 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-08 12:39:27,319 INFO L290 TraceCheckUtils]: 12: Hoare triple {89075#(<= ~counter~0 0)} ~cond := #in~cond; {89075#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:27,319 INFO L290 TraceCheckUtils]: 13: Hoare triple {89075#(<= ~counter~0 0)} assume !(0 == ~cond); {89075#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:27,319 INFO L290 TraceCheckUtils]: 14: Hoare triple {89075#(<= ~counter~0 0)} assume true; {89075#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:27,319 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {89075#(<= ~counter~0 0)} {89075#(<= ~counter~0 0)} #92#return; {89075#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:27,320 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-08 12:39:27,322 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-08 12:39:27,322 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-08 12:39:27,322 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-08 12:39:27,323 INFO L290 TraceCheckUtils]: 20: Hoare triple {89124#(<= ~counter~0 1)} ~cond := #in~cond; {89124#(<= ~counter~0 1)} is VALID [2022-04-08 12:39:27,323 INFO L290 TraceCheckUtils]: 21: Hoare triple {89124#(<= ~counter~0 1)} assume !(0 == ~cond); {89124#(<= ~counter~0 1)} is VALID [2022-04-08 12:39:27,323 INFO L290 TraceCheckUtils]: 22: Hoare triple {89124#(<= ~counter~0 1)} assume true; {89124#(<= ~counter~0 1)} is VALID [2022-04-08 12:39:27,324 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {89124#(<= ~counter~0 1)} {89124#(<= ~counter~0 1)} #94#return; {89124#(<= ~counter~0 1)} is VALID [2022-04-08 12:39:27,324 INFO L290 TraceCheckUtils]: 24: Hoare triple {89124#(<= ~counter~0 1)} assume !!(0 != ~r~0); {89124#(<= ~counter~0 1)} is VALID [2022-04-08 12:39:27,325 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-08 12:39:27,325 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-08 12:39:27,326 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-08 12:39:27,326 INFO L290 TraceCheckUtils]: 28: Hoare triple {89149#(<= ~counter~0 2)} ~cond := #in~cond; {89149#(<= ~counter~0 2)} is VALID [2022-04-08 12:39:27,326 INFO L290 TraceCheckUtils]: 29: Hoare triple {89149#(<= ~counter~0 2)} assume !(0 == ~cond); {89149#(<= ~counter~0 2)} is VALID [2022-04-08 12:39:27,326 INFO L290 TraceCheckUtils]: 30: Hoare triple {89149#(<= ~counter~0 2)} assume true; {89149#(<= ~counter~0 2)} is VALID [2022-04-08 12:39:27,327 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {89149#(<= ~counter~0 2)} {89149#(<= ~counter~0 2)} #96#return; {89149#(<= ~counter~0 2)} is VALID [2022-04-08 12:39:27,327 INFO L290 TraceCheckUtils]: 32: Hoare triple {89149#(<= ~counter~0 2)} assume !(~r~0 > 0); {89149#(<= ~counter~0 2)} is VALID [2022-04-08 12:39:27,328 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-08 12:39:27,328 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-08 12:39:27,329 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-08 12:39:27,329 INFO L290 TraceCheckUtils]: 36: Hoare triple {89174#(<= ~counter~0 3)} ~cond := #in~cond; {89174#(<= ~counter~0 3)} is VALID [2022-04-08 12:39:27,329 INFO L290 TraceCheckUtils]: 37: Hoare triple {89174#(<= ~counter~0 3)} assume !(0 == ~cond); {89174#(<= ~counter~0 3)} is VALID [2022-04-08 12:39:27,329 INFO L290 TraceCheckUtils]: 38: Hoare triple {89174#(<= ~counter~0 3)} assume true; {89174#(<= ~counter~0 3)} is VALID [2022-04-08 12:39:27,330 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {89174#(<= ~counter~0 3)} {89174#(<= ~counter~0 3)} #98#return; {89174#(<= ~counter~0 3)} is VALID [2022-04-08 12:39:27,330 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-08 12:39:27,331 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-08 12:39:27,331 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-08 12:39:27,332 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-08 12:39:27,332 INFO L290 TraceCheckUtils]: 44: Hoare triple {89199#(<= ~counter~0 4)} ~cond := #in~cond; {89199#(<= ~counter~0 4)} is VALID [2022-04-08 12:39:27,332 INFO L290 TraceCheckUtils]: 45: Hoare triple {89199#(<= ~counter~0 4)} assume !(0 == ~cond); {89199#(<= ~counter~0 4)} is VALID [2022-04-08 12:39:27,333 INFO L290 TraceCheckUtils]: 46: Hoare triple {89199#(<= ~counter~0 4)} assume true; {89199#(<= ~counter~0 4)} is VALID [2022-04-08 12:39:27,333 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {89199#(<= ~counter~0 4)} {89199#(<= ~counter~0 4)} #98#return; {89199#(<= ~counter~0 4)} is VALID [2022-04-08 12:39:27,333 INFO L290 TraceCheckUtils]: 48: Hoare triple {89199#(<= ~counter~0 4)} assume !(~r~0 < 0); {89199#(<= ~counter~0 4)} is VALID [2022-04-08 12:39:27,334 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-08 12:39:27,334 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-08 12:39:27,335 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-08 12:39:27,335 INFO L290 TraceCheckUtils]: 52: Hoare triple {89224#(<= ~counter~0 5)} ~cond := #in~cond; {89224#(<= ~counter~0 5)} is VALID [2022-04-08 12:39:27,336 INFO L290 TraceCheckUtils]: 53: Hoare triple {89224#(<= ~counter~0 5)} assume !(0 == ~cond); {89224#(<= ~counter~0 5)} is VALID [2022-04-08 12:39:27,336 INFO L290 TraceCheckUtils]: 54: Hoare triple {89224#(<= ~counter~0 5)} assume true; {89224#(<= ~counter~0 5)} is VALID [2022-04-08 12:39:27,336 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {89224#(<= ~counter~0 5)} {89224#(<= ~counter~0 5)} #94#return; {89224#(<= ~counter~0 5)} is VALID [2022-04-08 12:39:27,337 INFO L290 TraceCheckUtils]: 56: Hoare triple {89224#(<= ~counter~0 5)} assume !!(0 != ~r~0); {89224#(<= ~counter~0 5)} is VALID [2022-04-08 12:39:27,337 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-08 12:39:27,338 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-08 12:39:27,338 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-08 12:39:27,338 INFO L290 TraceCheckUtils]: 60: Hoare triple {89249#(<= ~counter~0 6)} ~cond := #in~cond; {89249#(<= ~counter~0 6)} is VALID [2022-04-08 12:39:27,339 INFO L290 TraceCheckUtils]: 61: Hoare triple {89249#(<= ~counter~0 6)} assume !(0 == ~cond); {89249#(<= ~counter~0 6)} is VALID [2022-04-08 12:39:27,339 INFO L290 TraceCheckUtils]: 62: Hoare triple {89249#(<= ~counter~0 6)} assume true; {89249#(<= ~counter~0 6)} is VALID [2022-04-08 12:39:27,339 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {89249#(<= ~counter~0 6)} {89249#(<= ~counter~0 6)} #96#return; {89249#(<= ~counter~0 6)} is VALID [2022-04-08 12:39:27,340 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-08 12:39:27,341 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-08 12:39:27,341 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-08 12:39:27,341 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-08 12:39:27,342 INFO L290 TraceCheckUtils]: 68: Hoare triple {89274#(<= ~counter~0 7)} ~cond := #in~cond; {89274#(<= ~counter~0 7)} is VALID [2022-04-08 12:39:27,342 INFO L290 TraceCheckUtils]: 69: Hoare triple {89274#(<= ~counter~0 7)} assume !(0 == ~cond); {89274#(<= ~counter~0 7)} is VALID [2022-04-08 12:39:27,342 INFO L290 TraceCheckUtils]: 70: Hoare triple {89274#(<= ~counter~0 7)} assume true; {89274#(<= ~counter~0 7)} is VALID [2022-04-08 12:39:27,342 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {89274#(<= ~counter~0 7)} {89274#(<= ~counter~0 7)} #96#return; {89274#(<= ~counter~0 7)} is VALID [2022-04-08 12:39:27,343 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-08 12:39:27,344 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-08 12:39:27,344 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-08 12:39:27,344 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-08 12:39:27,345 INFO L290 TraceCheckUtils]: 76: Hoare triple {89299#(<= ~counter~0 8)} ~cond := #in~cond; {89299#(<= ~counter~0 8)} is VALID [2022-04-08 12:39:27,345 INFO L290 TraceCheckUtils]: 77: Hoare triple {89299#(<= ~counter~0 8)} assume !(0 == ~cond); {89299#(<= ~counter~0 8)} is VALID [2022-04-08 12:39:27,345 INFO L290 TraceCheckUtils]: 78: Hoare triple {89299#(<= ~counter~0 8)} assume true; {89299#(<= ~counter~0 8)} is VALID [2022-04-08 12:39:27,346 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {89299#(<= ~counter~0 8)} {89299#(<= ~counter~0 8)} #96#return; {89299#(<= ~counter~0 8)} is VALID [2022-04-08 12:39:27,346 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-08 12:39:27,347 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-08 12:39:27,347 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-08 12:39:27,347 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-08 12:39:27,348 INFO L290 TraceCheckUtils]: 84: Hoare triple {89324#(<= ~counter~0 9)} ~cond := #in~cond; {89324#(<= ~counter~0 9)} is VALID [2022-04-08 12:39:27,348 INFO L290 TraceCheckUtils]: 85: Hoare triple {89324#(<= ~counter~0 9)} assume !(0 == ~cond); {89324#(<= ~counter~0 9)} is VALID [2022-04-08 12:39:27,348 INFO L290 TraceCheckUtils]: 86: Hoare triple {89324#(<= ~counter~0 9)} assume true; {89324#(<= ~counter~0 9)} is VALID [2022-04-08 12:39:27,349 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {89324#(<= ~counter~0 9)} {89324#(<= ~counter~0 9)} #96#return; {89324#(<= ~counter~0 9)} is VALID [2022-04-08 12:39:27,349 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-08 12:39:27,350 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-08 12:39:27,350 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-08 12:39:27,350 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-08 12:39:27,351 INFO L290 TraceCheckUtils]: 92: Hoare triple {89349#(<= ~counter~0 10)} ~cond := #in~cond; {89349#(<= ~counter~0 10)} is VALID [2022-04-08 12:39:27,351 INFO L290 TraceCheckUtils]: 93: Hoare triple {89349#(<= ~counter~0 10)} assume !(0 == ~cond); {89349#(<= ~counter~0 10)} is VALID [2022-04-08 12:39:27,351 INFO L290 TraceCheckUtils]: 94: Hoare triple {89349#(<= ~counter~0 10)} assume true; {89349#(<= ~counter~0 10)} is VALID [2022-04-08 12:39:27,352 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {89349#(<= ~counter~0 10)} {89349#(<= ~counter~0 10)} #96#return; {89349#(<= ~counter~0 10)} is VALID [2022-04-08 12:39:27,352 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-08 12:39:27,353 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-08 12:39:27,353 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-08 12:39:27,354 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-08 12:39:27,354 INFO L290 TraceCheckUtils]: 100: Hoare triple {89374#(<= ~counter~0 11)} ~cond := #in~cond; {89374#(<= ~counter~0 11)} is VALID [2022-04-08 12:39:27,354 INFO L290 TraceCheckUtils]: 101: Hoare triple {89374#(<= ~counter~0 11)} assume !(0 == ~cond); {89374#(<= ~counter~0 11)} is VALID [2022-04-08 12:39:27,354 INFO L290 TraceCheckUtils]: 102: Hoare triple {89374#(<= ~counter~0 11)} assume true; {89374#(<= ~counter~0 11)} is VALID [2022-04-08 12:39:27,355 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {89374#(<= ~counter~0 11)} {89374#(<= ~counter~0 11)} #96#return; {89374#(<= ~counter~0 11)} is VALID [2022-04-08 12:39:27,355 INFO L290 TraceCheckUtils]: 104: Hoare triple {89374#(<= ~counter~0 11)} assume !(~r~0 > 0); {89374#(<= ~counter~0 11)} is VALID [2022-04-08 12:39:27,356 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-08 12:39:27,356 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-08 12:39:27,357 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-08 12:39:27,357 INFO L290 TraceCheckUtils]: 108: Hoare triple {89399#(<= ~counter~0 12)} ~cond := #in~cond; {89399#(<= ~counter~0 12)} is VALID [2022-04-08 12:39:27,357 INFO L290 TraceCheckUtils]: 109: Hoare triple {89399#(<= ~counter~0 12)} assume !(0 == ~cond); {89399#(<= ~counter~0 12)} is VALID [2022-04-08 12:39:27,358 INFO L290 TraceCheckUtils]: 110: Hoare triple {89399#(<= ~counter~0 12)} assume true; {89399#(<= ~counter~0 12)} is VALID [2022-04-08 12:39:27,358 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {89399#(<= ~counter~0 12)} {89399#(<= ~counter~0 12)} #98#return; {89399#(<= ~counter~0 12)} is VALID [2022-04-08 12:39:27,358 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-08 12:39:27,360 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-08 12:39:27,360 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-08 12:39:27,360 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-08 12:39:27,361 INFO L290 TraceCheckUtils]: 116: Hoare triple {89424#(<= ~counter~0 13)} ~cond := #in~cond; {89424#(<= ~counter~0 13)} is VALID [2022-04-08 12:39:27,361 INFO L290 TraceCheckUtils]: 117: Hoare triple {89424#(<= ~counter~0 13)} assume !(0 == ~cond); {89424#(<= ~counter~0 13)} is VALID [2022-04-08 12:39:27,361 INFO L290 TraceCheckUtils]: 118: Hoare triple {89424#(<= ~counter~0 13)} assume true; {89424#(<= ~counter~0 13)} is VALID [2022-04-08 12:39:27,362 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {89424#(<= ~counter~0 13)} {89424#(<= ~counter~0 13)} #98#return; {89424#(<= ~counter~0 13)} is VALID [2022-04-08 12:39:27,362 INFO L290 TraceCheckUtils]: 120: Hoare triple {89424#(<= ~counter~0 13)} assume !(~r~0 < 0); {89424#(<= ~counter~0 13)} is VALID [2022-04-08 12:39:27,362 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-08 12:39:27,362 INFO L290 TraceCheckUtils]: 122: Hoare triple {89449#(<= |main_#t~post6| 13)} assume !(#t~post6 < 20);havoc #t~post6; {89068#false} is VALID [2022-04-08 12:39:27,363 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-08 12:39:27,363 INFO L290 TraceCheckUtils]: 124: Hoare triple {89068#false} ~cond := #in~cond; {89068#false} is VALID [2022-04-08 12:39:27,363 INFO L290 TraceCheckUtils]: 125: Hoare triple {89068#false} assume 0 == ~cond; {89068#false} is VALID [2022-04-08 12:39:27,363 INFO L290 TraceCheckUtils]: 126: Hoare triple {89068#false} assume !false; {89068#false} is VALID [2022-04-08 12:39:27,363 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-08 12:39:27,363 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:39:27,957 INFO L290 TraceCheckUtils]: 126: Hoare triple {89068#false} assume !false; {89068#false} is VALID [2022-04-08 12:39:27,957 INFO L290 TraceCheckUtils]: 125: Hoare triple {89068#false} assume 0 == ~cond; {89068#false} is VALID [2022-04-08 12:39:27,957 INFO L290 TraceCheckUtils]: 124: Hoare triple {89068#false} ~cond := #in~cond; {89068#false} is VALID [2022-04-08 12:39:27,957 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-08 12:39:27,958 INFO L290 TraceCheckUtils]: 122: Hoare triple {89477#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {89068#false} is VALID [2022-04-08 12:39:27,958 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-08 12:39:27,958 INFO L290 TraceCheckUtils]: 120: Hoare triple {89481#(< ~counter~0 20)} assume !(~r~0 < 0); {89481#(< ~counter~0 20)} is VALID [2022-04-08 12:39:27,959 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {89067#true} {89481#(< ~counter~0 20)} #98#return; {89481#(< ~counter~0 20)} is VALID [2022-04-08 12:39:27,959 INFO L290 TraceCheckUtils]: 118: Hoare triple {89067#true} assume true; {89067#true} is VALID [2022-04-08 12:39:27,959 INFO L290 TraceCheckUtils]: 117: Hoare triple {89067#true} assume !(0 == ~cond); {89067#true} is VALID [2022-04-08 12:39:27,959 INFO L290 TraceCheckUtils]: 116: Hoare triple {89067#true} ~cond := #in~cond; {89067#true} is VALID [2022-04-08 12:39:27,959 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-08 12:39:27,959 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-08 12:39:27,961 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-08 12:39:27,962 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-08 12:39:27,962 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {89067#true} {89506#(< ~counter~0 19)} #98#return; {89506#(< ~counter~0 19)} is VALID [2022-04-08 12:39:27,962 INFO L290 TraceCheckUtils]: 110: Hoare triple {89067#true} assume true; {89067#true} is VALID [2022-04-08 12:39:27,962 INFO L290 TraceCheckUtils]: 109: Hoare triple {89067#true} assume !(0 == ~cond); {89067#true} is VALID [2022-04-08 12:39:27,962 INFO L290 TraceCheckUtils]: 108: Hoare triple {89067#true} ~cond := #in~cond; {89067#true} is VALID [2022-04-08 12:39:27,962 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-08 12:39:27,963 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-08 12:39:27,964 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-08 12:39:27,964 INFO L290 TraceCheckUtils]: 104: Hoare triple {89531#(< ~counter~0 18)} assume !(~r~0 > 0); {89531#(< ~counter~0 18)} is VALID [2022-04-08 12:39:27,964 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {89067#true} {89531#(< ~counter~0 18)} #96#return; {89531#(< ~counter~0 18)} is VALID [2022-04-08 12:39:27,964 INFO L290 TraceCheckUtils]: 102: Hoare triple {89067#true} assume true; {89067#true} is VALID [2022-04-08 12:39:27,964 INFO L290 TraceCheckUtils]: 101: Hoare triple {89067#true} assume !(0 == ~cond); {89067#true} is VALID [2022-04-08 12:39:27,964 INFO L290 TraceCheckUtils]: 100: Hoare triple {89067#true} ~cond := #in~cond; {89067#true} is VALID [2022-04-08 12:39:27,965 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-08 12:39:27,965 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-08 12:39:27,966 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-08 12:39:27,966 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-08 12:39:27,966 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {89067#true} {89556#(< ~counter~0 17)} #96#return; {89556#(< ~counter~0 17)} is VALID [2022-04-08 12:39:27,966 INFO L290 TraceCheckUtils]: 94: Hoare triple {89067#true} assume true; {89067#true} is VALID [2022-04-08 12:39:27,967 INFO L290 TraceCheckUtils]: 93: Hoare triple {89067#true} assume !(0 == ~cond); {89067#true} is VALID [2022-04-08 12:39:27,967 INFO L290 TraceCheckUtils]: 92: Hoare triple {89067#true} ~cond := #in~cond; {89067#true} is VALID [2022-04-08 12:39:27,967 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-08 12:39:27,967 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-08 12:39:27,968 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-08 12:39:27,968 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-08 12:39:27,969 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {89067#true} {89581#(< ~counter~0 16)} #96#return; {89581#(< ~counter~0 16)} is VALID [2022-04-08 12:39:27,969 INFO L290 TraceCheckUtils]: 86: Hoare triple {89067#true} assume true; {89067#true} is VALID [2022-04-08 12:39:27,969 INFO L290 TraceCheckUtils]: 85: Hoare triple {89067#true} assume !(0 == ~cond); {89067#true} is VALID [2022-04-08 12:39:27,969 INFO L290 TraceCheckUtils]: 84: Hoare triple {89067#true} ~cond := #in~cond; {89067#true} is VALID [2022-04-08 12:39:27,969 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-08 12:39:27,969 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-08 12:39:27,970 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-08 12:39:27,970 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-08 12:39:27,971 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {89067#true} {89606#(< ~counter~0 15)} #96#return; {89606#(< ~counter~0 15)} is VALID [2022-04-08 12:39:27,971 INFO L290 TraceCheckUtils]: 78: Hoare triple {89067#true} assume true; {89067#true} is VALID [2022-04-08 12:39:27,971 INFO L290 TraceCheckUtils]: 77: Hoare triple {89067#true} assume !(0 == ~cond); {89067#true} is VALID [2022-04-08 12:39:27,971 INFO L290 TraceCheckUtils]: 76: Hoare triple {89067#true} ~cond := #in~cond; {89067#true} is VALID [2022-04-08 12:39:27,971 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-08 12:39:27,971 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-08 12:39:27,972 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-08 12:39:27,972 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-08 12:39:27,973 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {89067#true} {89424#(<= ~counter~0 13)} #96#return; {89424#(<= ~counter~0 13)} is VALID [2022-04-08 12:39:27,973 INFO L290 TraceCheckUtils]: 70: Hoare triple {89067#true} assume true; {89067#true} is VALID [2022-04-08 12:39:27,973 INFO L290 TraceCheckUtils]: 69: Hoare triple {89067#true} assume !(0 == ~cond); {89067#true} is VALID [2022-04-08 12:39:27,973 INFO L290 TraceCheckUtils]: 68: Hoare triple {89067#true} ~cond := #in~cond; {89067#true} is VALID [2022-04-08 12:39:27,973 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-08 12:39:27,973 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-08 12:39:27,974 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-08 12:39:27,975 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-08 12:39:27,975 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {89067#true} {89399#(<= ~counter~0 12)} #96#return; {89399#(<= ~counter~0 12)} is VALID [2022-04-08 12:39:27,975 INFO L290 TraceCheckUtils]: 62: Hoare triple {89067#true} assume true; {89067#true} is VALID [2022-04-08 12:39:27,975 INFO L290 TraceCheckUtils]: 61: Hoare triple {89067#true} assume !(0 == ~cond); {89067#true} is VALID [2022-04-08 12:39:27,975 INFO L290 TraceCheckUtils]: 60: Hoare triple {89067#true} ~cond := #in~cond; {89067#true} is VALID [2022-04-08 12:39:27,975 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-08 12:39:27,976 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-08 12:39:27,977 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-08 12:39:27,977 INFO L290 TraceCheckUtils]: 56: Hoare triple {89374#(<= ~counter~0 11)} assume !!(0 != ~r~0); {89374#(<= ~counter~0 11)} is VALID [2022-04-08 12:39:27,977 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {89067#true} {89374#(<= ~counter~0 11)} #94#return; {89374#(<= ~counter~0 11)} is VALID [2022-04-08 12:39:27,977 INFO L290 TraceCheckUtils]: 54: Hoare triple {89067#true} assume true; {89067#true} is VALID [2022-04-08 12:39:27,977 INFO L290 TraceCheckUtils]: 53: Hoare triple {89067#true} assume !(0 == ~cond); {89067#true} is VALID [2022-04-08 12:39:27,978 INFO L290 TraceCheckUtils]: 52: Hoare triple {89067#true} ~cond := #in~cond; {89067#true} is VALID [2022-04-08 12:39:27,978 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-08 12:39:27,978 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-08 12:39:27,979 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-08 12:39:27,979 INFO L290 TraceCheckUtils]: 48: Hoare triple {89349#(<= ~counter~0 10)} assume !(~r~0 < 0); {89349#(<= ~counter~0 10)} is VALID [2022-04-08 12:39:27,979 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {89067#true} {89349#(<= ~counter~0 10)} #98#return; {89349#(<= ~counter~0 10)} is VALID [2022-04-08 12:39:27,980 INFO L290 TraceCheckUtils]: 46: Hoare triple {89067#true} assume true; {89067#true} is VALID [2022-04-08 12:39:27,980 INFO L290 TraceCheckUtils]: 45: Hoare triple {89067#true} assume !(0 == ~cond); {89067#true} is VALID [2022-04-08 12:39:27,980 INFO L290 TraceCheckUtils]: 44: Hoare triple {89067#true} ~cond := #in~cond; {89067#true} is VALID [2022-04-08 12:39:27,980 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-08 12:39:27,980 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-08 12:39:27,981 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-08 12:39:27,981 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-08 12:39:27,982 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {89067#true} {89324#(<= ~counter~0 9)} #98#return; {89324#(<= ~counter~0 9)} is VALID [2022-04-08 12:39:27,982 INFO L290 TraceCheckUtils]: 38: Hoare triple {89067#true} assume true; {89067#true} is VALID [2022-04-08 12:39:27,982 INFO L290 TraceCheckUtils]: 37: Hoare triple {89067#true} assume !(0 == ~cond); {89067#true} is VALID [2022-04-08 12:39:27,982 INFO L290 TraceCheckUtils]: 36: Hoare triple {89067#true} ~cond := #in~cond; {89067#true} is VALID [2022-04-08 12:39:27,982 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-08 12:39:27,982 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-08 12:39:27,989 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-08 12:39:27,990 INFO L290 TraceCheckUtils]: 32: Hoare triple {89299#(<= ~counter~0 8)} assume !(~r~0 > 0); {89299#(<= ~counter~0 8)} is VALID [2022-04-08 12:39:27,991 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {89067#true} {89299#(<= ~counter~0 8)} #96#return; {89299#(<= ~counter~0 8)} is VALID [2022-04-08 12:39:27,991 INFO L290 TraceCheckUtils]: 30: Hoare triple {89067#true} assume true; {89067#true} is VALID [2022-04-08 12:39:27,991 INFO L290 TraceCheckUtils]: 29: Hoare triple {89067#true} assume !(0 == ~cond); {89067#true} is VALID [2022-04-08 12:39:27,991 INFO L290 TraceCheckUtils]: 28: Hoare triple {89067#true} ~cond := #in~cond; {89067#true} is VALID [2022-04-08 12:39:27,991 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-08 12:39:27,991 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-08 12:39:27,992 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-08 12:39:27,992 INFO L290 TraceCheckUtils]: 24: Hoare triple {89274#(<= ~counter~0 7)} assume !!(0 != ~r~0); {89274#(<= ~counter~0 7)} is VALID [2022-04-08 12:39:27,993 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {89067#true} {89274#(<= ~counter~0 7)} #94#return; {89274#(<= ~counter~0 7)} is VALID [2022-04-08 12:39:27,993 INFO L290 TraceCheckUtils]: 22: Hoare triple {89067#true} assume true; {89067#true} is VALID [2022-04-08 12:39:27,993 INFO L290 TraceCheckUtils]: 21: Hoare triple {89067#true} assume !(0 == ~cond); {89067#true} is VALID [2022-04-08 12:39:27,993 INFO L290 TraceCheckUtils]: 20: Hoare triple {89067#true} ~cond := #in~cond; {89067#true} is VALID [2022-04-08 12:39:27,993 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-08 12:39:27,993 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-08 12:39:27,994 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-08 12:39:27,995 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-08 12:39:27,995 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {89067#true} {89249#(<= ~counter~0 6)} #92#return; {89249#(<= ~counter~0 6)} is VALID [2022-04-08 12:39:27,995 INFO L290 TraceCheckUtils]: 14: Hoare triple {89067#true} assume true; {89067#true} is VALID [2022-04-08 12:39:27,995 INFO L290 TraceCheckUtils]: 13: Hoare triple {89067#true} assume !(0 == ~cond); {89067#true} is VALID [2022-04-08 12:39:27,995 INFO L290 TraceCheckUtils]: 12: Hoare triple {89067#true} ~cond := #in~cond; {89067#true} is VALID [2022-04-08 12:39:27,995 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-08 12:39:27,996 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {89067#true} {89249#(<= ~counter~0 6)} #90#return; {89249#(<= ~counter~0 6)} is VALID [2022-04-08 12:39:27,996 INFO L290 TraceCheckUtils]: 9: Hoare triple {89067#true} assume true; {89067#true} is VALID [2022-04-08 12:39:27,996 INFO L290 TraceCheckUtils]: 8: Hoare triple {89067#true} assume !(0 == ~cond); {89067#true} is VALID [2022-04-08 12:39:27,996 INFO L290 TraceCheckUtils]: 7: Hoare triple {89067#true} ~cond := #in~cond; {89067#true} is VALID [2022-04-08 12:39:27,996 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-08 12:39:27,996 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-08 12:39:27,997 INFO L272 TraceCheckUtils]: 4: Hoare triple {89249#(<= ~counter~0 6)} call #t~ret9 := main(); {89249#(<= ~counter~0 6)} is VALID [2022-04-08 12:39:27,997 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {89249#(<= ~counter~0 6)} {89067#true} #102#return; {89249#(<= ~counter~0 6)} is VALID [2022-04-08 12:39:27,997 INFO L290 TraceCheckUtils]: 2: Hoare triple {89249#(<= ~counter~0 6)} assume true; {89249#(<= ~counter~0 6)} is VALID [2022-04-08 12:39:27,998 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-08 12:39:27,998 INFO L272 TraceCheckUtils]: 0: Hoare triple {89067#true} call ULTIMATE.init(); {89067#true} is VALID [2022-04-08 12:39:27,998 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-08 12:39:27,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:39:27,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74583814] [2022-04-08 12:39:27,998 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:39:27,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [291155426] [2022-04-08 12:39:27,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [291155426] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:39:27,999 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:39:27,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 24 [2022-04-08 12:39:27,999 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:39:27,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1216801386] [2022-04-08 12:39:27,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1216801386] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:39:27,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:39:27,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-08 12:39:27,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581588265] [2022-04-08 12:39:27,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:39:28,000 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-08 12:39:28,000 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:39:28,000 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-08 12:39:28,110 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-08 12:39:28,111 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-08 12:39:28,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:39:28,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-08 12:39:28,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-08 12:39:28,111 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-08 12:39:31,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:39:31,344 INFO L93 Difference]: Finished difference Result 705 states and 956 transitions. [2022-04-08 12:39:31,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-08 12:39:31,344 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-08 12:39:31,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:39:31,345 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-08 12:39:31,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 274 transitions. [2022-04-08 12:39:31,346 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-08 12:39:31,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 274 transitions. [2022-04-08 12:39:31,348 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 274 transitions. [2022-04-08 12:39:31,588 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-08 12:39:31,607 INFO L225 Difference]: With dead ends: 705 [2022-04-08 12:39:31,607 INFO L226 Difference]: Without dead ends: 694 [2022-04-08 12:39:31,608 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 230 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=439, Invalid=683, Unknown=0, NotChecked=0, Total=1122 [2022-04-08 12:39:31,608 INFO L913 BasicCegarLoop]: 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-08 12:39:31,608 INFO L914 BasicCegarLoop]: 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-08 12:39:31,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2022-04-08 12:39:33,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 672. [2022-04-08 12:39:33,537 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:39:33,537 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-08 12:39:33,538 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-08 12:39:33,538 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-08 12:39:33,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:39:33,554 INFO L93 Difference]: Finished difference Result 694 states and 940 transitions. [2022-04-08 12:39:33,554 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 940 transitions. [2022-04-08 12:39:33,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:39:33,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:39:33,555 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-08 12:39:33,556 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-08 12:39:33,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:39:33,571 INFO L93 Difference]: Finished difference Result 694 states and 940 transitions. [2022-04-08 12:39:33,571 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 940 transitions. [2022-04-08 12:39:33,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:39:33,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:39:33,572 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:39:33,572 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:39:33,573 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-08 12:39:33,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 914 transitions. [2022-04-08 12:39:33,597 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 914 transitions. Word has length 127 [2022-04-08 12:39:33,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:39:33,598 INFO L478 AbstractCegarLoop]: Abstraction has 672 states and 914 transitions. [2022-04-08 12:39:33,598 INFO L479 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-08 12:39:33,598 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 672 states and 914 transitions. [2022-04-08 12:39:37,103 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 914 edges. 914 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:39:37,103 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 914 transitions. [2022-04-08 12:39:37,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-04-08 12:39:37,104 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:39:37,104 INFO L499 BasicCegarLoop]: 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-08 12:39:37,124 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-08 12:39:37,307 WARN L460 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-08 12:39:37,307 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:39:37,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:39:37,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1410231607, now seen corresponding path program 19 times [2022-04-08 12:39:37,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:39:37,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [701347976] [2022-04-08 12:39:37,308 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:39:37,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1410231607, now seen corresponding path program 20 times [2022-04-08 12:39:37,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:39:37,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863819733] [2022-04-08 12:39:37,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:39:37,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:39:37,327 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:39:37,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [115473906] [2022-04-08 12:39:37,327 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:39:37,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:39:37,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:39:37,328 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-08 12:39:37,333 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-08 12:39:37,391 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:39:37,391 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:39:37,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-08 12:39:37,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:39:37,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:39:38,027 INFO L272 TraceCheckUtils]: 0: Hoare triple {94014#true} call ULTIMATE.init(); {94014#true} is VALID [2022-04-08 12:39:38,028 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-08 12:39:38,028 INFO L290 TraceCheckUtils]: 2: Hoare triple {94022#(<= ~counter~0 0)} assume true; {94022#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:38,028 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {94022#(<= ~counter~0 0)} {94014#true} #102#return; {94022#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:38,029 INFO L272 TraceCheckUtils]: 4: Hoare triple {94022#(<= ~counter~0 0)} call #t~ret9 := main(); {94022#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:38,029 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-08 12:39:38,029 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-08 12:39:38,030 INFO L290 TraceCheckUtils]: 7: Hoare triple {94022#(<= ~counter~0 0)} ~cond := #in~cond; {94022#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:38,030 INFO L290 TraceCheckUtils]: 8: Hoare triple {94022#(<= ~counter~0 0)} assume !(0 == ~cond); {94022#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:38,030 INFO L290 TraceCheckUtils]: 9: Hoare triple {94022#(<= ~counter~0 0)} assume true; {94022#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:38,030 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {94022#(<= ~counter~0 0)} {94022#(<= ~counter~0 0)} #90#return; {94022#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:38,031 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-08 12:39:38,031 INFO L290 TraceCheckUtils]: 12: Hoare triple {94022#(<= ~counter~0 0)} ~cond := #in~cond; {94022#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:38,031 INFO L290 TraceCheckUtils]: 13: Hoare triple {94022#(<= ~counter~0 0)} assume !(0 == ~cond); {94022#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:38,032 INFO L290 TraceCheckUtils]: 14: Hoare triple {94022#(<= ~counter~0 0)} assume true; {94022#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:38,032 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {94022#(<= ~counter~0 0)} {94022#(<= ~counter~0 0)} #92#return; {94022#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:38,032 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-08 12:39:38,034 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-08 12:39:38,034 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-08 12:39:38,035 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-08 12:39:38,035 INFO L290 TraceCheckUtils]: 20: Hoare triple {94071#(<= ~counter~0 1)} ~cond := #in~cond; {94071#(<= ~counter~0 1)} is VALID [2022-04-08 12:39:38,036 INFO L290 TraceCheckUtils]: 21: Hoare triple {94071#(<= ~counter~0 1)} assume !(0 == ~cond); {94071#(<= ~counter~0 1)} is VALID [2022-04-08 12:39:38,036 INFO L290 TraceCheckUtils]: 22: Hoare triple {94071#(<= ~counter~0 1)} assume true; {94071#(<= ~counter~0 1)} is VALID [2022-04-08 12:39:38,036 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {94071#(<= ~counter~0 1)} {94071#(<= ~counter~0 1)} #94#return; {94071#(<= ~counter~0 1)} is VALID [2022-04-08 12:39:38,037 INFO L290 TraceCheckUtils]: 24: Hoare triple {94071#(<= ~counter~0 1)} assume !!(0 != ~r~0); {94071#(<= ~counter~0 1)} is VALID [2022-04-08 12:39:38,038 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-08 12:39:38,038 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-08 12:39:38,038 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-08 12:39:38,039 INFO L290 TraceCheckUtils]: 28: Hoare triple {94096#(<= ~counter~0 2)} ~cond := #in~cond; {94096#(<= ~counter~0 2)} is VALID [2022-04-08 12:39:38,039 INFO L290 TraceCheckUtils]: 29: Hoare triple {94096#(<= ~counter~0 2)} assume !(0 == ~cond); {94096#(<= ~counter~0 2)} is VALID [2022-04-08 12:39:38,039 INFO L290 TraceCheckUtils]: 30: Hoare triple {94096#(<= ~counter~0 2)} assume true; {94096#(<= ~counter~0 2)} is VALID [2022-04-08 12:39:38,040 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {94096#(<= ~counter~0 2)} {94096#(<= ~counter~0 2)} #96#return; {94096#(<= ~counter~0 2)} is VALID [2022-04-08 12:39:38,040 INFO L290 TraceCheckUtils]: 32: Hoare triple {94096#(<= ~counter~0 2)} assume !(~r~0 > 0); {94096#(<= ~counter~0 2)} is VALID [2022-04-08 12:39:38,041 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-08 12:39:38,041 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-08 12:39:38,042 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-08 12:39:38,042 INFO L290 TraceCheckUtils]: 36: Hoare triple {94121#(<= ~counter~0 3)} ~cond := #in~cond; {94121#(<= ~counter~0 3)} is VALID [2022-04-08 12:39:38,042 INFO L290 TraceCheckUtils]: 37: Hoare triple {94121#(<= ~counter~0 3)} assume !(0 == ~cond); {94121#(<= ~counter~0 3)} is VALID [2022-04-08 12:39:38,043 INFO L290 TraceCheckUtils]: 38: Hoare triple {94121#(<= ~counter~0 3)} assume true; {94121#(<= ~counter~0 3)} is VALID [2022-04-08 12:39:38,043 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {94121#(<= ~counter~0 3)} {94121#(<= ~counter~0 3)} #98#return; {94121#(<= ~counter~0 3)} is VALID [2022-04-08 12:39:38,043 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-08 12:39:38,044 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-08 12:39:38,045 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-08 12:39:38,045 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-08 12:39:38,045 INFO L290 TraceCheckUtils]: 44: Hoare triple {94146#(<= ~counter~0 4)} ~cond := #in~cond; {94146#(<= ~counter~0 4)} is VALID [2022-04-08 12:39:38,046 INFO L290 TraceCheckUtils]: 45: Hoare triple {94146#(<= ~counter~0 4)} assume !(0 == ~cond); {94146#(<= ~counter~0 4)} is VALID [2022-04-08 12:39:38,046 INFO L290 TraceCheckUtils]: 46: Hoare triple {94146#(<= ~counter~0 4)} assume true; {94146#(<= ~counter~0 4)} is VALID [2022-04-08 12:39:38,046 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {94146#(<= ~counter~0 4)} {94146#(<= ~counter~0 4)} #98#return; {94146#(<= ~counter~0 4)} is VALID [2022-04-08 12:39:38,046 INFO L290 TraceCheckUtils]: 48: Hoare triple {94146#(<= ~counter~0 4)} assume !(~r~0 < 0); {94146#(<= ~counter~0 4)} is VALID [2022-04-08 12:39:38,047 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-08 12:39:38,048 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-08 12:39:38,048 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-08 12:39:38,048 INFO L290 TraceCheckUtils]: 52: Hoare triple {94171#(<= ~counter~0 5)} ~cond := #in~cond; {94171#(<= ~counter~0 5)} is VALID [2022-04-08 12:39:38,049 INFO L290 TraceCheckUtils]: 53: Hoare triple {94171#(<= ~counter~0 5)} assume !(0 == ~cond); {94171#(<= ~counter~0 5)} is VALID [2022-04-08 12:39:38,049 INFO L290 TraceCheckUtils]: 54: Hoare triple {94171#(<= ~counter~0 5)} assume true; {94171#(<= ~counter~0 5)} is VALID [2022-04-08 12:39:38,049 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {94171#(<= ~counter~0 5)} {94171#(<= ~counter~0 5)} #94#return; {94171#(<= ~counter~0 5)} is VALID [2022-04-08 12:39:38,050 INFO L290 TraceCheckUtils]: 56: Hoare triple {94171#(<= ~counter~0 5)} assume !!(0 != ~r~0); {94171#(<= ~counter~0 5)} is VALID [2022-04-08 12:39:38,050 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-08 12:39:38,051 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-08 12:39:38,051 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-08 12:39:38,051 INFO L290 TraceCheckUtils]: 60: Hoare triple {94196#(<= ~counter~0 6)} ~cond := #in~cond; {94196#(<= ~counter~0 6)} is VALID [2022-04-08 12:39:38,052 INFO L290 TraceCheckUtils]: 61: Hoare triple {94196#(<= ~counter~0 6)} assume !(0 == ~cond); {94196#(<= ~counter~0 6)} is VALID [2022-04-08 12:39:38,052 INFO L290 TraceCheckUtils]: 62: Hoare triple {94196#(<= ~counter~0 6)} assume true; {94196#(<= ~counter~0 6)} is VALID [2022-04-08 12:39:38,052 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {94196#(<= ~counter~0 6)} {94196#(<= ~counter~0 6)} #96#return; {94196#(<= ~counter~0 6)} is VALID [2022-04-08 12:39:38,053 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-08 12:39:38,053 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-08 12:39:38,054 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-08 12:39:38,054 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-08 12:39:38,054 INFO L290 TraceCheckUtils]: 68: Hoare triple {94221#(<= ~counter~0 7)} ~cond := #in~cond; {94221#(<= ~counter~0 7)} is VALID [2022-04-08 12:39:38,055 INFO L290 TraceCheckUtils]: 69: Hoare triple {94221#(<= ~counter~0 7)} assume !(0 == ~cond); {94221#(<= ~counter~0 7)} is VALID [2022-04-08 12:39:38,055 INFO L290 TraceCheckUtils]: 70: Hoare triple {94221#(<= ~counter~0 7)} assume true; {94221#(<= ~counter~0 7)} is VALID [2022-04-08 12:39:38,055 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {94221#(<= ~counter~0 7)} {94221#(<= ~counter~0 7)} #96#return; {94221#(<= ~counter~0 7)} is VALID [2022-04-08 12:39:38,056 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-08 12:39:38,057 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-08 12:39:38,057 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-08 12:39:38,057 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-08 12:39:38,058 INFO L290 TraceCheckUtils]: 76: Hoare triple {94246#(<= ~counter~0 8)} ~cond := #in~cond; {94246#(<= ~counter~0 8)} is VALID [2022-04-08 12:39:38,058 INFO L290 TraceCheckUtils]: 77: Hoare triple {94246#(<= ~counter~0 8)} assume !(0 == ~cond); {94246#(<= ~counter~0 8)} is VALID [2022-04-08 12:39:38,058 INFO L290 TraceCheckUtils]: 78: Hoare triple {94246#(<= ~counter~0 8)} assume true; {94246#(<= ~counter~0 8)} is VALID [2022-04-08 12:39:38,059 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {94246#(<= ~counter~0 8)} {94246#(<= ~counter~0 8)} #96#return; {94246#(<= ~counter~0 8)} is VALID [2022-04-08 12:39:38,059 INFO L290 TraceCheckUtils]: 80: Hoare triple {94246#(<= ~counter~0 8)} assume !(~r~0 > 0); {94246#(<= ~counter~0 8)} is VALID [2022-04-08 12:39:38,060 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-08 12:39:38,060 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-08 12:39:38,061 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-08 12:39:38,061 INFO L290 TraceCheckUtils]: 84: Hoare triple {94271#(<= ~counter~0 9)} ~cond := #in~cond; {94271#(<= ~counter~0 9)} is VALID [2022-04-08 12:39:38,061 INFO L290 TraceCheckUtils]: 85: Hoare triple {94271#(<= ~counter~0 9)} assume !(0 == ~cond); {94271#(<= ~counter~0 9)} is VALID [2022-04-08 12:39:38,061 INFO L290 TraceCheckUtils]: 86: Hoare triple {94271#(<= ~counter~0 9)} assume true; {94271#(<= ~counter~0 9)} is VALID [2022-04-08 12:39:38,062 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {94271#(<= ~counter~0 9)} {94271#(<= ~counter~0 9)} #98#return; {94271#(<= ~counter~0 9)} is VALID [2022-04-08 12:39:38,062 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-08 12:39:38,063 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-08 12:39:38,063 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-08 12:39:38,064 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-08 12:39:38,064 INFO L290 TraceCheckUtils]: 92: Hoare triple {94296#(<= ~counter~0 10)} ~cond := #in~cond; {94296#(<= ~counter~0 10)} is VALID [2022-04-08 12:39:38,064 INFO L290 TraceCheckUtils]: 93: Hoare triple {94296#(<= ~counter~0 10)} assume !(0 == ~cond); {94296#(<= ~counter~0 10)} is VALID [2022-04-08 12:39:38,064 INFO L290 TraceCheckUtils]: 94: Hoare triple {94296#(<= ~counter~0 10)} assume true; {94296#(<= ~counter~0 10)} is VALID [2022-04-08 12:39:38,065 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {94296#(<= ~counter~0 10)} {94296#(<= ~counter~0 10)} #98#return; {94296#(<= ~counter~0 10)} is VALID [2022-04-08 12:39:38,065 INFO L290 TraceCheckUtils]: 96: Hoare triple {94296#(<= ~counter~0 10)} assume !(~r~0 < 0); {94296#(<= ~counter~0 10)} is VALID [2022-04-08 12:39:38,066 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-08 12:39:38,066 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-08 12:39:38,067 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-08 12:39:38,067 INFO L290 TraceCheckUtils]: 100: Hoare triple {94321#(<= ~counter~0 11)} ~cond := #in~cond; {94321#(<= ~counter~0 11)} is VALID [2022-04-08 12:39:38,067 INFO L290 TraceCheckUtils]: 101: Hoare triple {94321#(<= ~counter~0 11)} assume !(0 == ~cond); {94321#(<= ~counter~0 11)} is VALID [2022-04-08 12:39:38,068 INFO L290 TraceCheckUtils]: 102: Hoare triple {94321#(<= ~counter~0 11)} assume true; {94321#(<= ~counter~0 11)} is VALID [2022-04-08 12:39:38,068 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {94321#(<= ~counter~0 11)} {94321#(<= ~counter~0 11)} #94#return; {94321#(<= ~counter~0 11)} is VALID [2022-04-08 12:39:38,068 INFO L290 TraceCheckUtils]: 104: Hoare triple {94321#(<= ~counter~0 11)} assume !!(0 != ~r~0); {94321#(<= ~counter~0 11)} is VALID [2022-04-08 12:39:38,069 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-08 12:39:38,070 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-08 12:39:38,070 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-08 12:39:38,070 INFO L290 TraceCheckUtils]: 108: Hoare triple {94346#(<= ~counter~0 12)} ~cond := #in~cond; {94346#(<= ~counter~0 12)} is VALID [2022-04-08 12:39:38,071 INFO L290 TraceCheckUtils]: 109: Hoare triple {94346#(<= ~counter~0 12)} assume !(0 == ~cond); {94346#(<= ~counter~0 12)} is VALID [2022-04-08 12:39:38,071 INFO L290 TraceCheckUtils]: 110: Hoare triple {94346#(<= ~counter~0 12)} assume true; {94346#(<= ~counter~0 12)} is VALID [2022-04-08 12:39:38,071 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {94346#(<= ~counter~0 12)} {94346#(<= ~counter~0 12)} #96#return; {94346#(<= ~counter~0 12)} is VALID [2022-04-08 12:39:38,072 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-08 12:39:38,073 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-08 12:39:38,073 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-08 12:39:38,074 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-08 12:39:38,074 INFO L290 TraceCheckUtils]: 116: Hoare triple {94371#(<= ~counter~0 13)} ~cond := #in~cond; {94371#(<= ~counter~0 13)} is VALID [2022-04-08 12:39:38,074 INFO L290 TraceCheckUtils]: 117: Hoare triple {94371#(<= ~counter~0 13)} assume !(0 == ~cond); {94371#(<= ~counter~0 13)} is VALID [2022-04-08 12:39:38,074 INFO L290 TraceCheckUtils]: 118: Hoare triple {94371#(<= ~counter~0 13)} assume true; {94371#(<= ~counter~0 13)} is VALID [2022-04-08 12:39:38,075 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {94371#(<= ~counter~0 13)} {94371#(<= ~counter~0 13)} #96#return; {94371#(<= ~counter~0 13)} is VALID [2022-04-08 12:39:38,075 INFO L290 TraceCheckUtils]: 120: Hoare triple {94371#(<= ~counter~0 13)} assume !(~r~0 > 0); {94371#(<= ~counter~0 13)} is VALID [2022-04-08 12:39:38,075 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-08 12:39:38,076 INFO L290 TraceCheckUtils]: 122: Hoare triple {94396#(<= |main_#t~post8| 13)} assume !(#t~post8 < 20);havoc #t~post8; {94015#false} is VALID [2022-04-08 12:39:38,076 INFO L290 TraceCheckUtils]: 123: Hoare triple {94015#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {94015#false} is VALID [2022-04-08 12:39:38,076 INFO L290 TraceCheckUtils]: 124: Hoare triple {94015#false} assume !(#t~post6 < 20);havoc #t~post6; {94015#false} is VALID [2022-04-08 12:39:38,076 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-08 12:39:38,076 INFO L290 TraceCheckUtils]: 126: Hoare triple {94015#false} ~cond := #in~cond; {94015#false} is VALID [2022-04-08 12:39:38,076 INFO L290 TraceCheckUtils]: 127: Hoare triple {94015#false} assume 0 == ~cond; {94015#false} is VALID [2022-04-08 12:39:38,076 INFO L290 TraceCheckUtils]: 128: Hoare triple {94015#false} assume !false; {94015#false} is VALID [2022-04-08 12:39:38,077 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-08 12:39:38,077 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:39:38,692 INFO L290 TraceCheckUtils]: 128: Hoare triple {94015#false} assume !false; {94015#false} is VALID [2022-04-08 12:39:38,692 INFO L290 TraceCheckUtils]: 127: Hoare triple {94015#false} assume 0 == ~cond; {94015#false} is VALID [2022-04-08 12:39:38,692 INFO L290 TraceCheckUtils]: 126: Hoare triple {94015#false} ~cond := #in~cond; {94015#false} is VALID [2022-04-08 12:39:38,692 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-08 12:39:38,692 INFO L290 TraceCheckUtils]: 124: Hoare triple {94015#false} assume !(#t~post6 < 20);havoc #t~post6; {94015#false} is VALID [2022-04-08 12:39:38,692 INFO L290 TraceCheckUtils]: 123: Hoare triple {94015#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {94015#false} is VALID [2022-04-08 12:39:38,692 INFO L290 TraceCheckUtils]: 122: Hoare triple {94436#(< |main_#t~post8| 20)} assume !(#t~post8 < 20);havoc #t~post8; {94015#false} is VALID [2022-04-08 12:39:38,693 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-08 12:39:38,693 INFO L290 TraceCheckUtils]: 120: Hoare triple {94440#(< ~counter~0 20)} assume !(~r~0 > 0); {94440#(< ~counter~0 20)} is VALID [2022-04-08 12:39:38,694 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {94014#true} {94440#(< ~counter~0 20)} #96#return; {94440#(< ~counter~0 20)} is VALID [2022-04-08 12:39:38,694 INFO L290 TraceCheckUtils]: 118: Hoare triple {94014#true} assume true; {94014#true} is VALID [2022-04-08 12:39:38,694 INFO L290 TraceCheckUtils]: 117: Hoare triple {94014#true} assume !(0 == ~cond); {94014#true} is VALID [2022-04-08 12:39:38,694 INFO L290 TraceCheckUtils]: 116: Hoare triple {94014#true} ~cond := #in~cond; {94014#true} is VALID [2022-04-08 12:39:38,694 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-08 12:39:38,694 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-08 12:39:38,696 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-08 12:39:38,696 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-08 12:39:38,697 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {94014#true} {94465#(< ~counter~0 19)} #96#return; {94465#(< ~counter~0 19)} is VALID [2022-04-08 12:39:38,697 INFO L290 TraceCheckUtils]: 110: Hoare triple {94014#true} assume true; {94014#true} is VALID [2022-04-08 12:39:38,697 INFO L290 TraceCheckUtils]: 109: Hoare triple {94014#true} assume !(0 == ~cond); {94014#true} is VALID [2022-04-08 12:39:38,697 INFO L290 TraceCheckUtils]: 108: Hoare triple {94014#true} ~cond := #in~cond; {94014#true} is VALID [2022-04-08 12:39:38,697 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-08 12:39:38,697 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-08 12:39:38,698 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-08 12:39:38,698 INFO L290 TraceCheckUtils]: 104: Hoare triple {94490#(< ~counter~0 18)} assume !!(0 != ~r~0); {94490#(< ~counter~0 18)} is VALID [2022-04-08 12:39:38,699 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {94014#true} {94490#(< ~counter~0 18)} #94#return; {94490#(< ~counter~0 18)} is VALID [2022-04-08 12:39:38,699 INFO L290 TraceCheckUtils]: 102: Hoare triple {94014#true} assume true; {94014#true} is VALID [2022-04-08 12:39:38,699 INFO L290 TraceCheckUtils]: 101: Hoare triple {94014#true} assume !(0 == ~cond); {94014#true} is VALID [2022-04-08 12:39:38,699 INFO L290 TraceCheckUtils]: 100: Hoare triple {94014#true} ~cond := #in~cond; {94014#true} is VALID [2022-04-08 12:39:38,699 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-08 12:39:38,699 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-08 12:39:38,700 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-08 12:39:38,701 INFO L290 TraceCheckUtils]: 96: Hoare triple {94515#(< ~counter~0 17)} assume !(~r~0 < 0); {94515#(< ~counter~0 17)} is VALID [2022-04-08 12:39:38,701 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {94014#true} {94515#(< ~counter~0 17)} #98#return; {94515#(< ~counter~0 17)} is VALID [2022-04-08 12:39:38,701 INFO L290 TraceCheckUtils]: 94: Hoare triple {94014#true} assume true; {94014#true} is VALID [2022-04-08 12:39:38,701 INFO L290 TraceCheckUtils]: 93: Hoare triple {94014#true} assume !(0 == ~cond); {94014#true} is VALID [2022-04-08 12:39:38,701 INFO L290 TraceCheckUtils]: 92: Hoare triple {94014#true} ~cond := #in~cond; {94014#true} is VALID [2022-04-08 12:39:38,701 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-08 12:39:38,711 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-08 12:39:38,713 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-08 12:39:38,713 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-08 12:39:38,714 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {94014#true} {94540#(< ~counter~0 16)} #98#return; {94540#(< ~counter~0 16)} is VALID [2022-04-08 12:39:38,714 INFO L290 TraceCheckUtils]: 86: Hoare triple {94014#true} assume true; {94014#true} is VALID [2022-04-08 12:39:38,714 INFO L290 TraceCheckUtils]: 85: Hoare triple {94014#true} assume !(0 == ~cond); {94014#true} is VALID [2022-04-08 12:39:38,714 INFO L290 TraceCheckUtils]: 84: Hoare triple {94014#true} ~cond := #in~cond; {94014#true} is VALID [2022-04-08 12:39:38,714 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-08 12:39:38,714 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-08 12:39:38,715 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-08 12:39:38,716 INFO L290 TraceCheckUtils]: 80: Hoare triple {94565#(< ~counter~0 15)} assume !(~r~0 > 0); {94565#(< ~counter~0 15)} is VALID [2022-04-08 12:39:38,716 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {94014#true} {94565#(< ~counter~0 15)} #96#return; {94565#(< ~counter~0 15)} is VALID [2022-04-08 12:39:38,716 INFO L290 TraceCheckUtils]: 78: Hoare triple {94014#true} assume true; {94014#true} is VALID [2022-04-08 12:39:38,716 INFO L290 TraceCheckUtils]: 77: Hoare triple {94014#true} assume !(0 == ~cond); {94014#true} is VALID [2022-04-08 12:39:38,716 INFO L290 TraceCheckUtils]: 76: Hoare triple {94014#true} ~cond := #in~cond; {94014#true} is VALID [2022-04-08 12:39:38,716 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-08 12:39:38,717 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-08 12:39:38,718 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-08 12:39:38,718 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-08 12:39:38,718 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {94014#true} {94371#(<= ~counter~0 13)} #96#return; {94371#(<= ~counter~0 13)} is VALID [2022-04-08 12:39:38,719 INFO L290 TraceCheckUtils]: 70: Hoare triple {94014#true} assume true; {94014#true} is VALID [2022-04-08 12:39:38,719 INFO L290 TraceCheckUtils]: 69: Hoare triple {94014#true} assume !(0 == ~cond); {94014#true} is VALID [2022-04-08 12:39:38,719 INFO L290 TraceCheckUtils]: 68: Hoare triple {94014#true} ~cond := #in~cond; {94014#true} is VALID [2022-04-08 12:39:38,719 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-08 12:39:38,719 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-08 12:39:38,720 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-08 12:39:38,720 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-08 12:39:38,721 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {94014#true} {94346#(<= ~counter~0 12)} #96#return; {94346#(<= ~counter~0 12)} is VALID [2022-04-08 12:39:38,721 INFO L290 TraceCheckUtils]: 62: Hoare triple {94014#true} assume true; {94014#true} is VALID [2022-04-08 12:39:38,721 INFO L290 TraceCheckUtils]: 61: Hoare triple {94014#true} assume !(0 == ~cond); {94014#true} is VALID [2022-04-08 12:39:38,721 INFO L290 TraceCheckUtils]: 60: Hoare triple {94014#true} ~cond := #in~cond; {94014#true} is VALID [2022-04-08 12:39:38,721 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-08 12:39:38,721 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-08 12:39:38,722 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-08 12:39:38,723 INFO L290 TraceCheckUtils]: 56: Hoare triple {94321#(<= ~counter~0 11)} assume !!(0 != ~r~0); {94321#(<= ~counter~0 11)} is VALID [2022-04-08 12:39:38,723 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {94014#true} {94321#(<= ~counter~0 11)} #94#return; {94321#(<= ~counter~0 11)} is VALID [2022-04-08 12:39:38,723 INFO L290 TraceCheckUtils]: 54: Hoare triple {94014#true} assume true; {94014#true} is VALID [2022-04-08 12:39:38,723 INFO L290 TraceCheckUtils]: 53: Hoare triple {94014#true} assume !(0 == ~cond); {94014#true} is VALID [2022-04-08 12:39:38,723 INFO L290 TraceCheckUtils]: 52: Hoare triple {94014#true} ~cond := #in~cond; {94014#true} is VALID [2022-04-08 12:39:38,723 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-08 12:39:38,724 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-08 12:39:38,725 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-08 12:39:38,725 INFO L290 TraceCheckUtils]: 48: Hoare triple {94296#(<= ~counter~0 10)} assume !(~r~0 < 0); {94296#(<= ~counter~0 10)} is VALID [2022-04-08 12:39:38,725 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {94014#true} {94296#(<= ~counter~0 10)} #98#return; {94296#(<= ~counter~0 10)} is VALID [2022-04-08 12:39:38,725 INFO L290 TraceCheckUtils]: 46: Hoare triple {94014#true} assume true; {94014#true} is VALID [2022-04-08 12:39:38,725 INFO L290 TraceCheckUtils]: 45: Hoare triple {94014#true} assume !(0 == ~cond); {94014#true} is VALID [2022-04-08 12:39:38,726 INFO L290 TraceCheckUtils]: 44: Hoare triple {94014#true} ~cond := #in~cond; {94014#true} is VALID [2022-04-08 12:39:38,726 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-08 12:39:38,726 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-08 12:39:38,727 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-08 12:39:38,727 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-08 12:39:38,728 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {94014#true} {94271#(<= ~counter~0 9)} #98#return; {94271#(<= ~counter~0 9)} is VALID [2022-04-08 12:39:38,728 INFO L290 TraceCheckUtils]: 38: Hoare triple {94014#true} assume true; {94014#true} is VALID [2022-04-08 12:39:38,728 INFO L290 TraceCheckUtils]: 37: Hoare triple {94014#true} assume !(0 == ~cond); {94014#true} is VALID [2022-04-08 12:39:38,728 INFO L290 TraceCheckUtils]: 36: Hoare triple {94014#true} ~cond := #in~cond; {94014#true} is VALID [2022-04-08 12:39:38,728 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-08 12:39:38,728 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-08 12:39:38,729 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-08 12:39:38,730 INFO L290 TraceCheckUtils]: 32: Hoare triple {94246#(<= ~counter~0 8)} assume !(~r~0 > 0); {94246#(<= ~counter~0 8)} is VALID [2022-04-08 12:39:38,730 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {94014#true} {94246#(<= ~counter~0 8)} #96#return; {94246#(<= ~counter~0 8)} is VALID [2022-04-08 12:39:38,730 INFO L290 TraceCheckUtils]: 30: Hoare triple {94014#true} assume true; {94014#true} is VALID [2022-04-08 12:39:38,730 INFO L290 TraceCheckUtils]: 29: Hoare triple {94014#true} assume !(0 == ~cond); {94014#true} is VALID [2022-04-08 12:39:38,730 INFO L290 TraceCheckUtils]: 28: Hoare triple {94014#true} ~cond := #in~cond; {94014#true} is VALID [2022-04-08 12:39:38,730 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-08 12:39:38,731 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-08 12:39:38,732 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-08 12:39:38,732 INFO L290 TraceCheckUtils]: 24: Hoare triple {94221#(<= ~counter~0 7)} assume !!(0 != ~r~0); {94221#(<= ~counter~0 7)} is VALID [2022-04-08 12:39:38,733 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {94014#true} {94221#(<= ~counter~0 7)} #94#return; {94221#(<= ~counter~0 7)} is VALID [2022-04-08 12:39:38,733 INFO L290 TraceCheckUtils]: 22: Hoare triple {94014#true} assume true; {94014#true} is VALID [2022-04-08 12:39:38,733 INFO L290 TraceCheckUtils]: 21: Hoare triple {94014#true} assume !(0 == ~cond); {94014#true} is VALID [2022-04-08 12:39:38,733 INFO L290 TraceCheckUtils]: 20: Hoare triple {94014#true} ~cond := #in~cond; {94014#true} is VALID [2022-04-08 12:39:38,733 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-08 12:39:38,733 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-08 12:39:38,734 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-08 12:39:38,734 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-08 12:39:38,735 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {94014#true} {94196#(<= ~counter~0 6)} #92#return; {94196#(<= ~counter~0 6)} is VALID [2022-04-08 12:39:38,735 INFO L290 TraceCheckUtils]: 14: Hoare triple {94014#true} assume true; {94014#true} is VALID [2022-04-08 12:39:38,735 INFO L290 TraceCheckUtils]: 13: Hoare triple {94014#true} assume !(0 == ~cond); {94014#true} is VALID [2022-04-08 12:39:38,735 INFO L290 TraceCheckUtils]: 12: Hoare triple {94014#true} ~cond := #in~cond; {94014#true} is VALID [2022-04-08 12:39:38,735 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-08 12:39:38,736 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {94014#true} {94196#(<= ~counter~0 6)} #90#return; {94196#(<= ~counter~0 6)} is VALID [2022-04-08 12:39:38,736 INFO L290 TraceCheckUtils]: 9: Hoare triple {94014#true} assume true; {94014#true} is VALID [2022-04-08 12:39:38,736 INFO L290 TraceCheckUtils]: 8: Hoare triple {94014#true} assume !(0 == ~cond); {94014#true} is VALID [2022-04-08 12:39:38,736 INFO L290 TraceCheckUtils]: 7: Hoare triple {94014#true} ~cond := #in~cond; {94014#true} is VALID [2022-04-08 12:39:38,736 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-08 12:39:38,736 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-08 12:39:38,736 INFO L272 TraceCheckUtils]: 4: Hoare triple {94196#(<= ~counter~0 6)} call #t~ret9 := main(); {94196#(<= ~counter~0 6)} is VALID [2022-04-08 12:39:38,737 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {94196#(<= ~counter~0 6)} {94014#true} #102#return; {94196#(<= ~counter~0 6)} is VALID [2022-04-08 12:39:38,737 INFO L290 TraceCheckUtils]: 2: Hoare triple {94196#(<= ~counter~0 6)} assume true; {94196#(<= ~counter~0 6)} is VALID [2022-04-08 12:39:38,738 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-08 12:39:38,738 INFO L272 TraceCheckUtils]: 0: Hoare triple {94014#true} call ULTIMATE.init(); {94014#true} is VALID [2022-04-08 12:39:38,738 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-08 12:39:38,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:39:38,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863819733] [2022-04-08 12:39:38,740 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:39:38,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115473906] [2022-04-08 12:39:38,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115473906] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:39:38,740 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:39:38,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 24 [2022-04-08 12:39:38,740 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:39:38,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [701347976] [2022-04-08 12:39:38,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [701347976] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:39:38,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:39:38,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-08 12:39:38,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9073754] [2022-04-08 12:39:38,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:39:38,741 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-08 12:39:38,741 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:39:38,741 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-08 12:39:38,850 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-08 12:39:38,850 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-08 12:39:38,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:39:38,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-08 12:39:38,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-08 12:39:38,851 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-08 12:39:42,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:39:42,223 INFO L93 Difference]: Finished difference Result 893 states and 1247 transitions. [2022-04-08 12:39:42,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-08 12:39:42,223 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-08 12:39:42,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:39:42,224 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-08 12:39:42,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 296 transitions. [2022-04-08 12:39:42,226 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-08 12:39:42,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 296 transitions. [2022-04-08 12:39:42,227 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 296 transitions. [2022-04-08 12:39:42,486 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-08 12:39:42,506 INFO L225 Difference]: With dead ends: 893 [2022-04-08 12:39:42,506 INFO L226 Difference]: Without dead ends: 700 [2022-04-08 12:39:42,507 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 234 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=467, Invalid=723, Unknown=0, NotChecked=0, Total=1190 [2022-04-08 12:39:42,508 INFO L913 BasicCegarLoop]: 69 mSDtfsCounter, 249 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-08 12:39:42,508 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [249 Valid, 291 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 12:39:42,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2022-04-08 12:39:44,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 690. [2022-04-08 12:39:44,551 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:39:44,552 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-08 12:39:44,552 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-08 12:39:44,552 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-08 12:39:44,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:39:44,569 INFO L93 Difference]: Finished difference Result 700 states and 946 transitions. [2022-04-08 12:39:44,569 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 946 transitions. [2022-04-08 12:39:44,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:39:44,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:39:44,570 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-08 12:39:44,571 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-08 12:39:44,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:39:44,591 INFO L93 Difference]: Finished difference Result 700 states and 946 transitions. [2022-04-08 12:39:44,591 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 946 transitions. [2022-04-08 12:39:44,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:39:44,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:39:44,592 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:39:44,592 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:39:44,593 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-08 12:39:44,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 936 transitions. [2022-04-08 12:39:44,614 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 936 transitions. Word has length 129 [2022-04-08 12:39:44,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:39:44,614 INFO L478 AbstractCegarLoop]: Abstraction has 690 states and 936 transitions. [2022-04-08 12:39:44,615 INFO L479 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-08 12:39:44,615 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 690 states and 936 transitions. [2022-04-08 12:39:48,906 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 936 edges. 936 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:39:48,906 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 936 transitions. [2022-04-08 12:39:48,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-08 12:39:48,907 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:39:48,907 INFO L499 BasicCegarLoop]: 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-08 12:39:48,924 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-08 12:39:49,107 WARN L460 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-08 12:39:49,108 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:39:49,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:39:49,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1255136270, now seen corresponding path program 17 times [2022-04-08 12:39:49,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:39:49,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [257471697] [2022-04-08 12:39:49,108 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:39:49,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1255136270, now seen corresponding path program 18 times [2022-04-08 12:39:49,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:39:49,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049707466] [2022-04-08 12:39:49,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:39:49,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:39:49,132 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:39:49,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1897050174] [2022-04-08 12:39:49,133 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 12:39:49,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:39:49,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:39:49,133 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-08 12:39:49,134 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-08 12:39:49,323 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-08 12:39:49,323 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:39:49,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-08 12:39:49,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:39:49,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:39:49,962 INFO L272 TraceCheckUtils]: 0: Hoare triple {99399#true} call ULTIMATE.init(); {99399#true} is VALID [2022-04-08 12:39:49,963 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-08 12:39:49,963 INFO L290 TraceCheckUtils]: 2: Hoare triple {99407#(<= ~counter~0 0)} assume true; {99407#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:49,963 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {99407#(<= ~counter~0 0)} {99399#true} #102#return; {99407#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:49,964 INFO L272 TraceCheckUtils]: 4: Hoare triple {99407#(<= ~counter~0 0)} call #t~ret9 := main(); {99407#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:49,964 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-08 12:39:49,964 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-08 12:39:49,965 INFO L290 TraceCheckUtils]: 7: Hoare triple {99407#(<= ~counter~0 0)} ~cond := #in~cond; {99407#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:49,965 INFO L290 TraceCheckUtils]: 8: Hoare triple {99407#(<= ~counter~0 0)} assume !(0 == ~cond); {99407#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:49,965 INFO L290 TraceCheckUtils]: 9: Hoare triple {99407#(<= ~counter~0 0)} assume true; {99407#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:49,966 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {99407#(<= ~counter~0 0)} {99407#(<= ~counter~0 0)} #90#return; {99407#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:49,966 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-08 12:39:49,966 INFO L290 TraceCheckUtils]: 12: Hoare triple {99407#(<= ~counter~0 0)} ~cond := #in~cond; {99407#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:49,967 INFO L290 TraceCheckUtils]: 13: Hoare triple {99407#(<= ~counter~0 0)} assume !(0 == ~cond); {99407#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:49,967 INFO L290 TraceCheckUtils]: 14: Hoare triple {99407#(<= ~counter~0 0)} assume true; {99407#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:49,967 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {99407#(<= ~counter~0 0)} {99407#(<= ~counter~0 0)} #92#return; {99407#(<= ~counter~0 0)} is VALID [2022-04-08 12:39:49,968 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-08 12:39:49,970 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-08 12:39:49,970 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-08 12:39:49,971 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-08 12:39:49,971 INFO L290 TraceCheckUtils]: 20: Hoare triple {99456#(<= ~counter~0 1)} ~cond := #in~cond; {99456#(<= ~counter~0 1)} is VALID [2022-04-08 12:39:49,971 INFO L290 TraceCheckUtils]: 21: Hoare triple {99456#(<= ~counter~0 1)} assume !(0 == ~cond); {99456#(<= ~counter~0 1)} is VALID [2022-04-08 12:39:49,972 INFO L290 TraceCheckUtils]: 22: Hoare triple {99456#(<= ~counter~0 1)} assume true; {99456#(<= ~counter~0 1)} is VALID [2022-04-08 12:39:49,972 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {99456#(<= ~counter~0 1)} {99456#(<= ~counter~0 1)} #94#return; {99456#(<= ~counter~0 1)} is VALID [2022-04-08 12:39:49,973 INFO L290 TraceCheckUtils]: 24: Hoare triple {99456#(<= ~counter~0 1)} assume !!(0 != ~r~0); {99456#(<= ~counter~0 1)} is VALID [2022-04-08 12:39:49,974 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-08 12:39:49,974 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-08 12:39:49,975 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-08 12:39:49,975 INFO L290 TraceCheckUtils]: 28: Hoare triple {99481#(<= ~counter~0 2)} ~cond := #in~cond; {99481#(<= ~counter~0 2)} is VALID [2022-04-08 12:39:49,975 INFO L290 TraceCheckUtils]: 29: Hoare triple {99481#(<= ~counter~0 2)} assume !(0 == ~cond); {99481#(<= ~counter~0 2)} is VALID [2022-04-08 12:39:49,976 INFO L290 TraceCheckUtils]: 30: Hoare triple {99481#(<= ~counter~0 2)} assume true; {99481#(<= ~counter~0 2)} is VALID [2022-04-08 12:39:49,976 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {99481#(<= ~counter~0 2)} {99481#(<= ~counter~0 2)} #96#return; {99481#(<= ~counter~0 2)} is VALID [2022-04-08 12:39:49,976 INFO L290 TraceCheckUtils]: 32: Hoare triple {99481#(<= ~counter~0 2)} assume !(~r~0 > 0); {99481#(<= ~counter~0 2)} is VALID [2022-04-08 12:39:49,978 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-08 12:39:49,978 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-08 12:39:49,978 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-08 12:39:49,979 INFO L290 TraceCheckUtils]: 36: Hoare triple {99506#(<= ~counter~0 3)} ~cond := #in~cond; {99506#(<= ~counter~0 3)} is VALID [2022-04-08 12:39:49,979 INFO L290 TraceCheckUtils]: 37: Hoare triple {99506#(<= ~counter~0 3)} assume !(0 == ~cond); {99506#(<= ~counter~0 3)} is VALID [2022-04-08 12:39:49,980 INFO L290 TraceCheckUtils]: 38: Hoare triple {99506#(<= ~counter~0 3)} assume true; {99506#(<= ~counter~0 3)} is VALID [2022-04-08 12:39:49,980 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {99506#(<= ~counter~0 3)} {99506#(<= ~counter~0 3)} #98#return; {99506#(<= ~counter~0 3)} is VALID [2022-04-08 12:39:49,980 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-08 12:39:49,984 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-08 12:39:49,984 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-08 12:39:49,985 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-08 12:39:49,985 INFO L290 TraceCheckUtils]: 44: Hoare triple {99531#(<= ~counter~0 4)} ~cond := #in~cond; {99531#(<= ~counter~0 4)} is VALID [2022-04-08 12:39:49,986 INFO L290 TraceCheckUtils]: 45: Hoare triple {99531#(<= ~counter~0 4)} assume !(0 == ~cond); {99531#(<= ~counter~0 4)} is VALID [2022-04-08 12:39:49,986 INFO L290 TraceCheckUtils]: 46: Hoare triple {99531#(<= ~counter~0 4)} assume true; {99531#(<= ~counter~0 4)} is VALID [2022-04-08 12:39:49,986 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {99531#(<= ~counter~0 4)} {99531#(<= ~counter~0 4)} #98#return; {99531#(<= ~counter~0 4)} is VALID [2022-04-08 12:39:49,987 INFO L290 TraceCheckUtils]: 48: Hoare triple {99531#(<= ~counter~0 4)} assume !(~r~0 < 0); {99531#(<= ~counter~0 4)} is VALID [2022-04-08 12:39:49,988 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-08 12:39:49,988 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-08 12:39:49,989 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-08 12:39:49,989 INFO L290 TraceCheckUtils]: 52: Hoare triple {99556#(<= ~counter~0 5)} ~cond := #in~cond; {99556#(<= ~counter~0 5)} is VALID [2022-04-08 12:39:49,989 INFO L290 TraceCheckUtils]: 53: Hoare triple {99556#(<= ~counter~0 5)} assume !(0 == ~cond); {99556#(<= ~counter~0 5)} is VALID [2022-04-08 12:39:49,990 INFO L290 TraceCheckUtils]: 54: Hoare triple {99556#(<= ~counter~0 5)} assume true; {99556#(<= ~counter~0 5)} is VALID [2022-04-08 12:39:49,990 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {99556#(<= ~counter~0 5)} {99556#(<= ~counter~0 5)} #94#return; {99556#(<= ~counter~0 5)} is VALID [2022-04-08 12:39:49,990 INFO L290 TraceCheckUtils]: 56: Hoare triple {99556#(<= ~counter~0 5)} assume !!(0 != ~r~0); {99556#(<= ~counter~0 5)} is VALID [2022-04-08 12:39:49,991 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-08 12:39:49,992 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-08 12:39:49,992 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-08 12:39:49,993 INFO L290 TraceCheckUtils]: 60: Hoare triple {99581#(<= ~counter~0 6)} ~cond := #in~cond; {99581#(<= ~counter~0 6)} is VALID [2022-04-08 12:39:49,993 INFO L290 TraceCheckUtils]: 61: Hoare triple {99581#(<= ~counter~0 6)} assume !(0 == ~cond); {99581#(<= ~counter~0 6)} is VALID [2022-04-08 12:39:49,993 INFO L290 TraceCheckUtils]: 62: Hoare triple {99581#(<= ~counter~0 6)} assume true; {99581#(<= ~counter~0 6)} is VALID [2022-04-08 12:39:49,994 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {99581#(<= ~counter~0 6)} {99581#(<= ~counter~0 6)} #96#return; {99581#(<= ~counter~0 6)} is VALID [2022-04-08 12:39:49,994 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-08 12:39:49,995 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-08 12:39:49,996 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-08 12:39:49,996 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-08 12:39:49,996 INFO L290 TraceCheckUtils]: 68: Hoare triple {99606#(<= ~counter~0 7)} ~cond := #in~cond; {99606#(<= ~counter~0 7)} is VALID [2022-04-08 12:39:49,997 INFO L290 TraceCheckUtils]: 69: Hoare triple {99606#(<= ~counter~0 7)} assume !(0 == ~cond); {99606#(<= ~counter~0 7)} is VALID [2022-04-08 12:39:49,997 INFO L290 TraceCheckUtils]: 70: Hoare triple {99606#(<= ~counter~0 7)} assume true; {99606#(<= ~counter~0 7)} is VALID [2022-04-08 12:39:49,998 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {99606#(<= ~counter~0 7)} {99606#(<= ~counter~0 7)} #96#return; {99606#(<= ~counter~0 7)} is VALID [2022-04-08 12:39:49,998 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-08 12:39:49,999 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-08 12:39:49,999 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-08 12:39:50,000 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-08 12:39:50,000 INFO L290 TraceCheckUtils]: 76: Hoare triple {99631#(<= ~counter~0 8)} ~cond := #in~cond; {99631#(<= ~counter~0 8)} is VALID [2022-04-08 12:39:50,000 INFO L290 TraceCheckUtils]: 77: Hoare triple {99631#(<= ~counter~0 8)} assume !(0 == ~cond); {99631#(<= ~counter~0 8)} is VALID [2022-04-08 12:39:50,001 INFO L290 TraceCheckUtils]: 78: Hoare triple {99631#(<= ~counter~0 8)} assume true; {99631#(<= ~counter~0 8)} is VALID [2022-04-08 12:39:50,001 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {99631#(<= ~counter~0 8)} {99631#(<= ~counter~0 8)} #96#return; {99631#(<= ~counter~0 8)} is VALID [2022-04-08 12:39:50,001 INFO L290 TraceCheckUtils]: 80: Hoare triple {99631#(<= ~counter~0 8)} assume !(~r~0 > 0); {99631#(<= ~counter~0 8)} is VALID [2022-04-08 12:39:50,003 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-08 12:39:50,003 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-08 12:39:50,003 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-08 12:39:50,004 INFO L290 TraceCheckUtils]: 84: Hoare triple {99656#(<= ~counter~0 9)} ~cond := #in~cond; {99656#(<= ~counter~0 9)} is VALID [2022-04-08 12:39:50,004 INFO L290 TraceCheckUtils]: 85: Hoare triple {99656#(<= ~counter~0 9)} assume !(0 == ~cond); {99656#(<= ~counter~0 9)} is VALID [2022-04-08 12:39:50,004 INFO L290 TraceCheckUtils]: 86: Hoare triple {99656#(<= ~counter~0 9)} assume true; {99656#(<= ~counter~0 9)} is VALID [2022-04-08 12:39:50,005 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {99656#(<= ~counter~0 9)} {99656#(<= ~counter~0 9)} #98#return; {99656#(<= ~counter~0 9)} is VALID [2022-04-08 12:39:50,005 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-08 12:39:50,006 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-08 12:39:50,006 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-08 12:39:50,007 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-08 12:39:50,007 INFO L290 TraceCheckUtils]: 92: Hoare triple {99681#(<= ~counter~0 10)} ~cond := #in~cond; {99681#(<= ~counter~0 10)} is VALID [2022-04-08 12:39:50,008 INFO L290 TraceCheckUtils]: 93: Hoare triple {99681#(<= ~counter~0 10)} assume !(0 == ~cond); {99681#(<= ~counter~0 10)} is VALID [2022-04-08 12:39:50,008 INFO L290 TraceCheckUtils]: 94: Hoare triple {99681#(<= ~counter~0 10)} assume true; {99681#(<= ~counter~0 10)} is VALID [2022-04-08 12:39:50,008 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {99681#(<= ~counter~0 10)} {99681#(<= ~counter~0 10)} #98#return; {99681#(<= ~counter~0 10)} is VALID [2022-04-08 12:39:50,009 INFO L290 TraceCheckUtils]: 96: Hoare triple {99681#(<= ~counter~0 10)} assume !(~r~0 < 0); {99681#(<= ~counter~0 10)} is VALID [2022-04-08 12:39:50,010 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-08 12:39:50,010 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-08 12:39:50,011 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-08 12:39:50,011 INFO L290 TraceCheckUtils]: 100: Hoare triple {99706#(<= ~counter~0 11)} ~cond := #in~cond; {99706#(<= ~counter~0 11)} is VALID [2022-04-08 12:39:50,011 INFO L290 TraceCheckUtils]: 101: Hoare triple {99706#(<= ~counter~0 11)} assume !(0 == ~cond); {99706#(<= ~counter~0 11)} is VALID [2022-04-08 12:39:50,011 INFO L290 TraceCheckUtils]: 102: Hoare triple {99706#(<= ~counter~0 11)} assume true; {99706#(<= ~counter~0 11)} is VALID [2022-04-08 12:39:50,012 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {99706#(<= ~counter~0 11)} {99706#(<= ~counter~0 11)} #94#return; {99706#(<= ~counter~0 11)} is VALID [2022-04-08 12:39:50,012 INFO L290 TraceCheckUtils]: 104: Hoare triple {99706#(<= ~counter~0 11)} assume !!(0 != ~r~0); {99706#(<= ~counter~0 11)} is VALID [2022-04-08 12:39:50,014 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-08 12:39:50,014 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-08 12:39:50,014 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-08 12:39:50,015 INFO L290 TraceCheckUtils]: 108: Hoare triple {99731#(<= ~counter~0 12)} ~cond := #in~cond; {99731#(<= ~counter~0 12)} is VALID [2022-04-08 12:39:50,015 INFO L290 TraceCheckUtils]: 109: Hoare triple {99731#(<= ~counter~0 12)} assume !(0 == ~cond); {99731#(<= ~counter~0 12)} is VALID [2022-04-08 12:39:50,015 INFO L290 TraceCheckUtils]: 110: Hoare triple {99731#(<= ~counter~0 12)} assume true; {99731#(<= ~counter~0 12)} is VALID [2022-04-08 12:39:50,016 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {99731#(<= ~counter~0 12)} {99731#(<= ~counter~0 12)} #96#return; {99731#(<= ~counter~0 12)} is VALID [2022-04-08 12:39:50,016 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-08 12:39:50,017 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-08 12:39:50,017 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-08 12:39:50,018 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-08 12:39:50,018 INFO L290 TraceCheckUtils]: 116: Hoare triple {99756#(<= ~counter~0 13)} ~cond := #in~cond; {99756#(<= ~counter~0 13)} is VALID [2022-04-08 12:39:50,018 INFO L290 TraceCheckUtils]: 117: Hoare triple {99756#(<= ~counter~0 13)} assume !(0 == ~cond); {99756#(<= ~counter~0 13)} is VALID [2022-04-08 12:39:50,019 INFO L290 TraceCheckUtils]: 118: Hoare triple {99756#(<= ~counter~0 13)} assume true; {99756#(<= ~counter~0 13)} is VALID [2022-04-08 12:39:50,019 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {99756#(<= ~counter~0 13)} {99756#(<= ~counter~0 13)} #96#return; {99756#(<= ~counter~0 13)} is VALID [2022-04-08 12:39:50,019 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-08 12:39:50,020 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-08 12:39:50,020 INFO L290 TraceCheckUtils]: 122: Hoare triple {99781#(<= |main_#t~post7| 13)} assume !(#t~post7 < 20);havoc #t~post7; {99400#false} is VALID [2022-04-08 12:39:50,020 INFO L290 TraceCheckUtils]: 123: Hoare triple {99400#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {99400#false} is VALID [2022-04-08 12:39:50,020 INFO L290 TraceCheckUtils]: 124: Hoare triple {99400#false} assume !(#t~post8 < 20);havoc #t~post8; {99400#false} is VALID [2022-04-08 12:39:50,020 INFO L290 TraceCheckUtils]: 125: Hoare triple {99400#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {99400#false} is VALID [2022-04-08 12:39:50,020 INFO L290 TraceCheckUtils]: 126: Hoare triple {99400#false} assume !(#t~post6 < 20);havoc #t~post6; {99400#false} is VALID [2022-04-08 12:39:50,021 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-08 12:39:50,021 INFO L290 TraceCheckUtils]: 128: Hoare triple {99400#false} ~cond := #in~cond; {99400#false} is VALID [2022-04-08 12:39:50,021 INFO L290 TraceCheckUtils]: 129: Hoare triple {99400#false} assume 0 == ~cond; {99400#false} is VALID [2022-04-08 12:39:50,021 INFO L290 TraceCheckUtils]: 130: Hoare triple {99400#false} assume !false; {99400#false} is VALID [2022-04-08 12:39:50,021 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-08 12:39:50,021 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:39:50,624 INFO L290 TraceCheckUtils]: 130: Hoare triple {99400#false} assume !false; {99400#false} is VALID [2022-04-08 12:39:50,625 INFO L290 TraceCheckUtils]: 129: Hoare triple {99400#false} assume 0 == ~cond; {99400#false} is VALID [2022-04-08 12:39:50,625 INFO L290 TraceCheckUtils]: 128: Hoare triple {99400#false} ~cond := #in~cond; {99400#false} is VALID [2022-04-08 12:39:50,625 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-08 12:39:50,625 INFO L290 TraceCheckUtils]: 126: Hoare triple {99400#false} assume !(#t~post6 < 20);havoc #t~post6; {99400#false} is VALID [2022-04-08 12:39:50,625 INFO L290 TraceCheckUtils]: 125: Hoare triple {99400#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {99400#false} is VALID [2022-04-08 12:39:50,625 INFO L290 TraceCheckUtils]: 124: Hoare triple {99400#false} assume !(#t~post8 < 20);havoc #t~post8; {99400#false} is VALID [2022-04-08 12:39:50,625 INFO L290 TraceCheckUtils]: 123: Hoare triple {99400#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {99400#false} is VALID [2022-04-08 12:39:50,625 INFO L290 TraceCheckUtils]: 122: Hoare triple {99833#(< |main_#t~post7| 20)} assume !(#t~post7 < 20);havoc #t~post7; {99400#false} is VALID [2022-04-08 12:39:50,626 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-08 12:39:50,626 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-08 12:39:50,626 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {99399#true} {99837#(< ~counter~0 20)} #96#return; {99837#(< ~counter~0 20)} is VALID [2022-04-08 12:39:50,627 INFO L290 TraceCheckUtils]: 118: Hoare triple {99399#true} assume true; {99399#true} is VALID [2022-04-08 12:39:50,627 INFO L290 TraceCheckUtils]: 117: Hoare triple {99399#true} assume !(0 == ~cond); {99399#true} is VALID [2022-04-08 12:39:50,627 INFO L290 TraceCheckUtils]: 116: Hoare triple {99399#true} ~cond := #in~cond; {99399#true} is VALID [2022-04-08 12:39:50,627 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-08 12:39:50,627 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-08 12:39:50,629 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-08 12:39:50,629 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-08 12:39:50,630 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {99399#true} {99862#(< ~counter~0 19)} #96#return; {99862#(< ~counter~0 19)} is VALID [2022-04-08 12:39:50,630 INFO L290 TraceCheckUtils]: 110: Hoare triple {99399#true} assume true; {99399#true} is VALID [2022-04-08 12:39:50,630 INFO L290 TraceCheckUtils]: 109: Hoare triple {99399#true} assume !(0 == ~cond); {99399#true} is VALID [2022-04-08 12:39:50,630 INFO L290 TraceCheckUtils]: 108: Hoare triple {99399#true} ~cond := #in~cond; {99399#true} is VALID [2022-04-08 12:39:50,630 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-08 12:39:50,630 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-08 12:39:50,631 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-08 12:39:50,632 INFO L290 TraceCheckUtils]: 104: Hoare triple {99887#(< ~counter~0 18)} assume !!(0 != ~r~0); {99887#(< ~counter~0 18)} is VALID [2022-04-08 12:39:50,632 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {99399#true} {99887#(< ~counter~0 18)} #94#return; {99887#(< ~counter~0 18)} is VALID [2022-04-08 12:39:50,632 INFO L290 TraceCheckUtils]: 102: Hoare triple {99399#true} assume true; {99399#true} is VALID [2022-04-08 12:39:50,632 INFO L290 TraceCheckUtils]: 101: Hoare triple {99399#true} assume !(0 == ~cond); {99399#true} is VALID [2022-04-08 12:39:50,632 INFO L290 TraceCheckUtils]: 100: Hoare triple {99399#true} ~cond := #in~cond; {99399#true} is VALID [2022-04-08 12:39:50,632 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-08 12:39:50,633 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-08 12:39:50,633 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-08 12:39:50,634 INFO L290 TraceCheckUtils]: 96: Hoare triple {99912#(< ~counter~0 17)} assume !(~r~0 < 0); {99912#(< ~counter~0 17)} is VALID [2022-04-08 12:39:50,634 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {99399#true} {99912#(< ~counter~0 17)} #98#return; {99912#(< ~counter~0 17)} is VALID [2022-04-08 12:39:50,634 INFO L290 TraceCheckUtils]: 94: Hoare triple {99399#true} assume true; {99399#true} is VALID [2022-04-08 12:39:50,634 INFO L290 TraceCheckUtils]: 93: Hoare triple {99399#true} assume !(0 == ~cond); {99399#true} is VALID [2022-04-08 12:39:50,634 INFO L290 TraceCheckUtils]: 92: Hoare triple {99399#true} ~cond := #in~cond; {99399#true} is VALID [2022-04-08 12:39:50,634 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-08 12:39:50,635 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-08 12:39:50,636 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-08 12:39:50,636 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-08 12:39:50,636 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {99399#true} {99937#(< ~counter~0 16)} #98#return; {99937#(< ~counter~0 16)} is VALID [2022-04-08 12:39:50,636 INFO L290 TraceCheckUtils]: 86: Hoare triple {99399#true} assume true; {99399#true} is VALID [2022-04-08 12:39:50,636 INFO L290 TraceCheckUtils]: 85: Hoare triple {99399#true} assume !(0 == ~cond); {99399#true} is VALID [2022-04-08 12:39:50,637 INFO L290 TraceCheckUtils]: 84: Hoare triple {99399#true} ~cond := #in~cond; {99399#true} is VALID [2022-04-08 12:39:50,637 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-08 12:39:50,637 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-08 12:39:50,638 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-08 12:39:50,638 INFO L290 TraceCheckUtils]: 80: Hoare triple {99962#(< ~counter~0 15)} assume !(~r~0 > 0); {99962#(< ~counter~0 15)} is VALID [2022-04-08 12:39:50,638 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {99399#true} {99962#(< ~counter~0 15)} #96#return; {99962#(< ~counter~0 15)} is VALID [2022-04-08 12:39:50,639 INFO L290 TraceCheckUtils]: 78: Hoare triple {99399#true} assume true; {99399#true} is VALID [2022-04-08 12:39:50,639 INFO L290 TraceCheckUtils]: 77: Hoare triple {99399#true} assume !(0 == ~cond); {99399#true} is VALID [2022-04-08 12:39:50,639 INFO L290 TraceCheckUtils]: 76: Hoare triple {99399#true} ~cond := #in~cond; {99399#true} is VALID [2022-04-08 12:39:50,639 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-08 12:39:50,639 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-08 12:39:50,640 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-08 12:39:50,640 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-08 12:39:50,641 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {99399#true} {99756#(<= ~counter~0 13)} #96#return; {99756#(<= ~counter~0 13)} is VALID [2022-04-08 12:39:50,641 INFO L290 TraceCheckUtils]: 70: Hoare triple {99399#true} assume true; {99399#true} is VALID [2022-04-08 12:39:50,641 INFO L290 TraceCheckUtils]: 69: Hoare triple {99399#true} assume !(0 == ~cond); {99399#true} is VALID [2022-04-08 12:39:50,641 INFO L290 TraceCheckUtils]: 68: Hoare triple {99399#true} ~cond := #in~cond; {99399#true} is VALID [2022-04-08 12:39:50,641 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-08 12:39:50,641 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-08 12:39:50,642 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-08 12:39:50,642 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-08 12:39:50,643 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {99399#true} {99731#(<= ~counter~0 12)} #96#return; {99731#(<= ~counter~0 12)} is VALID [2022-04-08 12:39:50,643 INFO L290 TraceCheckUtils]: 62: Hoare triple {99399#true} assume true; {99399#true} is VALID [2022-04-08 12:39:50,643 INFO L290 TraceCheckUtils]: 61: Hoare triple {99399#true} assume !(0 == ~cond); {99399#true} is VALID [2022-04-08 12:39:50,643 INFO L290 TraceCheckUtils]: 60: Hoare triple {99399#true} ~cond := #in~cond; {99399#true} is VALID [2022-04-08 12:39:50,643 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-08 12:39:50,643 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-08 12:39:50,644 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-08 12:39:50,645 INFO L290 TraceCheckUtils]: 56: Hoare triple {99706#(<= ~counter~0 11)} assume !!(0 != ~r~0); {99706#(<= ~counter~0 11)} is VALID [2022-04-08 12:39:50,645 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {99399#true} {99706#(<= ~counter~0 11)} #94#return; {99706#(<= ~counter~0 11)} is VALID [2022-04-08 12:39:50,645 INFO L290 TraceCheckUtils]: 54: Hoare triple {99399#true} assume true; {99399#true} is VALID [2022-04-08 12:39:50,645 INFO L290 TraceCheckUtils]: 53: Hoare triple {99399#true} assume !(0 == ~cond); {99399#true} is VALID [2022-04-08 12:39:50,645 INFO L290 TraceCheckUtils]: 52: Hoare triple {99399#true} ~cond := #in~cond; {99399#true} is VALID [2022-04-08 12:39:50,645 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-08 12:39:50,646 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-08 12:39:50,647 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-08 12:39:50,647 INFO L290 TraceCheckUtils]: 48: Hoare triple {99681#(<= ~counter~0 10)} assume !(~r~0 < 0); {99681#(<= ~counter~0 10)} is VALID [2022-04-08 12:39:50,647 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {99399#true} {99681#(<= ~counter~0 10)} #98#return; {99681#(<= ~counter~0 10)} is VALID [2022-04-08 12:39:50,647 INFO L290 TraceCheckUtils]: 46: Hoare triple {99399#true} assume true; {99399#true} is VALID [2022-04-08 12:39:50,647 INFO L290 TraceCheckUtils]: 45: Hoare triple {99399#true} assume !(0 == ~cond); {99399#true} is VALID [2022-04-08 12:39:50,648 INFO L290 TraceCheckUtils]: 44: Hoare triple {99399#true} ~cond := #in~cond; {99399#true} is VALID [2022-04-08 12:39:50,648 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-08 12:39:50,648 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-08 12:39:50,649 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-08 12:39:50,649 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-08 12:39:50,649 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {99399#true} {99656#(<= ~counter~0 9)} #98#return; {99656#(<= ~counter~0 9)} is VALID [2022-04-08 12:39:50,650 INFO L290 TraceCheckUtils]: 38: Hoare triple {99399#true} assume true; {99399#true} is VALID [2022-04-08 12:39:50,650 INFO L290 TraceCheckUtils]: 37: Hoare triple {99399#true} assume !(0 == ~cond); {99399#true} is VALID [2022-04-08 12:39:50,650 INFO L290 TraceCheckUtils]: 36: Hoare triple {99399#true} ~cond := #in~cond; {99399#true} is VALID [2022-04-08 12:39:50,650 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-08 12:39:50,650 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-08 12:39:50,651 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-08 12:39:50,651 INFO L290 TraceCheckUtils]: 32: Hoare triple {99631#(<= ~counter~0 8)} assume !(~r~0 > 0); {99631#(<= ~counter~0 8)} is VALID [2022-04-08 12:39:50,652 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {99399#true} {99631#(<= ~counter~0 8)} #96#return; {99631#(<= ~counter~0 8)} is VALID [2022-04-08 12:39:50,652 INFO L290 TraceCheckUtils]: 30: Hoare triple {99399#true} assume true; {99399#true} is VALID [2022-04-08 12:39:50,652 INFO L290 TraceCheckUtils]: 29: Hoare triple {99399#true} assume !(0 == ~cond); {99399#true} is VALID [2022-04-08 12:39:50,652 INFO L290 TraceCheckUtils]: 28: Hoare triple {99399#true} ~cond := #in~cond; {99399#true} is VALID [2022-04-08 12:39:50,652 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-08 12:39:50,652 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-08 12:39:50,653 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-08 12:39:50,653 INFO L290 TraceCheckUtils]: 24: Hoare triple {99606#(<= ~counter~0 7)} assume !!(0 != ~r~0); {99606#(<= ~counter~0 7)} is VALID [2022-04-08 12:39:50,654 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {99399#true} {99606#(<= ~counter~0 7)} #94#return; {99606#(<= ~counter~0 7)} is VALID [2022-04-08 12:39:50,654 INFO L290 TraceCheckUtils]: 22: Hoare triple {99399#true} assume true; {99399#true} is VALID [2022-04-08 12:39:50,654 INFO L290 TraceCheckUtils]: 21: Hoare triple {99399#true} assume !(0 == ~cond); {99399#true} is VALID [2022-04-08 12:39:50,654 INFO L290 TraceCheckUtils]: 20: Hoare triple {99399#true} ~cond := #in~cond; {99399#true} is VALID [2022-04-08 12:39:50,654 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-08 12:39:50,654 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-08 12:39:50,655 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-08 12:39:50,655 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-08 12:39:50,656 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {99399#true} {99581#(<= ~counter~0 6)} #92#return; {99581#(<= ~counter~0 6)} is VALID [2022-04-08 12:39:50,656 INFO L290 TraceCheckUtils]: 14: Hoare triple {99399#true} assume true; {99399#true} is VALID [2022-04-08 12:39:50,656 INFO L290 TraceCheckUtils]: 13: Hoare triple {99399#true} assume !(0 == ~cond); {99399#true} is VALID [2022-04-08 12:39:50,656 INFO L290 TraceCheckUtils]: 12: Hoare triple {99399#true} ~cond := #in~cond; {99399#true} is VALID [2022-04-08 12:39:50,656 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-08 12:39:50,656 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {99399#true} {99581#(<= ~counter~0 6)} #90#return; {99581#(<= ~counter~0 6)} is VALID [2022-04-08 12:39:50,656 INFO L290 TraceCheckUtils]: 9: Hoare triple {99399#true} assume true; {99399#true} is VALID [2022-04-08 12:39:50,657 INFO L290 TraceCheckUtils]: 8: Hoare triple {99399#true} assume !(0 == ~cond); {99399#true} is VALID [2022-04-08 12:39:50,657 INFO L290 TraceCheckUtils]: 7: Hoare triple {99399#true} ~cond := #in~cond; {99399#true} is VALID [2022-04-08 12:39:50,657 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-08 12:39:50,657 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-08 12:39:50,657 INFO L272 TraceCheckUtils]: 4: Hoare triple {99581#(<= ~counter~0 6)} call #t~ret9 := main(); {99581#(<= ~counter~0 6)} is VALID [2022-04-08 12:39:50,658 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {99581#(<= ~counter~0 6)} {99399#true} #102#return; {99581#(<= ~counter~0 6)} is VALID [2022-04-08 12:39:50,658 INFO L290 TraceCheckUtils]: 2: Hoare triple {99581#(<= ~counter~0 6)} assume true; {99581#(<= ~counter~0 6)} is VALID [2022-04-08 12:39:50,658 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-08 12:39:50,658 INFO L272 TraceCheckUtils]: 0: Hoare triple {99399#true} call ULTIMATE.init(); {99399#true} is VALID [2022-04-08 12:39:50,659 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-08 12:39:50,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:39:50,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049707466] [2022-04-08 12:39:50,659 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:39:50,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1897050174] [2022-04-08 12:39:50,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1897050174] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:39:50,659 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:39:50,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 24 [2022-04-08 12:39:50,659 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:39:50,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [257471697] [2022-04-08 12:39:50,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [257471697] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:39:50,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:39:50,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-08 12:39:50,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471864001] [2022-04-08 12:39:50,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:39:50,660 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-08 12:39:50,660 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:39:50,660 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-08 12:39:50,765 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-08 12:39:50,765 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-08 12:39:50,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:39:50,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-08 12:39:50,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-08 12:39:50,766 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-08 12:39:54,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:39:54,063 INFO L93 Difference]: Finished difference Result 903 states and 1260 transitions. [2022-04-08 12:39:54,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-08 12:39:54,063 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-08 12:39:54,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:39:54,063 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-08 12:39:54,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 296 transitions. [2022-04-08 12:39:54,065 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-08 12:39:54,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 296 transitions. [2022-04-08 12:39:54,067 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 296 transitions. [2022-04-08 12:39:54,325 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-08 12:39:54,347 INFO L225 Difference]: With dead ends: 903 [2022-04-08 12:39:54,348 INFO L226 Difference]: Without dead ends: 706 [2022-04-08 12:39:54,348 INFO L912 BasicCegarLoop]: 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-08 12:39:54,349 INFO L913 BasicCegarLoop]: 69 mSDtfsCounter, 205 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-08 12:39:54,349 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [205 Valid, 291 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 12:39:54,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2022-04-08 12:39:56,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 706. [2022-04-08 12:39:56,511 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:39:56,512 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-08 12:39:56,512 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-08 12:39:56,513 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-08 12:39:56,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:39:56,529 INFO L93 Difference]: Finished difference Result 706 states and 952 transitions. [2022-04-08 12:39:56,529 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 952 transitions. [2022-04-08 12:39:56,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:39:56,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:39:56,530 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-08 12:39:56,530 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-08 12:39:56,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:39:56,546 INFO L93 Difference]: Finished difference Result 706 states and 952 transitions. [2022-04-08 12:39:56,546 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 952 transitions. [2022-04-08 12:39:56,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:39:56,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:39:56,547 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:39:56,547 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:39:56,548 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-08 12:39:56,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 952 transitions. [2022-04-08 12:39:56,576 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 952 transitions. Word has length 131 [2022-04-08 12:39:56,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:39:56,576 INFO L478 AbstractCegarLoop]: Abstraction has 706 states and 952 transitions. [2022-04-08 12:39:56,576 INFO L479 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-08 12:39:56,576 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 706 states and 952 transitions. [2022-04-08 12:40:01,514 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 952 edges. 951 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 12:40:01,514 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 952 transitions. [2022-04-08 12:40:01,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-04-08 12:40:01,516 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:40:01,516 INFO L499 BasicCegarLoop]: 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-08 12:40:01,522 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-08 12:40:01,716 WARN L460 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-08 12:40:01,716 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:40:01,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:40:01,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1252937077, now seen corresponding path program 11 times [2022-04-08 12:40:01,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:40:01,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [749123531] [2022-04-08 12:40:01,717 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:40:01,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1252937077, now seen corresponding path program 12 times [2022-04-08 12:40:01,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:40:01,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866628126] [2022-04-08 12:40:01,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:40:01,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:40:01,729 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:40:01,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1250583750] [2022-04-08 12:40:01,729 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 12:40:01,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:40:01,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:40:01,730 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-08 12:40:01,757 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-08 12:40:01,820 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 12:40:01,820 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:40:01,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-08 12:40:01,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:40:01,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:40:02,396 INFO L272 TraceCheckUtils]: 0: Hoare triple {104862#true} call ULTIMATE.init(); {104862#true} is VALID [2022-04-08 12:40:02,396 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-08 12:40:02,396 INFO L290 TraceCheckUtils]: 2: Hoare triple {104862#true} assume true; {104862#true} is VALID [2022-04-08 12:40:02,397 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {104862#true} {104862#true} #102#return; {104862#true} is VALID [2022-04-08 12:40:02,397 INFO L272 TraceCheckUtils]: 4: Hoare triple {104862#true} call #t~ret9 := main(); {104862#true} is VALID [2022-04-08 12:40:02,397 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-08 12:40:02,397 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-08 12:40:02,397 INFO L290 TraceCheckUtils]: 7: Hoare triple {104862#true} ~cond := #in~cond; {104862#true} is VALID [2022-04-08 12:40:02,397 INFO L290 TraceCheckUtils]: 8: Hoare triple {104862#true} assume !(0 == ~cond); {104862#true} is VALID [2022-04-08 12:40:02,397 INFO L290 TraceCheckUtils]: 9: Hoare triple {104862#true} assume true; {104862#true} is VALID [2022-04-08 12:40:02,397 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {104862#true} {104862#true} #90#return; {104862#true} is VALID [2022-04-08 12:40:02,397 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-08 12:40:02,397 INFO L290 TraceCheckUtils]: 12: Hoare triple {104862#true} ~cond := #in~cond; {104862#true} is VALID [2022-04-08 12:40:02,397 INFO L290 TraceCheckUtils]: 13: Hoare triple {104862#true} assume !(0 == ~cond); {104862#true} is VALID [2022-04-08 12:40:02,397 INFO L290 TraceCheckUtils]: 14: Hoare triple {104862#true} assume true; {104862#true} is VALID [2022-04-08 12:40:02,397 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {104862#true} {104862#true} #92#return; {104862#true} is VALID [2022-04-08 12:40:02,397 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-08 12:40:02,398 INFO L290 TraceCheckUtils]: 17: Hoare triple {104862#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {104862#true} is VALID [2022-04-08 12:40:02,398 INFO L290 TraceCheckUtils]: 18: Hoare triple {104862#true} assume !!(#t~post6 < 20);havoc #t~post6; {104862#true} is VALID [2022-04-08 12:40:02,398 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-08 12:40:02,398 INFO L290 TraceCheckUtils]: 20: Hoare triple {104862#true} ~cond := #in~cond; {104862#true} is VALID [2022-04-08 12:40:02,398 INFO L290 TraceCheckUtils]: 21: Hoare triple {104862#true} assume !(0 == ~cond); {104862#true} is VALID [2022-04-08 12:40:02,398 INFO L290 TraceCheckUtils]: 22: Hoare triple {104862#true} assume true; {104862#true} is VALID [2022-04-08 12:40:02,398 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {104862#true} {104862#true} #94#return; {104862#true} is VALID [2022-04-08 12:40:02,398 INFO L290 TraceCheckUtils]: 24: Hoare triple {104862#true} assume !!(0 != ~r~0); {104862#true} is VALID [2022-04-08 12:40:02,398 INFO L290 TraceCheckUtils]: 25: Hoare triple {104862#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {104862#true} is VALID [2022-04-08 12:40:02,398 INFO L290 TraceCheckUtils]: 26: Hoare triple {104862#true} assume !!(#t~post7 < 20);havoc #t~post7; {104862#true} is VALID [2022-04-08 12:40:02,398 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-08 12:40:02,398 INFO L290 TraceCheckUtils]: 28: Hoare triple {104862#true} ~cond := #in~cond; {104862#true} is VALID [2022-04-08 12:40:02,398 INFO L290 TraceCheckUtils]: 29: Hoare triple {104862#true} assume !(0 == ~cond); {104862#true} is VALID [2022-04-08 12:40:02,398 INFO L290 TraceCheckUtils]: 30: Hoare triple {104862#true} assume true; {104862#true} is VALID [2022-04-08 12:40:02,398 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {104862#true} {104862#true} #96#return; {104862#true} is VALID [2022-04-08 12:40:02,398 INFO L290 TraceCheckUtils]: 32: Hoare triple {104862#true} assume !(~r~0 > 0); {104862#true} is VALID [2022-04-08 12:40:02,399 INFO L290 TraceCheckUtils]: 33: Hoare triple {104862#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {104862#true} is VALID [2022-04-08 12:40:02,399 INFO L290 TraceCheckUtils]: 34: Hoare triple {104862#true} assume !!(#t~post8 < 20);havoc #t~post8; {104862#true} is VALID [2022-04-08 12:40:02,399 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-08 12:40:02,399 INFO L290 TraceCheckUtils]: 36: Hoare triple {104862#true} ~cond := #in~cond; {104862#true} is VALID [2022-04-08 12:40:02,399 INFO L290 TraceCheckUtils]: 37: Hoare triple {104862#true} assume !(0 == ~cond); {104862#true} is VALID [2022-04-08 12:40:02,399 INFO L290 TraceCheckUtils]: 38: Hoare triple {104862#true} assume true; {104862#true} is VALID [2022-04-08 12:40:02,399 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {104862#true} {104862#true} #98#return; {104862#true} is VALID [2022-04-08 12:40:02,399 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-08 12:40:02,399 INFO L290 TraceCheckUtils]: 41: Hoare triple {104862#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {104862#true} is VALID [2022-04-08 12:40:02,399 INFO L290 TraceCheckUtils]: 42: Hoare triple {104862#true} assume !!(#t~post8 < 20);havoc #t~post8; {104862#true} is VALID [2022-04-08 12:40:02,399 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-08 12:40:02,399 INFO L290 TraceCheckUtils]: 44: Hoare triple {104862#true} ~cond := #in~cond; {104862#true} is VALID [2022-04-08 12:40:02,399 INFO L290 TraceCheckUtils]: 45: Hoare triple {104862#true} assume !(0 == ~cond); {104862#true} is VALID [2022-04-08 12:40:02,399 INFO L290 TraceCheckUtils]: 46: Hoare triple {104862#true} assume true; {104862#true} is VALID [2022-04-08 12:40:02,399 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {104862#true} {104862#true} #98#return; {104862#true} is VALID [2022-04-08 12:40:02,400 INFO L290 TraceCheckUtils]: 48: Hoare triple {104862#true} assume !(~r~0 < 0); {104862#true} is VALID [2022-04-08 12:40:02,400 INFO L290 TraceCheckUtils]: 49: Hoare triple {104862#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {104862#true} is VALID [2022-04-08 12:40:02,400 INFO L290 TraceCheckUtils]: 50: Hoare triple {104862#true} assume !!(#t~post6 < 20);havoc #t~post6; {104862#true} is VALID [2022-04-08 12:40:02,400 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-08 12:40:02,400 INFO L290 TraceCheckUtils]: 52: Hoare triple {104862#true} ~cond := #in~cond; {104862#true} is VALID [2022-04-08 12:40:02,400 INFO L290 TraceCheckUtils]: 53: Hoare triple {104862#true} assume !(0 == ~cond); {104862#true} is VALID [2022-04-08 12:40:02,400 INFO L290 TraceCheckUtils]: 54: Hoare triple {104862#true} assume true; {104862#true} is VALID [2022-04-08 12:40:02,400 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {104862#true} {104862#true} #94#return; {104862#true} is VALID [2022-04-08 12:40:02,400 INFO L290 TraceCheckUtils]: 56: Hoare triple {104862#true} assume !!(0 != ~r~0); {104862#true} is VALID [2022-04-08 12:40:02,400 INFO L290 TraceCheckUtils]: 57: Hoare triple {104862#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {104862#true} is VALID [2022-04-08 12:40:02,400 INFO L290 TraceCheckUtils]: 58: Hoare triple {104862#true} assume !!(#t~post7 < 20);havoc #t~post7; {104862#true} is VALID [2022-04-08 12:40:02,400 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-08 12:40:02,400 INFO L290 TraceCheckUtils]: 60: Hoare triple {104862#true} ~cond := #in~cond; {104862#true} is VALID [2022-04-08 12:40:02,400 INFO L290 TraceCheckUtils]: 61: Hoare triple {104862#true} assume !(0 == ~cond); {104862#true} is VALID [2022-04-08 12:40:02,400 INFO L290 TraceCheckUtils]: 62: Hoare triple {104862#true} assume true; {104862#true} is VALID [2022-04-08 12:40:02,401 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {104862#true} {104862#true} #96#return; {104862#true} is VALID [2022-04-08 12:40:02,401 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-08 12:40:02,401 INFO L290 TraceCheckUtils]: 65: Hoare triple {104862#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {104862#true} is VALID [2022-04-08 12:40:02,401 INFO L290 TraceCheckUtils]: 66: Hoare triple {104862#true} assume !!(#t~post7 < 20);havoc #t~post7; {104862#true} is VALID [2022-04-08 12:40:02,401 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-08 12:40:02,401 INFO L290 TraceCheckUtils]: 68: Hoare triple {104862#true} ~cond := #in~cond; {104862#true} is VALID [2022-04-08 12:40:02,401 INFO L290 TraceCheckUtils]: 69: Hoare triple {104862#true} assume !(0 == ~cond); {104862#true} is VALID [2022-04-08 12:40:02,401 INFO L290 TraceCheckUtils]: 70: Hoare triple {104862#true} assume true; {104862#true} is VALID [2022-04-08 12:40:02,401 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {104862#true} {104862#true} #96#return; {104862#true} is VALID [2022-04-08 12:40:02,401 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-08 12:40:02,401 INFO L290 TraceCheckUtils]: 73: Hoare triple {104862#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {104862#true} is VALID [2022-04-08 12:40:02,401 INFO L290 TraceCheckUtils]: 74: Hoare triple {104862#true} assume !!(#t~post7 < 20);havoc #t~post7; {104862#true} is VALID [2022-04-08 12:40:02,401 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-08 12:40:02,401 INFO L290 TraceCheckUtils]: 76: Hoare triple {104862#true} ~cond := #in~cond; {104862#true} is VALID [2022-04-08 12:40:02,401 INFO L290 TraceCheckUtils]: 77: Hoare triple {104862#true} assume !(0 == ~cond); {104862#true} is VALID [2022-04-08 12:40:02,402 INFO L290 TraceCheckUtils]: 78: Hoare triple {104862#true} assume true; {104862#true} is VALID [2022-04-08 12:40:02,402 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {104862#true} {104862#true} #96#return; {104862#true} is VALID [2022-04-08 12:40:02,402 INFO L290 TraceCheckUtils]: 80: Hoare triple {104862#true} assume !(~r~0 > 0); {104862#true} is VALID [2022-04-08 12:40:02,402 INFO L290 TraceCheckUtils]: 81: Hoare triple {104862#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {104862#true} is VALID [2022-04-08 12:40:02,402 INFO L290 TraceCheckUtils]: 82: Hoare triple {104862#true} assume !!(#t~post8 < 20);havoc #t~post8; {104862#true} is VALID [2022-04-08 12:40:02,402 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-08 12:40:02,402 INFO L290 TraceCheckUtils]: 84: Hoare triple {104862#true} ~cond := #in~cond; {104862#true} is VALID [2022-04-08 12:40:02,402 INFO L290 TraceCheckUtils]: 85: Hoare triple {104862#true} assume !(0 == ~cond); {104862#true} is VALID [2022-04-08 12:40:02,402 INFO L290 TraceCheckUtils]: 86: Hoare triple {104862#true} assume true; {104862#true} is VALID [2022-04-08 12:40:02,402 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {104862#true} {104862#true} #98#return; {104862#true} is VALID [2022-04-08 12:40:02,402 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-08 12:40:02,402 INFO L290 TraceCheckUtils]: 89: Hoare triple {104862#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {104862#true} is VALID [2022-04-08 12:40:02,402 INFO L290 TraceCheckUtils]: 90: Hoare triple {104862#true} assume !!(#t~post8 < 20);havoc #t~post8; {104862#true} is VALID [2022-04-08 12:40:02,402 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-08 12:40:02,402 INFO L290 TraceCheckUtils]: 92: Hoare triple {104862#true} ~cond := #in~cond; {104862#true} is VALID [2022-04-08 12:40:02,402 INFO L290 TraceCheckUtils]: 93: Hoare triple {104862#true} assume !(0 == ~cond); {104862#true} is VALID [2022-04-08 12:40:02,403 INFO L290 TraceCheckUtils]: 94: Hoare triple {104862#true} assume true; {104862#true} is VALID [2022-04-08 12:40:02,403 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {104862#true} {104862#true} #98#return; {104862#true} is VALID [2022-04-08 12:40:02,403 INFO L290 TraceCheckUtils]: 96: Hoare triple {104862#true} assume !(~r~0 < 0); {104862#true} is VALID [2022-04-08 12:40:02,403 INFO L290 TraceCheckUtils]: 97: Hoare triple {104862#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {104862#true} is VALID [2022-04-08 12:40:02,403 INFO L290 TraceCheckUtils]: 98: Hoare triple {104862#true} assume !!(#t~post6 < 20);havoc #t~post6; {104862#true} is VALID [2022-04-08 12:40:02,403 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-08 12:40:02,403 INFO L290 TraceCheckUtils]: 100: Hoare triple {104862#true} ~cond := #in~cond; {104862#true} is VALID [2022-04-08 12:40:02,403 INFO L290 TraceCheckUtils]: 101: Hoare triple {104862#true} assume !(0 == ~cond); {104862#true} is VALID [2022-04-08 12:40:02,403 INFO L290 TraceCheckUtils]: 102: Hoare triple {104862#true} assume true; {104862#true} is VALID [2022-04-08 12:40:02,403 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {104862#true} {104862#true} #94#return; {104862#true} is VALID [2022-04-08 12:40:02,403 INFO L290 TraceCheckUtils]: 104: Hoare triple {104862#true} assume !!(0 != ~r~0); {104862#true} is VALID [2022-04-08 12:40:02,403 INFO L290 TraceCheckUtils]: 105: Hoare triple {104862#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {104862#true} is VALID [2022-04-08 12:40:02,403 INFO L290 TraceCheckUtils]: 106: Hoare triple {104862#true} assume !!(#t~post7 < 20);havoc #t~post7; {104862#true} is VALID [2022-04-08 12:40:02,403 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-08 12:40:02,403 INFO L290 TraceCheckUtils]: 108: Hoare triple {104862#true} ~cond := #in~cond; {104862#true} is VALID [2022-04-08 12:40:02,404 INFO L290 TraceCheckUtils]: 109: Hoare triple {104862#true} assume !(0 == ~cond); {104862#true} is VALID [2022-04-08 12:40:02,404 INFO L290 TraceCheckUtils]: 110: Hoare triple {104862#true} assume true; {104862#true} is VALID [2022-04-08 12:40:02,404 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {104862#true} {104862#true} #96#return; {104862#true} is VALID [2022-04-08 12:40:02,404 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-08 12:40:02,404 INFO L290 TraceCheckUtils]: 113: Hoare triple {104862#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {104862#true} is VALID [2022-04-08 12:40:02,404 INFO L290 TraceCheckUtils]: 114: Hoare triple {104862#true} assume !!(#t~post7 < 20);havoc #t~post7; {104862#true} is VALID [2022-04-08 12:40:02,404 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-08 12:40:02,404 INFO L290 TraceCheckUtils]: 116: Hoare triple {104862#true} ~cond := #in~cond; {104862#true} is VALID [2022-04-08 12:40:02,404 INFO L290 TraceCheckUtils]: 117: Hoare triple {104862#true} assume !(0 == ~cond); {104862#true} is VALID [2022-04-08 12:40:02,404 INFO L290 TraceCheckUtils]: 118: Hoare triple {104862#true} assume true; {104862#true} is VALID [2022-04-08 12:40:02,404 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {104862#true} {104862#true} #96#return; {104862#true} is VALID [2022-04-08 12:40:02,404 INFO L290 TraceCheckUtils]: 120: Hoare triple {104862#true} assume !(~r~0 > 0); {105227#(not (< 0 main_~r~0))} is VALID [2022-04-08 12:40:02,405 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-08 12:40:02,405 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-08 12:40:02,405 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-08 12:40:02,405 INFO L290 TraceCheckUtils]: 124: Hoare triple {104862#true} ~cond := #in~cond; {105240#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:40:02,406 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-08 12:40:02,406 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-08 12:40:02,407 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-08 12:40:02,410 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-08 12:40:02,410 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-08 12:40:02,411 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-08 12:40:02,412 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-08 12:40:02,412 INFO L290 TraceCheckUtils]: 132: Hoare triple {105265#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {105269#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:40:02,413 INFO L290 TraceCheckUtils]: 133: Hoare triple {105269#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {104863#false} is VALID [2022-04-08 12:40:02,413 INFO L290 TraceCheckUtils]: 134: Hoare triple {104863#false} assume !false; {104863#false} is VALID [2022-04-08 12:40:02,413 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-08 12:40:02,413 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:40:04,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:40:04,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866628126] [2022-04-08 12:40:04,887 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:40:04,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1250583750] [2022-04-08 12:40:04,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1250583750] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 12:40:04,887 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 12:40:04,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-08 12:40:04,887 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:40:04,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [749123531] [2022-04-08 12:40:04,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [749123531] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:40:04,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:40:04,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 12:40:04,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047655831] [2022-04-08 12:40:04,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:40:04,888 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-08 12:40:04,888 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:40:04,888 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-08 12:40:04,928 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-08 12:40:04,928 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 12:40:04,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:40:04,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 12:40:04,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=84, Unknown=1, NotChecked=0, Total=110 [2022-04-08 12:40:04,929 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-08 12:40:08,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:40:08,074 INFO L93 Difference]: Finished difference Result 758 states and 1028 transitions. [2022-04-08 12:40:08,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 12:40:08,074 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-08 12:40:08,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:40:08,075 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-08 12:40:08,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 79 transitions. [2022-04-08 12:40:08,075 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-08 12:40:08,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 79 transitions. [2022-04-08 12:40:08,076 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 79 transitions. [2022-04-08 12:40:08,148 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-08 12:40:08,169 INFO L225 Difference]: With dead ends: 758 [2022-04-08 12:40:08,169 INFO L226 Difference]: Without dead ends: 746 [2022-04-08 12:40:08,169 INFO L912 BasicCegarLoop]: 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-08 12:40:08,170 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 27 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 12:40:08,170 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 295 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 12:40:08,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2022-04-08 12:40:10,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 683. [2022-04-08 12:40:10,296 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:40:10,297 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-08 12:40:10,298 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-08 12:40:10,298 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-08 12:40:10,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:40:10,318 INFO L93 Difference]: Finished difference Result 746 states and 1010 transitions. [2022-04-08 12:40:10,318 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1010 transitions. [2022-04-08 12:40:10,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:40:10,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:40:10,320 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-08 12:40:10,320 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-08 12:40:10,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:40:10,338 INFO L93 Difference]: Finished difference Result 746 states and 1010 transitions. [2022-04-08 12:40:10,338 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1010 transitions. [2022-04-08 12:40:10,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:40:10,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:40:10,339 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:40:10,339 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:40:10,340 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-08 12:40:10,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 912 transitions. [2022-04-08 12:40:10,360 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 912 transitions. Word has length 135 [2022-04-08 12:40:10,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:40:10,360 INFO L478 AbstractCegarLoop]: Abstraction has 683 states and 912 transitions. [2022-04-08 12:40:10,360 INFO L479 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-08 12:40:10,360 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 683 states and 912 transitions. [2022-04-08 12:40:15,205 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-08 12:40:15,205 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 912 transitions. [2022-04-08 12:40:15,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-04-08 12:40:15,206 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:40:15,206 INFO L499 BasicCegarLoop]: 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-08 12:40:15,210 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-08 12:40:15,410 WARN L460 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-08 12:40:15,410 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:40:15,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:40:15,411 INFO L85 PathProgramCache]: Analyzing trace with hash 200539575, now seen corresponding path program 13 times [2022-04-08 12:40:15,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:40:15,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [79358341] [2022-04-08 12:40:15,411 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:40:15,411 INFO L85 PathProgramCache]: Analyzing trace with hash 200539575, now seen corresponding path program 14 times [2022-04-08 12:40:15,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:40:15,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707283567] [2022-04-08 12:40:15,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:40:15,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:40:15,428 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:40:15,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1925726997] [2022-04-08 12:40:15,428 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:40:15,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:40:15,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:40:15,429 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-08 12:40:15,430 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-08 12:40:15,489 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:40:15,489 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:40:15,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-08 12:40:15,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:40:15,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:40:16,194 INFO L272 TraceCheckUtils]: 0: Hoare triple {109682#true} call ULTIMATE.init(); {109682#true} is VALID [2022-04-08 12:40:16,195 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-08 12:40:16,195 INFO L290 TraceCheckUtils]: 2: Hoare triple {109690#(<= ~counter~0 0)} assume true; {109690#(<= ~counter~0 0)} is VALID [2022-04-08 12:40:16,195 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {109690#(<= ~counter~0 0)} {109682#true} #102#return; {109690#(<= ~counter~0 0)} is VALID [2022-04-08 12:40:16,196 INFO L272 TraceCheckUtils]: 4: Hoare triple {109690#(<= ~counter~0 0)} call #t~ret9 := main(); {109690#(<= ~counter~0 0)} is VALID [2022-04-08 12:40:16,196 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-08 12:40:16,196 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-08 12:40:16,197 INFO L290 TraceCheckUtils]: 7: Hoare triple {109690#(<= ~counter~0 0)} ~cond := #in~cond; {109690#(<= ~counter~0 0)} is VALID [2022-04-08 12:40:16,197 INFO L290 TraceCheckUtils]: 8: Hoare triple {109690#(<= ~counter~0 0)} assume !(0 == ~cond); {109690#(<= ~counter~0 0)} is VALID [2022-04-08 12:40:16,197 INFO L290 TraceCheckUtils]: 9: Hoare triple {109690#(<= ~counter~0 0)} assume true; {109690#(<= ~counter~0 0)} is VALID [2022-04-08 12:40:16,198 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {109690#(<= ~counter~0 0)} {109690#(<= ~counter~0 0)} #90#return; {109690#(<= ~counter~0 0)} is VALID [2022-04-08 12:40:16,198 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-08 12:40:16,198 INFO L290 TraceCheckUtils]: 12: Hoare triple {109690#(<= ~counter~0 0)} ~cond := #in~cond; {109690#(<= ~counter~0 0)} is VALID [2022-04-08 12:40:16,198 INFO L290 TraceCheckUtils]: 13: Hoare triple {109690#(<= ~counter~0 0)} assume !(0 == ~cond); {109690#(<= ~counter~0 0)} is VALID [2022-04-08 12:40:16,199 INFO L290 TraceCheckUtils]: 14: Hoare triple {109690#(<= ~counter~0 0)} assume true; {109690#(<= ~counter~0 0)} is VALID [2022-04-08 12:40:16,199 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {109690#(<= ~counter~0 0)} {109690#(<= ~counter~0 0)} #92#return; {109690#(<= ~counter~0 0)} is VALID [2022-04-08 12:40:16,199 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-08 12:40:16,201 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-08 12:40:16,202 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-08 12:40:16,202 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-08 12:40:16,202 INFO L290 TraceCheckUtils]: 20: Hoare triple {109739#(<= ~counter~0 1)} ~cond := #in~cond; {109739#(<= ~counter~0 1)} is VALID [2022-04-08 12:40:16,203 INFO L290 TraceCheckUtils]: 21: Hoare triple {109739#(<= ~counter~0 1)} assume !(0 == ~cond); {109739#(<= ~counter~0 1)} is VALID [2022-04-08 12:40:16,203 INFO L290 TraceCheckUtils]: 22: Hoare triple {109739#(<= ~counter~0 1)} assume true; {109739#(<= ~counter~0 1)} is VALID [2022-04-08 12:40:16,203 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {109739#(<= ~counter~0 1)} {109739#(<= ~counter~0 1)} #94#return; {109739#(<= ~counter~0 1)} is VALID [2022-04-08 12:40:16,204 INFO L290 TraceCheckUtils]: 24: Hoare triple {109739#(<= ~counter~0 1)} assume !!(0 != ~r~0); {109739#(<= ~counter~0 1)} is VALID [2022-04-08 12:40:16,205 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-08 12:40:16,205 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-08 12:40:16,205 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-08 12:40:16,206 INFO L290 TraceCheckUtils]: 28: Hoare triple {109764#(<= ~counter~0 2)} ~cond := #in~cond; {109764#(<= ~counter~0 2)} is VALID [2022-04-08 12:40:16,206 INFO L290 TraceCheckUtils]: 29: Hoare triple {109764#(<= ~counter~0 2)} assume !(0 == ~cond); {109764#(<= ~counter~0 2)} is VALID [2022-04-08 12:40:16,206 INFO L290 TraceCheckUtils]: 30: Hoare triple {109764#(<= ~counter~0 2)} assume true; {109764#(<= ~counter~0 2)} is VALID [2022-04-08 12:40:16,207 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {109764#(<= ~counter~0 2)} {109764#(<= ~counter~0 2)} #96#return; {109764#(<= ~counter~0 2)} is VALID [2022-04-08 12:40:16,207 INFO L290 TraceCheckUtils]: 32: Hoare triple {109764#(<= ~counter~0 2)} assume !(~r~0 > 0); {109764#(<= ~counter~0 2)} is VALID [2022-04-08 12:40:16,208 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-08 12:40:16,208 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-08 12:40:16,209 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-08 12:40:16,209 INFO L290 TraceCheckUtils]: 36: Hoare triple {109789#(<= ~counter~0 3)} ~cond := #in~cond; {109789#(<= ~counter~0 3)} is VALID [2022-04-08 12:40:16,209 INFO L290 TraceCheckUtils]: 37: Hoare triple {109789#(<= ~counter~0 3)} assume !(0 == ~cond); {109789#(<= ~counter~0 3)} is VALID [2022-04-08 12:40:16,209 INFO L290 TraceCheckUtils]: 38: Hoare triple {109789#(<= ~counter~0 3)} assume true; {109789#(<= ~counter~0 3)} is VALID [2022-04-08 12:40:16,210 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {109789#(<= ~counter~0 3)} {109789#(<= ~counter~0 3)} #98#return; {109789#(<= ~counter~0 3)} is VALID [2022-04-08 12:40:16,210 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-08 12:40:16,211 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-08 12:40:16,211 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-08 12:40:16,212 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-08 12:40:16,212 INFO L290 TraceCheckUtils]: 44: Hoare triple {109814#(<= ~counter~0 4)} ~cond := #in~cond; {109814#(<= ~counter~0 4)} is VALID [2022-04-08 12:40:16,212 INFO L290 TraceCheckUtils]: 45: Hoare triple {109814#(<= ~counter~0 4)} assume !(0 == ~cond); {109814#(<= ~counter~0 4)} is VALID [2022-04-08 12:40:16,212 INFO L290 TraceCheckUtils]: 46: Hoare triple {109814#(<= ~counter~0 4)} assume true; {109814#(<= ~counter~0 4)} is VALID [2022-04-08 12:40:16,213 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {109814#(<= ~counter~0 4)} {109814#(<= ~counter~0 4)} #98#return; {109814#(<= ~counter~0 4)} is VALID [2022-04-08 12:40:16,213 INFO L290 TraceCheckUtils]: 48: Hoare triple {109814#(<= ~counter~0 4)} assume !(~r~0 < 0); {109814#(<= ~counter~0 4)} is VALID [2022-04-08 12:40:16,214 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-08 12:40:16,214 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-08 12:40:16,215 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-08 12:40:16,215 INFO L290 TraceCheckUtils]: 52: Hoare triple {109839#(<= ~counter~0 5)} ~cond := #in~cond; {109839#(<= ~counter~0 5)} is VALID [2022-04-08 12:40:16,215 INFO L290 TraceCheckUtils]: 53: Hoare triple {109839#(<= ~counter~0 5)} assume !(0 == ~cond); {109839#(<= ~counter~0 5)} is VALID [2022-04-08 12:40:16,216 INFO L290 TraceCheckUtils]: 54: Hoare triple {109839#(<= ~counter~0 5)} assume true; {109839#(<= ~counter~0 5)} is VALID [2022-04-08 12:40:16,216 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {109839#(<= ~counter~0 5)} {109839#(<= ~counter~0 5)} #94#return; {109839#(<= ~counter~0 5)} is VALID [2022-04-08 12:40:16,216 INFO L290 TraceCheckUtils]: 56: Hoare triple {109839#(<= ~counter~0 5)} assume !!(0 != ~r~0); {109839#(<= ~counter~0 5)} is VALID [2022-04-08 12:40:16,217 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-08 12:40:16,218 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-08 12:40:16,218 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-08 12:40:16,218 INFO L290 TraceCheckUtils]: 60: Hoare triple {109864#(<= ~counter~0 6)} ~cond := #in~cond; {109864#(<= ~counter~0 6)} is VALID [2022-04-08 12:40:16,219 INFO L290 TraceCheckUtils]: 61: Hoare triple {109864#(<= ~counter~0 6)} assume !(0 == ~cond); {109864#(<= ~counter~0 6)} is VALID [2022-04-08 12:40:16,219 INFO L290 TraceCheckUtils]: 62: Hoare triple {109864#(<= ~counter~0 6)} assume true; {109864#(<= ~counter~0 6)} is VALID [2022-04-08 12:40:16,219 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {109864#(<= ~counter~0 6)} {109864#(<= ~counter~0 6)} #96#return; {109864#(<= ~counter~0 6)} is VALID [2022-04-08 12:40:16,220 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-08 12:40:16,220 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-08 12:40:16,221 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-08 12:40:16,221 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-08 12:40:16,221 INFO L290 TraceCheckUtils]: 68: Hoare triple {109889#(<= ~counter~0 7)} ~cond := #in~cond; {109889#(<= ~counter~0 7)} is VALID [2022-04-08 12:40:16,222 INFO L290 TraceCheckUtils]: 69: Hoare triple {109889#(<= ~counter~0 7)} assume !(0 == ~cond); {109889#(<= ~counter~0 7)} is VALID [2022-04-08 12:40:16,222 INFO L290 TraceCheckUtils]: 70: Hoare triple {109889#(<= ~counter~0 7)} assume true; {109889#(<= ~counter~0 7)} is VALID [2022-04-08 12:40:16,222 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {109889#(<= ~counter~0 7)} {109889#(<= ~counter~0 7)} #96#return; {109889#(<= ~counter~0 7)} is VALID [2022-04-08 12:40:16,223 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-08 12:40:16,224 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-08 12:40:16,224 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-08 12:40:16,224 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-08 12:40:16,225 INFO L290 TraceCheckUtils]: 76: Hoare triple {109914#(<= ~counter~0 8)} ~cond := #in~cond; {109914#(<= ~counter~0 8)} is VALID [2022-04-08 12:40:16,225 INFO L290 TraceCheckUtils]: 77: Hoare triple {109914#(<= ~counter~0 8)} assume !(0 == ~cond); {109914#(<= ~counter~0 8)} is VALID [2022-04-08 12:40:16,225 INFO L290 TraceCheckUtils]: 78: Hoare triple {109914#(<= ~counter~0 8)} assume true; {109914#(<= ~counter~0 8)} is VALID [2022-04-08 12:40:16,226 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {109914#(<= ~counter~0 8)} {109914#(<= ~counter~0 8)} #96#return; {109914#(<= ~counter~0 8)} is VALID [2022-04-08 12:40:16,226 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-08 12:40:16,227 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-08 12:40:16,227 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-08 12:40:16,228 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-08 12:40:16,228 INFO L290 TraceCheckUtils]: 84: Hoare triple {109939#(<= ~counter~0 9)} ~cond := #in~cond; {109939#(<= ~counter~0 9)} is VALID [2022-04-08 12:40:16,228 INFO L290 TraceCheckUtils]: 85: Hoare triple {109939#(<= ~counter~0 9)} assume !(0 == ~cond); {109939#(<= ~counter~0 9)} is VALID [2022-04-08 12:40:16,228 INFO L290 TraceCheckUtils]: 86: Hoare triple {109939#(<= ~counter~0 9)} assume true; {109939#(<= ~counter~0 9)} is VALID [2022-04-08 12:40:16,229 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {109939#(<= ~counter~0 9)} {109939#(<= ~counter~0 9)} #96#return; {109939#(<= ~counter~0 9)} is VALID [2022-04-08 12:40:16,229 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-08 12:40:16,230 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-08 12:40:16,230 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-08 12:40:16,231 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-08 12:40:16,231 INFO L290 TraceCheckUtils]: 92: Hoare triple {109964#(<= ~counter~0 10)} ~cond := #in~cond; {109964#(<= ~counter~0 10)} is VALID [2022-04-08 12:40:16,231 INFO L290 TraceCheckUtils]: 93: Hoare triple {109964#(<= ~counter~0 10)} assume !(0 == ~cond); {109964#(<= ~counter~0 10)} is VALID [2022-04-08 12:40:16,231 INFO L290 TraceCheckUtils]: 94: Hoare triple {109964#(<= ~counter~0 10)} assume true; {109964#(<= ~counter~0 10)} is VALID [2022-04-08 12:40:16,232 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {109964#(<= ~counter~0 10)} {109964#(<= ~counter~0 10)} #96#return; {109964#(<= ~counter~0 10)} is VALID [2022-04-08 12:40:16,232 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-08 12:40:16,233 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-08 12:40:16,233 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-08 12:40:16,234 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-08 12:40:16,234 INFO L290 TraceCheckUtils]: 100: Hoare triple {109989#(<= ~counter~0 11)} ~cond := #in~cond; {109989#(<= ~counter~0 11)} is VALID [2022-04-08 12:40:16,234 INFO L290 TraceCheckUtils]: 101: Hoare triple {109989#(<= ~counter~0 11)} assume !(0 == ~cond); {109989#(<= ~counter~0 11)} is VALID [2022-04-08 12:40:16,234 INFO L290 TraceCheckUtils]: 102: Hoare triple {109989#(<= ~counter~0 11)} assume true; {109989#(<= ~counter~0 11)} is VALID [2022-04-08 12:40:16,235 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {109989#(<= ~counter~0 11)} {109989#(<= ~counter~0 11)} #96#return; {109989#(<= ~counter~0 11)} is VALID [2022-04-08 12:40:16,235 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-08 12:40:16,236 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-08 12:40:16,236 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-08 12:40:16,237 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-08 12:40:16,237 INFO L290 TraceCheckUtils]: 108: Hoare triple {110014#(<= ~counter~0 12)} ~cond := #in~cond; {110014#(<= ~counter~0 12)} is VALID [2022-04-08 12:40:16,237 INFO L290 TraceCheckUtils]: 109: Hoare triple {110014#(<= ~counter~0 12)} assume !(0 == ~cond); {110014#(<= ~counter~0 12)} is VALID [2022-04-08 12:40:16,238 INFO L290 TraceCheckUtils]: 110: Hoare triple {110014#(<= ~counter~0 12)} assume true; {110014#(<= ~counter~0 12)} is VALID [2022-04-08 12:40:16,238 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {110014#(<= ~counter~0 12)} {110014#(<= ~counter~0 12)} #96#return; {110014#(<= ~counter~0 12)} is VALID [2022-04-08 12:40:16,238 INFO L290 TraceCheckUtils]: 112: Hoare triple {110014#(<= ~counter~0 12)} assume !(~r~0 > 0); {110014#(<= ~counter~0 12)} is VALID [2022-04-08 12:40:16,239 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-08 12:40:16,239 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-08 12:40:16,240 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-08 12:40:16,240 INFO L290 TraceCheckUtils]: 116: Hoare triple {110039#(<= ~counter~0 13)} ~cond := #in~cond; {110039#(<= ~counter~0 13)} is VALID [2022-04-08 12:40:16,240 INFO L290 TraceCheckUtils]: 117: Hoare triple {110039#(<= ~counter~0 13)} assume !(0 == ~cond); {110039#(<= ~counter~0 13)} is VALID [2022-04-08 12:40:16,241 INFO L290 TraceCheckUtils]: 118: Hoare triple {110039#(<= ~counter~0 13)} assume true; {110039#(<= ~counter~0 13)} is VALID [2022-04-08 12:40:16,241 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {110039#(<= ~counter~0 13)} {110039#(<= ~counter~0 13)} #98#return; {110039#(<= ~counter~0 13)} is VALID [2022-04-08 12:40:16,241 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-08 12:40:16,242 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-08 12:40:16,243 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-08 12:40:16,243 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-08 12:40:16,243 INFO L290 TraceCheckUtils]: 124: Hoare triple {110064#(<= ~counter~0 14)} ~cond := #in~cond; {110064#(<= ~counter~0 14)} is VALID [2022-04-08 12:40:16,244 INFO L290 TraceCheckUtils]: 125: Hoare triple {110064#(<= ~counter~0 14)} assume !(0 == ~cond); {110064#(<= ~counter~0 14)} is VALID [2022-04-08 12:40:16,244 INFO L290 TraceCheckUtils]: 126: Hoare triple {110064#(<= ~counter~0 14)} assume true; {110064#(<= ~counter~0 14)} is VALID [2022-04-08 12:40:16,244 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {110064#(<= ~counter~0 14)} {110064#(<= ~counter~0 14)} #98#return; {110064#(<= ~counter~0 14)} is VALID [2022-04-08 12:40:16,244 INFO L290 TraceCheckUtils]: 128: Hoare triple {110064#(<= ~counter~0 14)} assume !(~r~0 < 0); {110064#(<= ~counter~0 14)} is VALID [2022-04-08 12:40:16,245 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-08 12:40:16,245 INFO L290 TraceCheckUtils]: 130: Hoare triple {110089#(<= |main_#t~post6| 14)} assume !(#t~post6 < 20);havoc #t~post6; {109683#false} is VALID [2022-04-08 12:40:16,245 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-08 12:40:16,245 INFO L290 TraceCheckUtils]: 132: Hoare triple {109683#false} ~cond := #in~cond; {109683#false} is VALID [2022-04-08 12:40:16,245 INFO L290 TraceCheckUtils]: 133: Hoare triple {109683#false} assume 0 == ~cond; {109683#false} is VALID [2022-04-08 12:40:16,245 INFO L290 TraceCheckUtils]: 134: Hoare triple {109683#false} assume !false; {109683#false} is VALID [2022-04-08 12:40:16,246 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-08 12:40:16,246 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:40:16,865 INFO L290 TraceCheckUtils]: 134: Hoare triple {109683#false} assume !false; {109683#false} is VALID [2022-04-08 12:40:16,866 INFO L290 TraceCheckUtils]: 133: Hoare triple {109683#false} assume 0 == ~cond; {109683#false} is VALID [2022-04-08 12:40:16,866 INFO L290 TraceCheckUtils]: 132: Hoare triple {109683#false} ~cond := #in~cond; {109683#false} is VALID [2022-04-08 12:40:16,866 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-08 12:40:16,866 INFO L290 TraceCheckUtils]: 130: Hoare triple {110117#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {109683#false} is VALID [2022-04-08 12:40:16,866 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-08 12:40:16,867 INFO L290 TraceCheckUtils]: 128: Hoare triple {110121#(< ~counter~0 20)} assume !(~r~0 < 0); {110121#(< ~counter~0 20)} is VALID [2022-04-08 12:40:16,867 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {109682#true} {110121#(< ~counter~0 20)} #98#return; {110121#(< ~counter~0 20)} is VALID [2022-04-08 12:40:16,867 INFO L290 TraceCheckUtils]: 126: Hoare triple {109682#true} assume true; {109682#true} is VALID [2022-04-08 12:40:16,867 INFO L290 TraceCheckUtils]: 125: Hoare triple {109682#true} assume !(0 == ~cond); {109682#true} is VALID [2022-04-08 12:40:16,867 INFO L290 TraceCheckUtils]: 124: Hoare triple {109682#true} ~cond := #in~cond; {109682#true} is VALID [2022-04-08 12:40:16,867 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-08 12:40:16,868 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-08 12:40:16,870 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-08 12:40:16,870 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-08 12:40:16,871 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {109682#true} {110146#(< ~counter~0 19)} #98#return; {110146#(< ~counter~0 19)} is VALID [2022-04-08 12:40:16,871 INFO L290 TraceCheckUtils]: 118: Hoare triple {109682#true} assume true; {109682#true} is VALID [2022-04-08 12:40:16,871 INFO L290 TraceCheckUtils]: 117: Hoare triple {109682#true} assume !(0 == ~cond); {109682#true} is VALID [2022-04-08 12:40:16,871 INFO L290 TraceCheckUtils]: 116: Hoare triple {109682#true} ~cond := #in~cond; {109682#true} is VALID [2022-04-08 12:40:16,871 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-08 12:40:16,871 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-08 12:40:16,872 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-08 12:40:16,873 INFO L290 TraceCheckUtils]: 112: Hoare triple {110171#(< ~counter~0 18)} assume !(~r~0 > 0); {110171#(< ~counter~0 18)} is VALID [2022-04-08 12:40:16,873 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {109682#true} {110171#(< ~counter~0 18)} #96#return; {110171#(< ~counter~0 18)} is VALID [2022-04-08 12:40:16,873 INFO L290 TraceCheckUtils]: 110: Hoare triple {109682#true} assume true; {109682#true} is VALID [2022-04-08 12:40:16,873 INFO L290 TraceCheckUtils]: 109: Hoare triple {109682#true} assume !(0 == ~cond); {109682#true} is VALID [2022-04-08 12:40:16,873 INFO L290 TraceCheckUtils]: 108: Hoare triple {109682#true} ~cond := #in~cond; {109682#true} is VALID [2022-04-08 12:40:16,873 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-08 12:40:16,874 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-08 12:40:16,875 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-08 12:40:16,875 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-08 12:40:16,875 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {109682#true} {110196#(< ~counter~0 17)} #96#return; {110196#(< ~counter~0 17)} is VALID [2022-04-08 12:40:16,875 INFO L290 TraceCheckUtils]: 102: Hoare triple {109682#true} assume true; {109682#true} is VALID [2022-04-08 12:40:16,876 INFO L290 TraceCheckUtils]: 101: Hoare triple {109682#true} assume !(0 == ~cond); {109682#true} is VALID [2022-04-08 12:40:16,876 INFO L290 TraceCheckUtils]: 100: Hoare triple {109682#true} ~cond := #in~cond; {109682#true} is VALID [2022-04-08 12:40:16,876 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-08 12:40:16,876 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-08 12:40:16,877 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-08 12:40:16,877 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-08 12:40:16,878 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {109682#true} {110221#(< ~counter~0 16)} #96#return; {110221#(< ~counter~0 16)} is VALID [2022-04-08 12:40:16,878 INFO L290 TraceCheckUtils]: 94: Hoare triple {109682#true} assume true; {109682#true} is VALID [2022-04-08 12:40:16,878 INFO L290 TraceCheckUtils]: 93: Hoare triple {109682#true} assume !(0 == ~cond); {109682#true} is VALID [2022-04-08 12:40:16,878 INFO L290 TraceCheckUtils]: 92: Hoare triple {109682#true} ~cond := #in~cond; {109682#true} is VALID [2022-04-08 12:40:16,878 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-08 12:40:16,878 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-08 12:40:16,879 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-08 12:40:16,879 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-08 12:40:16,880 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {109682#true} {110064#(<= ~counter~0 14)} #96#return; {110064#(<= ~counter~0 14)} is VALID [2022-04-08 12:40:16,880 INFO L290 TraceCheckUtils]: 86: Hoare triple {109682#true} assume true; {109682#true} is VALID [2022-04-08 12:40:16,880 INFO L290 TraceCheckUtils]: 85: Hoare triple {109682#true} assume !(0 == ~cond); {109682#true} is VALID [2022-04-08 12:40:16,880 INFO L290 TraceCheckUtils]: 84: Hoare triple {109682#true} ~cond := #in~cond; {109682#true} is VALID [2022-04-08 12:40:16,880 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-08 12:40:16,881 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-08 12:40:16,882 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-08 12:40:16,882 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-08 12:40:16,882 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {109682#true} {110039#(<= ~counter~0 13)} #96#return; {110039#(<= ~counter~0 13)} is VALID [2022-04-08 12:40:16,882 INFO L290 TraceCheckUtils]: 78: Hoare triple {109682#true} assume true; {109682#true} is VALID [2022-04-08 12:40:16,883 INFO L290 TraceCheckUtils]: 77: Hoare triple {109682#true} assume !(0 == ~cond); {109682#true} is VALID [2022-04-08 12:40:16,883 INFO L290 TraceCheckUtils]: 76: Hoare triple {109682#true} ~cond := #in~cond; {109682#true} is VALID [2022-04-08 12:40:16,883 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-08 12:40:16,883 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-08 12:40:16,884 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-08 12:40:16,884 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-08 12:40:16,885 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {109682#true} {110014#(<= ~counter~0 12)} #96#return; {110014#(<= ~counter~0 12)} is VALID [2022-04-08 12:40:16,885 INFO L290 TraceCheckUtils]: 70: Hoare triple {109682#true} assume true; {109682#true} is VALID [2022-04-08 12:40:16,885 INFO L290 TraceCheckUtils]: 69: Hoare triple {109682#true} assume !(0 == ~cond); {109682#true} is VALID [2022-04-08 12:40:16,885 INFO L290 TraceCheckUtils]: 68: Hoare triple {109682#true} ~cond := #in~cond; {109682#true} is VALID [2022-04-08 12:40:16,885 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-08 12:40:16,885 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-08 12:40:16,886 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-08 12:40:16,886 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-08 12:40:16,887 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {109682#true} {109989#(<= ~counter~0 11)} #96#return; {109989#(<= ~counter~0 11)} is VALID [2022-04-08 12:40:16,887 INFO L290 TraceCheckUtils]: 62: Hoare triple {109682#true} assume true; {109682#true} is VALID [2022-04-08 12:40:16,887 INFO L290 TraceCheckUtils]: 61: Hoare triple {109682#true} assume !(0 == ~cond); {109682#true} is VALID [2022-04-08 12:40:16,887 INFO L290 TraceCheckUtils]: 60: Hoare triple {109682#true} ~cond := #in~cond; {109682#true} is VALID [2022-04-08 12:40:16,887 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-08 12:40:16,887 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-08 12:40:16,888 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-08 12:40:16,889 INFO L290 TraceCheckUtils]: 56: Hoare triple {109964#(<= ~counter~0 10)} assume !!(0 != ~r~0); {109964#(<= ~counter~0 10)} is VALID [2022-04-08 12:40:16,889 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {109682#true} {109964#(<= ~counter~0 10)} #94#return; {109964#(<= ~counter~0 10)} is VALID [2022-04-08 12:40:16,889 INFO L290 TraceCheckUtils]: 54: Hoare triple {109682#true} assume true; {109682#true} is VALID [2022-04-08 12:40:16,889 INFO L290 TraceCheckUtils]: 53: Hoare triple {109682#true} assume !(0 == ~cond); {109682#true} is VALID [2022-04-08 12:40:16,889 INFO L290 TraceCheckUtils]: 52: Hoare triple {109682#true} ~cond := #in~cond; {109682#true} is VALID [2022-04-08 12:40:16,889 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-08 12:40:16,890 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-08 12:40:16,891 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-08 12:40:16,891 INFO L290 TraceCheckUtils]: 48: Hoare triple {109939#(<= ~counter~0 9)} assume !(~r~0 < 0); {109939#(<= ~counter~0 9)} is VALID [2022-04-08 12:40:16,891 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {109682#true} {109939#(<= ~counter~0 9)} #98#return; {109939#(<= ~counter~0 9)} is VALID [2022-04-08 12:40:16,892 INFO L290 TraceCheckUtils]: 46: Hoare triple {109682#true} assume true; {109682#true} is VALID [2022-04-08 12:40:16,892 INFO L290 TraceCheckUtils]: 45: Hoare triple {109682#true} assume !(0 == ~cond); {109682#true} is VALID [2022-04-08 12:40:16,892 INFO L290 TraceCheckUtils]: 44: Hoare triple {109682#true} ~cond := #in~cond; {109682#true} is VALID [2022-04-08 12:40:16,892 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-08 12:40:16,892 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-08 12:40:16,893 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-08 12:40:16,893 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-08 12:40:16,894 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {109682#true} {109914#(<= ~counter~0 8)} #98#return; {109914#(<= ~counter~0 8)} is VALID [2022-04-08 12:40:16,894 INFO L290 TraceCheckUtils]: 38: Hoare triple {109682#true} assume true; {109682#true} is VALID [2022-04-08 12:40:16,894 INFO L290 TraceCheckUtils]: 37: Hoare triple {109682#true} assume !(0 == ~cond); {109682#true} is VALID [2022-04-08 12:40:16,894 INFO L290 TraceCheckUtils]: 36: Hoare triple {109682#true} ~cond := #in~cond; {109682#true} is VALID [2022-04-08 12:40:16,894 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-08 12:40:16,894 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-08 12:40:16,895 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-08 12:40:16,896 INFO L290 TraceCheckUtils]: 32: Hoare triple {109889#(<= ~counter~0 7)} assume !(~r~0 > 0); {109889#(<= ~counter~0 7)} is VALID [2022-04-08 12:40:16,896 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {109682#true} {109889#(<= ~counter~0 7)} #96#return; {109889#(<= ~counter~0 7)} is VALID [2022-04-08 12:40:16,896 INFO L290 TraceCheckUtils]: 30: Hoare triple {109682#true} assume true; {109682#true} is VALID [2022-04-08 12:40:16,896 INFO L290 TraceCheckUtils]: 29: Hoare triple {109682#true} assume !(0 == ~cond); {109682#true} is VALID [2022-04-08 12:40:16,896 INFO L290 TraceCheckUtils]: 28: Hoare triple {109682#true} ~cond := #in~cond; {109682#true} is VALID [2022-04-08 12:40:16,896 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-08 12:40:16,897 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-08 12:40:16,898 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-08 12:40:16,898 INFO L290 TraceCheckUtils]: 24: Hoare triple {109864#(<= ~counter~0 6)} assume !!(0 != ~r~0); {109864#(<= ~counter~0 6)} is VALID [2022-04-08 12:40:16,898 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {109682#true} {109864#(<= ~counter~0 6)} #94#return; {109864#(<= ~counter~0 6)} is VALID [2022-04-08 12:40:16,898 INFO L290 TraceCheckUtils]: 22: Hoare triple {109682#true} assume true; {109682#true} is VALID [2022-04-08 12:40:16,898 INFO L290 TraceCheckUtils]: 21: Hoare triple {109682#true} assume !(0 == ~cond); {109682#true} is VALID [2022-04-08 12:40:16,898 INFO L290 TraceCheckUtils]: 20: Hoare triple {109682#true} ~cond := #in~cond; {109682#true} is VALID [2022-04-08 12:40:16,899 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-08 12:40:16,899 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-08 12:40:16,900 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-08 12:40:16,900 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-08 12:40:16,900 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {109682#true} {109839#(<= ~counter~0 5)} #92#return; {109839#(<= ~counter~0 5)} is VALID [2022-04-08 12:40:16,900 INFO L290 TraceCheckUtils]: 14: Hoare triple {109682#true} assume true; {109682#true} is VALID [2022-04-08 12:40:16,901 INFO L290 TraceCheckUtils]: 13: Hoare triple {109682#true} assume !(0 == ~cond); {109682#true} is VALID [2022-04-08 12:40:16,901 INFO L290 TraceCheckUtils]: 12: Hoare triple {109682#true} ~cond := #in~cond; {109682#true} is VALID [2022-04-08 12:40:16,901 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-08 12:40:16,901 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {109682#true} {109839#(<= ~counter~0 5)} #90#return; {109839#(<= ~counter~0 5)} is VALID [2022-04-08 12:40:16,901 INFO L290 TraceCheckUtils]: 9: Hoare triple {109682#true} assume true; {109682#true} is VALID [2022-04-08 12:40:16,901 INFO L290 TraceCheckUtils]: 8: Hoare triple {109682#true} assume !(0 == ~cond); {109682#true} is VALID [2022-04-08 12:40:16,901 INFO L290 TraceCheckUtils]: 7: Hoare triple {109682#true} ~cond := #in~cond; {109682#true} is VALID [2022-04-08 12:40:16,901 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-08 12:40:16,902 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-08 12:40:16,902 INFO L272 TraceCheckUtils]: 4: Hoare triple {109839#(<= ~counter~0 5)} call #t~ret9 := main(); {109839#(<= ~counter~0 5)} is VALID [2022-04-08 12:40:16,902 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {109839#(<= ~counter~0 5)} {109682#true} #102#return; {109839#(<= ~counter~0 5)} is VALID [2022-04-08 12:40:16,902 INFO L290 TraceCheckUtils]: 2: Hoare triple {109839#(<= ~counter~0 5)} assume true; {109839#(<= ~counter~0 5)} is VALID [2022-04-08 12:40:16,903 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-08 12:40:16,903 INFO L272 TraceCheckUtils]: 0: Hoare triple {109682#true} call ULTIMATE.init(); {109682#true} is VALID [2022-04-08 12:40:16,903 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-08 12:40:16,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:40:16,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707283567] [2022-04-08 12:40:16,904 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:40:16,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925726997] [2022-04-08 12:40:16,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925726997] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:40:16,904 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:40:16,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 24 [2022-04-08 12:40:16,904 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:40:16,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [79358341] [2022-04-08 12:40:16,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [79358341] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:40:16,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:40:16,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-08 12:40:16,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478014746] [2022-04-08 12:40:16,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:40:16,905 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-08 12:40:16,905 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:40:16,905 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-08 12:40:17,026 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-08 12:40:17,026 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-08 12:40:17,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:40:17,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-08 12:40:17,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-08 12:40:17,027 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-08 12:40:20,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:40:20,653 INFO L93 Difference]: Finished difference Result 734 states and 982 transitions. [2022-04-08 12:40:20,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-08 12:40:20,653 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-08 12:40:20,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:40:20,654 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-08 12:40:20,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 294 transitions. [2022-04-08 12:40:20,656 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-08 12:40:20,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 294 transitions. [2022-04-08 12:40:20,658 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 294 transitions. [2022-04-08 12:40:20,945 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-08 12:40:20,966 INFO L225 Difference]: With dead ends: 734 [2022-04-08 12:40:20,967 INFO L226 Difference]: Without dead ends: 729 [2022-04-08 12:40:20,967 INFO L912 BasicCegarLoop]: 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-08 12:40:20,967 INFO L913 BasicCegarLoop]: 72 mSDtfsCounter, 192 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.5s IncrementalHoareTripleChecker+Time [2022-04-08 12:40:20,968 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [192 Valid, 356 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 12:40:20,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2022-04-08 12:40:23,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 707. [2022-04-08 12:40:23,098 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:40:23,099 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-08 12:40:23,100 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-08 12:40:23,100 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-08 12:40:23,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:40:23,116 INFO L93 Difference]: Finished difference Result 729 states and 976 transitions. [2022-04-08 12:40:23,116 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 976 transitions. [2022-04-08 12:40:23,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:40:23,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:40:23,117 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-08 12:40:23,118 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-08 12:40:23,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:40:23,134 INFO L93 Difference]: Finished difference Result 729 states and 976 transitions. [2022-04-08 12:40:23,134 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 976 transitions. [2022-04-08 12:40:23,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:40:23,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:40:23,140 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:40:23,140 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:40:23,140 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-08 12:40:23,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 950 transitions. [2022-04-08 12:40:23,163 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 950 transitions. Word has length 135 [2022-04-08 12:40:23,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:40:23,163 INFO L478 AbstractCegarLoop]: Abstraction has 707 states and 950 transitions. [2022-04-08 12:40:23,163 INFO L479 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-08 12:40:23,163 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 707 states and 950 transitions. [2022-04-08 12:40:27,296 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-08 12:40:27,296 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 950 transitions. [2022-04-08 12:40:27,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-04-08 12:40:27,297 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:40:27,297 INFO L499 BasicCegarLoop]: 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-08 12:40:27,313 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-08 12:40:27,497 WARN L460 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-08 12:40:27,498 INFO L403 AbstractCegarLoop]: === Iteration 47 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:40:27,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:40:27,498 INFO L85 PathProgramCache]: Analyzing trace with hash -972958086, now seen corresponding path program 21 times [2022-04-08 12:40:27,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:40:27,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2036105326] [2022-04-08 12:40:27,498 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:40:27,498 INFO L85 PathProgramCache]: Analyzing trace with hash -972958086, now seen corresponding path program 22 times [2022-04-08 12:40:27,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:40:27,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657789296] [2022-04-08 12:40:27,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:40:27,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:40:27,510 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:40:27,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1410992599] [2022-04-08 12:40:27,511 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 12:40:27,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:40:27,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:40:27,511 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-08 12:40:27,512 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-08 12:40:27,567 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 12:40:27,567 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:40:27,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-08 12:40:27,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:40:27,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:42:39,879 INFO L272 TraceCheckUtils]: 0: Hoare triple {114877#true} call ULTIMATE.init(); {114877#true} is VALID [2022-04-08 12:42:39,879 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-08 12:42:39,879 INFO L290 TraceCheckUtils]: 2: Hoare triple {114877#true} assume true; {114877#true} is VALID [2022-04-08 12:42:39,879 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {114877#true} {114877#true} #102#return; {114877#true} is VALID [2022-04-08 12:42:39,879 INFO L272 TraceCheckUtils]: 4: Hoare triple {114877#true} call #t~ret9 := main(); {114877#true} is VALID [2022-04-08 12:42:39,879 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-08 12:42:39,879 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-08 12:42:39,879 INFO L290 TraceCheckUtils]: 7: Hoare triple {114877#true} ~cond := #in~cond; {114877#true} is VALID [2022-04-08 12:42:39,879 INFO L290 TraceCheckUtils]: 8: Hoare triple {114877#true} assume !(0 == ~cond); {114877#true} is VALID [2022-04-08 12:42:39,880 INFO L290 TraceCheckUtils]: 9: Hoare triple {114877#true} assume true; {114877#true} is VALID [2022-04-08 12:42:39,880 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {114877#true} {114877#true} #90#return; {114877#true} is VALID [2022-04-08 12:42:39,880 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-08 12:42:39,880 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-08 12:42:39,880 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-08 12:42:39,880 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-08 12:42:39,881 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-08 12:42:41,883 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-08 12:42:41,884 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-08 12:42:41,885 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-08 12:42:41,885 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-08 12:42:41,885 INFO L290 TraceCheckUtils]: 20: Hoare triple {114877#true} ~cond := #in~cond; {114877#true} is VALID [2022-04-08 12:42:41,885 INFO L290 TraceCheckUtils]: 21: Hoare triple {114877#true} assume !(0 == ~cond); {114877#true} is VALID [2022-04-08 12:42:41,885 INFO L290 TraceCheckUtils]: 22: Hoare triple {114877#true} assume true; {114877#true} is VALID [2022-04-08 12:42:41,885 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-08 12:42:41,886 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-08 12:42:41,886 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-08 12:42:41,887 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-08 12:42:41,887 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-08 12:42:41,887 INFO L290 TraceCheckUtils]: 28: Hoare triple {114877#true} ~cond := #in~cond; {114877#true} is VALID [2022-04-08 12:42:41,887 INFO L290 TraceCheckUtils]: 29: Hoare triple {114877#true} assume !(0 == ~cond); {114877#true} is VALID [2022-04-08 12:42:41,887 INFO L290 TraceCheckUtils]: 30: Hoare triple {114877#true} assume true; {114877#true} is VALID [2022-04-08 12:42:41,887 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-08 12:42:41,888 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-08 12:42:41,888 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-08 12:42:41,888 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-08 12:42:41,889 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-08 12:42:41,889 INFO L290 TraceCheckUtils]: 36: Hoare triple {114877#true} ~cond := #in~cond; {114877#true} is VALID [2022-04-08 12:42:41,889 INFO L290 TraceCheckUtils]: 37: Hoare triple {114877#true} assume !(0 == ~cond); {114877#true} is VALID [2022-04-08 12:42:41,889 INFO L290 TraceCheckUtils]: 38: Hoare triple {114877#true} assume true; {114877#true} is VALID [2022-04-08 12:42:41,889 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-08 12:42:42,208 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-08 12:42:42,211 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-08 12:42:42,213 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-08 12:42:42,213 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-08 12:42:42,213 INFO L290 TraceCheckUtils]: 44: Hoare triple {114877#true} ~cond := #in~cond; {114877#true} is VALID [2022-04-08 12:42:42,213 INFO L290 TraceCheckUtils]: 45: Hoare triple {114877#true} assume !(0 == ~cond); {114877#true} is VALID [2022-04-08 12:42:42,213 INFO L290 TraceCheckUtils]: 46: Hoare triple {114877#true} assume true; {114877#true} is VALID [2022-04-08 12:42:42,213 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-08 12:42:42,214 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-08 12:42:42,216 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-08 12:42:42,217 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-08 12:42:42,217 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-08 12:42:42,218 INFO L290 TraceCheckUtils]: 52: Hoare triple {114877#true} ~cond := #in~cond; {114877#true} is VALID [2022-04-08 12:42:42,218 INFO L290 TraceCheckUtils]: 53: Hoare triple {114877#true} assume !(0 == ~cond); {114877#true} is VALID [2022-04-08 12:42:42,218 INFO L290 TraceCheckUtils]: 54: Hoare triple {114877#true} assume true; {114877#true} is VALID [2022-04-08 12:42:42,218 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-08 12:42:42,219 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-08 12:42:42,220 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-08 12:42:42,221 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-08 12:42:42,221 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-08 12:42:42,221 INFO L290 TraceCheckUtils]: 60: Hoare triple {114877#true} ~cond := #in~cond; {114877#true} is VALID [2022-04-08 12:42:42,221 INFO L290 TraceCheckUtils]: 61: Hoare triple {114877#true} assume !(0 == ~cond); {114877#true} is VALID [2022-04-08 12:42:42,221 INFO L290 TraceCheckUtils]: 62: Hoare triple {114877#true} assume true; {114877#true} is VALID [2022-04-08 12:42:42,222 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-08 12:42:42,224 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-08 12:42:42,226 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-08 12:42:42,227 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-08 12:42:42,227 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-08 12:42:42,227 INFO L290 TraceCheckUtils]: 68: Hoare triple {114877#true} ~cond := #in~cond; {114877#true} is VALID [2022-04-08 12:42:42,227 INFO L290 TraceCheckUtils]: 69: Hoare triple {114877#true} assume !(0 == ~cond); {114877#true} is VALID [2022-04-08 12:42:42,227 INFO L290 TraceCheckUtils]: 70: Hoare triple {114877#true} assume true; {114877#true} is VALID [2022-04-08 12:42:42,227 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-08 12:42:42,229 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-08 12:42:42,229 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-08 12:42:42,231 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-08 12:42:42,231 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-08 12:42:42,231 INFO L290 TraceCheckUtils]: 76: Hoare triple {114877#true} ~cond := #in~cond; {114877#true} is VALID [2022-04-08 12:42:42,231 INFO L290 TraceCheckUtils]: 77: Hoare triple {114877#true} assume !(0 == ~cond); {114877#true} is VALID [2022-04-08 12:42:42,231 INFO L290 TraceCheckUtils]: 78: Hoare triple {114877#true} assume true; {114877#true} is VALID [2022-04-08 12:42:42,231 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-08 12:42:42,243 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-08 12:42:42,244 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-08 12:42:42,244 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-08 12:42:42,245 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-08 12:42:42,245 INFO L290 TraceCheckUtils]: 84: Hoare triple {114877#true} ~cond := #in~cond; {114877#true} is VALID [2022-04-08 12:42:42,245 INFO L290 TraceCheckUtils]: 85: Hoare triple {114877#true} assume !(0 == ~cond); {114877#true} is VALID [2022-04-08 12:42:42,245 INFO L290 TraceCheckUtils]: 86: Hoare triple {114877#true} assume true; {114877#true} is VALID [2022-04-08 12:42:42,245 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-08 12:42:42,249 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-08 12:42:42,254 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-08 12:42:42,255 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-08 12:42:42,255 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-08 12:42:42,255 INFO L290 TraceCheckUtils]: 92: Hoare triple {114877#true} ~cond := #in~cond; {114877#true} is VALID [2022-04-08 12:42:42,255 INFO L290 TraceCheckUtils]: 93: Hoare triple {114877#true} assume !(0 == ~cond); {114877#true} is VALID [2022-04-08 12:42:42,255 INFO L290 TraceCheckUtils]: 94: Hoare triple {114877#true} assume true; {114877#true} is VALID [2022-04-08 12:42:42,256 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-08 12:42:42,256 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-08 12:42:42,258 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-08 12:42:42,258 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-08 12:42:42,259 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-08 12:42:42,259 INFO L290 TraceCheckUtils]: 100: Hoare triple {114877#true} ~cond := #in~cond; {114877#true} is VALID [2022-04-08 12:42:42,259 INFO L290 TraceCheckUtils]: 101: Hoare triple {114877#true} assume !(0 == ~cond); {114877#true} is VALID [2022-04-08 12:42:42,259 INFO L290 TraceCheckUtils]: 102: Hoare triple {114877#true} assume true; {114877#true} is VALID [2022-04-08 12:42:42,259 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-08 12:42:42,260 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-08 12:42:42,265 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-08 12:42:42,266 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-08 12:42:42,266 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-08 12:42:42,266 INFO L290 TraceCheckUtils]: 108: Hoare triple {114877#true} ~cond := #in~cond; {114877#true} is VALID [2022-04-08 12:42:42,266 INFO L290 TraceCheckUtils]: 109: Hoare triple {114877#true} assume !(0 == ~cond); {114877#true} is VALID [2022-04-08 12:42:42,266 INFO L290 TraceCheckUtils]: 110: Hoare triple {114877#true} assume true; {114877#true} is VALID [2022-04-08 12:42:42,267 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-08 12:42:42,268 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-08 12:42:42,269 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-08 12:42:42,380 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-08 12:42:42,380 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-08 12:42:42,381 INFO L290 TraceCheckUtils]: 116: Hoare triple {114877#true} ~cond := #in~cond; {114877#true} is VALID [2022-04-08 12:42:42,381 INFO L290 TraceCheckUtils]: 117: Hoare triple {114877#true} assume !(0 == ~cond); {114877#true} is VALID [2022-04-08 12:42:42,381 INFO L290 TraceCheckUtils]: 118: Hoare triple {114877#true} assume true; {114877#true} is VALID [2022-04-08 12:42:42,381 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-08 12:42:42,383 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-08 12:42:42,384 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-08 12:42:42,387 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-08 12:42:42,387 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-08 12:42:42,387 INFO L290 TraceCheckUtils]: 124: Hoare triple {114877#true} ~cond := #in~cond; {114877#true} is VALID [2022-04-08 12:42:42,387 INFO L290 TraceCheckUtils]: 125: Hoare triple {114877#true} assume !(0 == ~cond); {114877#true} is VALID [2022-04-08 12:42:42,387 INFO L290 TraceCheckUtils]: 126: Hoare triple {114877#true} assume true; {114877#true} is VALID [2022-04-08 12:42:42,388 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-08 12:42:42,391 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-08 12:42:42,392 INFO L290 TraceCheckUtils]: 129: Hoare triple {114878#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {114878#false} is VALID [2022-04-08 12:42:42,392 INFO L290 TraceCheckUtils]: 130: Hoare triple {114878#false} assume !(#t~post8 < 20);havoc #t~post8; {114878#false} is VALID [2022-04-08 12:42:42,392 INFO L290 TraceCheckUtils]: 131: Hoare triple {114878#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {114878#false} is VALID [2022-04-08 12:42:42,392 INFO L290 TraceCheckUtils]: 132: Hoare triple {114878#false} assume !(#t~post6 < 20);havoc #t~post6; {114878#false} is VALID [2022-04-08 12:42:42,392 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-08 12:42:42,392 INFO L290 TraceCheckUtils]: 134: Hoare triple {114878#false} ~cond := #in~cond; {114878#false} is VALID [2022-04-08 12:42:42,392 INFO L290 TraceCheckUtils]: 135: Hoare triple {114878#false} assume 0 == ~cond; {114878#false} is VALID [2022-04-08 12:42:42,392 INFO L290 TraceCheckUtils]: 136: Hoare triple {114878#false} assume !false; {114878#false} is VALID [2022-04-08 12:42:42,393 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-08 12:42:42,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:42:46,034 INFO L290 TraceCheckUtils]: 136: Hoare triple {114878#false} assume !false; {114878#false} is VALID [2022-04-08 12:42:46,034 INFO L290 TraceCheckUtils]: 135: Hoare triple {114878#false} assume 0 == ~cond; {114878#false} is VALID [2022-04-08 12:42:46,034 INFO L290 TraceCheckUtils]: 134: Hoare triple {114878#false} ~cond := #in~cond; {114878#false} is VALID [2022-04-08 12:42:46,034 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-08 12:42:46,035 INFO L290 TraceCheckUtils]: 132: Hoare triple {114878#false} assume !(#t~post6 < 20);havoc #t~post6; {114878#false} is VALID [2022-04-08 12:42:46,035 INFO L290 TraceCheckUtils]: 131: Hoare triple {114878#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {114878#false} is VALID [2022-04-08 12:42:46,035 INFO L290 TraceCheckUtils]: 130: Hoare triple {114878#false} assume !(#t~post8 < 20);havoc #t~post8; {114878#false} is VALID [2022-04-08 12:42:46,035 INFO L290 TraceCheckUtils]: 129: Hoare triple {114878#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {114878#false} is VALID [2022-04-08 12:42:46,035 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-08 12:42:46,047 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-08 12:42:46,047 INFO L290 TraceCheckUtils]: 126: Hoare triple {114877#true} assume true; {114877#true} is VALID [2022-04-08 12:42:46,048 INFO L290 TraceCheckUtils]: 125: Hoare triple {114877#true} assume !(0 == ~cond); {114877#true} is VALID [2022-04-08 12:42:46,048 INFO L290 TraceCheckUtils]: 124: Hoare triple {114877#true} ~cond := #in~cond; {114877#true} is VALID [2022-04-08 12:42:46,048 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-08 12:42:46,048 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-08 12:42:46,048 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-08 12:42:46,049 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-08 12:42:46,049 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-08 12:42:46,049 INFO L290 TraceCheckUtils]: 118: Hoare triple {114877#true} assume true; {114877#true} is VALID [2022-04-08 12:42:46,049 INFO L290 TraceCheckUtils]: 117: Hoare triple {114877#true} assume !(0 == ~cond); {114877#true} is VALID [2022-04-08 12:42:46,049 INFO L290 TraceCheckUtils]: 116: Hoare triple {114877#true} ~cond := #in~cond; {114877#true} is VALID [2022-04-08 12:42:46,049 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-08 12:42:46,050 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-08 12:42:46,050 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-08 12:42:46,052 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-08 12:42:46,052 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-08 12:42:46,052 INFO L290 TraceCheckUtils]: 110: Hoare triple {114877#true} assume true; {114877#true} is VALID [2022-04-08 12:42:46,052 INFO L290 TraceCheckUtils]: 109: Hoare triple {114877#true} assume !(0 == ~cond); {114877#true} is VALID [2022-04-08 12:42:46,052 INFO L290 TraceCheckUtils]: 108: Hoare triple {114877#true} ~cond := #in~cond; {114877#true} is VALID [2022-04-08 12:42:46,052 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-08 12:42:46,053 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-08 12:42:46,053 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-08 12:42:46,053 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-08 12:42:46,054 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-08 12:42:46,054 INFO L290 TraceCheckUtils]: 102: Hoare triple {114877#true} assume true; {114877#true} is VALID [2022-04-08 12:42:46,054 INFO L290 TraceCheckUtils]: 101: Hoare triple {114877#true} assume !(0 == ~cond); {114877#true} is VALID [2022-04-08 12:42:46,054 INFO L290 TraceCheckUtils]: 100: Hoare triple {114877#true} ~cond := #in~cond; {114877#true} is VALID [2022-04-08 12:42:46,054 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-08 12:42:46,055 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-08 12:42:46,055 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-08 12:42:46,055 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-08 12:42:46,056 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-08 12:42:46,056 INFO L290 TraceCheckUtils]: 94: Hoare triple {114877#true} assume true; {114877#true} is VALID [2022-04-08 12:42:46,056 INFO L290 TraceCheckUtils]: 93: Hoare triple {114877#true} assume !(0 == ~cond); {114877#true} is VALID [2022-04-08 12:42:46,056 INFO L290 TraceCheckUtils]: 92: Hoare triple {114877#true} ~cond := #in~cond; {114877#true} is VALID [2022-04-08 12:42:46,056 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-08 12:42:46,056 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-08 12:42:46,057 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-08 12:42:46,059 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-08 12:42:46,060 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-08 12:42:46,060 INFO L290 TraceCheckUtils]: 86: Hoare triple {114877#true} assume true; {114877#true} is VALID [2022-04-08 12:42:46,060 INFO L290 TraceCheckUtils]: 85: Hoare triple {114877#true} assume !(0 == ~cond); {114877#true} is VALID [2022-04-08 12:42:46,060 INFO L290 TraceCheckUtils]: 84: Hoare triple {114877#true} ~cond := #in~cond; {114877#true} is VALID [2022-04-08 12:42:46,060 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-08 12:42:46,061 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-08 12:42:46,061 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-08 12:42:46,061 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-08 12:42:46,062 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-08 12:42:46,062 INFO L290 TraceCheckUtils]: 78: Hoare triple {114877#true} assume true; {114877#true} is VALID [2022-04-08 12:42:46,062 INFO L290 TraceCheckUtils]: 77: Hoare triple {114877#true} assume !(0 == ~cond); {114877#true} is VALID [2022-04-08 12:42:46,062 INFO L290 TraceCheckUtils]: 76: Hoare triple {114877#true} ~cond := #in~cond; {114877#true} is VALID [2022-04-08 12:42:46,062 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-08 12:42:46,062 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-08 12:42:46,062 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-08 12:42:46,063 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-08 12:42:46,064 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-08 12:42:46,064 INFO L290 TraceCheckUtils]: 70: Hoare triple {114877#true} assume true; {114877#true} is VALID [2022-04-08 12:42:46,064 INFO L290 TraceCheckUtils]: 69: Hoare triple {114877#true} assume !(0 == ~cond); {114877#true} is VALID [2022-04-08 12:42:46,064 INFO L290 TraceCheckUtils]: 68: Hoare triple {114877#true} ~cond := #in~cond; {114877#true} is VALID [2022-04-08 12:42:46,064 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-08 12:42:46,064 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-08 12:42:46,065 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-08 12:42:46,067 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-08 12:42:46,068 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-08 12:42:46,068 INFO L290 TraceCheckUtils]: 62: Hoare triple {114877#true} assume true; {114877#true} is VALID [2022-04-08 12:42:46,068 INFO L290 TraceCheckUtils]: 61: Hoare triple {114877#true} assume !(0 == ~cond); {114877#true} is VALID [2022-04-08 12:42:46,068 INFO L290 TraceCheckUtils]: 60: Hoare triple {114877#true} ~cond := #in~cond; {114877#true} is VALID [2022-04-08 12:42:46,068 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-08 12:42:46,068 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-08 12:42:46,069 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-08 12:42:46,069 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-08 12:42:46,069 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-08 12:42:46,070 INFO L290 TraceCheckUtils]: 54: Hoare triple {114877#true} assume true; {114877#true} is VALID [2022-04-08 12:42:46,070 INFO L290 TraceCheckUtils]: 53: Hoare triple {114877#true} assume !(0 == ~cond); {114877#true} is VALID [2022-04-08 12:42:46,070 INFO L290 TraceCheckUtils]: 52: Hoare triple {114877#true} ~cond := #in~cond; {114877#true} is VALID [2022-04-08 12:42:46,070 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-08 12:42:46,070 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-08 12:42:46,070 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-08 12:42:46,071 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-08 12:42:46,071 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-08 12:42:46,071 INFO L290 TraceCheckUtils]: 46: Hoare triple {114877#true} assume true; {114877#true} is VALID [2022-04-08 12:42:46,071 INFO L290 TraceCheckUtils]: 45: Hoare triple {114877#true} assume !(0 == ~cond); {114877#true} is VALID [2022-04-08 12:42:46,072 INFO L290 TraceCheckUtils]: 44: Hoare triple {114877#true} ~cond := #in~cond; {114877#true} is VALID [2022-04-08 12:42:46,072 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-08 12:42:46,072 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-08 12:42:46,072 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-08 12:42:46,076 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-08 12:42:46,076 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-08 12:42:46,076 INFO L290 TraceCheckUtils]: 38: Hoare triple {114877#true} assume true; {114877#true} is VALID [2022-04-08 12:42:46,076 INFO L290 TraceCheckUtils]: 37: Hoare triple {114877#true} assume !(0 == ~cond); {114877#true} is VALID [2022-04-08 12:42:46,076 INFO L290 TraceCheckUtils]: 36: Hoare triple {114877#true} ~cond := #in~cond; {114877#true} is VALID [2022-04-08 12:42:46,077 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-08 12:42:46,077 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-08 12:42:46,077 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-08 12:42:46,078 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-08 12:42:46,078 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-08 12:42:46,078 INFO L290 TraceCheckUtils]: 30: Hoare triple {114877#true} assume true; {114877#true} is VALID [2022-04-08 12:42:46,078 INFO L290 TraceCheckUtils]: 29: Hoare triple {114877#true} assume !(0 == ~cond); {114877#true} is VALID [2022-04-08 12:42:46,078 INFO L290 TraceCheckUtils]: 28: Hoare triple {114877#true} ~cond := #in~cond; {114877#true} is VALID [2022-04-08 12:42:46,078 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-08 12:42:46,079 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-08 12:42:46,079 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-08 12:42:46,079 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-08 12:42:46,080 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-08 12:42:46,080 INFO L290 TraceCheckUtils]: 22: Hoare triple {114877#true} assume true; {114877#true} is VALID [2022-04-08 12:42:46,080 INFO L290 TraceCheckUtils]: 21: Hoare triple {114877#true} assume !(0 == ~cond); {114877#true} is VALID [2022-04-08 12:42:46,080 INFO L290 TraceCheckUtils]: 20: Hoare triple {114877#true} ~cond := #in~cond; {114877#true} is VALID [2022-04-08 12:42:46,080 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-08 12:42:46,081 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-08 12:42:46,081 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-08 12:42:46,082 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-08 12:42:46,084 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-08 12:42:46,084 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-08 12:42:46,084 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-08 12:42:46,085 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-08 12:42:46,085 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-08 12:42:46,085 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {114877#true} {114877#true} #90#return; {114877#true} is VALID [2022-04-08 12:42:46,085 INFO L290 TraceCheckUtils]: 9: Hoare triple {114877#true} assume true; {114877#true} is VALID [2022-04-08 12:42:46,085 INFO L290 TraceCheckUtils]: 8: Hoare triple {114877#true} assume !(0 == ~cond); {114877#true} is VALID [2022-04-08 12:42:46,085 INFO L290 TraceCheckUtils]: 7: Hoare triple {114877#true} ~cond := #in~cond; {114877#true} is VALID [2022-04-08 12:42:46,085 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-08 12:42:46,085 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-08 12:42:46,085 INFO L272 TraceCheckUtils]: 4: Hoare triple {114877#true} call #t~ret9 := main(); {114877#true} is VALID [2022-04-08 12:42:46,085 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {114877#true} {114877#true} #102#return; {114877#true} is VALID [2022-04-08 12:42:46,085 INFO L290 TraceCheckUtils]: 2: Hoare triple {114877#true} assume true; {114877#true} is VALID [2022-04-08 12:42:46,085 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-08 12:42:46,085 INFO L272 TraceCheckUtils]: 0: Hoare triple {114877#true} call ULTIMATE.init(); {114877#true} is VALID [2022-04-08 12:42:46,086 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-08 12:42:46,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:42:46,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657789296] [2022-04-08 12:42:46,086 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:42:46,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410992599] [2022-04-08 12:42:46,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410992599] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:42:46,086 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:42:46,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2022-04-08 12:42:46,087 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:42:46,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2036105326] [2022-04-08 12:42:46,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2036105326] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:42:46,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:42:46,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 12:42:46,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146852678] [2022-04-08 12:42:46,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:42:46,087 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-08 12:42:46,087 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:42:46,087 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-08 12:42:57,524 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 93 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2022-04-08 12:42:57,524 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 12:42:57,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:42:57,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 12:42:57,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=289, Unknown=1, NotChecked=0, Total=342 [2022-04-08 12:42:57,525 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-08 12:43:01,434 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-08 12:43:13,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:43:13,282 INFO L93 Difference]: Finished difference Result 964 states and 1336 transitions. [2022-04-08 12:43:13,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 12:43:13,282 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-08 12:43:13,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:43:13,282 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-08 12:43:13,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 161 transitions. [2022-04-08 12:43:13,283 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-08 12:43:13,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 161 transitions. [2022-04-08 12:43:13,284 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 161 transitions. [2022-04-08 12:43:26,893 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 155 inductive. 0 not inductive. 6 times theorem prover too weak to decide inductivity. [2022-04-08 12:43:26,922 INFO L225 Difference]: With dead ends: 964 [2022-04-08 12:43:26,922 INFO L226 Difference]: Without dead ends: 851 [2022-04-08 12:43:26,923 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=70, Invalid=391, Unknown=1, NotChecked=0, Total=462 [2022-04-08 12:43:26,923 INFO L913 BasicCegarLoop]: 75 mSDtfsCounter, 28 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 223 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-08 12:43:26,923 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 458 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 56 Invalid, 1 Unknown, 223 Unchecked, 2.6s Time] [2022-04-08 12:43:26,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2022-04-08 12:43:29,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 707. [2022-04-08 12:43:29,256 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:43:29,257 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-08 12:43:29,258 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-08 12:43:29,258 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-08 12:43:29,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:43:29,282 INFO L93 Difference]: Finished difference Result 851 states and 1168 transitions. [2022-04-08 12:43:29,282 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1168 transitions. [2022-04-08 12:43:29,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:43:29,283 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:43:29,284 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-08 12:43:29,284 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-08 12:43:29,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:43:29,308 INFO L93 Difference]: Finished difference Result 851 states and 1168 transitions. [2022-04-08 12:43:29,308 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1168 transitions. [2022-04-08 12:43:29,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:43:29,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:43:29,309 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:43:29,309 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:43:29,310 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-08 12:43:29,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 950 transitions. [2022-04-08 12:43:29,330 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 950 transitions. Word has length 137 [2022-04-08 12:43:29,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:43:29,331 INFO L478 AbstractCegarLoop]: Abstraction has 707 states and 950 transitions. [2022-04-08 12:43:29,331 INFO L479 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-08 12:43:29,331 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 707 states and 950 transitions. [2022-04-08 12:43:40,590 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-08 12:43:40,590 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 950 transitions. [2022-04-08 12:43:40,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-04-08 12:43:40,591 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:43:40,592 INFO L499 BasicCegarLoop]: 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-08 12:43:40,609 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-08 12:43:40,792 WARN L460 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-08 12:43:40,792 INFO L403 AbstractCegarLoop]: === Iteration 48 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:43:40,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:43:40,792 INFO L85 PathProgramCache]: Analyzing trace with hash -134259028, now seen corresponding path program 23 times [2022-04-08 12:43:40,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:43:40,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1023282148] [2022-04-08 12:43:40,793 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:43:40,793 INFO L85 PathProgramCache]: Analyzing trace with hash -134259028, now seen corresponding path program 24 times [2022-04-08 12:43:40,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:43:40,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092015329] [2022-04-08 12:43:40,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:43:40,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:43:40,806 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:43:40,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [86145918] [2022-04-08 12:43:40,806 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 12:43:40,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:43:40,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:43:40,807 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-08 12:43:40,808 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-08 12:43:40,979 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-08 12:43:40,980 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:43:40,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-08 12:43:41,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:43:41,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:43:41,705 INFO L272 TraceCheckUtils]: 0: Hoare triple {120767#true} call ULTIMATE.init(); {120767#true} is VALID [2022-04-08 12:43:41,705 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-08 12:43:41,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {120775#(<= ~counter~0 0)} assume true; {120775#(<= ~counter~0 0)} is VALID [2022-04-08 12:43:41,706 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {120775#(<= ~counter~0 0)} {120767#true} #102#return; {120775#(<= ~counter~0 0)} is VALID [2022-04-08 12:43:41,706 INFO L272 TraceCheckUtils]: 4: Hoare triple {120775#(<= ~counter~0 0)} call #t~ret9 := main(); {120775#(<= ~counter~0 0)} is VALID [2022-04-08 12:43:41,707 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-08 12:43:41,707 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-08 12:43:41,707 INFO L290 TraceCheckUtils]: 7: Hoare triple {120775#(<= ~counter~0 0)} ~cond := #in~cond; {120775#(<= ~counter~0 0)} is VALID [2022-04-08 12:43:41,708 INFO L290 TraceCheckUtils]: 8: Hoare triple {120775#(<= ~counter~0 0)} assume !(0 == ~cond); {120775#(<= ~counter~0 0)} is VALID [2022-04-08 12:43:41,708 INFO L290 TraceCheckUtils]: 9: Hoare triple {120775#(<= ~counter~0 0)} assume true; {120775#(<= ~counter~0 0)} is VALID [2022-04-08 12:43:41,708 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {120775#(<= ~counter~0 0)} {120775#(<= ~counter~0 0)} #90#return; {120775#(<= ~counter~0 0)} is VALID [2022-04-08 12:43:41,709 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-08 12:43:41,709 INFO L290 TraceCheckUtils]: 12: Hoare triple {120775#(<= ~counter~0 0)} ~cond := #in~cond; {120775#(<= ~counter~0 0)} is VALID [2022-04-08 12:43:41,709 INFO L290 TraceCheckUtils]: 13: Hoare triple {120775#(<= ~counter~0 0)} assume !(0 == ~cond); {120775#(<= ~counter~0 0)} is VALID [2022-04-08 12:43:41,709 INFO L290 TraceCheckUtils]: 14: Hoare triple {120775#(<= ~counter~0 0)} assume true; {120775#(<= ~counter~0 0)} is VALID [2022-04-08 12:43:41,710 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {120775#(<= ~counter~0 0)} {120775#(<= ~counter~0 0)} #92#return; {120775#(<= ~counter~0 0)} is VALID [2022-04-08 12:43:41,710 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-08 12:43:41,712 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-08 12:43:41,713 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-08 12:43:41,713 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-08 12:43:41,713 INFO L290 TraceCheckUtils]: 20: Hoare triple {120824#(<= ~counter~0 1)} ~cond := #in~cond; {120824#(<= ~counter~0 1)} is VALID [2022-04-08 12:43:41,714 INFO L290 TraceCheckUtils]: 21: Hoare triple {120824#(<= ~counter~0 1)} assume !(0 == ~cond); {120824#(<= ~counter~0 1)} is VALID [2022-04-08 12:43:41,714 INFO L290 TraceCheckUtils]: 22: Hoare triple {120824#(<= ~counter~0 1)} assume true; {120824#(<= ~counter~0 1)} is VALID [2022-04-08 12:43:41,714 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {120824#(<= ~counter~0 1)} {120824#(<= ~counter~0 1)} #94#return; {120824#(<= ~counter~0 1)} is VALID [2022-04-08 12:43:41,715 INFO L290 TraceCheckUtils]: 24: Hoare triple {120824#(<= ~counter~0 1)} assume !!(0 != ~r~0); {120824#(<= ~counter~0 1)} is VALID [2022-04-08 12:43:41,716 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-08 12:43:41,716 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-08 12:43:41,716 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-08 12:43:41,717 INFO L290 TraceCheckUtils]: 28: Hoare triple {120849#(<= ~counter~0 2)} ~cond := #in~cond; {120849#(<= ~counter~0 2)} is VALID [2022-04-08 12:43:41,717 INFO L290 TraceCheckUtils]: 29: Hoare triple {120849#(<= ~counter~0 2)} assume !(0 == ~cond); {120849#(<= ~counter~0 2)} is VALID [2022-04-08 12:43:41,717 INFO L290 TraceCheckUtils]: 30: Hoare triple {120849#(<= ~counter~0 2)} assume true; {120849#(<= ~counter~0 2)} is VALID [2022-04-08 12:43:41,718 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {120849#(<= ~counter~0 2)} {120849#(<= ~counter~0 2)} #96#return; {120849#(<= ~counter~0 2)} is VALID [2022-04-08 12:43:41,718 INFO L290 TraceCheckUtils]: 32: Hoare triple {120849#(<= ~counter~0 2)} assume !(~r~0 > 0); {120849#(<= ~counter~0 2)} is VALID [2022-04-08 12:43:41,719 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-08 12:43:41,719 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-08 12:43:41,720 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-08 12:43:41,720 INFO L290 TraceCheckUtils]: 36: Hoare triple {120874#(<= ~counter~0 3)} ~cond := #in~cond; {120874#(<= ~counter~0 3)} is VALID [2022-04-08 12:43:41,720 INFO L290 TraceCheckUtils]: 37: Hoare triple {120874#(<= ~counter~0 3)} assume !(0 == ~cond); {120874#(<= ~counter~0 3)} is VALID [2022-04-08 12:43:41,720 INFO L290 TraceCheckUtils]: 38: Hoare triple {120874#(<= ~counter~0 3)} assume true; {120874#(<= ~counter~0 3)} is VALID [2022-04-08 12:43:41,721 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {120874#(<= ~counter~0 3)} {120874#(<= ~counter~0 3)} #98#return; {120874#(<= ~counter~0 3)} is VALID [2022-04-08 12:43:41,721 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-08 12:43:41,722 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-08 12:43:41,722 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-08 12:43:41,723 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-08 12:43:41,723 INFO L290 TraceCheckUtils]: 44: Hoare triple {120899#(<= ~counter~0 4)} ~cond := #in~cond; {120899#(<= ~counter~0 4)} is VALID [2022-04-08 12:43:41,723 INFO L290 TraceCheckUtils]: 45: Hoare triple {120899#(<= ~counter~0 4)} assume !(0 == ~cond); {120899#(<= ~counter~0 4)} is VALID [2022-04-08 12:43:41,724 INFO L290 TraceCheckUtils]: 46: Hoare triple {120899#(<= ~counter~0 4)} assume true; {120899#(<= ~counter~0 4)} is VALID [2022-04-08 12:43:41,724 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {120899#(<= ~counter~0 4)} {120899#(<= ~counter~0 4)} #98#return; {120899#(<= ~counter~0 4)} is VALID [2022-04-08 12:43:41,724 INFO L290 TraceCheckUtils]: 48: Hoare triple {120899#(<= ~counter~0 4)} assume !(~r~0 < 0); {120899#(<= ~counter~0 4)} is VALID [2022-04-08 12:43:41,725 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-08 12:43:41,726 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-08 12:43:41,726 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-08 12:43:41,726 INFO L290 TraceCheckUtils]: 52: Hoare triple {120924#(<= ~counter~0 5)} ~cond := #in~cond; {120924#(<= ~counter~0 5)} is VALID [2022-04-08 12:43:41,727 INFO L290 TraceCheckUtils]: 53: Hoare triple {120924#(<= ~counter~0 5)} assume !(0 == ~cond); {120924#(<= ~counter~0 5)} is VALID [2022-04-08 12:43:41,727 INFO L290 TraceCheckUtils]: 54: Hoare triple {120924#(<= ~counter~0 5)} assume true; {120924#(<= ~counter~0 5)} is VALID [2022-04-08 12:43:41,727 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {120924#(<= ~counter~0 5)} {120924#(<= ~counter~0 5)} #94#return; {120924#(<= ~counter~0 5)} is VALID [2022-04-08 12:43:41,728 INFO L290 TraceCheckUtils]: 56: Hoare triple {120924#(<= ~counter~0 5)} assume !!(0 != ~r~0); {120924#(<= ~counter~0 5)} is VALID [2022-04-08 12:43:41,729 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-08 12:43:41,729 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-08 12:43:41,730 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-08 12:43:41,730 INFO L290 TraceCheckUtils]: 60: Hoare triple {120949#(<= ~counter~0 6)} ~cond := #in~cond; {120949#(<= ~counter~0 6)} is VALID [2022-04-08 12:43:41,730 INFO L290 TraceCheckUtils]: 61: Hoare triple {120949#(<= ~counter~0 6)} assume !(0 == ~cond); {120949#(<= ~counter~0 6)} is VALID [2022-04-08 12:43:41,730 INFO L290 TraceCheckUtils]: 62: Hoare triple {120949#(<= ~counter~0 6)} assume true; {120949#(<= ~counter~0 6)} is VALID [2022-04-08 12:43:41,731 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {120949#(<= ~counter~0 6)} {120949#(<= ~counter~0 6)} #96#return; {120949#(<= ~counter~0 6)} is VALID [2022-04-08 12:43:41,731 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-08 12:43:41,732 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-08 12:43:41,732 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-08 12:43:41,733 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-08 12:43:41,733 INFO L290 TraceCheckUtils]: 68: Hoare triple {120974#(<= ~counter~0 7)} ~cond := #in~cond; {120974#(<= ~counter~0 7)} is VALID [2022-04-08 12:43:41,733 INFO L290 TraceCheckUtils]: 69: Hoare triple {120974#(<= ~counter~0 7)} assume !(0 == ~cond); {120974#(<= ~counter~0 7)} is VALID [2022-04-08 12:43:41,734 INFO L290 TraceCheckUtils]: 70: Hoare triple {120974#(<= ~counter~0 7)} assume true; {120974#(<= ~counter~0 7)} is VALID [2022-04-08 12:43:41,734 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {120974#(<= ~counter~0 7)} {120974#(<= ~counter~0 7)} #96#return; {120974#(<= ~counter~0 7)} is VALID [2022-04-08 12:43:41,734 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-08 12:43:41,735 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-08 12:43:41,736 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-08 12:43:41,736 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-08 12:43:41,736 INFO L290 TraceCheckUtils]: 76: Hoare triple {120999#(<= ~counter~0 8)} ~cond := #in~cond; {120999#(<= ~counter~0 8)} is VALID [2022-04-08 12:43:41,737 INFO L290 TraceCheckUtils]: 77: Hoare triple {120999#(<= ~counter~0 8)} assume !(0 == ~cond); {120999#(<= ~counter~0 8)} is VALID [2022-04-08 12:43:41,737 INFO L290 TraceCheckUtils]: 78: Hoare triple {120999#(<= ~counter~0 8)} assume true; {120999#(<= ~counter~0 8)} is VALID [2022-04-08 12:43:41,737 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {120999#(<= ~counter~0 8)} {120999#(<= ~counter~0 8)} #96#return; {120999#(<= ~counter~0 8)} is VALID [2022-04-08 12:43:41,738 INFO L290 TraceCheckUtils]: 80: Hoare triple {120999#(<= ~counter~0 8)} assume !(~r~0 > 0); {120999#(<= ~counter~0 8)} is VALID [2022-04-08 12:43:41,739 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-08 12:43:41,739 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-08 12:43:41,739 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-08 12:43:41,740 INFO L290 TraceCheckUtils]: 84: Hoare triple {121024#(<= ~counter~0 9)} ~cond := #in~cond; {121024#(<= ~counter~0 9)} is VALID [2022-04-08 12:43:41,740 INFO L290 TraceCheckUtils]: 85: Hoare triple {121024#(<= ~counter~0 9)} assume !(0 == ~cond); {121024#(<= ~counter~0 9)} is VALID [2022-04-08 12:43:41,740 INFO L290 TraceCheckUtils]: 86: Hoare triple {121024#(<= ~counter~0 9)} assume true; {121024#(<= ~counter~0 9)} is VALID [2022-04-08 12:43:41,741 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {121024#(<= ~counter~0 9)} {121024#(<= ~counter~0 9)} #98#return; {121024#(<= ~counter~0 9)} is VALID [2022-04-08 12:43:41,741 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-08 12:43:41,742 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-08 12:43:41,742 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-08 12:43:41,743 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-08 12:43:41,743 INFO L290 TraceCheckUtils]: 92: Hoare triple {121049#(<= ~counter~0 10)} ~cond := #in~cond; {121049#(<= ~counter~0 10)} is VALID [2022-04-08 12:43:41,743 INFO L290 TraceCheckUtils]: 93: Hoare triple {121049#(<= ~counter~0 10)} assume !(0 == ~cond); {121049#(<= ~counter~0 10)} is VALID [2022-04-08 12:43:41,743 INFO L290 TraceCheckUtils]: 94: Hoare triple {121049#(<= ~counter~0 10)} assume true; {121049#(<= ~counter~0 10)} is VALID [2022-04-08 12:43:41,744 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {121049#(<= ~counter~0 10)} {121049#(<= ~counter~0 10)} #98#return; {121049#(<= ~counter~0 10)} is VALID [2022-04-08 12:43:41,744 INFO L290 TraceCheckUtils]: 96: Hoare triple {121049#(<= ~counter~0 10)} assume !(~r~0 < 0); {121049#(<= ~counter~0 10)} is VALID [2022-04-08 12:43:41,745 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-08 12:43:41,745 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-08 12:43:41,746 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-08 12:43:41,746 INFO L290 TraceCheckUtils]: 100: Hoare triple {121074#(<= ~counter~0 11)} ~cond := #in~cond; {121074#(<= ~counter~0 11)} is VALID [2022-04-08 12:43:41,746 INFO L290 TraceCheckUtils]: 101: Hoare triple {121074#(<= ~counter~0 11)} assume !(0 == ~cond); {121074#(<= ~counter~0 11)} is VALID [2022-04-08 12:43:41,747 INFO L290 TraceCheckUtils]: 102: Hoare triple {121074#(<= ~counter~0 11)} assume true; {121074#(<= ~counter~0 11)} is VALID [2022-04-08 12:43:41,747 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {121074#(<= ~counter~0 11)} {121074#(<= ~counter~0 11)} #94#return; {121074#(<= ~counter~0 11)} is VALID [2022-04-08 12:43:41,747 INFO L290 TraceCheckUtils]: 104: Hoare triple {121074#(<= ~counter~0 11)} assume !!(0 != ~r~0); {121074#(<= ~counter~0 11)} is VALID [2022-04-08 12:43:41,749 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-08 12:43:41,749 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-08 12:43:41,749 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-08 12:43:41,750 INFO L290 TraceCheckUtils]: 108: Hoare triple {121099#(<= ~counter~0 12)} ~cond := #in~cond; {121099#(<= ~counter~0 12)} is VALID [2022-04-08 12:43:41,750 INFO L290 TraceCheckUtils]: 109: Hoare triple {121099#(<= ~counter~0 12)} assume !(0 == ~cond); {121099#(<= ~counter~0 12)} is VALID [2022-04-08 12:43:41,750 INFO L290 TraceCheckUtils]: 110: Hoare triple {121099#(<= ~counter~0 12)} assume true; {121099#(<= ~counter~0 12)} is VALID [2022-04-08 12:43:41,751 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {121099#(<= ~counter~0 12)} {121099#(<= ~counter~0 12)} #96#return; {121099#(<= ~counter~0 12)} is VALID [2022-04-08 12:43:41,751 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-08 12:43:41,752 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-08 12:43:41,753 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-08 12:43:41,753 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-08 12:43:41,753 INFO L290 TraceCheckUtils]: 116: Hoare triple {121124#(<= ~counter~0 13)} ~cond := #in~cond; {121124#(<= ~counter~0 13)} is VALID [2022-04-08 12:43:41,754 INFO L290 TraceCheckUtils]: 117: Hoare triple {121124#(<= ~counter~0 13)} assume !(0 == ~cond); {121124#(<= ~counter~0 13)} is VALID [2022-04-08 12:43:41,754 INFO L290 TraceCheckUtils]: 118: Hoare triple {121124#(<= ~counter~0 13)} assume true; {121124#(<= ~counter~0 13)} is VALID [2022-04-08 12:43:41,755 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {121124#(<= ~counter~0 13)} {121124#(<= ~counter~0 13)} #96#return; {121124#(<= ~counter~0 13)} is VALID [2022-04-08 12:43:41,755 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-08 12:43:41,756 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-08 12:43:41,757 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-08 12:43:41,757 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-08 12:43:41,757 INFO L290 TraceCheckUtils]: 124: Hoare triple {121149#(<= ~counter~0 14)} ~cond := #in~cond; {121149#(<= ~counter~0 14)} is VALID [2022-04-08 12:43:41,758 INFO L290 TraceCheckUtils]: 125: Hoare triple {121149#(<= ~counter~0 14)} assume !(0 == ~cond); {121149#(<= ~counter~0 14)} is VALID [2022-04-08 12:43:41,758 INFO L290 TraceCheckUtils]: 126: Hoare triple {121149#(<= ~counter~0 14)} assume true; {121149#(<= ~counter~0 14)} is VALID [2022-04-08 12:43:41,758 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {121149#(<= ~counter~0 14)} {121149#(<= ~counter~0 14)} #96#return; {121149#(<= ~counter~0 14)} is VALID [2022-04-08 12:43:41,759 INFO L290 TraceCheckUtils]: 128: Hoare triple {121149#(<= ~counter~0 14)} assume !(~r~0 > 0); {121149#(<= ~counter~0 14)} is VALID [2022-04-08 12:43:41,760 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-08 12:43:41,760 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-08 12:43:41,760 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-08 12:43:41,761 INFO L290 TraceCheckUtils]: 132: Hoare triple {121181#(<= |main_#t~post6| 15)} assume !(#t~post6 < 20);havoc #t~post6; {120768#false} is VALID [2022-04-08 12:43:41,761 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-08 12:43:41,761 INFO L290 TraceCheckUtils]: 134: Hoare triple {120768#false} ~cond := #in~cond; {120768#false} is VALID [2022-04-08 12:43:41,761 INFO L290 TraceCheckUtils]: 135: Hoare triple {120768#false} assume 0 == ~cond; {120768#false} is VALID [2022-04-08 12:43:41,761 INFO L290 TraceCheckUtils]: 136: Hoare triple {120768#false} assume !false; {120768#false} is VALID [2022-04-08 12:43:41,761 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-08 12:43:41,762 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:43:42,422 INFO L290 TraceCheckUtils]: 136: Hoare triple {120768#false} assume !false; {120768#false} is VALID [2022-04-08 12:43:42,423 INFO L290 TraceCheckUtils]: 135: Hoare triple {120768#false} assume 0 == ~cond; {120768#false} is VALID [2022-04-08 12:43:42,423 INFO L290 TraceCheckUtils]: 134: Hoare triple {120768#false} ~cond := #in~cond; {120768#false} is VALID [2022-04-08 12:43:42,423 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-08 12:43:42,423 INFO L290 TraceCheckUtils]: 132: Hoare triple {121209#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {120768#false} is VALID [2022-04-08 12:43:42,423 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-08 12:43:42,424 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-08 12:43:42,426 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-08 12:43:42,427 INFO L290 TraceCheckUtils]: 128: Hoare triple {121220#(< ~counter~0 19)} assume !(~r~0 > 0); {121220#(< ~counter~0 19)} is VALID [2022-04-08 12:43:42,427 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {120767#true} {121220#(< ~counter~0 19)} #96#return; {121220#(< ~counter~0 19)} is VALID [2022-04-08 12:43:42,427 INFO L290 TraceCheckUtils]: 126: Hoare triple {120767#true} assume true; {120767#true} is VALID [2022-04-08 12:43:42,427 INFO L290 TraceCheckUtils]: 125: Hoare triple {120767#true} assume !(0 == ~cond); {120767#true} is VALID [2022-04-08 12:43:42,427 INFO L290 TraceCheckUtils]: 124: Hoare triple {120767#true} ~cond := #in~cond; {120767#true} is VALID [2022-04-08 12:43:42,427 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-08 12:43:42,428 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-08 12:43:42,429 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-08 12:43:42,429 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-08 12:43:42,430 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {120767#true} {121245#(< ~counter~0 18)} #96#return; {121245#(< ~counter~0 18)} is VALID [2022-04-08 12:43:42,430 INFO L290 TraceCheckUtils]: 118: Hoare triple {120767#true} assume true; {120767#true} is VALID [2022-04-08 12:43:42,430 INFO L290 TraceCheckUtils]: 117: Hoare triple {120767#true} assume !(0 == ~cond); {120767#true} is VALID [2022-04-08 12:43:42,430 INFO L290 TraceCheckUtils]: 116: Hoare triple {120767#true} ~cond := #in~cond; {120767#true} is VALID [2022-04-08 12:43:42,430 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-08 12:43:42,430 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-08 12:43:42,431 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-08 12:43:42,431 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-08 12:43:42,432 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {120767#true} {121270#(< ~counter~0 17)} #96#return; {121270#(< ~counter~0 17)} is VALID [2022-04-08 12:43:42,432 INFO L290 TraceCheckUtils]: 110: Hoare triple {120767#true} assume true; {120767#true} is VALID [2022-04-08 12:43:42,432 INFO L290 TraceCheckUtils]: 109: Hoare triple {120767#true} assume !(0 == ~cond); {120767#true} is VALID [2022-04-08 12:43:42,432 INFO L290 TraceCheckUtils]: 108: Hoare triple {120767#true} ~cond := #in~cond; {120767#true} is VALID [2022-04-08 12:43:42,432 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-08 12:43:42,432 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-08 12:43:42,434 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-08 12:43:42,434 INFO L290 TraceCheckUtils]: 104: Hoare triple {121174#(<= ~counter~0 15)} assume !!(0 != ~r~0); {121174#(<= ~counter~0 15)} is VALID [2022-04-08 12:43:42,434 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {120767#true} {121174#(<= ~counter~0 15)} #94#return; {121174#(<= ~counter~0 15)} is VALID [2022-04-08 12:43:42,434 INFO L290 TraceCheckUtils]: 102: Hoare triple {120767#true} assume true; {120767#true} is VALID [2022-04-08 12:43:42,434 INFO L290 TraceCheckUtils]: 101: Hoare triple {120767#true} assume !(0 == ~cond); {120767#true} is VALID [2022-04-08 12:43:42,434 INFO L290 TraceCheckUtils]: 100: Hoare triple {120767#true} ~cond := #in~cond; {120767#true} is VALID [2022-04-08 12:43:42,435 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-08 12:43:42,435 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-08 12:43:42,436 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-08 12:43:42,436 INFO L290 TraceCheckUtils]: 96: Hoare triple {121149#(<= ~counter~0 14)} assume !(~r~0 < 0); {121149#(<= ~counter~0 14)} is VALID [2022-04-08 12:43:42,437 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {120767#true} {121149#(<= ~counter~0 14)} #98#return; {121149#(<= ~counter~0 14)} is VALID [2022-04-08 12:43:42,437 INFO L290 TraceCheckUtils]: 94: Hoare triple {120767#true} assume true; {120767#true} is VALID [2022-04-08 12:43:42,437 INFO L290 TraceCheckUtils]: 93: Hoare triple {120767#true} assume !(0 == ~cond); {120767#true} is VALID [2022-04-08 12:43:42,437 INFO L290 TraceCheckUtils]: 92: Hoare triple {120767#true} ~cond := #in~cond; {120767#true} is VALID [2022-04-08 12:43:42,437 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-08 12:43:42,437 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-08 12:43:42,438 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-08 12:43:42,439 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-08 12:43:42,439 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {120767#true} {121124#(<= ~counter~0 13)} #98#return; {121124#(<= ~counter~0 13)} is VALID [2022-04-08 12:43:42,439 INFO L290 TraceCheckUtils]: 86: Hoare triple {120767#true} assume true; {120767#true} is VALID [2022-04-08 12:43:42,439 INFO L290 TraceCheckUtils]: 85: Hoare triple {120767#true} assume !(0 == ~cond); {120767#true} is VALID [2022-04-08 12:43:42,439 INFO L290 TraceCheckUtils]: 84: Hoare triple {120767#true} ~cond := #in~cond; {120767#true} is VALID [2022-04-08 12:43:42,439 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-08 12:43:42,440 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-08 12:43:42,441 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-08 12:43:42,441 INFO L290 TraceCheckUtils]: 80: Hoare triple {121099#(<= ~counter~0 12)} assume !(~r~0 > 0); {121099#(<= ~counter~0 12)} is VALID [2022-04-08 12:43:42,441 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {120767#true} {121099#(<= ~counter~0 12)} #96#return; {121099#(<= ~counter~0 12)} is VALID [2022-04-08 12:43:42,442 INFO L290 TraceCheckUtils]: 78: Hoare triple {120767#true} assume true; {120767#true} is VALID [2022-04-08 12:43:42,442 INFO L290 TraceCheckUtils]: 77: Hoare triple {120767#true} assume !(0 == ~cond); {120767#true} is VALID [2022-04-08 12:43:42,442 INFO L290 TraceCheckUtils]: 76: Hoare triple {120767#true} ~cond := #in~cond; {120767#true} is VALID [2022-04-08 12:43:42,442 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-08 12:43:42,442 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-08 12:43:42,443 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-08 12:43:42,443 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-08 12:43:42,444 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {120767#true} {121074#(<= ~counter~0 11)} #96#return; {121074#(<= ~counter~0 11)} is VALID [2022-04-08 12:43:42,444 INFO L290 TraceCheckUtils]: 70: Hoare triple {120767#true} assume true; {120767#true} is VALID [2022-04-08 12:43:42,444 INFO L290 TraceCheckUtils]: 69: Hoare triple {120767#true} assume !(0 == ~cond); {120767#true} is VALID [2022-04-08 12:43:42,444 INFO L290 TraceCheckUtils]: 68: Hoare triple {120767#true} ~cond := #in~cond; {120767#true} is VALID [2022-04-08 12:43:42,444 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-08 12:43:42,444 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-08 12:43:42,446 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-08 12:43:42,446 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-08 12:43:42,446 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {120767#true} {121049#(<= ~counter~0 10)} #96#return; {121049#(<= ~counter~0 10)} is VALID [2022-04-08 12:43:42,446 INFO L290 TraceCheckUtils]: 62: Hoare triple {120767#true} assume true; {120767#true} is VALID [2022-04-08 12:43:42,446 INFO L290 TraceCheckUtils]: 61: Hoare triple {120767#true} assume !(0 == ~cond); {120767#true} is VALID [2022-04-08 12:43:42,447 INFO L290 TraceCheckUtils]: 60: Hoare triple {120767#true} ~cond := #in~cond; {120767#true} is VALID [2022-04-08 12:43:42,447 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-08 12:43:42,447 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-08 12:43:42,448 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-08 12:43:42,448 INFO L290 TraceCheckUtils]: 56: Hoare triple {121024#(<= ~counter~0 9)} assume !!(0 != ~r~0); {121024#(<= ~counter~0 9)} is VALID [2022-04-08 12:43:42,449 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {120767#true} {121024#(<= ~counter~0 9)} #94#return; {121024#(<= ~counter~0 9)} is VALID [2022-04-08 12:43:42,449 INFO L290 TraceCheckUtils]: 54: Hoare triple {120767#true} assume true; {120767#true} is VALID [2022-04-08 12:43:42,449 INFO L290 TraceCheckUtils]: 53: Hoare triple {120767#true} assume !(0 == ~cond); {120767#true} is VALID [2022-04-08 12:43:42,449 INFO L290 TraceCheckUtils]: 52: Hoare triple {120767#true} ~cond := #in~cond; {120767#true} is VALID [2022-04-08 12:43:42,449 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-08 12:43:42,449 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-08 12:43:42,450 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-08 12:43:42,450 INFO L290 TraceCheckUtils]: 48: Hoare triple {120999#(<= ~counter~0 8)} assume !(~r~0 < 0); {120999#(<= ~counter~0 8)} is VALID [2022-04-08 12:43:42,451 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {120767#true} {120999#(<= ~counter~0 8)} #98#return; {120999#(<= ~counter~0 8)} is VALID [2022-04-08 12:43:42,451 INFO L290 TraceCheckUtils]: 46: Hoare triple {120767#true} assume true; {120767#true} is VALID [2022-04-08 12:43:42,451 INFO L290 TraceCheckUtils]: 45: Hoare triple {120767#true} assume !(0 == ~cond); {120767#true} is VALID [2022-04-08 12:43:42,451 INFO L290 TraceCheckUtils]: 44: Hoare triple {120767#true} ~cond := #in~cond; {120767#true} is VALID [2022-04-08 12:43:42,451 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-08 12:43:42,451 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-08 12:43:42,453 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-08 12:43:42,453 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-08 12:43:42,453 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {120767#true} {120974#(<= ~counter~0 7)} #98#return; {120974#(<= ~counter~0 7)} is VALID [2022-04-08 12:43:42,453 INFO L290 TraceCheckUtils]: 38: Hoare triple {120767#true} assume true; {120767#true} is VALID [2022-04-08 12:43:42,453 INFO L290 TraceCheckUtils]: 37: Hoare triple {120767#true} assume !(0 == ~cond); {120767#true} is VALID [2022-04-08 12:43:42,453 INFO L290 TraceCheckUtils]: 36: Hoare triple {120767#true} ~cond := #in~cond; {120767#true} is VALID [2022-04-08 12:43:42,454 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-08 12:43:42,454 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-08 12:43:42,455 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-08 12:43:42,455 INFO L290 TraceCheckUtils]: 32: Hoare triple {120949#(<= ~counter~0 6)} assume !(~r~0 > 0); {120949#(<= ~counter~0 6)} is VALID [2022-04-08 12:43:42,456 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {120767#true} {120949#(<= ~counter~0 6)} #96#return; {120949#(<= ~counter~0 6)} is VALID [2022-04-08 12:43:42,456 INFO L290 TraceCheckUtils]: 30: Hoare triple {120767#true} assume true; {120767#true} is VALID [2022-04-08 12:43:42,456 INFO L290 TraceCheckUtils]: 29: Hoare triple {120767#true} assume !(0 == ~cond); {120767#true} is VALID [2022-04-08 12:43:42,456 INFO L290 TraceCheckUtils]: 28: Hoare triple {120767#true} ~cond := #in~cond; {120767#true} is VALID [2022-04-08 12:43:42,456 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-08 12:43:42,456 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-08 12:43:42,457 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-08 12:43:42,457 INFO L290 TraceCheckUtils]: 24: Hoare triple {120924#(<= ~counter~0 5)} assume !!(0 != ~r~0); {120924#(<= ~counter~0 5)} is VALID [2022-04-08 12:43:42,458 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {120767#true} {120924#(<= ~counter~0 5)} #94#return; {120924#(<= ~counter~0 5)} is VALID [2022-04-08 12:43:42,458 INFO L290 TraceCheckUtils]: 22: Hoare triple {120767#true} assume true; {120767#true} is VALID [2022-04-08 12:43:42,458 INFO L290 TraceCheckUtils]: 21: Hoare triple {120767#true} assume !(0 == ~cond); {120767#true} is VALID [2022-04-08 12:43:42,458 INFO L290 TraceCheckUtils]: 20: Hoare triple {120767#true} ~cond := #in~cond; {120767#true} is VALID [2022-04-08 12:43:42,458 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-08 12:43:42,458 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-08 12:43:42,460 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-08 12:43:42,460 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-08 12:43:42,460 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {120767#true} {120899#(<= ~counter~0 4)} #92#return; {120899#(<= ~counter~0 4)} is VALID [2022-04-08 12:43:42,460 INFO L290 TraceCheckUtils]: 14: Hoare triple {120767#true} assume true; {120767#true} is VALID [2022-04-08 12:43:42,460 INFO L290 TraceCheckUtils]: 13: Hoare triple {120767#true} assume !(0 == ~cond); {120767#true} is VALID [2022-04-08 12:43:42,460 INFO L290 TraceCheckUtils]: 12: Hoare triple {120767#true} ~cond := #in~cond; {120767#true} is VALID [2022-04-08 12:43:42,461 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-08 12:43:42,461 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {120767#true} {120899#(<= ~counter~0 4)} #90#return; {120899#(<= ~counter~0 4)} is VALID [2022-04-08 12:43:42,461 INFO L290 TraceCheckUtils]: 9: Hoare triple {120767#true} assume true; {120767#true} is VALID [2022-04-08 12:43:42,461 INFO L290 TraceCheckUtils]: 8: Hoare triple {120767#true} assume !(0 == ~cond); {120767#true} is VALID [2022-04-08 12:43:42,461 INFO L290 TraceCheckUtils]: 7: Hoare triple {120767#true} ~cond := #in~cond; {120767#true} is VALID [2022-04-08 12:43:42,461 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-08 12:43:42,461 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-08 12:43:42,462 INFO L272 TraceCheckUtils]: 4: Hoare triple {120899#(<= ~counter~0 4)} call #t~ret9 := main(); {120899#(<= ~counter~0 4)} is VALID [2022-04-08 12:43:42,462 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {120899#(<= ~counter~0 4)} {120767#true} #102#return; {120899#(<= ~counter~0 4)} is VALID [2022-04-08 12:43:42,462 INFO L290 TraceCheckUtils]: 2: Hoare triple {120899#(<= ~counter~0 4)} assume true; {120899#(<= ~counter~0 4)} is VALID [2022-04-08 12:43:42,463 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-08 12:43:42,463 INFO L272 TraceCheckUtils]: 0: Hoare triple {120767#true} call ULTIMATE.init(); {120767#true} is VALID [2022-04-08 12:43:42,463 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-08 12:43:42,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:43:42,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092015329] [2022-04-08 12:43:42,463 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:43:42,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86145918] [2022-04-08 12:43:42,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86145918] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:43:42,464 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:43:42,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 24 [2022-04-08 12:43:42,464 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:43:42,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1023282148] [2022-04-08 12:43:42,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1023282148] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:43:42,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:43:42,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-08 12:43:42,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326005525] [2022-04-08 12:43:42,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:43:42,465 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-08 12:43:42,465 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:43:42,465 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-08 12:43:42,597 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-08 12:43:42,597 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-08 12:43:42,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:43:42,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-08 12:43:42,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-08 12:43:42,598 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-08 12:43:47,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:43:47,074 INFO L93 Difference]: Finished difference Result 807 states and 1089 transitions. [2022-04-08 12:43:47,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-08 12:43:47,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-08 12:43:47,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:43:47,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-08 12:43:47,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 316 transitions. [2022-04-08 12:43:47,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-08 12:43:47,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 316 transitions. [2022-04-08 12:43:47,079 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 316 transitions. [2022-04-08 12:43:47,380 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-08 12:43:47,405 INFO L225 Difference]: With dead ends: 807 [2022-04-08 12:43:47,405 INFO L226 Difference]: Without dead ends: 802 [2022-04-08 12:43:47,406 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 250 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=479, Invalid=781, Unknown=0, NotChecked=0, Total=1260 [2022-04-08 12:43:47,406 INFO L913 BasicCegarLoop]: 75 mSDtfsCounter, 354 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 281 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.5s IncrementalHoareTripleChecker+Time [2022-04-08 12:43:47,406 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [354 Valid, 341 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [281 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 12:43:47,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2022-04-08 12:43:49,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 775. [2022-04-08 12:43:49,972 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:43:49,973 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-08 12:43:49,973 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-08 12:43:49,974 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-08 12:43:49,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:43:49,994 INFO L93 Difference]: Finished difference Result 802 states and 1078 transitions. [2022-04-08 12:43:49,994 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1078 transitions. [2022-04-08 12:43:49,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:43:49,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:43:49,996 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-08 12:43:49,996 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-08 12:43:50,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:43:50,017 INFO L93 Difference]: Finished difference Result 802 states and 1078 transitions. [2022-04-08 12:43:50,017 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1078 transitions. [2022-04-08 12:43:50,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:43:50,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:43:50,019 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:43:50,019 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:43:50,020 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-08 12:43:50,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1047 transitions. [2022-04-08 12:43:50,046 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1047 transitions. Word has length 137 [2022-04-08 12:43:50,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:43:50,046 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 1047 transitions. [2022-04-08 12:43:50,046 INFO L479 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-08 12:43:50,046 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 775 states and 1047 transitions. [2022-04-08 12:43:58,228 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1047 edges. 1046 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 12:43:58,228 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1047 transitions. [2022-04-08 12:43:58,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-04-08 12:43:58,230 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:43:58,230 INFO L499 BasicCegarLoop]: 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-08 12:43:58,234 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-08 12:43:58,430 WARN L460 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-08 12:43:58,430 INFO L403 AbstractCegarLoop]: === Iteration 49 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:43:58,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:43:58,430 INFO L85 PathProgramCache]: Analyzing trace with hash -895861967, now seen corresponding path program 19 times [2022-04-08 12:43:58,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:43:58,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1177776782] [2022-04-08 12:43:58,431 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:43:58,431 INFO L85 PathProgramCache]: Analyzing trace with hash -895861967, now seen corresponding path program 20 times [2022-04-08 12:43:58,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:43:58,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826651761] [2022-04-08 12:43:58,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:43:58,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:43:58,443 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:43:58,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1474118109] [2022-04-08 12:43:58,443 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:43:58,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:43:58,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:43:58,444 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-08 12:43:58,445 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-08 12:43:58,508 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:43:58,509 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:43:58,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-08 12:43:58,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:43:58,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:43:59,228 INFO L272 TraceCheckUtils]: 0: Hoare triple {126404#true} call ULTIMATE.init(); {126404#true} is VALID [2022-04-08 12:43:59,228 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-08 12:43:59,229 INFO L290 TraceCheckUtils]: 2: Hoare triple {126412#(<= ~counter~0 0)} assume true; {126412#(<= ~counter~0 0)} is VALID [2022-04-08 12:43:59,229 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {126412#(<= ~counter~0 0)} {126404#true} #102#return; {126412#(<= ~counter~0 0)} is VALID [2022-04-08 12:43:59,229 INFO L272 TraceCheckUtils]: 4: Hoare triple {126412#(<= ~counter~0 0)} call #t~ret9 := main(); {126412#(<= ~counter~0 0)} is VALID [2022-04-08 12:43:59,229 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-08 12:43:59,230 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-08 12:43:59,230 INFO L290 TraceCheckUtils]: 7: Hoare triple {126412#(<= ~counter~0 0)} ~cond := #in~cond; {126412#(<= ~counter~0 0)} is VALID [2022-04-08 12:43:59,230 INFO L290 TraceCheckUtils]: 8: Hoare triple {126412#(<= ~counter~0 0)} assume !(0 == ~cond); {126412#(<= ~counter~0 0)} is VALID [2022-04-08 12:43:59,231 INFO L290 TraceCheckUtils]: 9: Hoare triple {126412#(<= ~counter~0 0)} assume true; {126412#(<= ~counter~0 0)} is VALID [2022-04-08 12:43:59,231 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {126412#(<= ~counter~0 0)} {126412#(<= ~counter~0 0)} #90#return; {126412#(<= ~counter~0 0)} is VALID [2022-04-08 12:43:59,231 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-08 12:43:59,232 INFO L290 TraceCheckUtils]: 12: Hoare triple {126412#(<= ~counter~0 0)} ~cond := #in~cond; {126412#(<= ~counter~0 0)} is VALID [2022-04-08 12:43:59,232 INFO L290 TraceCheckUtils]: 13: Hoare triple {126412#(<= ~counter~0 0)} assume !(0 == ~cond); {126412#(<= ~counter~0 0)} is VALID [2022-04-08 12:43:59,232 INFO L290 TraceCheckUtils]: 14: Hoare triple {126412#(<= ~counter~0 0)} assume true; {126412#(<= ~counter~0 0)} is VALID [2022-04-08 12:43:59,232 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {126412#(<= ~counter~0 0)} {126412#(<= ~counter~0 0)} #92#return; {126412#(<= ~counter~0 0)} is VALID [2022-04-08 12:43:59,233 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-08 12:43:59,235 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-08 12:43:59,235 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-08 12:43:59,236 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-08 12:43:59,236 INFO L290 TraceCheckUtils]: 20: Hoare triple {126461#(<= ~counter~0 1)} ~cond := #in~cond; {126461#(<= ~counter~0 1)} is VALID [2022-04-08 12:43:59,236 INFO L290 TraceCheckUtils]: 21: Hoare triple {126461#(<= ~counter~0 1)} assume !(0 == ~cond); {126461#(<= ~counter~0 1)} is VALID [2022-04-08 12:43:59,237 INFO L290 TraceCheckUtils]: 22: Hoare triple {126461#(<= ~counter~0 1)} assume true; {126461#(<= ~counter~0 1)} is VALID [2022-04-08 12:43:59,237 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {126461#(<= ~counter~0 1)} {126461#(<= ~counter~0 1)} #94#return; {126461#(<= ~counter~0 1)} is VALID [2022-04-08 12:43:59,237 INFO L290 TraceCheckUtils]: 24: Hoare triple {126461#(<= ~counter~0 1)} assume !!(0 != ~r~0); {126461#(<= ~counter~0 1)} is VALID [2022-04-08 12:43:59,238 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-08 12:43:59,239 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-08 12:43:59,239 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-08 12:43:59,239 INFO L290 TraceCheckUtils]: 28: Hoare triple {126486#(<= ~counter~0 2)} ~cond := #in~cond; {126486#(<= ~counter~0 2)} is VALID [2022-04-08 12:43:59,240 INFO L290 TraceCheckUtils]: 29: Hoare triple {126486#(<= ~counter~0 2)} assume !(0 == ~cond); {126486#(<= ~counter~0 2)} is VALID [2022-04-08 12:43:59,240 INFO L290 TraceCheckUtils]: 30: Hoare triple {126486#(<= ~counter~0 2)} assume true; {126486#(<= ~counter~0 2)} is VALID [2022-04-08 12:43:59,240 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {126486#(<= ~counter~0 2)} {126486#(<= ~counter~0 2)} #96#return; {126486#(<= ~counter~0 2)} is VALID [2022-04-08 12:43:59,241 INFO L290 TraceCheckUtils]: 32: Hoare triple {126486#(<= ~counter~0 2)} assume !(~r~0 > 0); {126486#(<= ~counter~0 2)} is VALID [2022-04-08 12:43:59,242 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-08 12:43:59,242 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-08 12:43:59,242 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-08 12:43:59,243 INFO L290 TraceCheckUtils]: 36: Hoare triple {126511#(<= ~counter~0 3)} ~cond := #in~cond; {126511#(<= ~counter~0 3)} is VALID [2022-04-08 12:43:59,243 INFO L290 TraceCheckUtils]: 37: Hoare triple {126511#(<= ~counter~0 3)} assume !(0 == ~cond); {126511#(<= ~counter~0 3)} is VALID [2022-04-08 12:43:59,243 INFO L290 TraceCheckUtils]: 38: Hoare triple {126511#(<= ~counter~0 3)} assume true; {126511#(<= ~counter~0 3)} is VALID [2022-04-08 12:43:59,244 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {126511#(<= ~counter~0 3)} {126511#(<= ~counter~0 3)} #98#return; {126511#(<= ~counter~0 3)} is VALID [2022-04-08 12:43:59,244 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-08 12:43:59,245 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-08 12:43:59,245 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-08 12:43:59,246 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-08 12:43:59,246 INFO L290 TraceCheckUtils]: 44: Hoare triple {126536#(<= ~counter~0 4)} ~cond := #in~cond; {126536#(<= ~counter~0 4)} is VALID [2022-04-08 12:43:59,246 INFO L290 TraceCheckUtils]: 45: Hoare triple {126536#(<= ~counter~0 4)} assume !(0 == ~cond); {126536#(<= ~counter~0 4)} is VALID [2022-04-08 12:43:59,246 INFO L290 TraceCheckUtils]: 46: Hoare triple {126536#(<= ~counter~0 4)} assume true; {126536#(<= ~counter~0 4)} is VALID [2022-04-08 12:43:59,247 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {126536#(<= ~counter~0 4)} {126536#(<= ~counter~0 4)} #98#return; {126536#(<= ~counter~0 4)} is VALID [2022-04-08 12:43:59,247 INFO L290 TraceCheckUtils]: 48: Hoare triple {126536#(<= ~counter~0 4)} assume !(~r~0 < 0); {126536#(<= ~counter~0 4)} is VALID [2022-04-08 12:43:59,248 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-08 12:43:59,249 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-08 12:43:59,249 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-08 12:43:59,249 INFO L290 TraceCheckUtils]: 52: Hoare triple {126561#(<= ~counter~0 5)} ~cond := #in~cond; {126561#(<= ~counter~0 5)} is VALID [2022-04-08 12:43:59,249 INFO L290 TraceCheckUtils]: 53: Hoare triple {126561#(<= ~counter~0 5)} assume !(0 == ~cond); {126561#(<= ~counter~0 5)} is VALID [2022-04-08 12:43:59,250 INFO L290 TraceCheckUtils]: 54: Hoare triple {126561#(<= ~counter~0 5)} assume true; {126561#(<= ~counter~0 5)} is VALID [2022-04-08 12:43:59,250 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {126561#(<= ~counter~0 5)} {126561#(<= ~counter~0 5)} #94#return; {126561#(<= ~counter~0 5)} is VALID [2022-04-08 12:43:59,250 INFO L290 TraceCheckUtils]: 56: Hoare triple {126561#(<= ~counter~0 5)} assume !!(0 != ~r~0); {126561#(<= ~counter~0 5)} is VALID [2022-04-08 12:43:59,251 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-08 12:43:59,252 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-08 12:43:59,252 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-08 12:43:59,252 INFO L290 TraceCheckUtils]: 60: Hoare triple {126586#(<= ~counter~0 6)} ~cond := #in~cond; {126586#(<= ~counter~0 6)} is VALID [2022-04-08 12:43:59,253 INFO L290 TraceCheckUtils]: 61: Hoare triple {126586#(<= ~counter~0 6)} assume !(0 == ~cond); {126586#(<= ~counter~0 6)} is VALID [2022-04-08 12:43:59,253 INFO L290 TraceCheckUtils]: 62: Hoare triple {126586#(<= ~counter~0 6)} assume true; {126586#(<= ~counter~0 6)} is VALID [2022-04-08 12:43:59,253 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {126586#(<= ~counter~0 6)} {126586#(<= ~counter~0 6)} #96#return; {126586#(<= ~counter~0 6)} is VALID [2022-04-08 12:43:59,254 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-08 12:43:59,255 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-08 12:43:59,255 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-08 12:43:59,255 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-08 12:43:59,256 INFO L290 TraceCheckUtils]: 68: Hoare triple {126611#(<= ~counter~0 7)} ~cond := #in~cond; {126611#(<= ~counter~0 7)} is VALID [2022-04-08 12:43:59,256 INFO L290 TraceCheckUtils]: 69: Hoare triple {126611#(<= ~counter~0 7)} assume !(0 == ~cond); {126611#(<= ~counter~0 7)} is VALID [2022-04-08 12:43:59,256 INFO L290 TraceCheckUtils]: 70: Hoare triple {126611#(<= ~counter~0 7)} assume true; {126611#(<= ~counter~0 7)} is VALID [2022-04-08 12:43:59,257 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {126611#(<= ~counter~0 7)} {126611#(<= ~counter~0 7)} #96#return; {126611#(<= ~counter~0 7)} is VALID [2022-04-08 12:43:59,257 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-08 12:43:59,258 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-08 12:43:59,258 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-08 12:43:59,259 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-08 12:43:59,259 INFO L290 TraceCheckUtils]: 76: Hoare triple {126636#(<= ~counter~0 8)} ~cond := #in~cond; {126636#(<= ~counter~0 8)} is VALID [2022-04-08 12:43:59,259 INFO L290 TraceCheckUtils]: 77: Hoare triple {126636#(<= ~counter~0 8)} assume !(0 == ~cond); {126636#(<= ~counter~0 8)} is VALID [2022-04-08 12:43:59,259 INFO L290 TraceCheckUtils]: 78: Hoare triple {126636#(<= ~counter~0 8)} assume true; {126636#(<= ~counter~0 8)} is VALID [2022-04-08 12:43:59,260 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {126636#(<= ~counter~0 8)} {126636#(<= ~counter~0 8)} #96#return; {126636#(<= ~counter~0 8)} is VALID [2022-04-08 12:43:59,260 INFO L290 TraceCheckUtils]: 80: Hoare triple {126636#(<= ~counter~0 8)} assume !(~r~0 > 0); {126636#(<= ~counter~0 8)} is VALID [2022-04-08 12:43:59,261 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-08 12:43:59,261 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-08 12:43:59,262 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-08 12:43:59,262 INFO L290 TraceCheckUtils]: 84: Hoare triple {126661#(<= ~counter~0 9)} ~cond := #in~cond; {126661#(<= ~counter~0 9)} is VALID [2022-04-08 12:43:59,262 INFO L290 TraceCheckUtils]: 85: Hoare triple {126661#(<= ~counter~0 9)} assume !(0 == ~cond); {126661#(<= ~counter~0 9)} is VALID [2022-04-08 12:43:59,263 INFO L290 TraceCheckUtils]: 86: Hoare triple {126661#(<= ~counter~0 9)} assume true; {126661#(<= ~counter~0 9)} is VALID [2022-04-08 12:43:59,263 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {126661#(<= ~counter~0 9)} {126661#(<= ~counter~0 9)} #98#return; {126661#(<= ~counter~0 9)} is VALID [2022-04-08 12:43:59,263 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-08 12:43:59,264 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-08 12:43:59,265 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-08 12:43:59,265 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-08 12:43:59,265 INFO L290 TraceCheckUtils]: 92: Hoare triple {126686#(<= ~counter~0 10)} ~cond := #in~cond; {126686#(<= ~counter~0 10)} is VALID [2022-04-08 12:43:59,266 INFO L290 TraceCheckUtils]: 93: Hoare triple {126686#(<= ~counter~0 10)} assume !(0 == ~cond); {126686#(<= ~counter~0 10)} is VALID [2022-04-08 12:43:59,266 INFO L290 TraceCheckUtils]: 94: Hoare triple {126686#(<= ~counter~0 10)} assume true; {126686#(<= ~counter~0 10)} is VALID [2022-04-08 12:43:59,266 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {126686#(<= ~counter~0 10)} {126686#(<= ~counter~0 10)} #98#return; {126686#(<= ~counter~0 10)} is VALID [2022-04-08 12:43:59,267 INFO L290 TraceCheckUtils]: 96: Hoare triple {126686#(<= ~counter~0 10)} assume !(~r~0 < 0); {126686#(<= ~counter~0 10)} is VALID [2022-04-08 12:43:59,268 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-08 12:43:59,268 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-08 12:43:59,268 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-08 12:43:59,269 INFO L290 TraceCheckUtils]: 100: Hoare triple {126711#(<= ~counter~0 11)} ~cond := #in~cond; {126711#(<= ~counter~0 11)} is VALID [2022-04-08 12:43:59,269 INFO L290 TraceCheckUtils]: 101: Hoare triple {126711#(<= ~counter~0 11)} assume !(0 == ~cond); {126711#(<= ~counter~0 11)} is VALID [2022-04-08 12:43:59,269 INFO L290 TraceCheckUtils]: 102: Hoare triple {126711#(<= ~counter~0 11)} assume true; {126711#(<= ~counter~0 11)} is VALID [2022-04-08 12:43:59,270 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {126711#(<= ~counter~0 11)} {126711#(<= ~counter~0 11)} #94#return; {126711#(<= ~counter~0 11)} is VALID [2022-04-08 12:43:59,270 INFO L290 TraceCheckUtils]: 104: Hoare triple {126711#(<= ~counter~0 11)} assume !!(0 != ~r~0); {126711#(<= ~counter~0 11)} is VALID [2022-04-08 12:43:59,271 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-08 12:43:59,271 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-08 12:43:59,272 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-08 12:43:59,272 INFO L290 TraceCheckUtils]: 108: Hoare triple {126736#(<= ~counter~0 12)} ~cond := #in~cond; {126736#(<= ~counter~0 12)} is VALID [2022-04-08 12:43:59,272 INFO L290 TraceCheckUtils]: 109: Hoare triple {126736#(<= ~counter~0 12)} assume !(0 == ~cond); {126736#(<= ~counter~0 12)} is VALID [2022-04-08 12:43:59,272 INFO L290 TraceCheckUtils]: 110: Hoare triple {126736#(<= ~counter~0 12)} assume true; {126736#(<= ~counter~0 12)} is VALID [2022-04-08 12:43:59,273 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {126736#(<= ~counter~0 12)} {126736#(<= ~counter~0 12)} #96#return; {126736#(<= ~counter~0 12)} is VALID [2022-04-08 12:43:59,273 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-08 12:43:59,274 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-08 12:43:59,274 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-08 12:43:59,275 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-08 12:43:59,275 INFO L290 TraceCheckUtils]: 116: Hoare triple {126761#(<= ~counter~0 13)} ~cond := #in~cond; {126761#(<= ~counter~0 13)} is VALID [2022-04-08 12:43:59,275 INFO L290 TraceCheckUtils]: 117: Hoare triple {126761#(<= ~counter~0 13)} assume !(0 == ~cond); {126761#(<= ~counter~0 13)} is VALID [2022-04-08 12:43:59,276 INFO L290 TraceCheckUtils]: 118: Hoare triple {126761#(<= ~counter~0 13)} assume true; {126761#(<= ~counter~0 13)} is VALID [2022-04-08 12:43:59,276 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {126761#(<= ~counter~0 13)} {126761#(<= ~counter~0 13)} #96#return; {126761#(<= ~counter~0 13)} is VALID [2022-04-08 12:43:59,276 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-08 12:43:59,277 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-08 12:43:59,278 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-08 12:43:59,278 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-08 12:43:59,278 INFO L290 TraceCheckUtils]: 124: Hoare triple {126786#(<= ~counter~0 14)} ~cond := #in~cond; {126786#(<= ~counter~0 14)} is VALID [2022-04-08 12:43:59,279 INFO L290 TraceCheckUtils]: 125: Hoare triple {126786#(<= ~counter~0 14)} assume !(0 == ~cond); {126786#(<= ~counter~0 14)} is VALID [2022-04-08 12:43:59,279 INFO L290 TraceCheckUtils]: 126: Hoare triple {126786#(<= ~counter~0 14)} assume true; {126786#(<= ~counter~0 14)} is VALID [2022-04-08 12:43:59,279 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {126786#(<= ~counter~0 14)} {126786#(<= ~counter~0 14)} #96#return; {126786#(<= ~counter~0 14)} is VALID [2022-04-08 12:43:59,280 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-08 12:43:59,280 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-08 12:43:59,280 INFO L290 TraceCheckUtils]: 130: Hoare triple {126811#(<= |main_#t~post7| 14)} assume !(#t~post7 < 20);havoc #t~post7; {126405#false} is VALID [2022-04-08 12:43:59,280 INFO L290 TraceCheckUtils]: 131: Hoare triple {126405#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {126405#false} is VALID [2022-04-08 12:43:59,280 INFO L290 TraceCheckUtils]: 132: Hoare triple {126405#false} assume !(#t~post8 < 20);havoc #t~post8; {126405#false} is VALID [2022-04-08 12:43:59,280 INFO L290 TraceCheckUtils]: 133: Hoare triple {126405#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {126405#false} is VALID [2022-04-08 12:43:59,281 INFO L290 TraceCheckUtils]: 134: Hoare triple {126405#false} assume !(#t~post6 < 20);havoc #t~post6; {126405#false} is VALID [2022-04-08 12:43:59,281 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-08 12:43:59,281 INFO L290 TraceCheckUtils]: 136: Hoare triple {126405#false} ~cond := #in~cond; {126405#false} is VALID [2022-04-08 12:43:59,281 INFO L290 TraceCheckUtils]: 137: Hoare triple {126405#false} assume 0 == ~cond; {126405#false} is VALID [2022-04-08 12:43:59,281 INFO L290 TraceCheckUtils]: 138: Hoare triple {126405#false} assume !false; {126405#false} is VALID [2022-04-08 12:43:59,281 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-08 12:43:59,281 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:43:59,898 INFO L290 TraceCheckUtils]: 138: Hoare triple {126405#false} assume !false; {126405#false} is VALID [2022-04-08 12:43:59,899 INFO L290 TraceCheckUtils]: 137: Hoare triple {126405#false} assume 0 == ~cond; {126405#false} is VALID [2022-04-08 12:43:59,899 INFO L290 TraceCheckUtils]: 136: Hoare triple {126405#false} ~cond := #in~cond; {126405#false} is VALID [2022-04-08 12:43:59,899 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-08 12:43:59,899 INFO L290 TraceCheckUtils]: 134: Hoare triple {126405#false} assume !(#t~post6 < 20);havoc #t~post6; {126405#false} is VALID [2022-04-08 12:43:59,899 INFO L290 TraceCheckUtils]: 133: Hoare triple {126405#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {126405#false} is VALID [2022-04-08 12:43:59,899 INFO L290 TraceCheckUtils]: 132: Hoare triple {126405#false} assume !(#t~post8 < 20);havoc #t~post8; {126405#false} is VALID [2022-04-08 12:43:59,899 INFO L290 TraceCheckUtils]: 131: Hoare triple {126405#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {126405#false} is VALID [2022-04-08 12:43:59,899 INFO L290 TraceCheckUtils]: 130: Hoare triple {126863#(< |main_#t~post7| 20)} assume !(#t~post7 < 20);havoc #t~post7; {126405#false} is VALID [2022-04-08 12:43:59,900 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-08 12:43:59,900 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-08 12:43:59,900 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {126404#true} {126867#(< ~counter~0 20)} #96#return; {126867#(< ~counter~0 20)} is VALID [2022-04-08 12:43:59,900 INFO L290 TraceCheckUtils]: 126: Hoare triple {126404#true} assume true; {126404#true} is VALID [2022-04-08 12:43:59,900 INFO L290 TraceCheckUtils]: 125: Hoare triple {126404#true} assume !(0 == ~cond); {126404#true} is VALID [2022-04-08 12:43:59,901 INFO L290 TraceCheckUtils]: 124: Hoare triple {126404#true} ~cond := #in~cond; {126404#true} is VALID [2022-04-08 12:43:59,901 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-08 12:43:59,901 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-08 12:43:59,903 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-08 12:43:59,904 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-08 12:43:59,904 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {126404#true} {126892#(< ~counter~0 19)} #96#return; {126892#(< ~counter~0 19)} is VALID [2022-04-08 12:43:59,904 INFO L290 TraceCheckUtils]: 118: Hoare triple {126404#true} assume true; {126404#true} is VALID [2022-04-08 12:43:59,904 INFO L290 TraceCheckUtils]: 117: Hoare triple {126404#true} assume !(0 == ~cond); {126404#true} is VALID [2022-04-08 12:43:59,904 INFO L290 TraceCheckUtils]: 116: Hoare triple {126404#true} ~cond := #in~cond; {126404#true} is VALID [2022-04-08 12:43:59,904 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-08 12:43:59,905 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-08 12:43:59,906 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-08 12:43:59,906 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-08 12:43:59,906 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {126404#true} {126917#(< ~counter~0 18)} #96#return; {126917#(< ~counter~0 18)} is VALID [2022-04-08 12:43:59,906 INFO L290 TraceCheckUtils]: 110: Hoare triple {126404#true} assume true; {126404#true} is VALID [2022-04-08 12:43:59,907 INFO L290 TraceCheckUtils]: 109: Hoare triple {126404#true} assume !(0 == ~cond); {126404#true} is VALID [2022-04-08 12:43:59,907 INFO L290 TraceCheckUtils]: 108: Hoare triple {126404#true} ~cond := #in~cond; {126404#true} is VALID [2022-04-08 12:43:59,907 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-08 12:43:59,907 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-08 12:43:59,908 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-08 12:43:59,908 INFO L290 TraceCheckUtils]: 104: Hoare triple {126942#(< ~counter~0 17)} assume !!(0 != ~r~0); {126942#(< ~counter~0 17)} is VALID [2022-04-08 12:43:59,909 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {126404#true} {126942#(< ~counter~0 17)} #94#return; {126942#(< ~counter~0 17)} is VALID [2022-04-08 12:43:59,909 INFO L290 TraceCheckUtils]: 102: Hoare triple {126404#true} assume true; {126404#true} is VALID [2022-04-08 12:43:59,909 INFO L290 TraceCheckUtils]: 101: Hoare triple {126404#true} assume !(0 == ~cond); {126404#true} is VALID [2022-04-08 12:43:59,909 INFO L290 TraceCheckUtils]: 100: Hoare triple {126404#true} ~cond := #in~cond; {126404#true} is VALID [2022-04-08 12:43:59,909 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-08 12:43:59,909 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-08 12:43:59,910 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-08 12:43:59,911 INFO L290 TraceCheckUtils]: 96: Hoare triple {126967#(< ~counter~0 16)} assume !(~r~0 < 0); {126967#(< ~counter~0 16)} is VALID [2022-04-08 12:43:59,911 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {126404#true} {126967#(< ~counter~0 16)} #98#return; {126967#(< ~counter~0 16)} is VALID [2022-04-08 12:43:59,911 INFO L290 TraceCheckUtils]: 94: Hoare triple {126404#true} assume true; {126404#true} is VALID [2022-04-08 12:43:59,911 INFO L290 TraceCheckUtils]: 93: Hoare triple {126404#true} assume !(0 == ~cond); {126404#true} is VALID [2022-04-08 12:43:59,911 INFO L290 TraceCheckUtils]: 92: Hoare triple {126404#true} ~cond := #in~cond; {126404#true} is VALID [2022-04-08 12:43:59,911 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-08 12:43:59,912 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-08 12:43:59,913 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-08 12:43:59,913 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-08 12:43:59,913 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {126404#true} {126786#(<= ~counter~0 14)} #98#return; {126786#(<= ~counter~0 14)} is VALID [2022-04-08 12:43:59,913 INFO L290 TraceCheckUtils]: 86: Hoare triple {126404#true} assume true; {126404#true} is VALID [2022-04-08 12:43:59,913 INFO L290 TraceCheckUtils]: 85: Hoare triple {126404#true} assume !(0 == ~cond); {126404#true} is VALID [2022-04-08 12:43:59,914 INFO L290 TraceCheckUtils]: 84: Hoare triple {126404#true} ~cond := #in~cond; {126404#true} is VALID [2022-04-08 12:43:59,914 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-08 12:43:59,914 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-08 12:43:59,915 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-08 12:43:59,915 INFO L290 TraceCheckUtils]: 80: Hoare triple {126761#(<= ~counter~0 13)} assume !(~r~0 > 0); {126761#(<= ~counter~0 13)} is VALID [2022-04-08 12:43:59,916 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {126404#true} {126761#(<= ~counter~0 13)} #96#return; {126761#(<= ~counter~0 13)} is VALID [2022-04-08 12:43:59,916 INFO L290 TraceCheckUtils]: 78: Hoare triple {126404#true} assume true; {126404#true} is VALID [2022-04-08 12:43:59,916 INFO L290 TraceCheckUtils]: 77: Hoare triple {126404#true} assume !(0 == ~cond); {126404#true} is VALID [2022-04-08 12:43:59,916 INFO L290 TraceCheckUtils]: 76: Hoare triple {126404#true} ~cond := #in~cond; {126404#true} is VALID [2022-04-08 12:43:59,916 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-08 12:43:59,916 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-08 12:43:59,917 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-08 12:43:59,917 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-08 12:43:59,918 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {126404#true} {126736#(<= ~counter~0 12)} #96#return; {126736#(<= ~counter~0 12)} is VALID [2022-04-08 12:43:59,918 INFO L290 TraceCheckUtils]: 70: Hoare triple {126404#true} assume true; {126404#true} is VALID [2022-04-08 12:43:59,918 INFO L290 TraceCheckUtils]: 69: Hoare triple {126404#true} assume !(0 == ~cond); {126404#true} is VALID [2022-04-08 12:43:59,918 INFO L290 TraceCheckUtils]: 68: Hoare triple {126404#true} ~cond := #in~cond; {126404#true} is VALID [2022-04-08 12:43:59,918 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-08 12:43:59,918 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-08 12:43:59,919 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-08 12:43:59,920 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-08 12:43:59,920 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {126404#true} {126711#(<= ~counter~0 11)} #96#return; {126711#(<= ~counter~0 11)} is VALID [2022-04-08 12:43:59,920 INFO L290 TraceCheckUtils]: 62: Hoare triple {126404#true} assume true; {126404#true} is VALID [2022-04-08 12:43:59,920 INFO L290 TraceCheckUtils]: 61: Hoare triple {126404#true} assume !(0 == ~cond); {126404#true} is VALID [2022-04-08 12:43:59,920 INFO L290 TraceCheckUtils]: 60: Hoare triple {126404#true} ~cond := #in~cond; {126404#true} is VALID [2022-04-08 12:43:59,921 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-08 12:43:59,921 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-08 12:43:59,922 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-08 12:43:59,922 INFO L290 TraceCheckUtils]: 56: Hoare triple {126686#(<= ~counter~0 10)} assume !!(0 != ~r~0); {126686#(<= ~counter~0 10)} is VALID [2022-04-08 12:43:59,922 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {126404#true} {126686#(<= ~counter~0 10)} #94#return; {126686#(<= ~counter~0 10)} is VALID [2022-04-08 12:43:59,923 INFO L290 TraceCheckUtils]: 54: Hoare triple {126404#true} assume true; {126404#true} is VALID [2022-04-08 12:43:59,923 INFO L290 TraceCheckUtils]: 53: Hoare triple {126404#true} assume !(0 == ~cond); {126404#true} is VALID [2022-04-08 12:43:59,923 INFO L290 TraceCheckUtils]: 52: Hoare triple {126404#true} ~cond := #in~cond; {126404#true} is VALID [2022-04-08 12:43:59,923 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-08 12:43:59,923 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-08 12:43:59,924 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-08 12:43:59,924 INFO L290 TraceCheckUtils]: 48: Hoare triple {126661#(<= ~counter~0 9)} assume !(~r~0 < 0); {126661#(<= ~counter~0 9)} is VALID [2022-04-08 12:43:59,925 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {126404#true} {126661#(<= ~counter~0 9)} #98#return; {126661#(<= ~counter~0 9)} is VALID [2022-04-08 12:43:59,925 INFO L290 TraceCheckUtils]: 46: Hoare triple {126404#true} assume true; {126404#true} is VALID [2022-04-08 12:43:59,925 INFO L290 TraceCheckUtils]: 45: Hoare triple {126404#true} assume !(0 == ~cond); {126404#true} is VALID [2022-04-08 12:43:59,925 INFO L290 TraceCheckUtils]: 44: Hoare triple {126404#true} ~cond := #in~cond; {126404#true} is VALID [2022-04-08 12:43:59,925 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-08 12:43:59,925 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-08 12:43:59,926 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-08 12:43:59,927 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-08 12:43:59,927 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {126404#true} {126636#(<= ~counter~0 8)} #98#return; {126636#(<= ~counter~0 8)} is VALID [2022-04-08 12:43:59,927 INFO L290 TraceCheckUtils]: 38: Hoare triple {126404#true} assume true; {126404#true} is VALID [2022-04-08 12:43:59,927 INFO L290 TraceCheckUtils]: 37: Hoare triple {126404#true} assume !(0 == ~cond); {126404#true} is VALID [2022-04-08 12:43:59,927 INFO L290 TraceCheckUtils]: 36: Hoare triple {126404#true} ~cond := #in~cond; {126404#true} is VALID [2022-04-08 12:43:59,927 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-08 12:43:59,928 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-08 12:43:59,929 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-08 12:43:59,929 INFO L290 TraceCheckUtils]: 32: Hoare triple {126611#(<= ~counter~0 7)} assume !(~r~0 > 0); {126611#(<= ~counter~0 7)} is VALID [2022-04-08 12:43:59,929 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {126404#true} {126611#(<= ~counter~0 7)} #96#return; {126611#(<= ~counter~0 7)} is VALID [2022-04-08 12:43:59,929 INFO L290 TraceCheckUtils]: 30: Hoare triple {126404#true} assume true; {126404#true} is VALID [2022-04-08 12:43:59,929 INFO L290 TraceCheckUtils]: 29: Hoare triple {126404#true} assume !(0 == ~cond); {126404#true} is VALID [2022-04-08 12:43:59,930 INFO L290 TraceCheckUtils]: 28: Hoare triple {126404#true} ~cond := #in~cond; {126404#true} is VALID [2022-04-08 12:43:59,930 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-08 12:43:59,930 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-08 12:43:59,931 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-08 12:43:59,931 INFO L290 TraceCheckUtils]: 24: Hoare triple {126586#(<= ~counter~0 6)} assume !!(0 != ~r~0); {126586#(<= ~counter~0 6)} is VALID [2022-04-08 12:43:59,932 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {126404#true} {126586#(<= ~counter~0 6)} #94#return; {126586#(<= ~counter~0 6)} is VALID [2022-04-08 12:43:59,932 INFO L290 TraceCheckUtils]: 22: Hoare triple {126404#true} assume true; {126404#true} is VALID [2022-04-08 12:43:59,932 INFO L290 TraceCheckUtils]: 21: Hoare triple {126404#true} assume !(0 == ~cond); {126404#true} is VALID [2022-04-08 12:43:59,932 INFO L290 TraceCheckUtils]: 20: Hoare triple {126404#true} ~cond := #in~cond; {126404#true} is VALID [2022-04-08 12:43:59,936 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-08 12:43:59,937 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-08 12:43:59,940 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-08 12:43:59,940 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-08 12:43:59,941 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {126404#true} {126561#(<= ~counter~0 5)} #92#return; {126561#(<= ~counter~0 5)} is VALID [2022-04-08 12:43:59,941 INFO L290 TraceCheckUtils]: 14: Hoare triple {126404#true} assume true; {126404#true} is VALID [2022-04-08 12:43:59,941 INFO L290 TraceCheckUtils]: 13: Hoare triple {126404#true} assume !(0 == ~cond); {126404#true} is VALID [2022-04-08 12:43:59,941 INFO L290 TraceCheckUtils]: 12: Hoare triple {126404#true} ~cond := #in~cond; {126404#true} is VALID [2022-04-08 12:43:59,941 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-08 12:43:59,941 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {126404#true} {126561#(<= ~counter~0 5)} #90#return; {126561#(<= ~counter~0 5)} is VALID [2022-04-08 12:43:59,941 INFO L290 TraceCheckUtils]: 9: Hoare triple {126404#true} assume true; {126404#true} is VALID [2022-04-08 12:43:59,941 INFO L290 TraceCheckUtils]: 8: Hoare triple {126404#true} assume !(0 == ~cond); {126404#true} is VALID [2022-04-08 12:43:59,942 INFO L290 TraceCheckUtils]: 7: Hoare triple {126404#true} ~cond := #in~cond; {126404#true} is VALID [2022-04-08 12:43:59,942 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-08 12:43:59,942 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-08 12:43:59,942 INFO L272 TraceCheckUtils]: 4: Hoare triple {126561#(<= ~counter~0 5)} call #t~ret9 := main(); {126561#(<= ~counter~0 5)} is VALID [2022-04-08 12:43:59,942 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {126561#(<= ~counter~0 5)} {126404#true} #102#return; {126561#(<= ~counter~0 5)} is VALID [2022-04-08 12:43:59,943 INFO L290 TraceCheckUtils]: 2: Hoare triple {126561#(<= ~counter~0 5)} assume true; {126561#(<= ~counter~0 5)} is VALID [2022-04-08 12:43:59,943 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-08 12:43:59,943 INFO L272 TraceCheckUtils]: 0: Hoare triple {126404#true} call ULTIMATE.init(); {126404#true} is VALID [2022-04-08 12:43:59,944 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-08 12:43:59,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:43:59,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826651761] [2022-04-08 12:43:59,944 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:43:59,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474118109] [2022-04-08 12:43:59,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474118109] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:43:59,944 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:43:59,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 24 [2022-04-08 12:43:59,944 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:43:59,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1177776782] [2022-04-08 12:43:59,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1177776782] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:43:59,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:43:59,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-08 12:43:59,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599843517] [2022-04-08 12:43:59,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:43:59,945 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-08 12:43:59,945 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:43:59,945 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-08 12:44:00,069 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-08 12:44:00,069 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-08 12:44:00,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:44:00,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-08 12:44:00,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-08 12:44:00,070 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-08 12:44:03,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:44:03,982 INFO L93 Difference]: Finished difference Result 945 states and 1302 transitions. [2022-04-08 12:44:03,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-08 12:44:03,982 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-08 12:44:03,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:44:03,982 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-08 12:44:03,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 316 transitions. [2022-04-08 12:44:03,984 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-08 12:44:03,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 316 transitions. [2022-04-08 12:44:03,986 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 316 transitions. [2022-04-08 12:44:04,311 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-08 12:44:04,336 INFO L225 Difference]: With dead ends: 945 [2022-04-08 12:44:04,336 INFO L226 Difference]: Without dead ends: 775 [2022-04-08 12:44:04,337 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 254 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=522, Invalid=810, Unknown=0, NotChecked=0, Total=1332 [2022-04-08 12:44:04,337 INFO L913 BasicCegarLoop]: 72 mSDtfsCounter, 208 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-08 12:44:04,337 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [208 Valid, 322 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 12:44:04,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2022-04-08 12:44:06,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 775. [2022-04-08 12:44:06,992 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:44:06,993 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-08 12:44:06,994 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-08 12:44:06,994 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-08 12:44:07,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:44:07,014 INFO L93 Difference]: Finished difference Result 775 states and 1041 transitions. [2022-04-08 12:44:07,014 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1041 transitions. [2022-04-08 12:44:07,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:44:07,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:44:07,015 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-08 12:44:07,016 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-08 12:44:07,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:44:07,035 INFO L93 Difference]: Finished difference Result 775 states and 1041 transitions. [2022-04-08 12:44:07,035 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1041 transitions. [2022-04-08 12:44:07,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:44:07,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:44:07,036 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:44:07,036 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:44:07,037 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-08 12:44:07,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1041 transitions. [2022-04-08 12:44:07,068 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1041 transitions. Word has length 139 [2022-04-08 12:44:07,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:44:07,068 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 1041 transitions. [2022-04-08 12:44:07,068 INFO L479 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-08 12:44:07,068 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 775 states and 1041 transitions. [2022-04-08 12:44:20,868 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-08 12:44:20,868 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1041 transitions. [2022-04-08 12:44:20,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-04-08 12:44:20,870 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:44:20,870 INFO L499 BasicCegarLoop]: 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-08 12:44:20,887 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-08 12:44:21,070 WARN L460 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-08 12:44:21,071 INFO L403 AbstractCegarLoop]: === Iteration 50 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:44:21,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:44:21,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1908608861, now seen corresponding path program 25 times [2022-04-08 12:44:21,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:44:21,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1057235126] [2022-04-08 12:44:21,071 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:44:21,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1908608861, now seen corresponding path program 26 times [2022-04-08 12:44:21,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:44:21,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546822377] [2022-04-08 12:44:21,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:44:21,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:44:21,086 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:44:21,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2105343084] [2022-04-08 12:44:21,086 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:44:21,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:44:21,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:44:21,087 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-08 12:44:21,088 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-08 12:44:21,153 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:44:21,153 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:44:21,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-08 12:44:21,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:44:21,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:44:21,911 INFO L272 TraceCheckUtils]: 0: Hoare triple {132277#true} call ULTIMATE.init(); {132277#true} is VALID [2022-04-08 12:44:21,912 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-08 12:44:21,912 INFO L290 TraceCheckUtils]: 2: Hoare triple {132285#(<= ~counter~0 0)} assume true; {132285#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:21,912 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {132285#(<= ~counter~0 0)} {132277#true} #102#return; {132285#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:21,913 INFO L272 TraceCheckUtils]: 4: Hoare triple {132285#(<= ~counter~0 0)} call #t~ret9 := main(); {132285#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:21,913 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-08 12:44:21,913 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-08 12:44:21,914 INFO L290 TraceCheckUtils]: 7: Hoare triple {132285#(<= ~counter~0 0)} ~cond := #in~cond; {132285#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:21,914 INFO L290 TraceCheckUtils]: 8: Hoare triple {132285#(<= ~counter~0 0)} assume !(0 == ~cond); {132285#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:21,914 INFO L290 TraceCheckUtils]: 9: Hoare triple {132285#(<= ~counter~0 0)} assume true; {132285#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:21,915 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {132285#(<= ~counter~0 0)} {132285#(<= ~counter~0 0)} #90#return; {132285#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:21,915 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-08 12:44:21,915 INFO L290 TraceCheckUtils]: 12: Hoare triple {132285#(<= ~counter~0 0)} ~cond := #in~cond; {132285#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:21,916 INFO L290 TraceCheckUtils]: 13: Hoare triple {132285#(<= ~counter~0 0)} assume !(0 == ~cond); {132285#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:21,916 INFO L290 TraceCheckUtils]: 14: Hoare triple {132285#(<= ~counter~0 0)} assume true; {132285#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:21,916 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {132285#(<= ~counter~0 0)} {132285#(<= ~counter~0 0)} #92#return; {132285#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:21,916 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-08 12:44:21,919 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-08 12:44:21,919 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-08 12:44:21,920 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-08 12:44:21,920 INFO L290 TraceCheckUtils]: 20: Hoare triple {132334#(<= ~counter~0 1)} ~cond := #in~cond; {132334#(<= ~counter~0 1)} is VALID [2022-04-08 12:44:21,920 INFO L290 TraceCheckUtils]: 21: Hoare triple {132334#(<= ~counter~0 1)} assume !(0 == ~cond); {132334#(<= ~counter~0 1)} is VALID [2022-04-08 12:44:21,920 INFO L290 TraceCheckUtils]: 22: Hoare triple {132334#(<= ~counter~0 1)} assume true; {132334#(<= ~counter~0 1)} is VALID [2022-04-08 12:44:21,921 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {132334#(<= ~counter~0 1)} {132334#(<= ~counter~0 1)} #94#return; {132334#(<= ~counter~0 1)} is VALID [2022-04-08 12:44:21,921 INFO L290 TraceCheckUtils]: 24: Hoare triple {132334#(<= ~counter~0 1)} assume !!(0 != ~r~0); {132334#(<= ~counter~0 1)} is VALID [2022-04-08 12:44:21,922 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-08 12:44:21,922 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-08 12:44:21,923 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-08 12:44:21,923 INFO L290 TraceCheckUtils]: 28: Hoare triple {132359#(<= ~counter~0 2)} ~cond := #in~cond; {132359#(<= ~counter~0 2)} is VALID [2022-04-08 12:44:21,923 INFO L290 TraceCheckUtils]: 29: Hoare triple {132359#(<= ~counter~0 2)} assume !(0 == ~cond); {132359#(<= ~counter~0 2)} is VALID [2022-04-08 12:44:21,924 INFO L290 TraceCheckUtils]: 30: Hoare triple {132359#(<= ~counter~0 2)} assume true; {132359#(<= ~counter~0 2)} is VALID [2022-04-08 12:44:21,924 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {132359#(<= ~counter~0 2)} {132359#(<= ~counter~0 2)} #96#return; {132359#(<= ~counter~0 2)} is VALID [2022-04-08 12:44:21,924 INFO L290 TraceCheckUtils]: 32: Hoare triple {132359#(<= ~counter~0 2)} assume !(~r~0 > 0); {132359#(<= ~counter~0 2)} is VALID [2022-04-08 12:44:21,925 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-08 12:44:21,926 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-08 12:44:21,926 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-08 12:44:21,926 INFO L290 TraceCheckUtils]: 36: Hoare triple {132384#(<= ~counter~0 3)} ~cond := #in~cond; {132384#(<= ~counter~0 3)} is VALID [2022-04-08 12:44:21,927 INFO L290 TraceCheckUtils]: 37: Hoare triple {132384#(<= ~counter~0 3)} assume !(0 == ~cond); {132384#(<= ~counter~0 3)} is VALID [2022-04-08 12:44:21,927 INFO L290 TraceCheckUtils]: 38: Hoare triple {132384#(<= ~counter~0 3)} assume true; {132384#(<= ~counter~0 3)} is VALID [2022-04-08 12:44:21,927 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {132384#(<= ~counter~0 3)} {132384#(<= ~counter~0 3)} #98#return; {132384#(<= ~counter~0 3)} is VALID [2022-04-08 12:44:21,928 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-08 12:44:21,929 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-08 12:44:21,929 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-08 12:44:21,930 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-08 12:44:21,930 INFO L290 TraceCheckUtils]: 44: Hoare triple {132409#(<= ~counter~0 4)} ~cond := #in~cond; {132409#(<= ~counter~0 4)} is VALID [2022-04-08 12:44:21,930 INFO L290 TraceCheckUtils]: 45: Hoare triple {132409#(<= ~counter~0 4)} assume !(0 == ~cond); {132409#(<= ~counter~0 4)} is VALID [2022-04-08 12:44:21,930 INFO L290 TraceCheckUtils]: 46: Hoare triple {132409#(<= ~counter~0 4)} assume true; {132409#(<= ~counter~0 4)} is VALID [2022-04-08 12:44:21,931 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {132409#(<= ~counter~0 4)} {132409#(<= ~counter~0 4)} #98#return; {132409#(<= ~counter~0 4)} is VALID [2022-04-08 12:44:21,931 INFO L290 TraceCheckUtils]: 48: Hoare triple {132409#(<= ~counter~0 4)} assume !(~r~0 < 0); {132409#(<= ~counter~0 4)} is VALID [2022-04-08 12:44:21,932 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-08 12:44:21,932 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-08 12:44:21,933 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-08 12:44:21,933 INFO L290 TraceCheckUtils]: 52: Hoare triple {132434#(<= ~counter~0 5)} ~cond := #in~cond; {132434#(<= ~counter~0 5)} is VALID [2022-04-08 12:44:21,933 INFO L290 TraceCheckUtils]: 53: Hoare triple {132434#(<= ~counter~0 5)} assume !(0 == ~cond); {132434#(<= ~counter~0 5)} is VALID [2022-04-08 12:44:21,934 INFO L290 TraceCheckUtils]: 54: Hoare triple {132434#(<= ~counter~0 5)} assume true; {132434#(<= ~counter~0 5)} is VALID [2022-04-08 12:44:21,934 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {132434#(<= ~counter~0 5)} {132434#(<= ~counter~0 5)} #94#return; {132434#(<= ~counter~0 5)} is VALID [2022-04-08 12:44:21,934 INFO L290 TraceCheckUtils]: 56: Hoare triple {132434#(<= ~counter~0 5)} assume !!(0 != ~r~0); {132434#(<= ~counter~0 5)} is VALID [2022-04-08 12:44:21,935 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-08 12:44:21,936 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-08 12:44:21,936 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-08 12:44:21,936 INFO L290 TraceCheckUtils]: 60: Hoare triple {132459#(<= ~counter~0 6)} ~cond := #in~cond; {132459#(<= ~counter~0 6)} is VALID [2022-04-08 12:44:21,937 INFO L290 TraceCheckUtils]: 61: Hoare triple {132459#(<= ~counter~0 6)} assume !(0 == ~cond); {132459#(<= ~counter~0 6)} is VALID [2022-04-08 12:44:21,937 INFO L290 TraceCheckUtils]: 62: Hoare triple {132459#(<= ~counter~0 6)} assume true; {132459#(<= ~counter~0 6)} is VALID [2022-04-08 12:44:21,937 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {132459#(<= ~counter~0 6)} {132459#(<= ~counter~0 6)} #96#return; {132459#(<= ~counter~0 6)} is VALID [2022-04-08 12:44:21,938 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-08 12:44:21,939 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-08 12:44:21,939 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-08 12:44:21,939 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-08 12:44:21,940 INFO L290 TraceCheckUtils]: 68: Hoare triple {132484#(<= ~counter~0 7)} ~cond := #in~cond; {132484#(<= ~counter~0 7)} is VALID [2022-04-08 12:44:21,940 INFO L290 TraceCheckUtils]: 69: Hoare triple {132484#(<= ~counter~0 7)} assume !(0 == ~cond); {132484#(<= ~counter~0 7)} is VALID [2022-04-08 12:44:21,940 INFO L290 TraceCheckUtils]: 70: Hoare triple {132484#(<= ~counter~0 7)} assume true; {132484#(<= ~counter~0 7)} is VALID [2022-04-08 12:44:21,941 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {132484#(<= ~counter~0 7)} {132484#(<= ~counter~0 7)} #96#return; {132484#(<= ~counter~0 7)} is VALID [2022-04-08 12:44:21,941 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-08 12:44:21,942 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-08 12:44:21,942 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-08 12:44:21,943 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-08 12:44:21,943 INFO L290 TraceCheckUtils]: 76: Hoare triple {132509#(<= ~counter~0 8)} ~cond := #in~cond; {132509#(<= ~counter~0 8)} is VALID [2022-04-08 12:44:21,943 INFO L290 TraceCheckUtils]: 77: Hoare triple {132509#(<= ~counter~0 8)} assume !(0 == ~cond); {132509#(<= ~counter~0 8)} is VALID [2022-04-08 12:44:21,944 INFO L290 TraceCheckUtils]: 78: Hoare triple {132509#(<= ~counter~0 8)} assume true; {132509#(<= ~counter~0 8)} is VALID [2022-04-08 12:44:21,944 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {132509#(<= ~counter~0 8)} {132509#(<= ~counter~0 8)} #96#return; {132509#(<= ~counter~0 8)} is VALID [2022-04-08 12:44:21,944 INFO L290 TraceCheckUtils]: 80: Hoare triple {132509#(<= ~counter~0 8)} assume !(~r~0 > 0); {132509#(<= ~counter~0 8)} is VALID [2022-04-08 12:44:21,945 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-08 12:44:21,946 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-08 12:44:21,946 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-08 12:44:21,946 INFO L290 TraceCheckUtils]: 84: Hoare triple {132534#(<= ~counter~0 9)} ~cond := #in~cond; {132534#(<= ~counter~0 9)} is VALID [2022-04-08 12:44:21,947 INFO L290 TraceCheckUtils]: 85: Hoare triple {132534#(<= ~counter~0 9)} assume !(0 == ~cond); {132534#(<= ~counter~0 9)} is VALID [2022-04-08 12:44:21,947 INFO L290 TraceCheckUtils]: 86: Hoare triple {132534#(<= ~counter~0 9)} assume true; {132534#(<= ~counter~0 9)} is VALID [2022-04-08 12:44:21,947 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {132534#(<= ~counter~0 9)} {132534#(<= ~counter~0 9)} #98#return; {132534#(<= ~counter~0 9)} is VALID [2022-04-08 12:44:21,948 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-08 12:44:21,949 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-08 12:44:21,949 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-08 12:44:21,949 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-08 12:44:21,950 INFO L290 TraceCheckUtils]: 92: Hoare triple {132559#(<= ~counter~0 10)} ~cond := #in~cond; {132559#(<= ~counter~0 10)} is VALID [2022-04-08 12:44:21,950 INFO L290 TraceCheckUtils]: 93: Hoare triple {132559#(<= ~counter~0 10)} assume !(0 == ~cond); {132559#(<= ~counter~0 10)} is VALID [2022-04-08 12:44:21,950 INFO L290 TraceCheckUtils]: 94: Hoare triple {132559#(<= ~counter~0 10)} assume true; {132559#(<= ~counter~0 10)} is VALID [2022-04-08 12:44:21,951 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {132559#(<= ~counter~0 10)} {132559#(<= ~counter~0 10)} #98#return; {132559#(<= ~counter~0 10)} is VALID [2022-04-08 12:44:21,951 INFO L290 TraceCheckUtils]: 96: Hoare triple {132559#(<= ~counter~0 10)} assume !(~r~0 < 0); {132559#(<= ~counter~0 10)} is VALID [2022-04-08 12:44:21,953 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-08 12:44:21,953 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-08 12:44:21,954 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-08 12:44:21,954 INFO L290 TraceCheckUtils]: 100: Hoare triple {132584#(<= ~counter~0 11)} ~cond := #in~cond; {132584#(<= ~counter~0 11)} is VALID [2022-04-08 12:44:21,954 INFO L290 TraceCheckUtils]: 101: Hoare triple {132584#(<= ~counter~0 11)} assume !(0 == ~cond); {132584#(<= ~counter~0 11)} is VALID [2022-04-08 12:44:21,955 INFO L290 TraceCheckUtils]: 102: Hoare triple {132584#(<= ~counter~0 11)} assume true; {132584#(<= ~counter~0 11)} is VALID [2022-04-08 12:44:21,955 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {132584#(<= ~counter~0 11)} {132584#(<= ~counter~0 11)} #94#return; {132584#(<= ~counter~0 11)} is VALID [2022-04-08 12:44:21,955 INFO L290 TraceCheckUtils]: 104: Hoare triple {132584#(<= ~counter~0 11)} assume !!(0 != ~r~0); {132584#(<= ~counter~0 11)} is VALID [2022-04-08 12:44:21,956 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-08 12:44:21,957 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-08 12:44:21,957 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-08 12:44:21,957 INFO L290 TraceCheckUtils]: 108: Hoare triple {132609#(<= ~counter~0 12)} ~cond := #in~cond; {132609#(<= ~counter~0 12)} is VALID [2022-04-08 12:44:21,958 INFO L290 TraceCheckUtils]: 109: Hoare triple {132609#(<= ~counter~0 12)} assume !(0 == ~cond); {132609#(<= ~counter~0 12)} is VALID [2022-04-08 12:44:21,958 INFO L290 TraceCheckUtils]: 110: Hoare triple {132609#(<= ~counter~0 12)} assume true; {132609#(<= ~counter~0 12)} is VALID [2022-04-08 12:44:21,958 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {132609#(<= ~counter~0 12)} {132609#(<= ~counter~0 12)} #96#return; {132609#(<= ~counter~0 12)} is VALID [2022-04-08 12:44:21,959 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-08 12:44:21,960 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-08 12:44:21,960 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-08 12:44:21,960 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-08 12:44:21,961 INFO L290 TraceCheckUtils]: 116: Hoare triple {132634#(<= ~counter~0 13)} ~cond := #in~cond; {132634#(<= ~counter~0 13)} is VALID [2022-04-08 12:44:21,961 INFO L290 TraceCheckUtils]: 117: Hoare triple {132634#(<= ~counter~0 13)} assume !(0 == ~cond); {132634#(<= ~counter~0 13)} is VALID [2022-04-08 12:44:21,961 INFO L290 TraceCheckUtils]: 118: Hoare triple {132634#(<= ~counter~0 13)} assume true; {132634#(<= ~counter~0 13)} is VALID [2022-04-08 12:44:21,962 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {132634#(<= ~counter~0 13)} {132634#(<= ~counter~0 13)} #96#return; {132634#(<= ~counter~0 13)} is VALID [2022-04-08 12:44:21,962 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-08 12:44:21,963 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-08 12:44:21,963 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-08 12:44:21,964 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-08 12:44:21,964 INFO L290 TraceCheckUtils]: 124: Hoare triple {132659#(<= ~counter~0 14)} ~cond := #in~cond; {132659#(<= ~counter~0 14)} is VALID [2022-04-08 12:44:21,964 INFO L290 TraceCheckUtils]: 125: Hoare triple {132659#(<= ~counter~0 14)} assume !(0 == ~cond); {132659#(<= ~counter~0 14)} is VALID [2022-04-08 12:44:21,964 INFO L290 TraceCheckUtils]: 126: Hoare triple {132659#(<= ~counter~0 14)} assume true; {132659#(<= ~counter~0 14)} is VALID [2022-04-08 12:44:21,965 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {132659#(<= ~counter~0 14)} {132659#(<= ~counter~0 14)} #96#return; {132659#(<= ~counter~0 14)} is VALID [2022-04-08 12:44:21,965 INFO L290 TraceCheckUtils]: 128: Hoare triple {132659#(<= ~counter~0 14)} assume !(~r~0 > 0); {132659#(<= ~counter~0 14)} is VALID [2022-04-08 12:44:21,966 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-08 12:44:21,966 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-08 12:44:21,967 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-08 12:44:21,967 INFO L290 TraceCheckUtils]: 132: Hoare triple {132684#(<= ~counter~0 15)} ~cond := #in~cond; {132684#(<= ~counter~0 15)} is VALID [2022-04-08 12:44:21,967 INFO L290 TraceCheckUtils]: 133: Hoare triple {132684#(<= ~counter~0 15)} assume !(0 == ~cond); {132684#(<= ~counter~0 15)} is VALID [2022-04-08 12:44:21,968 INFO L290 TraceCheckUtils]: 134: Hoare triple {132684#(<= ~counter~0 15)} assume true; {132684#(<= ~counter~0 15)} is VALID [2022-04-08 12:44:21,968 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {132684#(<= ~counter~0 15)} {132684#(<= ~counter~0 15)} #98#return; {132684#(<= ~counter~0 15)} is VALID [2022-04-08 12:44:21,968 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-08 12:44:21,969 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-08 12:44:21,969 INFO L290 TraceCheckUtils]: 138: Hoare triple {132709#(<= |main_#t~post8| 15)} assume !(#t~post8 < 20);havoc #t~post8; {132278#false} is VALID [2022-04-08 12:44:21,969 INFO L290 TraceCheckUtils]: 139: Hoare triple {132278#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {132278#false} is VALID [2022-04-08 12:44:21,969 INFO L290 TraceCheckUtils]: 140: Hoare triple {132278#false} assume !(#t~post6 < 20);havoc #t~post6; {132278#false} is VALID [2022-04-08 12:44:21,969 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-08 12:44:21,969 INFO L290 TraceCheckUtils]: 142: Hoare triple {132278#false} ~cond := #in~cond; {132278#false} is VALID [2022-04-08 12:44:21,969 INFO L290 TraceCheckUtils]: 143: Hoare triple {132278#false} assume 0 == ~cond; {132278#false} is VALID [2022-04-08 12:44:21,969 INFO L290 TraceCheckUtils]: 144: Hoare triple {132278#false} assume !false; {132278#false} is VALID [2022-04-08 12:44:21,970 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-08 12:44:21,970 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:44:22,618 INFO L290 TraceCheckUtils]: 144: Hoare triple {132278#false} assume !false; {132278#false} is VALID [2022-04-08 12:44:22,618 INFO L290 TraceCheckUtils]: 143: Hoare triple {132278#false} assume 0 == ~cond; {132278#false} is VALID [2022-04-08 12:44:22,618 INFO L290 TraceCheckUtils]: 142: Hoare triple {132278#false} ~cond := #in~cond; {132278#false} is VALID [2022-04-08 12:44:22,618 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-08 12:44:22,618 INFO L290 TraceCheckUtils]: 140: Hoare triple {132278#false} assume !(#t~post6 < 20);havoc #t~post6; {132278#false} is VALID [2022-04-08 12:44:22,618 INFO L290 TraceCheckUtils]: 139: Hoare triple {132278#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {132278#false} is VALID [2022-04-08 12:44:22,619 INFO L290 TraceCheckUtils]: 138: Hoare triple {132749#(< |main_#t~post8| 20)} assume !(#t~post8 < 20);havoc #t~post8; {132278#false} is VALID [2022-04-08 12:44:22,619 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-08 12:44:22,619 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-08 12:44:22,620 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {132277#true} {132753#(< ~counter~0 20)} #98#return; {132753#(< ~counter~0 20)} is VALID [2022-04-08 12:44:22,620 INFO L290 TraceCheckUtils]: 134: Hoare triple {132277#true} assume true; {132277#true} is VALID [2022-04-08 12:44:22,620 INFO L290 TraceCheckUtils]: 133: Hoare triple {132277#true} assume !(0 == ~cond); {132277#true} is VALID [2022-04-08 12:44:22,620 INFO L290 TraceCheckUtils]: 132: Hoare triple {132277#true} ~cond := #in~cond; {132277#true} is VALID [2022-04-08 12:44:22,620 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-08 12:44:22,620 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-08 12:44:22,624 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-08 12:44:22,624 INFO L290 TraceCheckUtils]: 128: Hoare triple {132778#(< ~counter~0 19)} assume !(~r~0 > 0); {132778#(< ~counter~0 19)} is VALID [2022-04-08 12:44:22,624 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {132277#true} {132778#(< ~counter~0 19)} #96#return; {132778#(< ~counter~0 19)} is VALID [2022-04-08 12:44:22,625 INFO L290 TraceCheckUtils]: 126: Hoare triple {132277#true} assume true; {132277#true} is VALID [2022-04-08 12:44:22,625 INFO L290 TraceCheckUtils]: 125: Hoare triple {132277#true} assume !(0 == ~cond); {132277#true} is VALID [2022-04-08 12:44:22,625 INFO L290 TraceCheckUtils]: 124: Hoare triple {132277#true} ~cond := #in~cond; {132277#true} is VALID [2022-04-08 12:44:22,625 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-08 12:44:22,625 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-08 12:44:22,627 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-08 12:44:22,627 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-08 12:44:22,627 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {132277#true} {132803#(< ~counter~0 18)} #96#return; {132803#(< ~counter~0 18)} is VALID [2022-04-08 12:44:22,628 INFO L290 TraceCheckUtils]: 118: Hoare triple {132277#true} assume true; {132277#true} is VALID [2022-04-08 12:44:22,628 INFO L290 TraceCheckUtils]: 117: Hoare triple {132277#true} assume !(0 == ~cond); {132277#true} is VALID [2022-04-08 12:44:22,628 INFO L290 TraceCheckUtils]: 116: Hoare triple {132277#true} ~cond := #in~cond; {132277#true} is VALID [2022-04-08 12:44:22,628 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-08 12:44:22,628 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-08 12:44:22,630 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-08 12:44:22,630 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-08 12:44:22,631 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {132277#true} {132828#(< ~counter~0 17)} #96#return; {132828#(< ~counter~0 17)} is VALID [2022-04-08 12:44:22,631 INFO L290 TraceCheckUtils]: 110: Hoare triple {132277#true} assume true; {132277#true} is VALID [2022-04-08 12:44:22,631 INFO L290 TraceCheckUtils]: 109: Hoare triple {132277#true} assume !(0 == ~cond); {132277#true} is VALID [2022-04-08 12:44:22,631 INFO L290 TraceCheckUtils]: 108: Hoare triple {132277#true} ~cond := #in~cond; {132277#true} is VALID [2022-04-08 12:44:22,631 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-08 12:44:22,631 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-08 12:44:22,633 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-08 12:44:22,633 INFO L290 TraceCheckUtils]: 104: Hoare triple {132684#(<= ~counter~0 15)} assume !!(0 != ~r~0); {132684#(<= ~counter~0 15)} is VALID [2022-04-08 12:44:22,634 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {132277#true} {132684#(<= ~counter~0 15)} #94#return; {132684#(<= ~counter~0 15)} is VALID [2022-04-08 12:44:22,634 INFO L290 TraceCheckUtils]: 102: Hoare triple {132277#true} assume true; {132277#true} is VALID [2022-04-08 12:44:22,634 INFO L290 TraceCheckUtils]: 101: Hoare triple {132277#true} assume !(0 == ~cond); {132277#true} is VALID [2022-04-08 12:44:22,634 INFO L290 TraceCheckUtils]: 100: Hoare triple {132277#true} ~cond := #in~cond; {132277#true} is VALID [2022-04-08 12:44:22,634 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-08 12:44:22,634 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-08 12:44:22,636 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-08 12:44:22,636 INFO L290 TraceCheckUtils]: 96: Hoare triple {132659#(<= ~counter~0 14)} assume !(~r~0 < 0); {132659#(<= ~counter~0 14)} is VALID [2022-04-08 12:44:22,637 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {132277#true} {132659#(<= ~counter~0 14)} #98#return; {132659#(<= ~counter~0 14)} is VALID [2022-04-08 12:44:22,637 INFO L290 TraceCheckUtils]: 94: Hoare triple {132277#true} assume true; {132277#true} is VALID [2022-04-08 12:44:22,637 INFO L290 TraceCheckUtils]: 93: Hoare triple {132277#true} assume !(0 == ~cond); {132277#true} is VALID [2022-04-08 12:44:22,637 INFO L290 TraceCheckUtils]: 92: Hoare triple {132277#true} ~cond := #in~cond; {132277#true} is VALID [2022-04-08 12:44:22,637 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-08 12:44:22,637 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-08 12:44:22,639 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-08 12:44:22,640 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-08 12:44:22,640 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {132277#true} {132634#(<= ~counter~0 13)} #98#return; {132634#(<= ~counter~0 13)} is VALID [2022-04-08 12:44:22,640 INFO L290 TraceCheckUtils]: 86: Hoare triple {132277#true} assume true; {132277#true} is VALID [2022-04-08 12:44:22,640 INFO L290 TraceCheckUtils]: 85: Hoare triple {132277#true} assume !(0 == ~cond); {132277#true} is VALID [2022-04-08 12:44:22,641 INFO L290 TraceCheckUtils]: 84: Hoare triple {132277#true} ~cond := #in~cond; {132277#true} is VALID [2022-04-08 12:44:22,641 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-08 12:44:22,641 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-08 12:44:22,642 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-08 12:44:22,643 INFO L290 TraceCheckUtils]: 80: Hoare triple {132609#(<= ~counter~0 12)} assume !(~r~0 > 0); {132609#(<= ~counter~0 12)} is VALID [2022-04-08 12:44:22,643 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {132277#true} {132609#(<= ~counter~0 12)} #96#return; {132609#(<= ~counter~0 12)} is VALID [2022-04-08 12:44:22,643 INFO L290 TraceCheckUtils]: 78: Hoare triple {132277#true} assume true; {132277#true} is VALID [2022-04-08 12:44:22,643 INFO L290 TraceCheckUtils]: 77: Hoare triple {132277#true} assume !(0 == ~cond); {132277#true} is VALID [2022-04-08 12:44:22,643 INFO L290 TraceCheckUtils]: 76: Hoare triple {132277#true} ~cond := #in~cond; {132277#true} is VALID [2022-04-08 12:44:22,643 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-08 12:44:22,644 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-08 12:44:22,645 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-08 12:44:22,646 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-08 12:44:22,646 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {132277#true} {132584#(<= ~counter~0 11)} #96#return; {132584#(<= ~counter~0 11)} is VALID [2022-04-08 12:44:22,646 INFO L290 TraceCheckUtils]: 70: Hoare triple {132277#true} assume true; {132277#true} is VALID [2022-04-08 12:44:22,646 INFO L290 TraceCheckUtils]: 69: Hoare triple {132277#true} assume !(0 == ~cond); {132277#true} is VALID [2022-04-08 12:44:22,647 INFO L290 TraceCheckUtils]: 68: Hoare triple {132277#true} ~cond := #in~cond; {132277#true} is VALID [2022-04-08 12:44:22,647 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-08 12:44:22,647 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-08 12:44:22,649 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-08 12:44:22,649 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-08 12:44:22,650 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {132277#true} {132559#(<= ~counter~0 10)} #96#return; {132559#(<= ~counter~0 10)} is VALID [2022-04-08 12:44:22,650 INFO L290 TraceCheckUtils]: 62: Hoare triple {132277#true} assume true; {132277#true} is VALID [2022-04-08 12:44:22,650 INFO L290 TraceCheckUtils]: 61: Hoare triple {132277#true} assume !(0 == ~cond); {132277#true} is VALID [2022-04-08 12:44:22,650 INFO L290 TraceCheckUtils]: 60: Hoare triple {132277#true} ~cond := #in~cond; {132277#true} is VALID [2022-04-08 12:44:22,650 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-08 12:44:22,650 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-08 12:44:22,652 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-08 12:44:22,652 INFO L290 TraceCheckUtils]: 56: Hoare triple {132534#(<= ~counter~0 9)} assume !!(0 != ~r~0); {132534#(<= ~counter~0 9)} is VALID [2022-04-08 12:44:22,652 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {132277#true} {132534#(<= ~counter~0 9)} #94#return; {132534#(<= ~counter~0 9)} is VALID [2022-04-08 12:44:22,653 INFO L290 TraceCheckUtils]: 54: Hoare triple {132277#true} assume true; {132277#true} is VALID [2022-04-08 12:44:22,653 INFO L290 TraceCheckUtils]: 53: Hoare triple {132277#true} assume !(0 == ~cond); {132277#true} is VALID [2022-04-08 12:44:22,653 INFO L290 TraceCheckUtils]: 52: Hoare triple {132277#true} ~cond := #in~cond; {132277#true} is VALID [2022-04-08 12:44:22,653 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-08 12:44:22,653 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-08 12:44:22,655 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-08 12:44:22,655 INFO L290 TraceCheckUtils]: 48: Hoare triple {132509#(<= ~counter~0 8)} assume !(~r~0 < 0); {132509#(<= ~counter~0 8)} is VALID [2022-04-08 12:44:22,656 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {132277#true} {132509#(<= ~counter~0 8)} #98#return; {132509#(<= ~counter~0 8)} is VALID [2022-04-08 12:44:22,656 INFO L290 TraceCheckUtils]: 46: Hoare triple {132277#true} assume true; {132277#true} is VALID [2022-04-08 12:44:22,656 INFO L290 TraceCheckUtils]: 45: Hoare triple {132277#true} assume !(0 == ~cond); {132277#true} is VALID [2022-04-08 12:44:22,656 INFO L290 TraceCheckUtils]: 44: Hoare triple {132277#true} ~cond := #in~cond; {132277#true} is VALID [2022-04-08 12:44:22,656 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-08 12:44:22,656 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-08 12:44:22,658 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-08 12:44:22,659 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-08 12:44:22,659 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {132277#true} {132484#(<= ~counter~0 7)} #98#return; {132484#(<= ~counter~0 7)} is VALID [2022-04-08 12:44:22,659 INFO L290 TraceCheckUtils]: 38: Hoare triple {132277#true} assume true; {132277#true} is VALID [2022-04-08 12:44:22,659 INFO L290 TraceCheckUtils]: 37: Hoare triple {132277#true} assume !(0 == ~cond); {132277#true} is VALID [2022-04-08 12:44:22,659 INFO L290 TraceCheckUtils]: 36: Hoare triple {132277#true} ~cond := #in~cond; {132277#true} is VALID [2022-04-08 12:44:22,659 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-08 12:44:22,660 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-08 12:44:22,661 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-08 12:44:22,662 INFO L290 TraceCheckUtils]: 32: Hoare triple {132459#(<= ~counter~0 6)} assume !(~r~0 > 0); {132459#(<= ~counter~0 6)} is VALID [2022-04-08 12:44:22,662 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {132277#true} {132459#(<= ~counter~0 6)} #96#return; {132459#(<= ~counter~0 6)} is VALID [2022-04-08 12:44:22,662 INFO L290 TraceCheckUtils]: 30: Hoare triple {132277#true} assume true; {132277#true} is VALID [2022-04-08 12:44:22,662 INFO L290 TraceCheckUtils]: 29: Hoare triple {132277#true} assume !(0 == ~cond); {132277#true} is VALID [2022-04-08 12:44:22,662 INFO L290 TraceCheckUtils]: 28: Hoare triple {132277#true} ~cond := #in~cond; {132277#true} is VALID [2022-04-08 12:44:22,663 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-08 12:44:22,663 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-08 12:44:22,665 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-08 12:44:22,666 INFO L290 TraceCheckUtils]: 24: Hoare triple {132434#(<= ~counter~0 5)} assume !!(0 != ~r~0); {132434#(<= ~counter~0 5)} is VALID [2022-04-08 12:44:22,666 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {132277#true} {132434#(<= ~counter~0 5)} #94#return; {132434#(<= ~counter~0 5)} is VALID [2022-04-08 12:44:22,666 INFO L290 TraceCheckUtils]: 22: Hoare triple {132277#true} assume true; {132277#true} is VALID [2022-04-08 12:44:22,667 INFO L290 TraceCheckUtils]: 21: Hoare triple {132277#true} assume !(0 == ~cond); {132277#true} is VALID [2022-04-08 12:44:22,667 INFO L290 TraceCheckUtils]: 20: Hoare triple {132277#true} ~cond := #in~cond; {132277#true} is VALID [2022-04-08 12:44:22,667 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-08 12:44:22,667 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-08 12:44:22,670 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-08 12:44:22,671 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-08 12:44:22,671 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {132277#true} {132409#(<= ~counter~0 4)} #92#return; {132409#(<= ~counter~0 4)} is VALID [2022-04-08 12:44:22,671 INFO L290 TraceCheckUtils]: 14: Hoare triple {132277#true} assume true; {132277#true} is VALID [2022-04-08 12:44:22,671 INFO L290 TraceCheckUtils]: 13: Hoare triple {132277#true} assume !(0 == ~cond); {132277#true} is VALID [2022-04-08 12:44:22,671 INFO L290 TraceCheckUtils]: 12: Hoare triple {132277#true} ~cond := #in~cond; {132277#true} is VALID [2022-04-08 12:44:22,671 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-08 12:44:22,672 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {132277#true} {132409#(<= ~counter~0 4)} #90#return; {132409#(<= ~counter~0 4)} is VALID [2022-04-08 12:44:22,672 INFO L290 TraceCheckUtils]: 9: Hoare triple {132277#true} assume true; {132277#true} is VALID [2022-04-08 12:44:22,672 INFO L290 TraceCheckUtils]: 8: Hoare triple {132277#true} assume !(0 == ~cond); {132277#true} is VALID [2022-04-08 12:44:22,672 INFO L290 TraceCheckUtils]: 7: Hoare triple {132277#true} ~cond := #in~cond; {132277#true} is VALID [2022-04-08 12:44:22,672 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-08 12:44:22,672 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-08 12:44:22,672 INFO L272 TraceCheckUtils]: 4: Hoare triple {132409#(<= ~counter~0 4)} call #t~ret9 := main(); {132409#(<= ~counter~0 4)} is VALID [2022-04-08 12:44:22,673 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {132409#(<= ~counter~0 4)} {132277#true} #102#return; {132409#(<= ~counter~0 4)} is VALID [2022-04-08 12:44:22,673 INFO L290 TraceCheckUtils]: 2: Hoare triple {132409#(<= ~counter~0 4)} assume true; {132409#(<= ~counter~0 4)} is VALID [2022-04-08 12:44:22,674 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-08 12:44:22,674 INFO L272 TraceCheckUtils]: 0: Hoare triple {132277#true} call ULTIMATE.init(); {132277#true} is VALID [2022-04-08 12:44:22,674 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-08 12:44:22,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:44:22,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546822377] [2022-04-08 12:44:22,674 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:44:22,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105343084] [2022-04-08 12:44:22,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2105343084] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:44:22,674 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:44:22,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 24 [2022-04-08 12:44:22,675 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:44:22,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1057235126] [2022-04-08 12:44:22,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1057235126] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:44:22,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:44:22,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-08 12:44:22,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916424269] [2022-04-08 12:44:22,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:44:22,675 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-08 12:44:22,676 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:44:22,676 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-08 12:44:22,858 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-08 12:44:22,858 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-08 12:44:22,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:44:22,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-08 12:44:22,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-08 12:44:22,859 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-08 12:44:27,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:44:27,429 INFO L93 Difference]: Finished difference Result 981 states and 1345 transitions. [2022-04-08 12:44:27,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-08 12:44:27,430 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-08 12:44:27,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:44:27,430 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-08 12:44:27,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 337 transitions. [2022-04-08 12:44:27,432 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-08 12:44:27,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 337 transitions. [2022-04-08 12:44:27,434 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 337 transitions. [2022-04-08 12:44:27,893 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-08 12:44:27,918 INFO L225 Difference]: With dead ends: 981 [2022-04-08 12:44:27,918 INFO L226 Difference]: Without dead ends: 789 [2022-04-08 12:44:27,919 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 266 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=509, Invalid=823, Unknown=0, NotChecked=0, Total=1332 [2022-04-08 12:44:27,919 INFO L913 BasicCegarLoop]: 75 mSDtfsCounter, 230 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.6s IncrementalHoareTripleChecker+Time [2022-04-08 12:44:27,919 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [230 Valid, 343 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-08 12:44:27,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2022-04-08 12:44:30,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 778. [2022-04-08 12:44:30,645 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:44:30,646 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-08 12:44:30,647 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-08 12:44:30,647 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-08 12:44:30,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:44:30,667 INFO L93 Difference]: Finished difference Result 789 states and 1052 transitions. [2022-04-08 12:44:30,667 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1052 transitions. [2022-04-08 12:44:30,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:44:30,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:44:30,668 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-08 12:44:30,669 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-08 12:44:30,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:44:30,689 INFO L93 Difference]: Finished difference Result 789 states and 1052 transitions. [2022-04-08 12:44:30,689 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1052 transitions. [2022-04-08 12:44:30,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:44:30,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:44:30,690 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:44:30,690 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:44:30,690 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-08 12:44:30,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1041 transitions. [2022-04-08 12:44:30,721 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1041 transitions. Word has length 145 [2022-04-08 12:44:30,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:44:30,721 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 1041 transitions. [2022-04-08 12:44:30,721 INFO L479 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-08 12:44:30,721 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 778 states and 1041 transitions. [2022-04-08 12:44:44,414 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-08 12:44:44,414 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1041 transitions. [2022-04-08 12:44:44,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-04-08 12:44:44,415 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:44:44,415 INFO L499 BasicCegarLoop]: 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-08 12:44:44,432 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-08 12:44:44,616 WARN L460 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-08 12:44:44,616 INFO L403 AbstractCegarLoop]: === Iteration 51 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:44:44,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:44:44,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1963931820, now seen corresponding path program 21 times [2022-04-08 12:44:44,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:44:44,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [921013017] [2022-04-08 12:44:44,617 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:44:44,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1963931820, now seen corresponding path program 22 times [2022-04-08 12:44:44,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:44:44,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180102137] [2022-04-08 12:44:44,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:44:44,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:44:44,629 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:44:44,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [402942834] [2022-04-08 12:44:44,630 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 12:44:44,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:44:44,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:44:44,630 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-08 12:44:44,631 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-08 12:44:44,798 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 12:44:44,798 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:44:44,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-08 12:44:44,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:44:44,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:44:45,531 INFO L272 TraceCheckUtils]: 0: Hoare triple {138292#true} call ULTIMATE.init(); {138292#true} is VALID [2022-04-08 12:44:45,531 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-08 12:44:45,532 INFO L290 TraceCheckUtils]: 2: Hoare triple {138300#(<= ~counter~0 0)} assume true; {138300#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:45,532 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {138300#(<= ~counter~0 0)} {138292#true} #102#return; {138300#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:45,532 INFO L272 TraceCheckUtils]: 4: Hoare triple {138300#(<= ~counter~0 0)} call #t~ret9 := main(); {138300#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:45,533 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-08 12:44:45,533 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-08 12:44:45,533 INFO L290 TraceCheckUtils]: 7: Hoare triple {138300#(<= ~counter~0 0)} ~cond := #in~cond; {138300#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:45,534 INFO L290 TraceCheckUtils]: 8: Hoare triple {138300#(<= ~counter~0 0)} assume !(0 == ~cond); {138300#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:45,534 INFO L290 TraceCheckUtils]: 9: Hoare triple {138300#(<= ~counter~0 0)} assume true; {138300#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:45,534 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {138300#(<= ~counter~0 0)} {138300#(<= ~counter~0 0)} #90#return; {138300#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:45,535 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-08 12:44:45,535 INFO L290 TraceCheckUtils]: 12: Hoare triple {138300#(<= ~counter~0 0)} ~cond := #in~cond; {138300#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:45,535 INFO L290 TraceCheckUtils]: 13: Hoare triple {138300#(<= ~counter~0 0)} assume !(0 == ~cond); {138300#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:45,535 INFO L290 TraceCheckUtils]: 14: Hoare triple {138300#(<= ~counter~0 0)} assume true; {138300#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:45,536 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {138300#(<= ~counter~0 0)} {138300#(<= ~counter~0 0)} #92#return; {138300#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:45,536 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-08 12:44:45,539 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-08 12:44:45,539 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-08 12:44:45,539 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-08 12:44:45,540 INFO L290 TraceCheckUtils]: 20: Hoare triple {138349#(<= ~counter~0 1)} ~cond := #in~cond; {138349#(<= ~counter~0 1)} is VALID [2022-04-08 12:44:45,540 INFO L290 TraceCheckUtils]: 21: Hoare triple {138349#(<= ~counter~0 1)} assume !(0 == ~cond); {138349#(<= ~counter~0 1)} is VALID [2022-04-08 12:44:45,540 INFO L290 TraceCheckUtils]: 22: Hoare triple {138349#(<= ~counter~0 1)} assume true; {138349#(<= ~counter~0 1)} is VALID [2022-04-08 12:44:45,541 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {138349#(<= ~counter~0 1)} {138349#(<= ~counter~0 1)} #94#return; {138349#(<= ~counter~0 1)} is VALID [2022-04-08 12:44:45,541 INFO L290 TraceCheckUtils]: 24: Hoare triple {138349#(<= ~counter~0 1)} assume !!(0 != ~r~0); {138349#(<= ~counter~0 1)} is VALID [2022-04-08 12:44:45,542 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-08 12:44:45,542 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-08 12:44:45,543 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-08 12:44:45,543 INFO L290 TraceCheckUtils]: 28: Hoare triple {138374#(<= ~counter~0 2)} ~cond := #in~cond; {138374#(<= ~counter~0 2)} is VALID [2022-04-08 12:44:45,543 INFO L290 TraceCheckUtils]: 29: Hoare triple {138374#(<= ~counter~0 2)} assume !(0 == ~cond); {138374#(<= ~counter~0 2)} is VALID [2022-04-08 12:44:45,544 INFO L290 TraceCheckUtils]: 30: Hoare triple {138374#(<= ~counter~0 2)} assume true; {138374#(<= ~counter~0 2)} is VALID [2022-04-08 12:44:45,544 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {138374#(<= ~counter~0 2)} {138374#(<= ~counter~0 2)} #96#return; {138374#(<= ~counter~0 2)} is VALID [2022-04-08 12:44:45,544 INFO L290 TraceCheckUtils]: 32: Hoare triple {138374#(<= ~counter~0 2)} assume !(~r~0 > 0); {138374#(<= ~counter~0 2)} is VALID [2022-04-08 12:44:45,546 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-08 12:44:45,546 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-08 12:44:45,546 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-08 12:44:45,547 INFO L290 TraceCheckUtils]: 36: Hoare triple {138399#(<= ~counter~0 3)} ~cond := #in~cond; {138399#(<= ~counter~0 3)} is VALID [2022-04-08 12:44:45,547 INFO L290 TraceCheckUtils]: 37: Hoare triple {138399#(<= ~counter~0 3)} assume !(0 == ~cond); {138399#(<= ~counter~0 3)} is VALID [2022-04-08 12:44:45,547 INFO L290 TraceCheckUtils]: 38: Hoare triple {138399#(<= ~counter~0 3)} assume true; {138399#(<= ~counter~0 3)} is VALID [2022-04-08 12:44:45,548 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {138399#(<= ~counter~0 3)} {138399#(<= ~counter~0 3)} #98#return; {138399#(<= ~counter~0 3)} is VALID [2022-04-08 12:44:45,548 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-08 12:44:45,549 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-08 12:44:45,549 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-08 12:44:45,550 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-08 12:44:45,550 INFO L290 TraceCheckUtils]: 44: Hoare triple {138424#(<= ~counter~0 4)} ~cond := #in~cond; {138424#(<= ~counter~0 4)} is VALID [2022-04-08 12:44:45,550 INFO L290 TraceCheckUtils]: 45: Hoare triple {138424#(<= ~counter~0 4)} assume !(0 == ~cond); {138424#(<= ~counter~0 4)} is VALID [2022-04-08 12:44:45,550 INFO L290 TraceCheckUtils]: 46: Hoare triple {138424#(<= ~counter~0 4)} assume true; {138424#(<= ~counter~0 4)} is VALID [2022-04-08 12:44:45,551 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {138424#(<= ~counter~0 4)} {138424#(<= ~counter~0 4)} #98#return; {138424#(<= ~counter~0 4)} is VALID [2022-04-08 12:44:45,551 INFO L290 TraceCheckUtils]: 48: Hoare triple {138424#(<= ~counter~0 4)} assume !(~r~0 < 0); {138424#(<= ~counter~0 4)} is VALID [2022-04-08 12:44:45,552 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-08 12:44:45,561 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-08 12:44:45,562 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-08 12:44:45,562 INFO L290 TraceCheckUtils]: 52: Hoare triple {138449#(<= ~counter~0 5)} ~cond := #in~cond; {138449#(<= ~counter~0 5)} is VALID [2022-04-08 12:44:45,562 INFO L290 TraceCheckUtils]: 53: Hoare triple {138449#(<= ~counter~0 5)} assume !(0 == ~cond); {138449#(<= ~counter~0 5)} is VALID [2022-04-08 12:44:45,563 INFO L290 TraceCheckUtils]: 54: Hoare triple {138449#(<= ~counter~0 5)} assume true; {138449#(<= ~counter~0 5)} is VALID [2022-04-08 12:44:45,563 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {138449#(<= ~counter~0 5)} {138449#(<= ~counter~0 5)} #94#return; {138449#(<= ~counter~0 5)} is VALID [2022-04-08 12:44:45,564 INFO L290 TraceCheckUtils]: 56: Hoare triple {138449#(<= ~counter~0 5)} assume !!(0 != ~r~0); {138449#(<= ~counter~0 5)} is VALID [2022-04-08 12:44:45,566 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-08 12:44:45,566 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-08 12:44:45,567 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-08 12:44:45,567 INFO L290 TraceCheckUtils]: 60: Hoare triple {138474#(<= ~counter~0 6)} ~cond := #in~cond; {138474#(<= ~counter~0 6)} is VALID [2022-04-08 12:44:45,567 INFO L290 TraceCheckUtils]: 61: Hoare triple {138474#(<= ~counter~0 6)} assume !(0 == ~cond); {138474#(<= ~counter~0 6)} is VALID [2022-04-08 12:44:45,568 INFO L290 TraceCheckUtils]: 62: Hoare triple {138474#(<= ~counter~0 6)} assume true; {138474#(<= ~counter~0 6)} is VALID [2022-04-08 12:44:45,568 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {138474#(<= ~counter~0 6)} {138474#(<= ~counter~0 6)} #96#return; {138474#(<= ~counter~0 6)} is VALID [2022-04-08 12:44:45,568 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-08 12:44:45,570 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-08 12:44:45,571 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-08 12:44:45,571 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-08 12:44:45,571 INFO L290 TraceCheckUtils]: 68: Hoare triple {138499#(<= ~counter~0 7)} ~cond := #in~cond; {138499#(<= ~counter~0 7)} is VALID [2022-04-08 12:44:45,572 INFO L290 TraceCheckUtils]: 69: Hoare triple {138499#(<= ~counter~0 7)} assume !(0 == ~cond); {138499#(<= ~counter~0 7)} is VALID [2022-04-08 12:44:45,572 INFO L290 TraceCheckUtils]: 70: Hoare triple {138499#(<= ~counter~0 7)} assume true; {138499#(<= ~counter~0 7)} is VALID [2022-04-08 12:44:45,573 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {138499#(<= ~counter~0 7)} {138499#(<= ~counter~0 7)} #96#return; {138499#(<= ~counter~0 7)} is VALID [2022-04-08 12:44:45,573 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-08 12:44:45,574 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-08 12:44:45,575 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-08 12:44:45,575 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-08 12:44:45,576 INFO L290 TraceCheckUtils]: 76: Hoare triple {138524#(<= ~counter~0 8)} ~cond := #in~cond; {138524#(<= ~counter~0 8)} is VALID [2022-04-08 12:44:45,576 INFO L290 TraceCheckUtils]: 77: Hoare triple {138524#(<= ~counter~0 8)} assume !(0 == ~cond); {138524#(<= ~counter~0 8)} is VALID [2022-04-08 12:44:45,576 INFO L290 TraceCheckUtils]: 78: Hoare triple {138524#(<= ~counter~0 8)} assume true; {138524#(<= ~counter~0 8)} is VALID [2022-04-08 12:44:45,577 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {138524#(<= ~counter~0 8)} {138524#(<= ~counter~0 8)} #96#return; {138524#(<= ~counter~0 8)} is VALID [2022-04-08 12:44:45,577 INFO L290 TraceCheckUtils]: 80: Hoare triple {138524#(<= ~counter~0 8)} assume !(~r~0 > 0); {138524#(<= ~counter~0 8)} is VALID [2022-04-08 12:44:45,578 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-08 12:44:45,579 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-08 12:44:45,579 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-08 12:44:45,579 INFO L290 TraceCheckUtils]: 84: Hoare triple {138549#(<= ~counter~0 9)} ~cond := #in~cond; {138549#(<= ~counter~0 9)} is VALID [2022-04-08 12:44:45,580 INFO L290 TraceCheckUtils]: 85: Hoare triple {138549#(<= ~counter~0 9)} assume !(0 == ~cond); {138549#(<= ~counter~0 9)} is VALID [2022-04-08 12:44:45,580 INFO L290 TraceCheckUtils]: 86: Hoare triple {138549#(<= ~counter~0 9)} assume true; {138549#(<= ~counter~0 9)} is VALID [2022-04-08 12:44:45,580 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {138549#(<= ~counter~0 9)} {138549#(<= ~counter~0 9)} #98#return; {138549#(<= ~counter~0 9)} is VALID [2022-04-08 12:44:45,581 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-08 12:44:45,582 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-08 12:44:45,583 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-08 12:44:45,583 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-08 12:44:45,583 INFO L290 TraceCheckUtils]: 92: Hoare triple {138574#(<= ~counter~0 10)} ~cond := #in~cond; {138574#(<= ~counter~0 10)} is VALID [2022-04-08 12:44:45,584 INFO L290 TraceCheckUtils]: 93: Hoare triple {138574#(<= ~counter~0 10)} assume !(0 == ~cond); {138574#(<= ~counter~0 10)} is VALID [2022-04-08 12:44:45,584 INFO L290 TraceCheckUtils]: 94: Hoare triple {138574#(<= ~counter~0 10)} assume true; {138574#(<= ~counter~0 10)} is VALID [2022-04-08 12:44:45,585 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {138574#(<= ~counter~0 10)} {138574#(<= ~counter~0 10)} #98#return; {138574#(<= ~counter~0 10)} is VALID [2022-04-08 12:44:45,585 INFO L290 TraceCheckUtils]: 96: Hoare triple {138574#(<= ~counter~0 10)} assume !(~r~0 < 0); {138574#(<= ~counter~0 10)} is VALID [2022-04-08 12:44:45,586 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-08 12:44:45,587 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-08 12:44:45,587 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-08 12:44:45,587 INFO L290 TraceCheckUtils]: 100: Hoare triple {138599#(<= ~counter~0 11)} ~cond := #in~cond; {138599#(<= ~counter~0 11)} is VALID [2022-04-08 12:44:45,588 INFO L290 TraceCheckUtils]: 101: Hoare triple {138599#(<= ~counter~0 11)} assume !(0 == ~cond); {138599#(<= ~counter~0 11)} is VALID [2022-04-08 12:44:45,588 INFO L290 TraceCheckUtils]: 102: Hoare triple {138599#(<= ~counter~0 11)} assume true; {138599#(<= ~counter~0 11)} is VALID [2022-04-08 12:44:45,589 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {138599#(<= ~counter~0 11)} {138599#(<= ~counter~0 11)} #94#return; {138599#(<= ~counter~0 11)} is VALID [2022-04-08 12:44:45,589 INFO L290 TraceCheckUtils]: 104: Hoare triple {138599#(<= ~counter~0 11)} assume !!(0 != ~r~0); {138599#(<= ~counter~0 11)} is VALID [2022-04-08 12:44:45,590 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-08 12:44:45,591 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-08 12:44:45,591 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-08 12:44:45,591 INFO L290 TraceCheckUtils]: 108: Hoare triple {138624#(<= ~counter~0 12)} ~cond := #in~cond; {138624#(<= ~counter~0 12)} is VALID [2022-04-08 12:44:45,592 INFO L290 TraceCheckUtils]: 109: Hoare triple {138624#(<= ~counter~0 12)} assume !(0 == ~cond); {138624#(<= ~counter~0 12)} is VALID [2022-04-08 12:44:45,592 INFO L290 TraceCheckUtils]: 110: Hoare triple {138624#(<= ~counter~0 12)} assume true; {138624#(<= ~counter~0 12)} is VALID [2022-04-08 12:44:45,593 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {138624#(<= ~counter~0 12)} {138624#(<= ~counter~0 12)} #96#return; {138624#(<= ~counter~0 12)} is VALID [2022-04-08 12:44:45,593 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-08 12:44:45,594 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-08 12:44:45,594 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-08 12:44:45,595 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-08 12:44:45,595 INFO L290 TraceCheckUtils]: 116: Hoare triple {138649#(<= ~counter~0 13)} ~cond := #in~cond; {138649#(<= ~counter~0 13)} is VALID [2022-04-08 12:44:45,595 INFO L290 TraceCheckUtils]: 117: Hoare triple {138649#(<= ~counter~0 13)} assume !(0 == ~cond); {138649#(<= ~counter~0 13)} is VALID [2022-04-08 12:44:45,596 INFO L290 TraceCheckUtils]: 118: Hoare triple {138649#(<= ~counter~0 13)} assume true; {138649#(<= ~counter~0 13)} is VALID [2022-04-08 12:44:45,596 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {138649#(<= ~counter~0 13)} {138649#(<= ~counter~0 13)} #96#return; {138649#(<= ~counter~0 13)} is VALID [2022-04-08 12:44:45,596 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-08 12:44:45,598 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-08 12:44:45,598 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-08 12:44:45,599 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-08 12:44:45,599 INFO L290 TraceCheckUtils]: 124: Hoare triple {138674#(<= ~counter~0 14)} ~cond := #in~cond; {138674#(<= ~counter~0 14)} is VALID [2022-04-08 12:44:45,599 INFO L290 TraceCheckUtils]: 125: Hoare triple {138674#(<= ~counter~0 14)} assume !(0 == ~cond); {138674#(<= ~counter~0 14)} is VALID [2022-04-08 12:44:45,600 INFO L290 TraceCheckUtils]: 126: Hoare triple {138674#(<= ~counter~0 14)} assume true; {138674#(<= ~counter~0 14)} is VALID [2022-04-08 12:44:45,600 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {138674#(<= ~counter~0 14)} {138674#(<= ~counter~0 14)} #96#return; {138674#(<= ~counter~0 14)} is VALID [2022-04-08 12:44:45,600 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-08 12:44:45,602 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-08 12:44:45,602 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-08 12:44:45,602 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-08 12:44:45,603 INFO L290 TraceCheckUtils]: 132: Hoare triple {138699#(<= ~counter~0 15)} ~cond := #in~cond; {138699#(<= ~counter~0 15)} is VALID [2022-04-08 12:44:45,603 INFO L290 TraceCheckUtils]: 133: Hoare triple {138699#(<= ~counter~0 15)} assume !(0 == ~cond); {138699#(<= ~counter~0 15)} is VALID [2022-04-08 12:44:45,603 INFO L290 TraceCheckUtils]: 134: Hoare triple {138699#(<= ~counter~0 15)} assume true; {138699#(<= ~counter~0 15)} is VALID [2022-04-08 12:44:45,603 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {138699#(<= ~counter~0 15)} {138699#(<= ~counter~0 15)} #96#return; {138699#(<= ~counter~0 15)} is VALID [2022-04-08 12:44:45,604 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-08 12:44:45,604 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-08 12:44:45,604 INFO L290 TraceCheckUtils]: 138: Hoare triple {138724#(<= |main_#t~post7| 15)} assume !(#t~post7 < 20);havoc #t~post7; {138293#false} is VALID [2022-04-08 12:44:45,604 INFO L290 TraceCheckUtils]: 139: Hoare triple {138293#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {138293#false} is VALID [2022-04-08 12:44:45,605 INFO L290 TraceCheckUtils]: 140: Hoare triple {138293#false} assume !(#t~post8 < 20);havoc #t~post8; {138293#false} is VALID [2022-04-08 12:44:45,605 INFO L290 TraceCheckUtils]: 141: Hoare triple {138293#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {138293#false} is VALID [2022-04-08 12:44:45,605 INFO L290 TraceCheckUtils]: 142: Hoare triple {138293#false} assume !(#t~post6 < 20);havoc #t~post6; {138293#false} is VALID [2022-04-08 12:44:45,605 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-08 12:44:45,605 INFO L290 TraceCheckUtils]: 144: Hoare triple {138293#false} ~cond := #in~cond; {138293#false} is VALID [2022-04-08 12:44:45,605 INFO L290 TraceCheckUtils]: 145: Hoare triple {138293#false} assume 0 == ~cond; {138293#false} is VALID [2022-04-08 12:44:45,605 INFO L290 TraceCheckUtils]: 146: Hoare triple {138293#false} assume !false; {138293#false} is VALID [2022-04-08 12:44:45,605 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-08 12:44:45,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:44:46,232 INFO L290 TraceCheckUtils]: 146: Hoare triple {138293#false} assume !false; {138293#false} is VALID [2022-04-08 12:44:46,232 INFO L290 TraceCheckUtils]: 145: Hoare triple {138293#false} assume 0 == ~cond; {138293#false} is VALID [2022-04-08 12:44:46,232 INFO L290 TraceCheckUtils]: 144: Hoare triple {138293#false} ~cond := #in~cond; {138293#false} is VALID [2022-04-08 12:44:46,232 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-08 12:44:46,232 INFO L290 TraceCheckUtils]: 142: Hoare triple {138293#false} assume !(#t~post6 < 20);havoc #t~post6; {138293#false} is VALID [2022-04-08 12:44:46,232 INFO L290 TraceCheckUtils]: 141: Hoare triple {138293#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {138293#false} is VALID [2022-04-08 12:44:46,232 INFO L290 TraceCheckUtils]: 140: Hoare triple {138293#false} assume !(#t~post8 < 20);havoc #t~post8; {138293#false} is VALID [2022-04-08 12:44:46,232 INFO L290 TraceCheckUtils]: 139: Hoare triple {138293#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {138293#false} is VALID [2022-04-08 12:44:46,233 INFO L290 TraceCheckUtils]: 138: Hoare triple {138776#(< |main_#t~post7| 20)} assume !(#t~post7 < 20);havoc #t~post7; {138293#false} is VALID [2022-04-08 12:44:46,233 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-08 12:44:46,233 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-08 12:44:46,234 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {138292#true} {138780#(< ~counter~0 20)} #96#return; {138780#(< ~counter~0 20)} is VALID [2022-04-08 12:44:46,234 INFO L290 TraceCheckUtils]: 134: Hoare triple {138292#true} assume true; {138292#true} is VALID [2022-04-08 12:44:46,234 INFO L290 TraceCheckUtils]: 133: Hoare triple {138292#true} assume !(0 == ~cond); {138292#true} is VALID [2022-04-08 12:44:46,234 INFO L290 TraceCheckUtils]: 132: Hoare triple {138292#true} ~cond := #in~cond; {138292#true} is VALID [2022-04-08 12:44:46,234 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-08 12:44:46,234 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-08 12:44:46,237 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-08 12:44:46,237 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-08 12:44:46,238 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {138292#true} {138805#(< ~counter~0 19)} #96#return; {138805#(< ~counter~0 19)} is VALID [2022-04-08 12:44:46,238 INFO L290 TraceCheckUtils]: 126: Hoare triple {138292#true} assume true; {138292#true} is VALID [2022-04-08 12:44:46,238 INFO L290 TraceCheckUtils]: 125: Hoare triple {138292#true} assume !(0 == ~cond); {138292#true} is VALID [2022-04-08 12:44:46,238 INFO L290 TraceCheckUtils]: 124: Hoare triple {138292#true} ~cond := #in~cond; {138292#true} is VALID [2022-04-08 12:44:46,238 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-08 12:44:46,238 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-08 12:44:46,239 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-08 12:44:46,240 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-08 12:44:46,240 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {138292#true} {138830#(< ~counter~0 18)} #96#return; {138830#(< ~counter~0 18)} is VALID [2022-04-08 12:44:46,240 INFO L290 TraceCheckUtils]: 118: Hoare triple {138292#true} assume true; {138292#true} is VALID [2022-04-08 12:44:46,240 INFO L290 TraceCheckUtils]: 117: Hoare triple {138292#true} assume !(0 == ~cond); {138292#true} is VALID [2022-04-08 12:44:46,240 INFO L290 TraceCheckUtils]: 116: Hoare triple {138292#true} ~cond := #in~cond; {138292#true} is VALID [2022-04-08 12:44:46,240 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-08 12:44:46,241 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-08 12:44:46,242 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-08 12:44:46,242 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-08 12:44:46,243 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {138292#true} {138855#(< ~counter~0 17)} #96#return; {138855#(< ~counter~0 17)} is VALID [2022-04-08 12:44:46,243 INFO L290 TraceCheckUtils]: 110: Hoare triple {138292#true} assume true; {138292#true} is VALID [2022-04-08 12:44:46,243 INFO L290 TraceCheckUtils]: 109: Hoare triple {138292#true} assume !(0 == ~cond); {138292#true} is VALID [2022-04-08 12:44:46,243 INFO L290 TraceCheckUtils]: 108: Hoare triple {138292#true} ~cond := #in~cond; {138292#true} is VALID [2022-04-08 12:44:46,243 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-08 12:44:46,243 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-08 12:44:46,244 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-08 12:44:46,244 INFO L290 TraceCheckUtils]: 104: Hoare triple {138699#(<= ~counter~0 15)} assume !!(0 != ~r~0); {138699#(<= ~counter~0 15)} is VALID [2022-04-08 12:44:46,245 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {138292#true} {138699#(<= ~counter~0 15)} #94#return; {138699#(<= ~counter~0 15)} is VALID [2022-04-08 12:44:46,245 INFO L290 TraceCheckUtils]: 102: Hoare triple {138292#true} assume true; {138292#true} is VALID [2022-04-08 12:44:46,245 INFO L290 TraceCheckUtils]: 101: Hoare triple {138292#true} assume !(0 == ~cond); {138292#true} is VALID [2022-04-08 12:44:46,245 INFO L290 TraceCheckUtils]: 100: Hoare triple {138292#true} ~cond := #in~cond; {138292#true} is VALID [2022-04-08 12:44:46,245 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-08 12:44:46,245 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-08 12:44:46,247 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-08 12:44:46,247 INFO L290 TraceCheckUtils]: 96: Hoare triple {138674#(<= ~counter~0 14)} assume !(~r~0 < 0); {138674#(<= ~counter~0 14)} is VALID [2022-04-08 12:44:46,247 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {138292#true} {138674#(<= ~counter~0 14)} #98#return; {138674#(<= ~counter~0 14)} is VALID [2022-04-08 12:44:46,247 INFO L290 TraceCheckUtils]: 94: Hoare triple {138292#true} assume true; {138292#true} is VALID [2022-04-08 12:44:46,248 INFO L290 TraceCheckUtils]: 93: Hoare triple {138292#true} assume !(0 == ~cond); {138292#true} is VALID [2022-04-08 12:44:46,248 INFO L290 TraceCheckUtils]: 92: Hoare triple {138292#true} ~cond := #in~cond; {138292#true} is VALID [2022-04-08 12:44:46,248 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-08 12:44:46,248 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-08 12:44:46,249 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-08 12:44:46,249 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-08 12:44:46,250 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {138292#true} {138649#(<= ~counter~0 13)} #98#return; {138649#(<= ~counter~0 13)} is VALID [2022-04-08 12:44:46,250 INFO L290 TraceCheckUtils]: 86: Hoare triple {138292#true} assume true; {138292#true} is VALID [2022-04-08 12:44:46,250 INFO L290 TraceCheckUtils]: 85: Hoare triple {138292#true} assume !(0 == ~cond); {138292#true} is VALID [2022-04-08 12:44:46,250 INFO L290 TraceCheckUtils]: 84: Hoare triple {138292#true} ~cond := #in~cond; {138292#true} is VALID [2022-04-08 12:44:46,250 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-08 12:44:46,250 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-08 12:44:46,251 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-08 12:44:46,252 INFO L290 TraceCheckUtils]: 80: Hoare triple {138624#(<= ~counter~0 12)} assume !(~r~0 > 0); {138624#(<= ~counter~0 12)} is VALID [2022-04-08 12:44:46,252 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {138292#true} {138624#(<= ~counter~0 12)} #96#return; {138624#(<= ~counter~0 12)} is VALID [2022-04-08 12:44:46,252 INFO L290 TraceCheckUtils]: 78: Hoare triple {138292#true} assume true; {138292#true} is VALID [2022-04-08 12:44:46,252 INFO L290 TraceCheckUtils]: 77: Hoare triple {138292#true} assume !(0 == ~cond); {138292#true} is VALID [2022-04-08 12:44:46,252 INFO L290 TraceCheckUtils]: 76: Hoare triple {138292#true} ~cond := #in~cond; {138292#true} is VALID [2022-04-08 12:44:46,252 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-08 12:44:46,253 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-08 12:44:46,254 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-08 12:44:46,254 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-08 12:44:46,254 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {138292#true} {138599#(<= ~counter~0 11)} #96#return; {138599#(<= ~counter~0 11)} is VALID [2022-04-08 12:44:46,254 INFO L290 TraceCheckUtils]: 70: Hoare triple {138292#true} assume true; {138292#true} is VALID [2022-04-08 12:44:46,255 INFO L290 TraceCheckUtils]: 69: Hoare triple {138292#true} assume !(0 == ~cond); {138292#true} is VALID [2022-04-08 12:44:46,255 INFO L290 TraceCheckUtils]: 68: Hoare triple {138292#true} ~cond := #in~cond; {138292#true} is VALID [2022-04-08 12:44:46,255 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-08 12:44:46,255 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-08 12:44:46,256 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-08 12:44:46,256 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-08 12:44:46,257 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {138292#true} {138574#(<= ~counter~0 10)} #96#return; {138574#(<= ~counter~0 10)} is VALID [2022-04-08 12:44:46,257 INFO L290 TraceCheckUtils]: 62: Hoare triple {138292#true} assume true; {138292#true} is VALID [2022-04-08 12:44:46,257 INFO L290 TraceCheckUtils]: 61: Hoare triple {138292#true} assume !(0 == ~cond); {138292#true} is VALID [2022-04-08 12:44:46,257 INFO L290 TraceCheckUtils]: 60: Hoare triple {138292#true} ~cond := #in~cond; {138292#true} is VALID [2022-04-08 12:44:46,257 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-08 12:44:46,257 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-08 12:44:46,258 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-08 12:44:46,259 INFO L290 TraceCheckUtils]: 56: Hoare triple {138549#(<= ~counter~0 9)} assume !!(0 != ~r~0); {138549#(<= ~counter~0 9)} is VALID [2022-04-08 12:44:46,259 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {138292#true} {138549#(<= ~counter~0 9)} #94#return; {138549#(<= ~counter~0 9)} is VALID [2022-04-08 12:44:46,259 INFO L290 TraceCheckUtils]: 54: Hoare triple {138292#true} assume true; {138292#true} is VALID [2022-04-08 12:44:46,259 INFO L290 TraceCheckUtils]: 53: Hoare triple {138292#true} assume !(0 == ~cond); {138292#true} is VALID [2022-04-08 12:44:46,259 INFO L290 TraceCheckUtils]: 52: Hoare triple {138292#true} ~cond := #in~cond; {138292#true} is VALID [2022-04-08 12:44:46,259 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-08 12:44:46,260 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-08 12:44:46,261 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-08 12:44:46,261 INFO L290 TraceCheckUtils]: 48: Hoare triple {138524#(<= ~counter~0 8)} assume !(~r~0 < 0); {138524#(<= ~counter~0 8)} is VALID [2022-04-08 12:44:46,261 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {138292#true} {138524#(<= ~counter~0 8)} #98#return; {138524#(<= ~counter~0 8)} is VALID [2022-04-08 12:44:46,262 INFO L290 TraceCheckUtils]: 46: Hoare triple {138292#true} assume true; {138292#true} is VALID [2022-04-08 12:44:46,262 INFO L290 TraceCheckUtils]: 45: Hoare triple {138292#true} assume !(0 == ~cond); {138292#true} is VALID [2022-04-08 12:44:46,262 INFO L290 TraceCheckUtils]: 44: Hoare triple {138292#true} ~cond := #in~cond; {138292#true} is VALID [2022-04-08 12:44:46,262 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-08 12:44:46,262 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-08 12:44:46,263 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-08 12:44:46,263 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-08 12:44:46,264 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {138292#true} {138499#(<= ~counter~0 7)} #98#return; {138499#(<= ~counter~0 7)} is VALID [2022-04-08 12:44:46,264 INFO L290 TraceCheckUtils]: 38: Hoare triple {138292#true} assume true; {138292#true} is VALID [2022-04-08 12:44:46,264 INFO L290 TraceCheckUtils]: 37: Hoare triple {138292#true} assume !(0 == ~cond); {138292#true} is VALID [2022-04-08 12:44:46,264 INFO L290 TraceCheckUtils]: 36: Hoare triple {138292#true} ~cond := #in~cond; {138292#true} is VALID [2022-04-08 12:44:46,264 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-08 12:44:46,264 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-08 12:44:46,266 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-08 12:44:46,266 INFO L290 TraceCheckUtils]: 32: Hoare triple {138474#(<= ~counter~0 6)} assume !(~r~0 > 0); {138474#(<= ~counter~0 6)} is VALID [2022-04-08 12:44:46,266 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {138292#true} {138474#(<= ~counter~0 6)} #96#return; {138474#(<= ~counter~0 6)} is VALID [2022-04-08 12:44:46,266 INFO L290 TraceCheckUtils]: 30: Hoare triple {138292#true} assume true; {138292#true} is VALID [2022-04-08 12:44:46,266 INFO L290 TraceCheckUtils]: 29: Hoare triple {138292#true} assume !(0 == ~cond); {138292#true} is VALID [2022-04-08 12:44:46,266 INFO L290 TraceCheckUtils]: 28: Hoare triple {138292#true} ~cond := #in~cond; {138292#true} is VALID [2022-04-08 12:44:46,267 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-08 12:44:46,267 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-08 12:44:46,268 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-08 12:44:46,268 INFO L290 TraceCheckUtils]: 24: Hoare triple {138449#(<= ~counter~0 5)} assume !!(0 != ~r~0); {138449#(<= ~counter~0 5)} is VALID [2022-04-08 12:44:46,269 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {138292#true} {138449#(<= ~counter~0 5)} #94#return; {138449#(<= ~counter~0 5)} is VALID [2022-04-08 12:44:46,269 INFO L290 TraceCheckUtils]: 22: Hoare triple {138292#true} assume true; {138292#true} is VALID [2022-04-08 12:44:46,269 INFO L290 TraceCheckUtils]: 21: Hoare triple {138292#true} assume !(0 == ~cond); {138292#true} is VALID [2022-04-08 12:44:46,269 INFO L290 TraceCheckUtils]: 20: Hoare triple {138292#true} ~cond := #in~cond; {138292#true} is VALID [2022-04-08 12:44:46,269 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-08 12:44:46,269 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-08 12:44:46,270 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-08 12:44:46,270 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-08 12:44:46,271 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {138292#true} {138424#(<= ~counter~0 4)} #92#return; {138424#(<= ~counter~0 4)} is VALID [2022-04-08 12:44:46,271 INFO L290 TraceCheckUtils]: 14: Hoare triple {138292#true} assume true; {138292#true} is VALID [2022-04-08 12:44:46,271 INFO L290 TraceCheckUtils]: 13: Hoare triple {138292#true} assume !(0 == ~cond); {138292#true} is VALID [2022-04-08 12:44:46,271 INFO L290 TraceCheckUtils]: 12: Hoare triple {138292#true} ~cond := #in~cond; {138292#true} is VALID [2022-04-08 12:44:46,271 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-08 12:44:46,272 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {138292#true} {138424#(<= ~counter~0 4)} #90#return; {138424#(<= ~counter~0 4)} is VALID [2022-04-08 12:44:46,272 INFO L290 TraceCheckUtils]: 9: Hoare triple {138292#true} assume true; {138292#true} is VALID [2022-04-08 12:44:46,272 INFO L290 TraceCheckUtils]: 8: Hoare triple {138292#true} assume !(0 == ~cond); {138292#true} is VALID [2022-04-08 12:44:46,272 INFO L290 TraceCheckUtils]: 7: Hoare triple {138292#true} ~cond := #in~cond; {138292#true} is VALID [2022-04-08 12:44:46,272 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-08 12:44:46,272 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-08 12:44:46,272 INFO L272 TraceCheckUtils]: 4: Hoare triple {138424#(<= ~counter~0 4)} call #t~ret9 := main(); {138424#(<= ~counter~0 4)} is VALID [2022-04-08 12:44:46,273 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {138424#(<= ~counter~0 4)} {138292#true} #102#return; {138424#(<= ~counter~0 4)} is VALID [2022-04-08 12:44:46,273 INFO L290 TraceCheckUtils]: 2: Hoare triple {138424#(<= ~counter~0 4)} assume true; {138424#(<= ~counter~0 4)} is VALID [2022-04-08 12:44:46,273 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-08 12:44:46,273 INFO L272 TraceCheckUtils]: 0: Hoare triple {138292#true} call ULTIMATE.init(); {138292#true} is VALID [2022-04-08 12:44:46,274 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-08 12:44:46,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:44:46,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180102137] [2022-04-08 12:44:46,274 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:44:46,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402942834] [2022-04-08 12:44:46,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402942834] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:44:46,274 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:44:46,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 24 [2022-04-08 12:44:46,274 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:44:46,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [921013017] [2022-04-08 12:44:46,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [921013017] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:44:46,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:44:46,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-08 12:44:46,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166784664] [2022-04-08 12:44:46,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:44:46,275 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-08 12:44:46,275 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:44:46,275 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-08 12:44:46,414 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-08 12:44:46,415 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-08 12:44:46,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:44:46,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-08 12:44:46,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-08 12:44:46,415 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-08 12:44:50,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:44:50,921 INFO L93 Difference]: Finished difference Result 965 states and 1319 transitions. [2022-04-08 12:44:50,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-08 12:44:50,921 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-08 12:44:50,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:44:50,921 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-08 12:44:50,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 336 transitions. [2022-04-08 12:44:50,923 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-08 12:44:50,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 336 transitions. [2022-04-08 12:44:50,926 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 336 transitions. [2022-04-08 12:44:51,302 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-08 12:44:51,328 INFO L225 Difference]: With dead ends: 965 [2022-04-08 12:44:51,328 INFO L226 Difference]: Without dead ends: 795 [2022-04-08 12:44:51,329 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 270 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=544, Invalid=862, Unknown=0, NotChecked=0, Total=1406 [2022-04-08 12:44:51,329 INFO L913 BasicCegarLoop]: 75 mSDtfsCounter, 265 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.6s IncrementalHoareTripleChecker+Time [2022-04-08 12:44:51,329 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [265 Valid, 323 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-08 12:44:51,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2022-04-08 12:44:54,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 795. [2022-04-08 12:44:54,088 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:44:54,089 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-08 12:44:54,090 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-08 12:44:54,090 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-08 12:44:54,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:44:54,111 INFO L93 Difference]: Finished difference Result 795 states and 1058 transitions. [2022-04-08 12:44:54,111 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1058 transitions. [2022-04-08 12:44:54,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:44:54,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:44:54,112 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-08 12:44:54,112 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-08 12:44:54,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:44:54,133 INFO L93 Difference]: Finished difference Result 795 states and 1058 transitions. [2022-04-08 12:44:54,133 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1058 transitions. [2022-04-08 12:44:54,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:44:54,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:44:54,134 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:44:54,134 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:44:54,134 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-08 12:44:54,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1058 transitions. [2022-04-08 12:44:54,161 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1058 transitions. Word has length 147 [2022-04-08 12:44:54,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:44:54,161 INFO L478 AbstractCegarLoop]: Abstraction has 795 states and 1058 transitions. [2022-04-08 12:44:54,161 INFO L479 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-08 12:44:54,161 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 795 states and 1058 transitions. [2022-04-08 12:45:03,628 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1058 edges. 1057 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 12:45:03,628 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1058 transitions. [2022-04-08 12:45:03,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-04-08 12:45:03,630 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:45:03,630 INFO L499 BasicCegarLoop]: 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-08 12:45:03,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Ended with exit code 0 [2022-04-08 12:45:03,830 WARN L460 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-08 12:45:03,830 INFO L403 AbstractCegarLoop]: === Iteration 52 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:45:03,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:45:03,831 INFO L85 PathProgramCache]: Analyzing trace with hash -913503479, now seen corresponding path program 15 times [2022-04-08 12:45:03,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:45:03,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [665872209] [2022-04-08 12:45:03,831 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:45:03,831 INFO L85 PathProgramCache]: Analyzing trace with hash -913503479, now seen corresponding path program 16 times [2022-04-08 12:45:03,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:45:03,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649848107] [2022-04-08 12:45:03,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:45:03,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:45:03,844 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:45:03,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1429492947] [2022-04-08 12:45:03,844 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 12:45:03,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:45:03,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:45:03,845 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-08 12:45:03,846 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-08 12:45:03,966 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 12:45:03,966 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:45:03,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-08 12:45:03,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:45:03,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:45:04,758 INFO L272 TraceCheckUtils]: 0: Hoare triple {144335#true} call ULTIMATE.init(); {144335#true} is VALID [2022-04-08 12:45:04,759 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-08 12:45:04,759 INFO L290 TraceCheckUtils]: 2: Hoare triple {144343#(<= ~counter~0 0)} assume true; {144343#(<= ~counter~0 0)} is VALID [2022-04-08 12:45:04,759 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {144343#(<= ~counter~0 0)} {144335#true} #102#return; {144343#(<= ~counter~0 0)} is VALID [2022-04-08 12:45:04,759 INFO L272 TraceCheckUtils]: 4: Hoare triple {144343#(<= ~counter~0 0)} call #t~ret9 := main(); {144343#(<= ~counter~0 0)} is VALID [2022-04-08 12:45:04,760 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-08 12:45:04,760 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-08 12:45:04,760 INFO L290 TraceCheckUtils]: 7: Hoare triple {144343#(<= ~counter~0 0)} ~cond := #in~cond; {144343#(<= ~counter~0 0)} is VALID [2022-04-08 12:45:04,761 INFO L290 TraceCheckUtils]: 8: Hoare triple {144343#(<= ~counter~0 0)} assume !(0 == ~cond); {144343#(<= ~counter~0 0)} is VALID [2022-04-08 12:45:04,761 INFO L290 TraceCheckUtils]: 9: Hoare triple {144343#(<= ~counter~0 0)} assume true; {144343#(<= ~counter~0 0)} is VALID [2022-04-08 12:45:04,761 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {144343#(<= ~counter~0 0)} {144343#(<= ~counter~0 0)} #90#return; {144343#(<= ~counter~0 0)} is VALID [2022-04-08 12:45:04,762 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-08 12:45:04,762 INFO L290 TraceCheckUtils]: 12: Hoare triple {144343#(<= ~counter~0 0)} ~cond := #in~cond; {144343#(<= ~counter~0 0)} is VALID [2022-04-08 12:45:04,762 INFO L290 TraceCheckUtils]: 13: Hoare triple {144343#(<= ~counter~0 0)} assume !(0 == ~cond); {144343#(<= ~counter~0 0)} is VALID [2022-04-08 12:45:04,762 INFO L290 TraceCheckUtils]: 14: Hoare triple {144343#(<= ~counter~0 0)} assume true; {144343#(<= ~counter~0 0)} is VALID [2022-04-08 12:45:04,763 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {144343#(<= ~counter~0 0)} {144343#(<= ~counter~0 0)} #92#return; {144343#(<= ~counter~0 0)} is VALID [2022-04-08 12:45:04,763 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-08 12:45:04,766 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-08 12:45:04,766 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-08 12:45:04,767 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-08 12:45:04,767 INFO L290 TraceCheckUtils]: 20: Hoare triple {144392#(<= ~counter~0 1)} ~cond := #in~cond; {144392#(<= ~counter~0 1)} is VALID [2022-04-08 12:45:04,767 INFO L290 TraceCheckUtils]: 21: Hoare triple {144392#(<= ~counter~0 1)} assume !(0 == ~cond); {144392#(<= ~counter~0 1)} is VALID [2022-04-08 12:45:04,767 INFO L290 TraceCheckUtils]: 22: Hoare triple {144392#(<= ~counter~0 1)} assume true; {144392#(<= ~counter~0 1)} is VALID [2022-04-08 12:45:04,768 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {144392#(<= ~counter~0 1)} {144392#(<= ~counter~0 1)} #94#return; {144392#(<= ~counter~0 1)} is VALID [2022-04-08 12:45:04,768 INFO L290 TraceCheckUtils]: 24: Hoare triple {144392#(<= ~counter~0 1)} assume !!(0 != ~r~0); {144392#(<= ~counter~0 1)} is VALID [2022-04-08 12:45:04,769 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-08 12:45:04,770 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-08 12:45:04,770 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-08 12:45:04,770 INFO L290 TraceCheckUtils]: 28: Hoare triple {144417#(<= ~counter~0 2)} ~cond := #in~cond; {144417#(<= ~counter~0 2)} is VALID [2022-04-08 12:45:04,771 INFO L290 TraceCheckUtils]: 29: Hoare triple {144417#(<= ~counter~0 2)} assume !(0 == ~cond); {144417#(<= ~counter~0 2)} is VALID [2022-04-08 12:45:04,771 INFO L290 TraceCheckUtils]: 30: Hoare triple {144417#(<= ~counter~0 2)} assume true; {144417#(<= ~counter~0 2)} is VALID [2022-04-08 12:45:04,771 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {144417#(<= ~counter~0 2)} {144417#(<= ~counter~0 2)} #96#return; {144417#(<= ~counter~0 2)} is VALID [2022-04-08 12:45:04,772 INFO L290 TraceCheckUtils]: 32: Hoare triple {144417#(<= ~counter~0 2)} assume !(~r~0 > 0); {144417#(<= ~counter~0 2)} is VALID [2022-04-08 12:45:04,773 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-08 12:45:04,773 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-08 12:45:04,774 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-08 12:45:04,774 INFO L290 TraceCheckUtils]: 36: Hoare triple {144442#(<= ~counter~0 3)} ~cond := #in~cond; {144442#(<= ~counter~0 3)} is VALID [2022-04-08 12:45:04,774 INFO L290 TraceCheckUtils]: 37: Hoare triple {144442#(<= ~counter~0 3)} assume !(0 == ~cond); {144442#(<= ~counter~0 3)} is VALID [2022-04-08 12:45:04,774 INFO L290 TraceCheckUtils]: 38: Hoare triple {144442#(<= ~counter~0 3)} assume true; {144442#(<= ~counter~0 3)} is VALID [2022-04-08 12:45:04,775 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {144442#(<= ~counter~0 3)} {144442#(<= ~counter~0 3)} #98#return; {144442#(<= ~counter~0 3)} is VALID [2022-04-08 12:45:04,775 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-08 12:45:04,776 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-08 12:45:04,777 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-08 12:45:04,777 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-08 12:45:04,777 INFO L290 TraceCheckUtils]: 44: Hoare triple {144467#(<= ~counter~0 4)} ~cond := #in~cond; {144467#(<= ~counter~0 4)} is VALID [2022-04-08 12:45:04,778 INFO L290 TraceCheckUtils]: 45: Hoare triple {144467#(<= ~counter~0 4)} assume !(0 == ~cond); {144467#(<= ~counter~0 4)} is VALID [2022-04-08 12:45:04,778 INFO L290 TraceCheckUtils]: 46: Hoare triple {144467#(<= ~counter~0 4)} assume true; {144467#(<= ~counter~0 4)} is VALID [2022-04-08 12:45:04,778 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {144467#(<= ~counter~0 4)} {144467#(<= ~counter~0 4)} #98#return; {144467#(<= ~counter~0 4)} is VALID [2022-04-08 12:45:04,779 INFO L290 TraceCheckUtils]: 48: Hoare triple {144467#(<= ~counter~0 4)} assume !(~r~0 < 0); {144467#(<= ~counter~0 4)} is VALID [2022-04-08 12:45:04,780 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-08 12:45:04,780 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-08 12:45:04,780 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-08 12:45:04,781 INFO L290 TraceCheckUtils]: 52: Hoare triple {144492#(<= ~counter~0 5)} ~cond := #in~cond; {144492#(<= ~counter~0 5)} is VALID [2022-04-08 12:45:04,781 INFO L290 TraceCheckUtils]: 53: Hoare triple {144492#(<= ~counter~0 5)} assume !(0 == ~cond); {144492#(<= ~counter~0 5)} is VALID [2022-04-08 12:45:04,781 INFO L290 TraceCheckUtils]: 54: Hoare triple {144492#(<= ~counter~0 5)} assume true; {144492#(<= ~counter~0 5)} is VALID [2022-04-08 12:45:04,782 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {144492#(<= ~counter~0 5)} {144492#(<= ~counter~0 5)} #94#return; {144492#(<= ~counter~0 5)} is VALID [2022-04-08 12:45:04,782 INFO L290 TraceCheckUtils]: 56: Hoare triple {144492#(<= ~counter~0 5)} assume !!(0 != ~r~0); {144492#(<= ~counter~0 5)} is VALID [2022-04-08 12:45:04,783 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-08 12:45:04,783 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-08 12:45:04,784 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-08 12:45:04,784 INFO L290 TraceCheckUtils]: 60: Hoare triple {144517#(<= ~counter~0 6)} ~cond := #in~cond; {144517#(<= ~counter~0 6)} is VALID [2022-04-08 12:45:04,784 INFO L290 TraceCheckUtils]: 61: Hoare triple {144517#(<= ~counter~0 6)} assume !(0 == ~cond); {144517#(<= ~counter~0 6)} is VALID [2022-04-08 12:45:04,785 INFO L290 TraceCheckUtils]: 62: Hoare triple {144517#(<= ~counter~0 6)} assume true; {144517#(<= ~counter~0 6)} is VALID [2022-04-08 12:45:04,785 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {144517#(<= ~counter~0 6)} {144517#(<= ~counter~0 6)} #96#return; {144517#(<= ~counter~0 6)} is VALID [2022-04-08 12:45:04,785 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-08 12:45:04,787 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-08 12:45:04,787 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-08 12:45:04,787 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-08 12:45:04,788 INFO L290 TraceCheckUtils]: 68: Hoare triple {144542#(<= ~counter~0 7)} ~cond := #in~cond; {144542#(<= ~counter~0 7)} is VALID [2022-04-08 12:45:04,788 INFO L290 TraceCheckUtils]: 69: Hoare triple {144542#(<= ~counter~0 7)} assume !(0 == ~cond); {144542#(<= ~counter~0 7)} is VALID [2022-04-08 12:45:04,788 INFO L290 TraceCheckUtils]: 70: Hoare triple {144542#(<= ~counter~0 7)} assume true; {144542#(<= ~counter~0 7)} is VALID [2022-04-08 12:45:04,789 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {144542#(<= ~counter~0 7)} {144542#(<= ~counter~0 7)} #96#return; {144542#(<= ~counter~0 7)} is VALID [2022-04-08 12:45:04,789 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-08 12:45:04,790 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-08 12:45:04,790 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-08 12:45:04,791 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-08 12:45:04,791 INFO L290 TraceCheckUtils]: 76: Hoare triple {144567#(<= ~counter~0 8)} ~cond := #in~cond; {144567#(<= ~counter~0 8)} is VALID [2022-04-08 12:45:04,791 INFO L290 TraceCheckUtils]: 77: Hoare triple {144567#(<= ~counter~0 8)} assume !(0 == ~cond); {144567#(<= ~counter~0 8)} is VALID [2022-04-08 12:45:04,792 INFO L290 TraceCheckUtils]: 78: Hoare triple {144567#(<= ~counter~0 8)} assume true; {144567#(<= ~counter~0 8)} is VALID [2022-04-08 12:45:04,792 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {144567#(<= ~counter~0 8)} {144567#(<= ~counter~0 8)} #96#return; {144567#(<= ~counter~0 8)} is VALID [2022-04-08 12:45:04,792 INFO L290 TraceCheckUtils]: 80: Hoare triple {144567#(<= ~counter~0 8)} assume !(~r~0 > 0); {144567#(<= ~counter~0 8)} is VALID [2022-04-08 12:45:04,793 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-08 12:45:04,794 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-08 12:45:04,794 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-08 12:45:04,794 INFO L290 TraceCheckUtils]: 84: Hoare triple {144592#(<= ~counter~0 9)} ~cond := #in~cond; {144592#(<= ~counter~0 9)} is VALID [2022-04-08 12:45:04,795 INFO L290 TraceCheckUtils]: 85: Hoare triple {144592#(<= ~counter~0 9)} assume !(0 == ~cond); {144592#(<= ~counter~0 9)} is VALID [2022-04-08 12:45:04,795 INFO L290 TraceCheckUtils]: 86: Hoare triple {144592#(<= ~counter~0 9)} assume true; {144592#(<= ~counter~0 9)} is VALID [2022-04-08 12:45:04,795 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {144592#(<= ~counter~0 9)} {144592#(<= ~counter~0 9)} #98#return; {144592#(<= ~counter~0 9)} is VALID [2022-04-08 12:45:04,796 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-08 12:45:04,797 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-08 12:45:04,797 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-08 12:45:04,798 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-08 12:45:04,798 INFO L290 TraceCheckUtils]: 92: Hoare triple {144617#(<= ~counter~0 10)} ~cond := #in~cond; {144617#(<= ~counter~0 10)} is VALID [2022-04-08 12:45:04,798 INFO L290 TraceCheckUtils]: 93: Hoare triple {144617#(<= ~counter~0 10)} assume !(0 == ~cond); {144617#(<= ~counter~0 10)} is VALID [2022-04-08 12:45:04,798 INFO L290 TraceCheckUtils]: 94: Hoare triple {144617#(<= ~counter~0 10)} assume true; {144617#(<= ~counter~0 10)} is VALID [2022-04-08 12:45:04,799 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {144617#(<= ~counter~0 10)} {144617#(<= ~counter~0 10)} #98#return; {144617#(<= ~counter~0 10)} is VALID [2022-04-08 12:45:04,799 INFO L290 TraceCheckUtils]: 96: Hoare triple {144617#(<= ~counter~0 10)} assume !(~r~0 < 0); {144617#(<= ~counter~0 10)} is VALID [2022-04-08 12:45:04,800 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-08 12:45:04,800 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-08 12:45:04,801 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-08 12:45:04,801 INFO L290 TraceCheckUtils]: 100: Hoare triple {144642#(<= ~counter~0 11)} ~cond := #in~cond; {144642#(<= ~counter~0 11)} is VALID [2022-04-08 12:45:04,801 INFO L290 TraceCheckUtils]: 101: Hoare triple {144642#(<= ~counter~0 11)} assume !(0 == ~cond); {144642#(<= ~counter~0 11)} is VALID [2022-04-08 12:45:04,802 INFO L290 TraceCheckUtils]: 102: Hoare triple {144642#(<= ~counter~0 11)} assume true; {144642#(<= ~counter~0 11)} is VALID [2022-04-08 12:45:04,802 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {144642#(<= ~counter~0 11)} {144642#(<= ~counter~0 11)} #94#return; {144642#(<= ~counter~0 11)} is VALID [2022-04-08 12:45:04,802 INFO L290 TraceCheckUtils]: 104: Hoare triple {144642#(<= ~counter~0 11)} assume !!(0 != ~r~0); {144642#(<= ~counter~0 11)} is VALID [2022-04-08 12:45:04,804 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-08 12:45:04,804 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-08 12:45:04,804 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-08 12:45:04,805 INFO L290 TraceCheckUtils]: 108: Hoare triple {144667#(<= ~counter~0 12)} ~cond := #in~cond; {144667#(<= ~counter~0 12)} is VALID [2022-04-08 12:45:04,805 INFO L290 TraceCheckUtils]: 109: Hoare triple {144667#(<= ~counter~0 12)} assume !(0 == ~cond); {144667#(<= ~counter~0 12)} is VALID [2022-04-08 12:45:04,805 INFO L290 TraceCheckUtils]: 110: Hoare triple {144667#(<= ~counter~0 12)} assume true; {144667#(<= ~counter~0 12)} is VALID [2022-04-08 12:45:04,806 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {144667#(<= ~counter~0 12)} {144667#(<= ~counter~0 12)} #96#return; {144667#(<= ~counter~0 12)} is VALID [2022-04-08 12:45:04,806 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-08 12:45:04,807 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-08 12:45:04,807 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-08 12:45:04,808 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-08 12:45:04,808 INFO L290 TraceCheckUtils]: 116: Hoare triple {144692#(<= ~counter~0 13)} ~cond := #in~cond; {144692#(<= ~counter~0 13)} is VALID [2022-04-08 12:45:04,809 INFO L290 TraceCheckUtils]: 117: Hoare triple {144692#(<= ~counter~0 13)} assume !(0 == ~cond); {144692#(<= ~counter~0 13)} is VALID [2022-04-08 12:45:04,809 INFO L290 TraceCheckUtils]: 118: Hoare triple {144692#(<= ~counter~0 13)} assume true; {144692#(<= ~counter~0 13)} is VALID [2022-04-08 12:45:04,809 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {144692#(<= ~counter~0 13)} {144692#(<= ~counter~0 13)} #96#return; {144692#(<= ~counter~0 13)} is VALID [2022-04-08 12:45:04,810 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-08 12:45:04,811 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-08 12:45:04,811 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-08 12:45:04,811 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-08 12:45:04,812 INFO L290 TraceCheckUtils]: 124: Hoare triple {144717#(<= ~counter~0 14)} ~cond := #in~cond; {144717#(<= ~counter~0 14)} is VALID [2022-04-08 12:45:04,812 INFO L290 TraceCheckUtils]: 125: Hoare triple {144717#(<= ~counter~0 14)} assume !(0 == ~cond); {144717#(<= ~counter~0 14)} is VALID [2022-04-08 12:45:04,812 INFO L290 TraceCheckUtils]: 126: Hoare triple {144717#(<= ~counter~0 14)} assume true; {144717#(<= ~counter~0 14)} is VALID [2022-04-08 12:45:04,813 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {144717#(<= ~counter~0 14)} {144717#(<= ~counter~0 14)} #96#return; {144717#(<= ~counter~0 14)} is VALID [2022-04-08 12:45:04,813 INFO L290 TraceCheckUtils]: 128: Hoare triple {144717#(<= ~counter~0 14)} assume !(~r~0 > 0); {144717#(<= ~counter~0 14)} is VALID [2022-04-08 12:45:04,814 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-08 12:45:04,814 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-08 12:45:04,815 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-08 12:45:04,815 INFO L290 TraceCheckUtils]: 132: Hoare triple {144742#(<= ~counter~0 15)} ~cond := #in~cond; {144742#(<= ~counter~0 15)} is VALID [2022-04-08 12:45:04,815 INFO L290 TraceCheckUtils]: 133: Hoare triple {144742#(<= ~counter~0 15)} assume !(0 == ~cond); {144742#(<= ~counter~0 15)} is VALID [2022-04-08 12:45:04,816 INFO L290 TraceCheckUtils]: 134: Hoare triple {144742#(<= ~counter~0 15)} assume true; {144742#(<= ~counter~0 15)} is VALID [2022-04-08 12:45:04,816 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {144742#(<= ~counter~0 15)} {144742#(<= ~counter~0 15)} #98#return; {144742#(<= ~counter~0 15)} is VALID [2022-04-08 12:45:04,816 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-08 12:45:04,818 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-08 12:45:04,818 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-08 12:45:04,818 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-08 12:45:04,819 INFO L290 TraceCheckUtils]: 140: Hoare triple {144767#(<= ~counter~0 16)} ~cond := #in~cond; {144767#(<= ~counter~0 16)} is VALID [2022-04-08 12:45:04,819 INFO L290 TraceCheckUtils]: 141: Hoare triple {144767#(<= ~counter~0 16)} assume !(0 == ~cond); {144767#(<= ~counter~0 16)} is VALID [2022-04-08 12:45:04,819 INFO L290 TraceCheckUtils]: 142: Hoare triple {144767#(<= ~counter~0 16)} assume true; {144767#(<= ~counter~0 16)} is VALID [2022-04-08 12:45:04,820 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {144767#(<= ~counter~0 16)} {144767#(<= ~counter~0 16)} #98#return; {144767#(<= ~counter~0 16)} is VALID [2022-04-08 12:45:04,820 INFO L290 TraceCheckUtils]: 144: Hoare triple {144767#(<= ~counter~0 16)} assume !(~r~0 < 0); {144767#(<= ~counter~0 16)} is VALID [2022-04-08 12:45:04,820 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-08 12:45:04,820 INFO L290 TraceCheckUtils]: 146: Hoare triple {144792#(<= |main_#t~post6| 16)} assume !(#t~post6 < 20);havoc #t~post6; {144336#false} is VALID [2022-04-08 12:45:04,821 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-08 12:45:04,821 INFO L290 TraceCheckUtils]: 148: Hoare triple {144336#false} ~cond := #in~cond; {144336#false} is VALID [2022-04-08 12:45:04,821 INFO L290 TraceCheckUtils]: 149: Hoare triple {144336#false} assume 0 == ~cond; {144336#false} is VALID [2022-04-08 12:45:04,821 INFO L290 TraceCheckUtils]: 150: Hoare triple {144336#false} assume !false; {144336#false} is VALID [2022-04-08 12:45:04,821 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-08 12:45:04,821 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:45:05,499 INFO L290 TraceCheckUtils]: 150: Hoare triple {144336#false} assume !false; {144336#false} is VALID [2022-04-08 12:45:05,500 INFO L290 TraceCheckUtils]: 149: Hoare triple {144336#false} assume 0 == ~cond; {144336#false} is VALID [2022-04-08 12:45:05,500 INFO L290 TraceCheckUtils]: 148: Hoare triple {144336#false} ~cond := #in~cond; {144336#false} is VALID [2022-04-08 12:45:05,500 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-08 12:45:05,500 INFO L290 TraceCheckUtils]: 146: Hoare triple {144820#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {144336#false} is VALID [2022-04-08 12:45:05,500 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-08 12:45:05,501 INFO L290 TraceCheckUtils]: 144: Hoare triple {144824#(< ~counter~0 20)} assume !(~r~0 < 0); {144824#(< ~counter~0 20)} is VALID [2022-04-08 12:45:05,501 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {144335#true} {144824#(< ~counter~0 20)} #98#return; {144824#(< ~counter~0 20)} is VALID [2022-04-08 12:45:05,501 INFO L290 TraceCheckUtils]: 142: Hoare triple {144335#true} assume true; {144335#true} is VALID [2022-04-08 12:45:05,501 INFO L290 TraceCheckUtils]: 141: Hoare triple {144335#true} assume !(0 == ~cond); {144335#true} is VALID [2022-04-08 12:45:05,501 INFO L290 TraceCheckUtils]: 140: Hoare triple {144335#true} ~cond := #in~cond; {144335#true} is VALID [2022-04-08 12:45:05,501 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-08 12:45:05,502 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-08 12:45:05,504 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-08 12:45:05,505 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-08 12:45:05,505 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {144335#true} {144849#(< ~counter~0 19)} #98#return; {144849#(< ~counter~0 19)} is VALID [2022-04-08 12:45:05,505 INFO L290 TraceCheckUtils]: 134: Hoare triple {144335#true} assume true; {144335#true} is VALID [2022-04-08 12:45:05,505 INFO L290 TraceCheckUtils]: 133: Hoare triple {144335#true} assume !(0 == ~cond); {144335#true} is VALID [2022-04-08 12:45:05,505 INFO L290 TraceCheckUtils]: 132: Hoare triple {144335#true} ~cond := #in~cond; {144335#true} is VALID [2022-04-08 12:45:05,505 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-08 12:45:05,506 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-08 12:45:05,507 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-08 12:45:05,507 INFO L290 TraceCheckUtils]: 128: Hoare triple {144874#(< ~counter~0 18)} assume !(~r~0 > 0); {144874#(< ~counter~0 18)} is VALID [2022-04-08 12:45:05,508 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {144335#true} {144874#(< ~counter~0 18)} #96#return; {144874#(< ~counter~0 18)} is VALID [2022-04-08 12:45:05,508 INFO L290 TraceCheckUtils]: 126: Hoare triple {144335#true} assume true; {144335#true} is VALID [2022-04-08 12:45:05,508 INFO L290 TraceCheckUtils]: 125: Hoare triple {144335#true} assume !(0 == ~cond); {144335#true} is VALID [2022-04-08 12:45:05,508 INFO L290 TraceCheckUtils]: 124: Hoare triple {144335#true} ~cond := #in~cond; {144335#true} is VALID [2022-04-08 12:45:05,508 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-08 12:45:05,508 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-08 12:45:05,509 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-08 12:45:05,510 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-08 12:45:05,510 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {144335#true} {144767#(<= ~counter~0 16)} #96#return; {144767#(<= ~counter~0 16)} is VALID [2022-04-08 12:45:05,510 INFO L290 TraceCheckUtils]: 118: Hoare triple {144335#true} assume true; {144335#true} is VALID [2022-04-08 12:45:05,510 INFO L290 TraceCheckUtils]: 117: Hoare triple {144335#true} assume !(0 == ~cond); {144335#true} is VALID [2022-04-08 12:45:05,510 INFO L290 TraceCheckUtils]: 116: Hoare triple {144335#true} ~cond := #in~cond; {144335#true} is VALID [2022-04-08 12:45:05,510 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-08 12:45:05,511 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-08 12:45:05,512 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-08 12:45:05,512 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-08 12:45:05,512 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {144335#true} {144742#(<= ~counter~0 15)} #96#return; {144742#(<= ~counter~0 15)} is VALID [2022-04-08 12:45:05,513 INFO L290 TraceCheckUtils]: 110: Hoare triple {144335#true} assume true; {144335#true} is VALID [2022-04-08 12:45:05,513 INFO L290 TraceCheckUtils]: 109: Hoare triple {144335#true} assume !(0 == ~cond); {144335#true} is VALID [2022-04-08 12:45:05,513 INFO L290 TraceCheckUtils]: 108: Hoare triple {144335#true} ~cond := #in~cond; {144335#true} is VALID [2022-04-08 12:45:05,513 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-08 12:45:05,513 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-08 12:45:05,514 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-08 12:45:05,514 INFO L290 TraceCheckUtils]: 104: Hoare triple {144717#(<= ~counter~0 14)} assume !!(0 != ~r~0); {144717#(<= ~counter~0 14)} is VALID [2022-04-08 12:45:05,515 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {144335#true} {144717#(<= ~counter~0 14)} #94#return; {144717#(<= ~counter~0 14)} is VALID [2022-04-08 12:45:05,515 INFO L290 TraceCheckUtils]: 102: Hoare triple {144335#true} assume true; {144335#true} is VALID [2022-04-08 12:45:05,515 INFO L290 TraceCheckUtils]: 101: Hoare triple {144335#true} assume !(0 == ~cond); {144335#true} is VALID [2022-04-08 12:45:05,515 INFO L290 TraceCheckUtils]: 100: Hoare triple {144335#true} ~cond := #in~cond; {144335#true} is VALID [2022-04-08 12:45:05,515 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-08 12:45:05,515 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-08 12:45:05,517 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-08 12:45:05,517 INFO L290 TraceCheckUtils]: 96: Hoare triple {144692#(<= ~counter~0 13)} assume !(~r~0 < 0); {144692#(<= ~counter~0 13)} is VALID [2022-04-08 12:45:05,517 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {144335#true} {144692#(<= ~counter~0 13)} #98#return; {144692#(<= ~counter~0 13)} is VALID [2022-04-08 12:45:05,517 INFO L290 TraceCheckUtils]: 94: Hoare triple {144335#true} assume true; {144335#true} is VALID [2022-04-08 12:45:05,518 INFO L290 TraceCheckUtils]: 93: Hoare triple {144335#true} assume !(0 == ~cond); {144335#true} is VALID [2022-04-08 12:45:05,518 INFO L290 TraceCheckUtils]: 92: Hoare triple {144335#true} ~cond := #in~cond; {144335#true} is VALID [2022-04-08 12:45:05,518 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-08 12:45:05,518 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-08 12:45:05,519 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-08 12:45:05,519 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-08 12:45:05,520 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {144335#true} {144667#(<= ~counter~0 12)} #98#return; {144667#(<= ~counter~0 12)} is VALID [2022-04-08 12:45:05,520 INFO L290 TraceCheckUtils]: 86: Hoare triple {144335#true} assume true; {144335#true} is VALID [2022-04-08 12:45:05,520 INFO L290 TraceCheckUtils]: 85: Hoare triple {144335#true} assume !(0 == ~cond); {144335#true} is VALID [2022-04-08 12:45:05,520 INFO L290 TraceCheckUtils]: 84: Hoare triple {144335#true} ~cond := #in~cond; {144335#true} is VALID [2022-04-08 12:45:05,520 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-08 12:45:05,520 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-08 12:45:05,522 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-08 12:45:05,522 INFO L290 TraceCheckUtils]: 80: Hoare triple {144642#(<= ~counter~0 11)} assume !(~r~0 > 0); {144642#(<= ~counter~0 11)} is VALID [2022-04-08 12:45:05,522 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {144335#true} {144642#(<= ~counter~0 11)} #96#return; {144642#(<= ~counter~0 11)} is VALID [2022-04-08 12:45:05,522 INFO L290 TraceCheckUtils]: 78: Hoare triple {144335#true} assume true; {144335#true} is VALID [2022-04-08 12:45:05,522 INFO L290 TraceCheckUtils]: 77: Hoare triple {144335#true} assume !(0 == ~cond); {144335#true} is VALID [2022-04-08 12:45:05,522 INFO L290 TraceCheckUtils]: 76: Hoare triple {144335#true} ~cond := #in~cond; {144335#true} is VALID [2022-04-08 12:45:05,523 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-08 12:45:05,523 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-08 12:45:05,524 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-08 12:45:05,524 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-08 12:45:05,525 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {144335#true} {144617#(<= ~counter~0 10)} #96#return; {144617#(<= ~counter~0 10)} is VALID [2022-04-08 12:45:05,525 INFO L290 TraceCheckUtils]: 70: Hoare triple {144335#true} assume true; {144335#true} is VALID [2022-04-08 12:45:05,525 INFO L290 TraceCheckUtils]: 69: Hoare triple {144335#true} assume !(0 == ~cond); {144335#true} is VALID [2022-04-08 12:45:05,525 INFO L290 TraceCheckUtils]: 68: Hoare triple {144335#true} ~cond := #in~cond; {144335#true} is VALID [2022-04-08 12:45:05,525 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-08 12:45:05,525 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-08 12:45:05,526 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-08 12:45:05,527 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-08 12:45:05,527 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {144335#true} {144592#(<= ~counter~0 9)} #96#return; {144592#(<= ~counter~0 9)} is VALID [2022-04-08 12:45:05,527 INFO L290 TraceCheckUtils]: 62: Hoare triple {144335#true} assume true; {144335#true} is VALID [2022-04-08 12:45:05,527 INFO L290 TraceCheckUtils]: 61: Hoare triple {144335#true} assume !(0 == ~cond); {144335#true} is VALID [2022-04-08 12:45:05,527 INFO L290 TraceCheckUtils]: 60: Hoare triple {144335#true} ~cond := #in~cond; {144335#true} is VALID [2022-04-08 12:45:05,527 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-08 12:45:05,528 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-08 12:45:05,529 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-08 12:45:05,529 INFO L290 TraceCheckUtils]: 56: Hoare triple {144567#(<= ~counter~0 8)} assume !!(0 != ~r~0); {144567#(<= ~counter~0 8)} is VALID [2022-04-08 12:45:05,530 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {144335#true} {144567#(<= ~counter~0 8)} #94#return; {144567#(<= ~counter~0 8)} is VALID [2022-04-08 12:45:05,530 INFO L290 TraceCheckUtils]: 54: Hoare triple {144335#true} assume true; {144335#true} is VALID [2022-04-08 12:45:05,530 INFO L290 TraceCheckUtils]: 53: Hoare triple {144335#true} assume !(0 == ~cond); {144335#true} is VALID [2022-04-08 12:45:05,530 INFO L290 TraceCheckUtils]: 52: Hoare triple {144335#true} ~cond := #in~cond; {144335#true} is VALID [2022-04-08 12:45:05,530 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-08 12:45:05,530 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-08 12:45:05,531 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-08 12:45:05,531 INFO L290 TraceCheckUtils]: 48: Hoare triple {144542#(<= ~counter~0 7)} assume !(~r~0 < 0); {144542#(<= ~counter~0 7)} is VALID [2022-04-08 12:45:05,532 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {144335#true} {144542#(<= ~counter~0 7)} #98#return; {144542#(<= ~counter~0 7)} is VALID [2022-04-08 12:45:05,532 INFO L290 TraceCheckUtils]: 46: Hoare triple {144335#true} assume true; {144335#true} is VALID [2022-04-08 12:45:05,532 INFO L290 TraceCheckUtils]: 45: Hoare triple {144335#true} assume !(0 == ~cond); {144335#true} is VALID [2022-04-08 12:45:05,532 INFO L290 TraceCheckUtils]: 44: Hoare triple {144335#true} ~cond := #in~cond; {144335#true} is VALID [2022-04-08 12:45:05,532 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-08 12:45:05,532 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-08 12:45:05,534 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-08 12:45:05,534 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-08 12:45:05,534 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {144335#true} {144517#(<= ~counter~0 6)} #98#return; {144517#(<= ~counter~0 6)} is VALID [2022-04-08 12:45:05,534 INFO L290 TraceCheckUtils]: 38: Hoare triple {144335#true} assume true; {144335#true} is VALID [2022-04-08 12:45:05,535 INFO L290 TraceCheckUtils]: 37: Hoare triple {144335#true} assume !(0 == ~cond); {144335#true} is VALID [2022-04-08 12:45:05,535 INFO L290 TraceCheckUtils]: 36: Hoare triple {144335#true} ~cond := #in~cond; {144335#true} is VALID [2022-04-08 12:45:05,535 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-08 12:45:05,535 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-08 12:45:05,536 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-08 12:45:05,536 INFO L290 TraceCheckUtils]: 32: Hoare triple {144492#(<= ~counter~0 5)} assume !(~r~0 > 0); {144492#(<= ~counter~0 5)} is VALID [2022-04-08 12:45:05,537 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {144335#true} {144492#(<= ~counter~0 5)} #96#return; {144492#(<= ~counter~0 5)} is VALID [2022-04-08 12:45:05,537 INFO L290 TraceCheckUtils]: 30: Hoare triple {144335#true} assume true; {144335#true} is VALID [2022-04-08 12:45:05,537 INFO L290 TraceCheckUtils]: 29: Hoare triple {144335#true} assume !(0 == ~cond); {144335#true} is VALID [2022-04-08 12:45:05,537 INFO L290 TraceCheckUtils]: 28: Hoare triple {144335#true} ~cond := #in~cond; {144335#true} is VALID [2022-04-08 12:45:05,537 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-08 12:45:05,537 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-08 12:45:05,538 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-08 12:45:05,539 INFO L290 TraceCheckUtils]: 24: Hoare triple {144467#(<= ~counter~0 4)} assume !!(0 != ~r~0); {144467#(<= ~counter~0 4)} is VALID [2022-04-08 12:45:05,539 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {144335#true} {144467#(<= ~counter~0 4)} #94#return; {144467#(<= ~counter~0 4)} is VALID [2022-04-08 12:45:05,539 INFO L290 TraceCheckUtils]: 22: Hoare triple {144335#true} assume true; {144335#true} is VALID [2022-04-08 12:45:05,539 INFO L290 TraceCheckUtils]: 21: Hoare triple {144335#true} assume !(0 == ~cond); {144335#true} is VALID [2022-04-08 12:45:05,539 INFO L290 TraceCheckUtils]: 20: Hoare triple {144335#true} ~cond := #in~cond; {144335#true} is VALID [2022-04-08 12:45:05,539 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-08 12:45:05,540 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-08 12:45:05,541 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-08 12:45:05,541 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-08 12:45:05,541 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {144335#true} {144442#(<= ~counter~0 3)} #92#return; {144442#(<= ~counter~0 3)} is VALID [2022-04-08 12:45:05,542 INFO L290 TraceCheckUtils]: 14: Hoare triple {144335#true} assume true; {144335#true} is VALID [2022-04-08 12:45:05,542 INFO L290 TraceCheckUtils]: 13: Hoare triple {144335#true} assume !(0 == ~cond); {144335#true} is VALID [2022-04-08 12:45:05,542 INFO L290 TraceCheckUtils]: 12: Hoare triple {144335#true} ~cond := #in~cond; {144335#true} is VALID [2022-04-08 12:45:05,542 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-08 12:45:05,542 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {144335#true} {144442#(<= ~counter~0 3)} #90#return; {144442#(<= ~counter~0 3)} is VALID [2022-04-08 12:45:05,542 INFO L290 TraceCheckUtils]: 9: Hoare triple {144335#true} assume true; {144335#true} is VALID [2022-04-08 12:45:05,542 INFO L290 TraceCheckUtils]: 8: Hoare triple {144335#true} assume !(0 == ~cond); {144335#true} is VALID [2022-04-08 12:45:05,542 INFO L290 TraceCheckUtils]: 7: Hoare triple {144335#true} ~cond := #in~cond; {144335#true} is VALID [2022-04-08 12:45:05,542 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-08 12:45:05,543 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-08 12:45:05,543 INFO L272 TraceCheckUtils]: 4: Hoare triple {144442#(<= ~counter~0 3)} call #t~ret9 := main(); {144442#(<= ~counter~0 3)} is VALID [2022-04-08 12:45:05,543 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {144442#(<= ~counter~0 3)} {144335#true} #102#return; {144442#(<= ~counter~0 3)} is VALID [2022-04-08 12:45:05,544 INFO L290 TraceCheckUtils]: 2: Hoare triple {144442#(<= ~counter~0 3)} assume true; {144442#(<= ~counter~0 3)} is VALID [2022-04-08 12:45:05,544 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-08 12:45:05,544 INFO L272 TraceCheckUtils]: 0: Hoare triple {144335#true} call ULTIMATE.init(); {144335#true} is VALID [2022-04-08 12:45:05,544 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-08 12:45:05,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:45:05,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649848107] [2022-04-08 12:45:05,545 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:45:05,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429492947] [2022-04-08 12:45:05,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1429492947] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:45:05,545 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:45:05,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 24 [2022-04-08 12:45:05,545 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:45:05,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [665872209] [2022-04-08 12:45:05,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [665872209] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:45:05,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:45:05,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-08 12:45:05,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121798265] [2022-04-08 12:45:05,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:45:05,546 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-08 12:45:05,546 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:45:05,546 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-08 12:45:05,702 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-08 12:45:05,702 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-08 12:45:05,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:45:05,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-08 12:45:05,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-08 12:45:05,703 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-08 12:45:10,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:45:10,901 INFO L93 Difference]: Finished difference Result 846 states and 1128 transitions. [2022-04-08 12:45:10,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-08 12:45:10,901 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-08 12:45:10,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:45:10,902 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-08 12:45:10,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 334 transitions. [2022-04-08 12:45:10,904 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-08 12:45:10,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 334 transitions. [2022-04-08 12:45:10,906 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 334 transitions. [2022-04-08 12:45:11,289 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-08 12:45:11,317 INFO L225 Difference]: With dead ends: 846 [2022-04-08 12:45:11,317 INFO L226 Difference]: Without dead ends: 841 [2022-04-08 12:45:11,318 INFO L912 BasicCegarLoop]: 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-08 12:45:11,318 INFO L913 BasicCegarLoop]: 78 mSDtfsCounter, 290 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 275 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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, 0.7s IncrementalHoareTripleChecker+Time [2022-04-08 12:45:11,318 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [290 Valid, 361 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [275 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-08 12:45:11,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2022-04-08 12:45:14,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 819. [2022-04-08 12:45:14,217 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:45:14,217 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-08 12:45:14,218 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-08 12:45:14,218 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-08 12:45:14,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:45:14,241 INFO L93 Difference]: Finished difference Result 841 states and 1122 transitions. [2022-04-08 12:45:14,241 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1122 transitions. [2022-04-08 12:45:14,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:45:14,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:45:14,243 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-08 12:45:14,243 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-08 12:45:14,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:45:14,266 INFO L93 Difference]: Finished difference Result 841 states and 1122 transitions. [2022-04-08 12:45:14,266 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1122 transitions. [2022-04-08 12:45:14,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:45:14,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:45:14,268 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:45:14,268 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:45:14,269 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-08 12:45:14,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1096 transitions. [2022-04-08 12:45:14,299 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1096 transitions. Word has length 151 [2022-04-08 12:45:14,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:45:14,300 INFO L478 AbstractCegarLoop]: Abstraction has 819 states and 1096 transitions. [2022-04-08 12:45:14,300 INFO L479 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-08 12:45:14,300 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 819 states and 1096 transitions. [2022-04-08 12:45:29,791 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1096 edges. 1094 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-08 12:45:29,791 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1096 transitions. [2022-04-08 12:45:29,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-04-08 12:45:29,792 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:45:29,792 INFO L499 BasicCegarLoop]: 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-08 12:45:29,809 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-08 12:45:29,992 WARN L460 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-08 12:45:29,993 INFO L403 AbstractCegarLoop]: === Iteration 53 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:45:29,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:45:29,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1031451968, now seen corresponding path program 27 times [2022-04-08 12:45:29,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:45:29,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [724884773] [2022-04-08 12:45:29,993 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:45:29,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1031451968, now seen corresponding path program 28 times [2022-04-08 12:45:29,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:45:29,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422816879] [2022-04-08 12:45:29,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:45:29,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:45:30,006 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:45:30,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [290216344] [2022-04-08 12:45:30,006 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 12:45:30,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:45:30,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:45:30,008 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-08 12:45:30,009 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-08 12:45:30,074 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 12:45:30,075 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:45:30,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-08 12:45:30,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:45:30,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:45:30,839 INFO L272 TraceCheckUtils]: 0: Hoare triple {150302#true} call ULTIMATE.init(); {150302#true} is VALID [2022-04-08 12:45:30,839 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-08 12:45:30,840 INFO L290 TraceCheckUtils]: 2: Hoare triple {150310#(<= ~counter~0 0)} assume true; {150310#(<= ~counter~0 0)} is VALID [2022-04-08 12:45:30,840 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {150310#(<= ~counter~0 0)} {150302#true} #102#return; {150310#(<= ~counter~0 0)} is VALID [2022-04-08 12:45:30,840 INFO L272 TraceCheckUtils]: 4: Hoare triple {150310#(<= ~counter~0 0)} call #t~ret9 := main(); {150310#(<= ~counter~0 0)} is VALID [2022-04-08 12:45:30,841 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-08 12:45:30,841 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-08 12:45:30,841 INFO L290 TraceCheckUtils]: 7: Hoare triple {150310#(<= ~counter~0 0)} ~cond := #in~cond; {150310#(<= ~counter~0 0)} is VALID [2022-04-08 12:45:30,841 INFO L290 TraceCheckUtils]: 8: Hoare triple {150310#(<= ~counter~0 0)} assume !(0 == ~cond); {150310#(<= ~counter~0 0)} is VALID [2022-04-08 12:45:30,842 INFO L290 TraceCheckUtils]: 9: Hoare triple {150310#(<= ~counter~0 0)} assume true; {150310#(<= ~counter~0 0)} is VALID [2022-04-08 12:45:30,842 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {150310#(<= ~counter~0 0)} {150310#(<= ~counter~0 0)} #90#return; {150310#(<= ~counter~0 0)} is VALID [2022-04-08 12:45:30,843 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-08 12:45:30,843 INFO L290 TraceCheckUtils]: 12: Hoare triple {150310#(<= ~counter~0 0)} ~cond := #in~cond; {150310#(<= ~counter~0 0)} is VALID [2022-04-08 12:45:30,843 INFO L290 TraceCheckUtils]: 13: Hoare triple {150310#(<= ~counter~0 0)} assume !(0 == ~cond); {150310#(<= ~counter~0 0)} is VALID [2022-04-08 12:45:30,843 INFO L290 TraceCheckUtils]: 14: Hoare triple {150310#(<= ~counter~0 0)} assume true; {150310#(<= ~counter~0 0)} is VALID [2022-04-08 12:45:30,844 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {150310#(<= ~counter~0 0)} {150310#(<= ~counter~0 0)} #92#return; {150310#(<= ~counter~0 0)} is VALID [2022-04-08 12:45:30,844 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-08 12:45:30,847 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-08 12:45:30,847 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-08 12:45:30,848 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-08 12:45:30,848 INFO L290 TraceCheckUtils]: 20: Hoare triple {150359#(<= ~counter~0 1)} ~cond := #in~cond; {150359#(<= ~counter~0 1)} is VALID [2022-04-08 12:45:30,848 INFO L290 TraceCheckUtils]: 21: Hoare triple {150359#(<= ~counter~0 1)} assume !(0 == ~cond); {150359#(<= ~counter~0 1)} is VALID [2022-04-08 12:45:30,849 INFO L290 TraceCheckUtils]: 22: Hoare triple {150359#(<= ~counter~0 1)} assume true; {150359#(<= ~counter~0 1)} is VALID [2022-04-08 12:45:30,849 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {150359#(<= ~counter~0 1)} {150359#(<= ~counter~0 1)} #94#return; {150359#(<= ~counter~0 1)} is VALID [2022-04-08 12:45:30,849 INFO L290 TraceCheckUtils]: 24: Hoare triple {150359#(<= ~counter~0 1)} assume !!(0 != ~r~0); {150359#(<= ~counter~0 1)} is VALID [2022-04-08 12:45:30,851 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-08 12:45:30,851 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-08 12:45:30,851 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-08 12:45:30,852 INFO L290 TraceCheckUtils]: 28: Hoare triple {150384#(<= ~counter~0 2)} ~cond := #in~cond; {150384#(<= ~counter~0 2)} is VALID [2022-04-08 12:45:30,852 INFO L290 TraceCheckUtils]: 29: Hoare triple {150384#(<= ~counter~0 2)} assume !(0 == ~cond); {150384#(<= ~counter~0 2)} is VALID [2022-04-08 12:45:30,852 INFO L290 TraceCheckUtils]: 30: Hoare triple {150384#(<= ~counter~0 2)} assume true; {150384#(<= ~counter~0 2)} is VALID [2022-04-08 12:45:30,852 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {150384#(<= ~counter~0 2)} {150384#(<= ~counter~0 2)} #96#return; {150384#(<= ~counter~0 2)} is VALID [2022-04-08 12:45:30,853 INFO L290 TraceCheckUtils]: 32: Hoare triple {150384#(<= ~counter~0 2)} assume !(~r~0 > 0); {150384#(<= ~counter~0 2)} is VALID [2022-04-08 12:45:30,854 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-08 12:45:30,854 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-08 12:45:30,855 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-08 12:45:30,855 INFO L290 TraceCheckUtils]: 36: Hoare triple {150409#(<= ~counter~0 3)} ~cond := #in~cond; {150409#(<= ~counter~0 3)} is VALID [2022-04-08 12:45:30,855 INFO L290 TraceCheckUtils]: 37: Hoare triple {150409#(<= ~counter~0 3)} assume !(0 == ~cond); {150409#(<= ~counter~0 3)} is VALID [2022-04-08 12:45:30,855 INFO L290 TraceCheckUtils]: 38: Hoare triple {150409#(<= ~counter~0 3)} assume true; {150409#(<= ~counter~0 3)} is VALID [2022-04-08 12:45:30,856 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {150409#(<= ~counter~0 3)} {150409#(<= ~counter~0 3)} #98#return; {150409#(<= ~counter~0 3)} is VALID [2022-04-08 12:45:30,856 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-08 12:45:30,857 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-08 12:45:30,858 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-08 12:45:30,858 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-08 12:45:30,858 INFO L290 TraceCheckUtils]: 44: Hoare triple {150434#(<= ~counter~0 4)} ~cond := #in~cond; {150434#(<= ~counter~0 4)} is VALID [2022-04-08 12:45:30,859 INFO L290 TraceCheckUtils]: 45: Hoare triple {150434#(<= ~counter~0 4)} assume !(0 == ~cond); {150434#(<= ~counter~0 4)} is VALID [2022-04-08 12:45:30,859 INFO L290 TraceCheckUtils]: 46: Hoare triple {150434#(<= ~counter~0 4)} assume true; {150434#(<= ~counter~0 4)} is VALID [2022-04-08 12:45:30,859 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {150434#(<= ~counter~0 4)} {150434#(<= ~counter~0 4)} #98#return; {150434#(<= ~counter~0 4)} is VALID [2022-04-08 12:45:30,860 INFO L290 TraceCheckUtils]: 48: Hoare triple {150434#(<= ~counter~0 4)} assume !(~r~0 < 0); {150434#(<= ~counter~0 4)} is VALID [2022-04-08 12:45:30,861 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-08 12:45:30,861 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-08 12:45:30,862 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-08 12:45:30,862 INFO L290 TraceCheckUtils]: 52: Hoare triple {150459#(<= ~counter~0 5)} ~cond := #in~cond; {150459#(<= ~counter~0 5)} is VALID [2022-04-08 12:45:30,862 INFO L290 TraceCheckUtils]: 53: Hoare triple {150459#(<= ~counter~0 5)} assume !(0 == ~cond); {150459#(<= ~counter~0 5)} is VALID [2022-04-08 12:45:30,862 INFO L290 TraceCheckUtils]: 54: Hoare triple {150459#(<= ~counter~0 5)} assume true; {150459#(<= ~counter~0 5)} is VALID [2022-04-08 12:45:30,863 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {150459#(<= ~counter~0 5)} {150459#(<= ~counter~0 5)} #94#return; {150459#(<= ~counter~0 5)} is VALID [2022-04-08 12:45:30,863 INFO L290 TraceCheckUtils]: 56: Hoare triple {150459#(<= ~counter~0 5)} assume !!(0 != ~r~0); {150459#(<= ~counter~0 5)} is VALID [2022-04-08 12:45:30,864 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-08 12:45:30,865 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-08 12:45:30,865 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-08 12:45:30,865 INFO L290 TraceCheckUtils]: 60: Hoare triple {150484#(<= ~counter~0 6)} ~cond := #in~cond; {150484#(<= ~counter~0 6)} is VALID [2022-04-08 12:45:30,866 INFO L290 TraceCheckUtils]: 61: Hoare triple {150484#(<= ~counter~0 6)} assume !(0 == ~cond); {150484#(<= ~counter~0 6)} is VALID [2022-04-08 12:45:30,866 INFO L290 TraceCheckUtils]: 62: Hoare triple {150484#(<= ~counter~0 6)} assume true; {150484#(<= ~counter~0 6)} is VALID [2022-04-08 12:45:30,866 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {150484#(<= ~counter~0 6)} {150484#(<= ~counter~0 6)} #96#return; {150484#(<= ~counter~0 6)} is VALID [2022-04-08 12:45:30,866 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-08 12:45:30,868 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-08 12:45:30,868 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-08 12:45:30,868 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-08 12:45:30,869 INFO L290 TraceCheckUtils]: 68: Hoare triple {150509#(<= ~counter~0 7)} ~cond := #in~cond; {150509#(<= ~counter~0 7)} is VALID [2022-04-08 12:45:30,869 INFO L290 TraceCheckUtils]: 69: Hoare triple {150509#(<= ~counter~0 7)} assume !(0 == ~cond); {150509#(<= ~counter~0 7)} is VALID [2022-04-08 12:45:30,869 INFO L290 TraceCheckUtils]: 70: Hoare triple {150509#(<= ~counter~0 7)} assume true; {150509#(<= ~counter~0 7)} is VALID [2022-04-08 12:45:30,870 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {150509#(<= ~counter~0 7)} {150509#(<= ~counter~0 7)} #96#return; {150509#(<= ~counter~0 7)} is VALID [2022-04-08 12:45:30,870 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-08 12:45:30,871 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-08 12:45:30,871 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-08 12:45:30,872 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-08 12:45:30,872 INFO L290 TraceCheckUtils]: 76: Hoare triple {150534#(<= ~counter~0 8)} ~cond := #in~cond; {150534#(<= ~counter~0 8)} is VALID [2022-04-08 12:45:30,872 INFO L290 TraceCheckUtils]: 77: Hoare triple {150534#(<= ~counter~0 8)} assume !(0 == ~cond); {150534#(<= ~counter~0 8)} is VALID [2022-04-08 12:45:30,873 INFO L290 TraceCheckUtils]: 78: Hoare triple {150534#(<= ~counter~0 8)} assume true; {150534#(<= ~counter~0 8)} is VALID [2022-04-08 12:45:30,873 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {150534#(<= ~counter~0 8)} {150534#(<= ~counter~0 8)} #96#return; {150534#(<= ~counter~0 8)} is VALID [2022-04-08 12:45:30,873 INFO L290 TraceCheckUtils]: 80: Hoare triple {150534#(<= ~counter~0 8)} assume !(~r~0 > 0); {150534#(<= ~counter~0 8)} is VALID [2022-04-08 12:45:30,875 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-08 12:45:30,875 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-08 12:45:30,875 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-08 12:45:30,876 INFO L290 TraceCheckUtils]: 84: Hoare triple {150559#(<= ~counter~0 9)} ~cond := #in~cond; {150559#(<= ~counter~0 9)} is VALID [2022-04-08 12:45:30,876 INFO L290 TraceCheckUtils]: 85: Hoare triple {150559#(<= ~counter~0 9)} assume !(0 == ~cond); {150559#(<= ~counter~0 9)} is VALID [2022-04-08 12:45:30,876 INFO L290 TraceCheckUtils]: 86: Hoare triple {150559#(<= ~counter~0 9)} assume true; {150559#(<= ~counter~0 9)} is VALID [2022-04-08 12:45:30,877 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {150559#(<= ~counter~0 9)} {150559#(<= ~counter~0 9)} #98#return; {150559#(<= ~counter~0 9)} is VALID [2022-04-08 12:45:30,877 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-08 12:45:30,878 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-08 12:45:30,878 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-08 12:45:30,879 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-08 12:45:30,879 INFO L290 TraceCheckUtils]: 92: Hoare triple {150584#(<= ~counter~0 10)} ~cond := #in~cond; {150584#(<= ~counter~0 10)} is VALID [2022-04-08 12:45:30,879 INFO L290 TraceCheckUtils]: 93: Hoare triple {150584#(<= ~counter~0 10)} assume !(0 == ~cond); {150584#(<= ~counter~0 10)} is VALID [2022-04-08 12:45:30,879 INFO L290 TraceCheckUtils]: 94: Hoare triple {150584#(<= ~counter~0 10)} assume true; {150584#(<= ~counter~0 10)} is VALID [2022-04-08 12:45:30,880 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {150584#(<= ~counter~0 10)} {150584#(<= ~counter~0 10)} #98#return; {150584#(<= ~counter~0 10)} is VALID [2022-04-08 12:45:30,880 INFO L290 TraceCheckUtils]: 96: Hoare triple {150584#(<= ~counter~0 10)} assume !(~r~0 < 0); {150584#(<= ~counter~0 10)} is VALID [2022-04-08 12:45:30,882 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-08 12:45:30,882 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-08 12:45:30,882 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-08 12:45:30,883 INFO L290 TraceCheckUtils]: 100: Hoare triple {150609#(<= ~counter~0 11)} ~cond := #in~cond; {150609#(<= ~counter~0 11)} is VALID [2022-04-08 12:45:30,883 INFO L290 TraceCheckUtils]: 101: Hoare triple {150609#(<= ~counter~0 11)} assume !(0 == ~cond); {150609#(<= ~counter~0 11)} is VALID [2022-04-08 12:45:30,883 INFO L290 TraceCheckUtils]: 102: Hoare triple {150609#(<= ~counter~0 11)} assume true; {150609#(<= ~counter~0 11)} is VALID [2022-04-08 12:45:30,884 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {150609#(<= ~counter~0 11)} {150609#(<= ~counter~0 11)} #94#return; {150609#(<= ~counter~0 11)} is VALID [2022-04-08 12:45:30,884 INFO L290 TraceCheckUtils]: 104: Hoare triple {150609#(<= ~counter~0 11)} assume !!(0 != ~r~0); {150609#(<= ~counter~0 11)} is VALID [2022-04-08 12:45:30,885 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-08 12:45:30,885 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-08 12:45:30,886 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-08 12:45:30,886 INFO L290 TraceCheckUtils]: 108: Hoare triple {150634#(<= ~counter~0 12)} ~cond := #in~cond; {150634#(<= ~counter~0 12)} is VALID [2022-04-08 12:45:30,886 INFO L290 TraceCheckUtils]: 109: Hoare triple {150634#(<= ~counter~0 12)} assume !(0 == ~cond); {150634#(<= ~counter~0 12)} is VALID [2022-04-08 12:45:30,887 INFO L290 TraceCheckUtils]: 110: Hoare triple {150634#(<= ~counter~0 12)} assume true; {150634#(<= ~counter~0 12)} is VALID [2022-04-08 12:45:30,887 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {150634#(<= ~counter~0 12)} {150634#(<= ~counter~0 12)} #96#return; {150634#(<= ~counter~0 12)} is VALID [2022-04-08 12:45:30,887 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-08 12:45:30,888 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-08 12:45:30,889 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-08 12:45:30,889 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-08 12:45:30,889 INFO L290 TraceCheckUtils]: 116: Hoare triple {150659#(<= ~counter~0 13)} ~cond := #in~cond; {150659#(<= ~counter~0 13)} is VALID [2022-04-08 12:45:30,890 INFO L290 TraceCheckUtils]: 117: Hoare triple {150659#(<= ~counter~0 13)} assume !(0 == ~cond); {150659#(<= ~counter~0 13)} is VALID [2022-04-08 12:45:30,890 INFO L290 TraceCheckUtils]: 118: Hoare triple {150659#(<= ~counter~0 13)} assume true; {150659#(<= ~counter~0 13)} is VALID [2022-04-08 12:45:30,890 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {150659#(<= ~counter~0 13)} {150659#(<= ~counter~0 13)} #96#return; {150659#(<= ~counter~0 13)} is VALID [2022-04-08 12:45:30,891 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-08 12:45:30,892 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-08 12:45:30,892 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-08 12:45:30,893 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-08 12:45:30,893 INFO L290 TraceCheckUtils]: 124: Hoare triple {150684#(<= ~counter~0 14)} ~cond := #in~cond; {150684#(<= ~counter~0 14)} is VALID [2022-04-08 12:45:30,893 INFO L290 TraceCheckUtils]: 125: Hoare triple {150684#(<= ~counter~0 14)} assume !(0 == ~cond); {150684#(<= ~counter~0 14)} is VALID [2022-04-08 12:45:30,893 INFO L290 TraceCheckUtils]: 126: Hoare triple {150684#(<= ~counter~0 14)} assume true; {150684#(<= ~counter~0 14)} is VALID [2022-04-08 12:45:30,894 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {150684#(<= ~counter~0 14)} {150684#(<= ~counter~0 14)} #96#return; {150684#(<= ~counter~0 14)} is VALID [2022-04-08 12:45:30,894 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-08 12:45:30,895 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-08 12:45:30,896 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-08 12:45:30,896 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-08 12:45:30,896 INFO L290 TraceCheckUtils]: 132: Hoare triple {150709#(<= ~counter~0 15)} ~cond := #in~cond; {150709#(<= ~counter~0 15)} is VALID [2022-04-08 12:45:30,897 INFO L290 TraceCheckUtils]: 133: Hoare triple {150709#(<= ~counter~0 15)} assume !(0 == ~cond); {150709#(<= ~counter~0 15)} is VALID [2022-04-08 12:45:30,897 INFO L290 TraceCheckUtils]: 134: Hoare triple {150709#(<= ~counter~0 15)} assume true; {150709#(<= ~counter~0 15)} is VALID [2022-04-08 12:45:30,897 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {150709#(<= ~counter~0 15)} {150709#(<= ~counter~0 15)} #96#return; {150709#(<= ~counter~0 15)} is VALID [2022-04-08 12:45:30,898 INFO L290 TraceCheckUtils]: 136: Hoare triple {150709#(<= ~counter~0 15)} assume !(~r~0 > 0); {150709#(<= ~counter~0 15)} is VALID [2022-04-08 12:45:30,899 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-08 12:45:30,899 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-08 12:45:30,900 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-08 12:45:30,900 INFO L290 TraceCheckUtils]: 140: Hoare triple {150734#(<= ~counter~0 16)} ~cond := #in~cond; {150734#(<= ~counter~0 16)} is VALID [2022-04-08 12:45:30,900 INFO L290 TraceCheckUtils]: 141: Hoare triple {150734#(<= ~counter~0 16)} assume !(0 == ~cond); {150734#(<= ~counter~0 16)} is VALID [2022-04-08 12:45:30,900 INFO L290 TraceCheckUtils]: 142: Hoare triple {150734#(<= ~counter~0 16)} assume true; {150734#(<= ~counter~0 16)} is VALID [2022-04-08 12:45:30,901 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {150734#(<= ~counter~0 16)} {150734#(<= ~counter~0 16)} #98#return; {150734#(<= ~counter~0 16)} is VALID [2022-04-08 12:45:30,901 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-08 12:45:30,901 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-08 12:45:30,902 INFO L290 TraceCheckUtils]: 146: Hoare triple {150759#(<= |main_#t~post8| 16)} assume !(#t~post8 < 20);havoc #t~post8; {150303#false} is VALID [2022-04-08 12:45:30,902 INFO L290 TraceCheckUtils]: 147: Hoare triple {150303#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {150303#false} is VALID [2022-04-08 12:45:30,902 INFO L290 TraceCheckUtils]: 148: Hoare triple {150303#false} assume !(#t~post6 < 20);havoc #t~post6; {150303#false} is VALID [2022-04-08 12:45:30,902 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-08 12:45:30,902 INFO L290 TraceCheckUtils]: 150: Hoare triple {150303#false} ~cond := #in~cond; {150303#false} is VALID [2022-04-08 12:45:30,902 INFO L290 TraceCheckUtils]: 151: Hoare triple {150303#false} assume 0 == ~cond; {150303#false} is VALID [2022-04-08 12:45:30,902 INFO L290 TraceCheckUtils]: 152: Hoare triple {150303#false} assume !false; {150303#false} is VALID [2022-04-08 12:45:30,903 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-08 12:45:30,903 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:45:31,596 INFO L290 TraceCheckUtils]: 152: Hoare triple {150303#false} assume !false; {150303#false} is VALID [2022-04-08 12:45:31,597 INFO L290 TraceCheckUtils]: 151: Hoare triple {150303#false} assume 0 == ~cond; {150303#false} is VALID [2022-04-08 12:45:31,597 INFO L290 TraceCheckUtils]: 150: Hoare triple {150303#false} ~cond := #in~cond; {150303#false} is VALID [2022-04-08 12:45:31,597 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-08 12:45:31,597 INFO L290 TraceCheckUtils]: 148: Hoare triple {150303#false} assume !(#t~post6 < 20);havoc #t~post6; {150303#false} is VALID [2022-04-08 12:45:31,597 INFO L290 TraceCheckUtils]: 147: Hoare triple {150303#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {150303#false} is VALID [2022-04-08 12:45:31,597 INFO L290 TraceCheckUtils]: 146: Hoare triple {150799#(< |main_#t~post8| 20)} assume !(#t~post8 < 20);havoc #t~post8; {150303#false} is VALID [2022-04-08 12:45:31,598 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-08 12:45:31,598 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-08 12:45:31,598 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {150302#true} {150803#(< ~counter~0 20)} #98#return; {150803#(< ~counter~0 20)} is VALID [2022-04-08 12:45:31,598 INFO L290 TraceCheckUtils]: 142: Hoare triple {150302#true} assume true; {150302#true} is VALID [2022-04-08 12:45:31,598 INFO L290 TraceCheckUtils]: 141: Hoare triple {150302#true} assume !(0 == ~cond); {150302#true} is VALID [2022-04-08 12:45:31,599 INFO L290 TraceCheckUtils]: 140: Hoare triple {150302#true} ~cond := #in~cond; {150302#true} is VALID [2022-04-08 12:45:31,599 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-08 12:45:31,599 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-08 12:45:31,602 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-08 12:45:31,602 INFO L290 TraceCheckUtils]: 136: Hoare triple {150828#(< ~counter~0 19)} assume !(~r~0 > 0); {150828#(< ~counter~0 19)} is VALID [2022-04-08 12:45:31,603 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {150302#true} {150828#(< ~counter~0 19)} #96#return; {150828#(< ~counter~0 19)} is VALID [2022-04-08 12:45:31,603 INFO L290 TraceCheckUtils]: 134: Hoare triple {150302#true} assume true; {150302#true} is VALID [2022-04-08 12:45:31,603 INFO L290 TraceCheckUtils]: 133: Hoare triple {150302#true} assume !(0 == ~cond); {150302#true} is VALID [2022-04-08 12:45:31,603 INFO L290 TraceCheckUtils]: 132: Hoare triple {150302#true} ~cond := #in~cond; {150302#true} is VALID [2022-04-08 12:45:31,603 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-08 12:45:31,603 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-08 12:45:31,604 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-08 12:45:31,605 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-08 12:45:31,606 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {150302#true} {150853#(< ~counter~0 18)} #96#return; {150853#(< ~counter~0 18)} is VALID [2022-04-08 12:45:31,606 INFO L290 TraceCheckUtils]: 126: Hoare triple {150302#true} assume true; {150302#true} is VALID [2022-04-08 12:45:31,606 INFO L290 TraceCheckUtils]: 125: Hoare triple {150302#true} assume !(0 == ~cond); {150302#true} is VALID [2022-04-08 12:45:31,606 INFO L290 TraceCheckUtils]: 124: Hoare triple {150302#true} ~cond := #in~cond; {150302#true} is VALID [2022-04-08 12:45:31,606 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-08 12:45:31,606 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-08 12:45:31,608 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-08 12:45:31,608 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-08 12:45:31,608 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {150302#true} {150734#(<= ~counter~0 16)} #96#return; {150734#(<= ~counter~0 16)} is VALID [2022-04-08 12:45:31,608 INFO L290 TraceCheckUtils]: 118: Hoare triple {150302#true} assume true; {150302#true} is VALID [2022-04-08 12:45:31,609 INFO L290 TraceCheckUtils]: 117: Hoare triple {150302#true} assume !(0 == ~cond); {150302#true} is VALID [2022-04-08 12:45:31,609 INFO L290 TraceCheckUtils]: 116: Hoare triple {150302#true} ~cond := #in~cond; {150302#true} is VALID [2022-04-08 12:45:31,609 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-08 12:45:31,609 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-08 12:45:31,610 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-08 12:45:31,611 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-08 12:45:31,611 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {150302#true} {150709#(<= ~counter~0 15)} #96#return; {150709#(<= ~counter~0 15)} is VALID [2022-04-08 12:45:31,611 INFO L290 TraceCheckUtils]: 110: Hoare triple {150302#true} assume true; {150302#true} is VALID [2022-04-08 12:45:31,611 INFO L290 TraceCheckUtils]: 109: Hoare triple {150302#true} assume !(0 == ~cond); {150302#true} is VALID [2022-04-08 12:45:31,611 INFO L290 TraceCheckUtils]: 108: Hoare triple {150302#true} ~cond := #in~cond; {150302#true} is VALID [2022-04-08 12:45:31,611 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-08 12:45:31,612 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-08 12:45:31,613 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-08 12:45:31,613 INFO L290 TraceCheckUtils]: 104: Hoare triple {150684#(<= ~counter~0 14)} assume !!(0 != ~r~0); {150684#(<= ~counter~0 14)} is VALID [2022-04-08 12:45:31,614 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {150302#true} {150684#(<= ~counter~0 14)} #94#return; {150684#(<= ~counter~0 14)} is VALID [2022-04-08 12:45:31,614 INFO L290 TraceCheckUtils]: 102: Hoare triple {150302#true} assume true; {150302#true} is VALID [2022-04-08 12:45:31,614 INFO L290 TraceCheckUtils]: 101: Hoare triple {150302#true} assume !(0 == ~cond); {150302#true} is VALID [2022-04-08 12:45:31,614 INFO L290 TraceCheckUtils]: 100: Hoare triple {150302#true} ~cond := #in~cond; {150302#true} is VALID [2022-04-08 12:45:31,614 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-08 12:45:31,614 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-08 12:45:31,615 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-08 12:45:31,616 INFO L290 TraceCheckUtils]: 96: Hoare triple {150659#(<= ~counter~0 13)} assume !(~r~0 < 0); {150659#(<= ~counter~0 13)} is VALID [2022-04-08 12:45:31,616 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {150302#true} {150659#(<= ~counter~0 13)} #98#return; {150659#(<= ~counter~0 13)} is VALID [2022-04-08 12:45:31,616 INFO L290 TraceCheckUtils]: 94: Hoare triple {150302#true} assume true; {150302#true} is VALID [2022-04-08 12:45:31,616 INFO L290 TraceCheckUtils]: 93: Hoare triple {150302#true} assume !(0 == ~cond); {150302#true} is VALID [2022-04-08 12:45:31,616 INFO L290 TraceCheckUtils]: 92: Hoare triple {150302#true} ~cond := #in~cond; {150302#true} is VALID [2022-04-08 12:45:31,616 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-08 12:45:31,617 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-08 12:45:31,618 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-08 12:45:31,618 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-08 12:45:31,619 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {150302#true} {150634#(<= ~counter~0 12)} #98#return; {150634#(<= ~counter~0 12)} is VALID [2022-04-08 12:45:31,619 INFO L290 TraceCheckUtils]: 86: Hoare triple {150302#true} assume true; {150302#true} is VALID [2022-04-08 12:45:31,619 INFO L290 TraceCheckUtils]: 85: Hoare triple {150302#true} assume !(0 == ~cond); {150302#true} is VALID [2022-04-08 12:45:31,619 INFO L290 TraceCheckUtils]: 84: Hoare triple {150302#true} ~cond := #in~cond; {150302#true} is VALID [2022-04-08 12:45:31,619 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-08 12:45:31,619 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-08 12:45:31,621 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-08 12:45:31,621 INFO L290 TraceCheckUtils]: 80: Hoare triple {150609#(<= ~counter~0 11)} assume !(~r~0 > 0); {150609#(<= ~counter~0 11)} is VALID [2022-04-08 12:45:31,622 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {150302#true} {150609#(<= ~counter~0 11)} #96#return; {150609#(<= ~counter~0 11)} is VALID [2022-04-08 12:45:31,622 INFO L290 TraceCheckUtils]: 78: Hoare triple {150302#true} assume true; {150302#true} is VALID [2022-04-08 12:45:31,622 INFO L290 TraceCheckUtils]: 77: Hoare triple {150302#true} assume !(0 == ~cond); {150302#true} is VALID [2022-04-08 12:45:31,622 INFO L290 TraceCheckUtils]: 76: Hoare triple {150302#true} ~cond := #in~cond; {150302#true} is VALID [2022-04-08 12:45:31,622 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-08 12:45:31,622 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-08 12:45:31,623 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-08 12:45:31,624 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-08 12:45:31,624 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {150302#true} {150584#(<= ~counter~0 10)} #96#return; {150584#(<= ~counter~0 10)} is VALID [2022-04-08 12:45:31,624 INFO L290 TraceCheckUtils]: 70: Hoare triple {150302#true} assume true; {150302#true} is VALID [2022-04-08 12:45:31,624 INFO L290 TraceCheckUtils]: 69: Hoare triple {150302#true} assume !(0 == ~cond); {150302#true} is VALID [2022-04-08 12:45:31,624 INFO L290 TraceCheckUtils]: 68: Hoare triple {150302#true} ~cond := #in~cond; {150302#true} is VALID [2022-04-08 12:45:31,624 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-08 12:45:31,625 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-08 12:45:31,626 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-08 12:45:31,626 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-08 12:45:31,627 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {150302#true} {150559#(<= ~counter~0 9)} #96#return; {150559#(<= ~counter~0 9)} is VALID [2022-04-08 12:45:31,627 INFO L290 TraceCheckUtils]: 62: Hoare triple {150302#true} assume true; {150302#true} is VALID [2022-04-08 12:45:31,627 INFO L290 TraceCheckUtils]: 61: Hoare triple {150302#true} assume !(0 == ~cond); {150302#true} is VALID [2022-04-08 12:45:31,627 INFO L290 TraceCheckUtils]: 60: Hoare triple {150302#true} ~cond := #in~cond; {150302#true} is VALID [2022-04-08 12:45:31,627 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-08 12:45:31,627 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-08 12:45:31,628 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-08 12:45:31,629 INFO L290 TraceCheckUtils]: 56: Hoare triple {150534#(<= ~counter~0 8)} assume !!(0 != ~r~0); {150534#(<= ~counter~0 8)} is VALID [2022-04-08 12:45:31,629 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {150302#true} {150534#(<= ~counter~0 8)} #94#return; {150534#(<= ~counter~0 8)} is VALID [2022-04-08 12:45:31,629 INFO L290 TraceCheckUtils]: 54: Hoare triple {150302#true} assume true; {150302#true} is VALID [2022-04-08 12:45:31,629 INFO L290 TraceCheckUtils]: 53: Hoare triple {150302#true} assume !(0 == ~cond); {150302#true} is VALID [2022-04-08 12:45:31,629 INFO L290 TraceCheckUtils]: 52: Hoare triple {150302#true} ~cond := #in~cond; {150302#true} is VALID [2022-04-08 12:45:31,629 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-08 12:45:31,630 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-08 12:45:31,631 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-08 12:45:31,631 INFO L290 TraceCheckUtils]: 48: Hoare triple {150509#(<= ~counter~0 7)} assume !(~r~0 < 0); {150509#(<= ~counter~0 7)} is VALID [2022-04-08 12:45:31,632 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {150302#true} {150509#(<= ~counter~0 7)} #98#return; {150509#(<= ~counter~0 7)} is VALID [2022-04-08 12:45:31,632 INFO L290 TraceCheckUtils]: 46: Hoare triple {150302#true} assume true; {150302#true} is VALID [2022-04-08 12:45:31,632 INFO L290 TraceCheckUtils]: 45: Hoare triple {150302#true} assume !(0 == ~cond); {150302#true} is VALID [2022-04-08 12:45:31,632 INFO L290 TraceCheckUtils]: 44: Hoare triple {150302#true} ~cond := #in~cond; {150302#true} is VALID [2022-04-08 12:45:31,632 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-08 12:45:31,632 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-08 12:45:31,633 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-08 12:45:31,634 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-08 12:45:31,634 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {150302#true} {150484#(<= ~counter~0 6)} #98#return; {150484#(<= ~counter~0 6)} is VALID [2022-04-08 12:45:31,634 INFO L290 TraceCheckUtils]: 38: Hoare triple {150302#true} assume true; {150302#true} is VALID [2022-04-08 12:45:31,634 INFO L290 TraceCheckUtils]: 37: Hoare triple {150302#true} assume !(0 == ~cond); {150302#true} is VALID [2022-04-08 12:45:31,634 INFO L290 TraceCheckUtils]: 36: Hoare triple {150302#true} ~cond := #in~cond; {150302#true} is VALID [2022-04-08 12:45:31,634 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-08 12:45:31,635 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-08 12:45:31,636 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-08 12:45:31,636 INFO L290 TraceCheckUtils]: 32: Hoare triple {150459#(<= ~counter~0 5)} assume !(~r~0 > 0); {150459#(<= ~counter~0 5)} is VALID [2022-04-08 12:45:31,637 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {150302#true} {150459#(<= ~counter~0 5)} #96#return; {150459#(<= ~counter~0 5)} is VALID [2022-04-08 12:45:31,637 INFO L290 TraceCheckUtils]: 30: Hoare triple {150302#true} assume true; {150302#true} is VALID [2022-04-08 12:45:31,637 INFO L290 TraceCheckUtils]: 29: Hoare triple {150302#true} assume !(0 == ~cond); {150302#true} is VALID [2022-04-08 12:45:31,637 INFO L290 TraceCheckUtils]: 28: Hoare triple {150302#true} ~cond := #in~cond; {150302#true} is VALID [2022-04-08 12:45:31,637 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-08 12:45:31,637 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-08 12:45:31,639 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-08 12:45:31,639 INFO L290 TraceCheckUtils]: 24: Hoare triple {150434#(<= ~counter~0 4)} assume !!(0 != ~r~0); {150434#(<= ~counter~0 4)} is VALID [2022-04-08 12:45:31,639 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {150302#true} {150434#(<= ~counter~0 4)} #94#return; {150434#(<= ~counter~0 4)} is VALID [2022-04-08 12:45:31,639 INFO L290 TraceCheckUtils]: 22: Hoare triple {150302#true} assume true; {150302#true} is VALID [2022-04-08 12:45:31,639 INFO L290 TraceCheckUtils]: 21: Hoare triple {150302#true} assume !(0 == ~cond); {150302#true} is VALID [2022-04-08 12:45:31,640 INFO L290 TraceCheckUtils]: 20: Hoare triple {150302#true} ~cond := #in~cond; {150302#true} is VALID [2022-04-08 12:45:31,640 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-08 12:45:31,640 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-08 12:45:31,641 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-08 12:45:31,641 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-08 12:45:31,642 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {150302#true} {150409#(<= ~counter~0 3)} #92#return; {150409#(<= ~counter~0 3)} is VALID [2022-04-08 12:45:31,642 INFO L290 TraceCheckUtils]: 14: Hoare triple {150302#true} assume true; {150302#true} is VALID [2022-04-08 12:45:31,642 INFO L290 TraceCheckUtils]: 13: Hoare triple {150302#true} assume !(0 == ~cond); {150302#true} is VALID [2022-04-08 12:45:31,642 INFO L290 TraceCheckUtils]: 12: Hoare triple {150302#true} ~cond := #in~cond; {150302#true} is VALID [2022-04-08 12:45:31,642 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-08 12:45:31,642 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {150302#true} {150409#(<= ~counter~0 3)} #90#return; {150409#(<= ~counter~0 3)} is VALID [2022-04-08 12:45:31,642 INFO L290 TraceCheckUtils]: 9: Hoare triple {150302#true} assume true; {150302#true} is VALID [2022-04-08 12:45:31,643 INFO L290 TraceCheckUtils]: 8: Hoare triple {150302#true} assume !(0 == ~cond); {150302#true} is VALID [2022-04-08 12:45:31,643 INFO L290 TraceCheckUtils]: 7: Hoare triple {150302#true} ~cond := #in~cond; {150302#true} is VALID [2022-04-08 12:45:31,643 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-08 12:45:31,643 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-08 12:45:31,643 INFO L272 TraceCheckUtils]: 4: Hoare triple {150409#(<= ~counter~0 3)} call #t~ret9 := main(); {150409#(<= ~counter~0 3)} is VALID [2022-04-08 12:45:31,644 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {150409#(<= ~counter~0 3)} {150302#true} #102#return; {150409#(<= ~counter~0 3)} is VALID [2022-04-08 12:45:31,644 INFO L290 TraceCheckUtils]: 2: Hoare triple {150409#(<= ~counter~0 3)} assume true; {150409#(<= ~counter~0 3)} is VALID [2022-04-08 12:45:31,644 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-08 12:45:31,644 INFO L272 TraceCheckUtils]: 0: Hoare triple {150302#true} call ULTIMATE.init(); {150302#true} is VALID [2022-04-08 12:45:31,645 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-08 12:45:31,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:45:31,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422816879] [2022-04-08 12:45:31,645 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:45:31,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [290216344] [2022-04-08 12:45:31,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [290216344] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:45:31,645 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:45:31,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 24 [2022-04-08 12:45:31,645 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:45:31,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [724884773] [2022-04-08 12:45:31,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [724884773] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:45:31,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:45:31,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-08 12:45:31,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423566772] [2022-04-08 12:45:31,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:45:31,646 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-08 12:45:31,646 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:45:31,646 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-08 12:45:31,810 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-08 12:45:31,810 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-08 12:45:31,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:45:31,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-08 12:45:31,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-08 12:45:31,810 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-08 12:45:36,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:45:36,845 INFO L93 Difference]: Finished difference Result 1023 states and 1398 transitions. [2022-04-08 12:45:36,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-08 12:45:36,845 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-08 12:45:36,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:45:36,846 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-08 12:45:36,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 356 transitions. [2022-04-08 12:45:36,848 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-08 12:45:36,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 356 transitions. [2022-04-08 12:45:36,850 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 356 transitions. [2022-04-08 12:45:37,248 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-08 12:45:37,276 INFO L225 Difference]: With dead ends: 1023 [2022-04-08 12:45:37,277 INFO L226 Difference]: Without dead ends: 845 [2022-04-08 12:45:37,277 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 282 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=530, Invalid=876, Unknown=0, NotChecked=0, Total=1406 [2022-04-08 12:45:37,279 INFO L913 BasicCegarLoop]: 78 mSDtfsCounter, 296 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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, 0.7s IncrementalHoareTripleChecker+Time [2022-04-08 12:45:37,279 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [296 Valid, 337 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-08 12:45:37,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2022-04-08 12:45:40,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 834. [2022-04-08 12:45:40,190 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:45:40,191 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-08 12:45:40,192 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-08 12:45:40,192 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-08 12:45:40,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:45:40,214 INFO L93 Difference]: Finished difference Result 845 states and 1125 transitions. [2022-04-08 12:45:40,214 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1125 transitions. [2022-04-08 12:45:40,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:45:40,215 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:45:40,216 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-08 12:45:40,216 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-08 12:45:40,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:45:40,239 INFO L93 Difference]: Finished difference Result 845 states and 1125 transitions. [2022-04-08 12:45:40,239 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1125 transitions. [2022-04-08 12:45:40,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:45:40,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:45:40,240 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:45:40,240 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:45:40,240 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-08 12:45:40,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1114 transitions. [2022-04-08 12:45:40,270 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1114 transitions. Word has length 153 [2022-04-08 12:45:40,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:45:40,270 INFO L478 AbstractCegarLoop]: Abstraction has 834 states and 1114 transitions. [2022-04-08 12:45:40,270 INFO L479 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-08 12:45:40,270 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 834 states and 1114 transitions. [2022-04-08 12:45:50,825 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1114 edges. 1112 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-08 12:45:50,825 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1114 transitions. [2022-04-08 12:45:50,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-04-08 12:45:50,826 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:45:50,826 INFO L499 BasicCegarLoop]: 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-08 12:45:50,847 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Ended with exit code 0 [2022-04-08 12:45:51,027 WARN L460 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-08 12:45:51,027 INFO L403 AbstractCegarLoop]: === Iteration 54 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:45:51,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:45:51,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1196851319, now seen corresponding path program 23 times [2022-04-08 12:45:51,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:45:51,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1232365837] [2022-04-08 12:45:51,028 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:45:51,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1196851319, now seen corresponding path program 24 times [2022-04-08 12:45:51,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:45:51,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449107817] [2022-04-08 12:45:51,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:45:51,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:45:51,042 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:45:51,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [952491219] [2022-04-08 12:45:51,042 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 12:45:51,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:45:51,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:45:51,043 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-08 12:45:51,043 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-08 12:45:51,278 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-08 12:45:51,279 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:45:51,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-08 12:45:51,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:45:51,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:45:52,052 INFO L272 TraceCheckUtils]: 0: Hoare triple {156675#true} call ULTIMATE.init(); {156675#true} is VALID [2022-04-08 12:45:52,053 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-08 12:45:52,053 INFO L290 TraceCheckUtils]: 2: Hoare triple {156683#(<= ~counter~0 0)} assume true; {156683#(<= ~counter~0 0)} is VALID [2022-04-08 12:45:52,053 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {156683#(<= ~counter~0 0)} {156675#true} #102#return; {156683#(<= ~counter~0 0)} is VALID [2022-04-08 12:45:52,054 INFO L272 TraceCheckUtils]: 4: Hoare triple {156683#(<= ~counter~0 0)} call #t~ret9 := main(); {156683#(<= ~counter~0 0)} is VALID [2022-04-08 12:45:52,054 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-08 12:45:52,054 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-08 12:45:52,055 INFO L290 TraceCheckUtils]: 7: Hoare triple {156683#(<= ~counter~0 0)} ~cond := #in~cond; {156683#(<= ~counter~0 0)} is VALID [2022-04-08 12:45:52,055 INFO L290 TraceCheckUtils]: 8: Hoare triple {156683#(<= ~counter~0 0)} assume !(0 == ~cond); {156683#(<= ~counter~0 0)} is VALID [2022-04-08 12:45:52,055 INFO L290 TraceCheckUtils]: 9: Hoare triple {156683#(<= ~counter~0 0)} assume true; {156683#(<= ~counter~0 0)} is VALID [2022-04-08 12:45:52,056 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {156683#(<= ~counter~0 0)} {156683#(<= ~counter~0 0)} #90#return; {156683#(<= ~counter~0 0)} is VALID [2022-04-08 12:45:52,056 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-08 12:45:52,056 INFO L290 TraceCheckUtils]: 12: Hoare triple {156683#(<= ~counter~0 0)} ~cond := #in~cond; {156683#(<= ~counter~0 0)} is VALID [2022-04-08 12:45:52,057 INFO L290 TraceCheckUtils]: 13: Hoare triple {156683#(<= ~counter~0 0)} assume !(0 == ~cond); {156683#(<= ~counter~0 0)} is VALID [2022-04-08 12:45:52,057 INFO L290 TraceCheckUtils]: 14: Hoare triple {156683#(<= ~counter~0 0)} assume true; {156683#(<= ~counter~0 0)} is VALID [2022-04-08 12:45:52,057 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {156683#(<= ~counter~0 0)} {156683#(<= ~counter~0 0)} #92#return; {156683#(<= ~counter~0 0)} is VALID [2022-04-08 12:45:52,057 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-08 12:45:52,061 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-08 12:45:52,062 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-08 12:45:52,062 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-08 12:45:52,062 INFO L290 TraceCheckUtils]: 20: Hoare triple {156732#(<= ~counter~0 1)} ~cond := #in~cond; {156732#(<= ~counter~0 1)} is VALID [2022-04-08 12:45:52,063 INFO L290 TraceCheckUtils]: 21: Hoare triple {156732#(<= ~counter~0 1)} assume !(0 == ~cond); {156732#(<= ~counter~0 1)} is VALID [2022-04-08 12:45:52,063 INFO L290 TraceCheckUtils]: 22: Hoare triple {156732#(<= ~counter~0 1)} assume true; {156732#(<= ~counter~0 1)} is VALID [2022-04-08 12:45:52,063 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {156732#(<= ~counter~0 1)} {156732#(<= ~counter~0 1)} #94#return; {156732#(<= ~counter~0 1)} is VALID [2022-04-08 12:45:52,064 INFO L290 TraceCheckUtils]: 24: Hoare triple {156732#(<= ~counter~0 1)} assume !!(0 != ~r~0); {156732#(<= ~counter~0 1)} is VALID [2022-04-08 12:45:52,067 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-08 12:45:52,067 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-08 12:45:52,068 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-08 12:45:52,068 INFO L290 TraceCheckUtils]: 28: Hoare triple {156757#(<= ~counter~0 2)} ~cond := #in~cond; {156757#(<= ~counter~0 2)} is VALID [2022-04-08 12:45:52,068 INFO L290 TraceCheckUtils]: 29: Hoare triple {156757#(<= ~counter~0 2)} assume !(0 == ~cond); {156757#(<= ~counter~0 2)} is VALID [2022-04-08 12:45:52,068 INFO L290 TraceCheckUtils]: 30: Hoare triple {156757#(<= ~counter~0 2)} assume true; {156757#(<= ~counter~0 2)} is VALID [2022-04-08 12:45:52,069 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {156757#(<= ~counter~0 2)} {156757#(<= ~counter~0 2)} #96#return; {156757#(<= ~counter~0 2)} is VALID [2022-04-08 12:45:52,069 INFO L290 TraceCheckUtils]: 32: Hoare triple {156757#(<= ~counter~0 2)} assume !(~r~0 > 0); {156757#(<= ~counter~0 2)} is VALID [2022-04-08 12:45:52,072 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-08 12:45:52,073 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-08 12:45:52,073 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-08 12:45:52,074 INFO L290 TraceCheckUtils]: 36: Hoare triple {156782#(<= ~counter~0 3)} ~cond := #in~cond; {156782#(<= ~counter~0 3)} is VALID [2022-04-08 12:45:52,074 INFO L290 TraceCheckUtils]: 37: Hoare triple {156782#(<= ~counter~0 3)} assume !(0 == ~cond); {156782#(<= ~counter~0 3)} is VALID [2022-04-08 12:45:52,074 INFO L290 TraceCheckUtils]: 38: Hoare triple {156782#(<= ~counter~0 3)} assume true; {156782#(<= ~counter~0 3)} is VALID [2022-04-08 12:45:52,075 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {156782#(<= ~counter~0 3)} {156782#(<= ~counter~0 3)} #98#return; {156782#(<= ~counter~0 3)} is VALID [2022-04-08 12:45:52,075 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-08 12:45:52,079 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-08 12:45:52,079 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-08 12:45:52,080 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-08 12:45:52,080 INFO L290 TraceCheckUtils]: 44: Hoare triple {156807#(<= ~counter~0 4)} ~cond := #in~cond; {156807#(<= ~counter~0 4)} is VALID [2022-04-08 12:45:52,080 INFO L290 TraceCheckUtils]: 45: Hoare triple {156807#(<= ~counter~0 4)} assume !(0 == ~cond); {156807#(<= ~counter~0 4)} is VALID [2022-04-08 12:45:52,080 INFO L290 TraceCheckUtils]: 46: Hoare triple {156807#(<= ~counter~0 4)} assume true; {156807#(<= ~counter~0 4)} is VALID [2022-04-08 12:45:52,081 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {156807#(<= ~counter~0 4)} {156807#(<= ~counter~0 4)} #98#return; {156807#(<= ~counter~0 4)} is VALID [2022-04-08 12:45:52,081 INFO L290 TraceCheckUtils]: 48: Hoare triple {156807#(<= ~counter~0 4)} assume !(~r~0 < 0); {156807#(<= ~counter~0 4)} is VALID [2022-04-08 12:45:52,084 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-08 12:45:52,085 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-08 12:45:52,085 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-08 12:45:52,086 INFO L290 TraceCheckUtils]: 52: Hoare triple {156832#(<= ~counter~0 5)} ~cond := #in~cond; {156832#(<= ~counter~0 5)} is VALID [2022-04-08 12:45:52,086 INFO L290 TraceCheckUtils]: 53: Hoare triple {156832#(<= ~counter~0 5)} assume !(0 == ~cond); {156832#(<= ~counter~0 5)} is VALID [2022-04-08 12:45:52,086 INFO L290 TraceCheckUtils]: 54: Hoare triple {156832#(<= ~counter~0 5)} assume true; {156832#(<= ~counter~0 5)} is VALID [2022-04-08 12:45:52,087 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {156832#(<= ~counter~0 5)} {156832#(<= ~counter~0 5)} #94#return; {156832#(<= ~counter~0 5)} is VALID [2022-04-08 12:45:52,087 INFO L290 TraceCheckUtils]: 56: Hoare triple {156832#(<= ~counter~0 5)} assume !!(0 != ~r~0); {156832#(<= ~counter~0 5)} is VALID [2022-04-08 12:45:52,090 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-08 12:45:52,090 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-08 12:45:52,091 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-08 12:45:52,091 INFO L290 TraceCheckUtils]: 60: Hoare triple {156857#(<= ~counter~0 6)} ~cond := #in~cond; {156857#(<= ~counter~0 6)} is VALID [2022-04-08 12:45:52,091 INFO L290 TraceCheckUtils]: 61: Hoare triple {156857#(<= ~counter~0 6)} assume !(0 == ~cond); {156857#(<= ~counter~0 6)} is VALID [2022-04-08 12:45:52,092 INFO L290 TraceCheckUtils]: 62: Hoare triple {156857#(<= ~counter~0 6)} assume true; {156857#(<= ~counter~0 6)} is VALID [2022-04-08 12:45:52,092 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {156857#(<= ~counter~0 6)} {156857#(<= ~counter~0 6)} #96#return; {156857#(<= ~counter~0 6)} is VALID [2022-04-08 12:45:52,093 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-08 12:45:52,095 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-08 12:45:52,096 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-08 12:45:52,096 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-08 12:45:52,097 INFO L290 TraceCheckUtils]: 68: Hoare triple {156882#(<= ~counter~0 7)} ~cond := #in~cond; {156882#(<= ~counter~0 7)} is VALID [2022-04-08 12:45:52,097 INFO L290 TraceCheckUtils]: 69: Hoare triple {156882#(<= ~counter~0 7)} assume !(0 == ~cond); {156882#(<= ~counter~0 7)} is VALID [2022-04-08 12:45:52,097 INFO L290 TraceCheckUtils]: 70: Hoare triple {156882#(<= ~counter~0 7)} assume true; {156882#(<= ~counter~0 7)} is VALID [2022-04-08 12:45:52,098 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {156882#(<= ~counter~0 7)} {156882#(<= ~counter~0 7)} #96#return; {156882#(<= ~counter~0 7)} is VALID [2022-04-08 12:45:52,098 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-08 12:45:52,102 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-08 12:45:52,102 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-08 12:45:52,103 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-08 12:45:52,103 INFO L290 TraceCheckUtils]: 76: Hoare triple {156907#(<= ~counter~0 8)} ~cond := #in~cond; {156907#(<= ~counter~0 8)} is VALID [2022-04-08 12:45:52,103 INFO L290 TraceCheckUtils]: 77: Hoare triple {156907#(<= ~counter~0 8)} assume !(0 == ~cond); {156907#(<= ~counter~0 8)} is VALID [2022-04-08 12:45:52,104 INFO L290 TraceCheckUtils]: 78: Hoare triple {156907#(<= ~counter~0 8)} assume true; {156907#(<= ~counter~0 8)} is VALID [2022-04-08 12:45:52,104 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {156907#(<= ~counter~0 8)} {156907#(<= ~counter~0 8)} #96#return; {156907#(<= ~counter~0 8)} is VALID [2022-04-08 12:45:52,104 INFO L290 TraceCheckUtils]: 80: Hoare triple {156907#(<= ~counter~0 8)} assume !(~r~0 > 0); {156907#(<= ~counter~0 8)} is VALID [2022-04-08 12:45:52,108 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-08 12:45:52,109 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-08 12:45:52,109 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-08 12:45:52,109 INFO L290 TraceCheckUtils]: 84: Hoare triple {156932#(<= ~counter~0 9)} ~cond := #in~cond; {156932#(<= ~counter~0 9)} is VALID [2022-04-08 12:45:52,110 INFO L290 TraceCheckUtils]: 85: Hoare triple {156932#(<= ~counter~0 9)} assume !(0 == ~cond); {156932#(<= ~counter~0 9)} is VALID [2022-04-08 12:45:52,110 INFO L290 TraceCheckUtils]: 86: Hoare triple {156932#(<= ~counter~0 9)} assume true; {156932#(<= ~counter~0 9)} is VALID [2022-04-08 12:45:52,110 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {156932#(<= ~counter~0 9)} {156932#(<= ~counter~0 9)} #98#return; {156932#(<= ~counter~0 9)} is VALID [2022-04-08 12:45:52,111 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-08 12:45:52,113 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-08 12:45:52,114 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-08 12:45:52,114 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-08 12:45:52,115 INFO L290 TraceCheckUtils]: 92: Hoare triple {156957#(<= ~counter~0 10)} ~cond := #in~cond; {156957#(<= ~counter~0 10)} is VALID [2022-04-08 12:45:52,115 INFO L290 TraceCheckUtils]: 93: Hoare triple {156957#(<= ~counter~0 10)} assume !(0 == ~cond); {156957#(<= ~counter~0 10)} is VALID [2022-04-08 12:45:52,115 INFO L290 TraceCheckUtils]: 94: Hoare triple {156957#(<= ~counter~0 10)} assume true; {156957#(<= ~counter~0 10)} is VALID [2022-04-08 12:45:52,116 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {156957#(<= ~counter~0 10)} {156957#(<= ~counter~0 10)} #98#return; {156957#(<= ~counter~0 10)} is VALID [2022-04-08 12:45:52,116 INFO L290 TraceCheckUtils]: 96: Hoare triple {156957#(<= ~counter~0 10)} assume !(~r~0 < 0); {156957#(<= ~counter~0 10)} is VALID [2022-04-08 12:45:52,119 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-08 12:45:52,119 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-08 12:45:52,120 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-08 12:45:52,120 INFO L290 TraceCheckUtils]: 100: Hoare triple {156982#(<= ~counter~0 11)} ~cond := #in~cond; {156982#(<= ~counter~0 11)} is VALID [2022-04-08 12:45:52,120 INFO L290 TraceCheckUtils]: 101: Hoare triple {156982#(<= ~counter~0 11)} assume !(0 == ~cond); {156982#(<= ~counter~0 11)} is VALID [2022-04-08 12:45:52,120 INFO L290 TraceCheckUtils]: 102: Hoare triple {156982#(<= ~counter~0 11)} assume true; {156982#(<= ~counter~0 11)} is VALID [2022-04-08 12:45:52,121 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {156982#(<= ~counter~0 11)} {156982#(<= ~counter~0 11)} #94#return; {156982#(<= ~counter~0 11)} is VALID [2022-04-08 12:45:52,121 INFO L290 TraceCheckUtils]: 104: Hoare triple {156982#(<= ~counter~0 11)} assume !!(0 != ~r~0); {156982#(<= ~counter~0 11)} is VALID [2022-04-08 12:45:52,124 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-08 12:45:52,124 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-08 12:45:52,125 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-08 12:45:52,125 INFO L290 TraceCheckUtils]: 108: Hoare triple {157007#(<= ~counter~0 12)} ~cond := #in~cond; {157007#(<= ~counter~0 12)} is VALID [2022-04-08 12:45:52,126 INFO L290 TraceCheckUtils]: 109: Hoare triple {157007#(<= ~counter~0 12)} assume !(0 == ~cond); {157007#(<= ~counter~0 12)} is VALID [2022-04-08 12:45:52,126 INFO L290 TraceCheckUtils]: 110: Hoare triple {157007#(<= ~counter~0 12)} assume true; {157007#(<= ~counter~0 12)} is VALID [2022-04-08 12:45:52,126 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {157007#(<= ~counter~0 12)} {157007#(<= ~counter~0 12)} #96#return; {157007#(<= ~counter~0 12)} is VALID [2022-04-08 12:45:52,127 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-08 12:45:52,128 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-08 12:45:52,128 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-08 12:45:52,129 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-08 12:45:52,129 INFO L290 TraceCheckUtils]: 116: Hoare triple {157032#(<= ~counter~0 13)} ~cond := #in~cond; {157032#(<= ~counter~0 13)} is VALID [2022-04-08 12:45:52,129 INFO L290 TraceCheckUtils]: 117: Hoare triple {157032#(<= ~counter~0 13)} assume !(0 == ~cond); {157032#(<= ~counter~0 13)} is VALID [2022-04-08 12:45:52,130 INFO L290 TraceCheckUtils]: 118: Hoare triple {157032#(<= ~counter~0 13)} assume true; {157032#(<= ~counter~0 13)} is VALID [2022-04-08 12:45:52,130 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {157032#(<= ~counter~0 13)} {157032#(<= ~counter~0 13)} #96#return; {157032#(<= ~counter~0 13)} is VALID [2022-04-08 12:45:52,131 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-08 12:45:52,132 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-08 12:45:52,132 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-08 12:45:52,133 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-08 12:45:52,133 INFO L290 TraceCheckUtils]: 124: Hoare triple {157057#(<= ~counter~0 14)} ~cond := #in~cond; {157057#(<= ~counter~0 14)} is VALID [2022-04-08 12:45:52,133 INFO L290 TraceCheckUtils]: 125: Hoare triple {157057#(<= ~counter~0 14)} assume !(0 == ~cond); {157057#(<= ~counter~0 14)} is VALID [2022-04-08 12:45:52,134 INFO L290 TraceCheckUtils]: 126: Hoare triple {157057#(<= ~counter~0 14)} assume true; {157057#(<= ~counter~0 14)} is VALID [2022-04-08 12:45:52,134 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {157057#(<= ~counter~0 14)} {157057#(<= ~counter~0 14)} #96#return; {157057#(<= ~counter~0 14)} is VALID [2022-04-08 12:45:52,134 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-08 12:45:52,136 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-08 12:45:52,136 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-08 12:45:52,137 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-08 12:45:52,137 INFO L290 TraceCheckUtils]: 132: Hoare triple {157082#(<= ~counter~0 15)} ~cond := #in~cond; {157082#(<= ~counter~0 15)} is VALID [2022-04-08 12:45:52,137 INFO L290 TraceCheckUtils]: 133: Hoare triple {157082#(<= ~counter~0 15)} assume !(0 == ~cond); {157082#(<= ~counter~0 15)} is VALID [2022-04-08 12:45:52,137 INFO L290 TraceCheckUtils]: 134: Hoare triple {157082#(<= ~counter~0 15)} assume true; {157082#(<= ~counter~0 15)} is VALID [2022-04-08 12:45:52,138 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {157082#(<= ~counter~0 15)} {157082#(<= ~counter~0 15)} #96#return; {157082#(<= ~counter~0 15)} is VALID [2022-04-08 12:45:52,138 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-08 12:45:52,140 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-08 12:45:52,140 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-08 12:45:52,140 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-08 12:45:52,141 INFO L290 TraceCheckUtils]: 140: Hoare triple {157107#(<= ~counter~0 16)} ~cond := #in~cond; {157107#(<= ~counter~0 16)} is VALID [2022-04-08 12:45:52,147 INFO L290 TraceCheckUtils]: 141: Hoare triple {157107#(<= ~counter~0 16)} assume !(0 == ~cond); {157107#(<= ~counter~0 16)} is VALID [2022-04-08 12:45:52,148 INFO L290 TraceCheckUtils]: 142: Hoare triple {157107#(<= ~counter~0 16)} assume true; {157107#(<= ~counter~0 16)} is VALID [2022-04-08 12:45:52,149 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {157107#(<= ~counter~0 16)} {157107#(<= ~counter~0 16)} #96#return; {157107#(<= ~counter~0 16)} is VALID [2022-04-08 12:45:52,149 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-08 12:45:52,149 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-08 12:45:52,150 INFO L290 TraceCheckUtils]: 146: Hoare triple {157132#(<= |main_#t~post7| 16)} assume !(#t~post7 < 20);havoc #t~post7; {156676#false} is VALID [2022-04-08 12:45:52,150 INFO L290 TraceCheckUtils]: 147: Hoare triple {156676#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {156676#false} is VALID [2022-04-08 12:45:52,150 INFO L290 TraceCheckUtils]: 148: Hoare triple {156676#false} assume !(#t~post8 < 20);havoc #t~post8; {156676#false} is VALID [2022-04-08 12:45:52,150 INFO L290 TraceCheckUtils]: 149: Hoare triple {156676#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {156676#false} is VALID [2022-04-08 12:45:52,150 INFO L290 TraceCheckUtils]: 150: Hoare triple {156676#false} assume !(#t~post6 < 20);havoc #t~post6; {156676#false} is VALID [2022-04-08 12:45:52,150 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-08 12:45:52,150 INFO L290 TraceCheckUtils]: 152: Hoare triple {156676#false} ~cond := #in~cond; {156676#false} is VALID [2022-04-08 12:45:52,150 INFO L290 TraceCheckUtils]: 153: Hoare triple {156676#false} assume 0 == ~cond; {156676#false} is VALID [2022-04-08 12:45:52,150 INFO L290 TraceCheckUtils]: 154: Hoare triple {156676#false} assume !false; {156676#false} is VALID [2022-04-08 12:45:52,151 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-08 12:45:52,151 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:45:52,834 INFO L290 TraceCheckUtils]: 154: Hoare triple {156676#false} assume !false; {156676#false} is VALID [2022-04-08 12:45:52,834 INFO L290 TraceCheckUtils]: 153: Hoare triple {156676#false} assume 0 == ~cond; {156676#false} is VALID [2022-04-08 12:45:52,835 INFO L290 TraceCheckUtils]: 152: Hoare triple {156676#false} ~cond := #in~cond; {156676#false} is VALID [2022-04-08 12:45:52,835 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-08 12:45:52,835 INFO L290 TraceCheckUtils]: 150: Hoare triple {156676#false} assume !(#t~post6 < 20);havoc #t~post6; {156676#false} is VALID [2022-04-08 12:45:52,835 INFO L290 TraceCheckUtils]: 149: Hoare triple {156676#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {156676#false} is VALID [2022-04-08 12:45:52,835 INFO L290 TraceCheckUtils]: 148: Hoare triple {156676#false} assume !(#t~post8 < 20);havoc #t~post8; {156676#false} is VALID [2022-04-08 12:45:52,835 INFO L290 TraceCheckUtils]: 147: Hoare triple {156676#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {156676#false} is VALID [2022-04-08 12:45:52,835 INFO L290 TraceCheckUtils]: 146: Hoare triple {157184#(< |main_#t~post7| 20)} assume !(#t~post7 < 20);havoc #t~post7; {156676#false} is VALID [2022-04-08 12:45:52,835 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-08 12:45:52,836 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-08 12:45:52,836 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {156675#true} {157188#(< ~counter~0 20)} #96#return; {157188#(< ~counter~0 20)} is VALID [2022-04-08 12:45:52,836 INFO L290 TraceCheckUtils]: 142: Hoare triple {156675#true} assume true; {156675#true} is VALID [2022-04-08 12:45:52,836 INFO L290 TraceCheckUtils]: 141: Hoare triple {156675#true} assume !(0 == ~cond); {156675#true} is VALID [2022-04-08 12:45:52,836 INFO L290 TraceCheckUtils]: 140: Hoare triple {156675#true} ~cond := #in~cond; {156675#true} is VALID [2022-04-08 12:45:52,836 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-08 12:45:52,837 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-08 12:45:52,840 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-08 12:45:52,840 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-08 12:45:52,841 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {156675#true} {157213#(< ~counter~0 19)} #96#return; {157213#(< ~counter~0 19)} is VALID [2022-04-08 12:45:52,841 INFO L290 TraceCheckUtils]: 134: Hoare triple {156675#true} assume true; {156675#true} is VALID [2022-04-08 12:45:52,841 INFO L290 TraceCheckUtils]: 133: Hoare triple {156675#true} assume !(0 == ~cond); {156675#true} is VALID [2022-04-08 12:45:52,841 INFO L290 TraceCheckUtils]: 132: Hoare triple {156675#true} ~cond := #in~cond; {156675#true} is VALID [2022-04-08 12:45:52,841 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-08 12:45:52,841 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-08 12:45:52,842 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-08 12:45:52,843 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-08 12:45:52,843 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {156675#true} {157238#(< ~counter~0 18)} #96#return; {157238#(< ~counter~0 18)} is VALID [2022-04-08 12:45:52,843 INFO L290 TraceCheckUtils]: 126: Hoare triple {156675#true} assume true; {156675#true} is VALID [2022-04-08 12:45:52,843 INFO L290 TraceCheckUtils]: 125: Hoare triple {156675#true} assume !(0 == ~cond); {156675#true} is VALID [2022-04-08 12:45:52,843 INFO L290 TraceCheckUtils]: 124: Hoare triple {156675#true} ~cond := #in~cond; {156675#true} is VALID [2022-04-08 12:45:52,843 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-08 12:45:52,844 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-08 12:45:52,845 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-08 12:45:52,845 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-08 12:45:52,846 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {156675#true} {157107#(<= ~counter~0 16)} #96#return; {157107#(<= ~counter~0 16)} is VALID [2022-04-08 12:45:52,846 INFO L290 TraceCheckUtils]: 118: Hoare triple {156675#true} assume true; {156675#true} is VALID [2022-04-08 12:45:52,846 INFO L290 TraceCheckUtils]: 117: Hoare triple {156675#true} assume !(0 == ~cond); {156675#true} is VALID [2022-04-08 12:45:52,846 INFO L290 TraceCheckUtils]: 116: Hoare triple {156675#true} ~cond := #in~cond; {156675#true} is VALID [2022-04-08 12:45:52,846 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-08 12:45:52,846 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-08 12:45:52,847 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-08 12:45:52,848 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-08 12:45:52,848 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {156675#true} {157082#(<= ~counter~0 15)} #96#return; {157082#(<= ~counter~0 15)} is VALID [2022-04-08 12:45:52,848 INFO L290 TraceCheckUtils]: 110: Hoare triple {156675#true} assume true; {156675#true} is VALID [2022-04-08 12:45:52,848 INFO L290 TraceCheckUtils]: 109: Hoare triple {156675#true} assume !(0 == ~cond); {156675#true} is VALID [2022-04-08 12:45:52,848 INFO L290 TraceCheckUtils]: 108: Hoare triple {156675#true} ~cond := #in~cond; {156675#true} is VALID [2022-04-08 12:45:52,848 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-08 12:45:52,849 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-08 12:45:52,850 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-08 12:45:52,850 INFO L290 TraceCheckUtils]: 104: Hoare triple {157057#(<= ~counter~0 14)} assume !!(0 != ~r~0); {157057#(<= ~counter~0 14)} is VALID [2022-04-08 12:45:52,851 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {156675#true} {157057#(<= ~counter~0 14)} #94#return; {157057#(<= ~counter~0 14)} is VALID [2022-04-08 12:45:52,851 INFO L290 TraceCheckUtils]: 102: Hoare triple {156675#true} assume true; {156675#true} is VALID [2022-04-08 12:45:52,851 INFO L290 TraceCheckUtils]: 101: Hoare triple {156675#true} assume !(0 == ~cond); {156675#true} is VALID [2022-04-08 12:45:52,851 INFO L290 TraceCheckUtils]: 100: Hoare triple {156675#true} ~cond := #in~cond; {156675#true} is VALID [2022-04-08 12:45:52,851 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-08 12:45:52,851 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-08 12:45:52,852 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-08 12:45:52,853 INFO L290 TraceCheckUtils]: 96: Hoare triple {157032#(<= ~counter~0 13)} assume !(~r~0 < 0); {157032#(<= ~counter~0 13)} is VALID [2022-04-08 12:45:52,853 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {156675#true} {157032#(<= ~counter~0 13)} #98#return; {157032#(<= ~counter~0 13)} is VALID [2022-04-08 12:45:52,853 INFO L290 TraceCheckUtils]: 94: Hoare triple {156675#true} assume true; {156675#true} is VALID [2022-04-08 12:45:52,853 INFO L290 TraceCheckUtils]: 93: Hoare triple {156675#true} assume !(0 == ~cond); {156675#true} is VALID [2022-04-08 12:45:52,853 INFO L290 TraceCheckUtils]: 92: Hoare triple {156675#true} ~cond := #in~cond; {156675#true} is VALID [2022-04-08 12:45:52,853 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-08 12:45:52,854 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-08 12:45:52,855 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-08 12:45:52,855 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-08 12:45:52,855 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {156675#true} {157007#(<= ~counter~0 12)} #98#return; {157007#(<= ~counter~0 12)} is VALID [2022-04-08 12:45:52,856 INFO L290 TraceCheckUtils]: 86: Hoare triple {156675#true} assume true; {156675#true} is VALID [2022-04-08 12:45:52,856 INFO L290 TraceCheckUtils]: 85: Hoare triple {156675#true} assume !(0 == ~cond); {156675#true} is VALID [2022-04-08 12:45:52,856 INFO L290 TraceCheckUtils]: 84: Hoare triple {156675#true} ~cond := #in~cond; {156675#true} is VALID [2022-04-08 12:45:52,856 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-08 12:45:52,856 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-08 12:45:52,857 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-08 12:45:52,857 INFO L290 TraceCheckUtils]: 80: Hoare triple {156982#(<= ~counter~0 11)} assume !(~r~0 > 0); {156982#(<= ~counter~0 11)} is VALID [2022-04-08 12:45:52,858 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {156675#true} {156982#(<= ~counter~0 11)} #96#return; {156982#(<= ~counter~0 11)} is VALID [2022-04-08 12:45:52,858 INFO L290 TraceCheckUtils]: 78: Hoare triple {156675#true} assume true; {156675#true} is VALID [2022-04-08 12:45:52,858 INFO L290 TraceCheckUtils]: 77: Hoare triple {156675#true} assume !(0 == ~cond); {156675#true} is VALID [2022-04-08 12:45:52,858 INFO L290 TraceCheckUtils]: 76: Hoare triple {156675#true} ~cond := #in~cond; {156675#true} is VALID [2022-04-08 12:45:52,858 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-08 12:45:52,858 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-08 12:45:52,860 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-08 12:45:52,860 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-08 12:45:52,860 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {156675#true} {156957#(<= ~counter~0 10)} #96#return; {156957#(<= ~counter~0 10)} is VALID [2022-04-08 12:45:52,860 INFO L290 TraceCheckUtils]: 70: Hoare triple {156675#true} assume true; {156675#true} is VALID [2022-04-08 12:45:52,861 INFO L290 TraceCheckUtils]: 69: Hoare triple {156675#true} assume !(0 == ~cond); {156675#true} is VALID [2022-04-08 12:45:52,861 INFO L290 TraceCheckUtils]: 68: Hoare triple {156675#true} ~cond := #in~cond; {156675#true} is VALID [2022-04-08 12:45:52,861 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-08 12:45:52,861 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-08 12:45:52,862 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-08 12:45:52,862 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-08 12:45:52,863 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {156675#true} {156932#(<= ~counter~0 9)} #96#return; {156932#(<= ~counter~0 9)} is VALID [2022-04-08 12:45:52,863 INFO L290 TraceCheckUtils]: 62: Hoare triple {156675#true} assume true; {156675#true} is VALID [2022-04-08 12:45:52,863 INFO L290 TraceCheckUtils]: 61: Hoare triple {156675#true} assume !(0 == ~cond); {156675#true} is VALID [2022-04-08 12:45:52,863 INFO L290 TraceCheckUtils]: 60: Hoare triple {156675#true} ~cond := #in~cond; {156675#true} is VALID [2022-04-08 12:45:52,863 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-08 12:45:52,863 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-08 12:45:52,865 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-08 12:45:52,865 INFO L290 TraceCheckUtils]: 56: Hoare triple {156907#(<= ~counter~0 8)} assume !!(0 != ~r~0); {156907#(<= ~counter~0 8)} is VALID [2022-04-08 12:45:52,866 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {156675#true} {156907#(<= ~counter~0 8)} #94#return; {156907#(<= ~counter~0 8)} is VALID [2022-04-08 12:45:52,866 INFO L290 TraceCheckUtils]: 54: Hoare triple {156675#true} assume true; {156675#true} is VALID [2022-04-08 12:45:52,866 INFO L290 TraceCheckUtils]: 53: Hoare triple {156675#true} assume !(0 == ~cond); {156675#true} is VALID [2022-04-08 12:45:52,866 INFO L290 TraceCheckUtils]: 52: Hoare triple {156675#true} ~cond := #in~cond; {156675#true} is VALID [2022-04-08 12:45:52,866 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-08 12:45:52,866 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-08 12:45:52,868 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-08 12:45:52,868 INFO L290 TraceCheckUtils]: 48: Hoare triple {156882#(<= ~counter~0 7)} assume !(~r~0 < 0); {156882#(<= ~counter~0 7)} is VALID [2022-04-08 12:45:52,868 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {156675#true} {156882#(<= ~counter~0 7)} #98#return; {156882#(<= ~counter~0 7)} is VALID [2022-04-08 12:45:52,869 INFO L290 TraceCheckUtils]: 46: Hoare triple {156675#true} assume true; {156675#true} is VALID [2022-04-08 12:45:52,869 INFO L290 TraceCheckUtils]: 45: Hoare triple {156675#true} assume !(0 == ~cond); {156675#true} is VALID [2022-04-08 12:45:52,869 INFO L290 TraceCheckUtils]: 44: Hoare triple {156675#true} ~cond := #in~cond; {156675#true} is VALID [2022-04-08 12:45:52,869 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-08 12:45:52,869 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-08 12:45:52,870 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-08 12:45:52,871 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-08 12:45:52,871 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {156675#true} {156857#(<= ~counter~0 6)} #98#return; {156857#(<= ~counter~0 6)} is VALID [2022-04-08 12:45:52,871 INFO L290 TraceCheckUtils]: 38: Hoare triple {156675#true} assume true; {156675#true} is VALID [2022-04-08 12:45:52,871 INFO L290 TraceCheckUtils]: 37: Hoare triple {156675#true} assume !(0 == ~cond); {156675#true} is VALID [2022-04-08 12:45:52,871 INFO L290 TraceCheckUtils]: 36: Hoare triple {156675#true} ~cond := #in~cond; {156675#true} is VALID [2022-04-08 12:45:52,871 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-08 12:45:52,872 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-08 12:45:52,873 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-08 12:45:52,873 INFO L290 TraceCheckUtils]: 32: Hoare triple {156832#(<= ~counter~0 5)} assume !(~r~0 > 0); {156832#(<= ~counter~0 5)} is VALID [2022-04-08 12:45:52,873 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {156675#true} {156832#(<= ~counter~0 5)} #96#return; {156832#(<= ~counter~0 5)} is VALID [2022-04-08 12:45:52,874 INFO L290 TraceCheckUtils]: 30: Hoare triple {156675#true} assume true; {156675#true} is VALID [2022-04-08 12:45:52,874 INFO L290 TraceCheckUtils]: 29: Hoare triple {156675#true} assume !(0 == ~cond); {156675#true} is VALID [2022-04-08 12:45:52,874 INFO L290 TraceCheckUtils]: 28: Hoare triple {156675#true} ~cond := #in~cond; {156675#true} is VALID [2022-04-08 12:45:52,874 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-08 12:45:52,874 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-08 12:45:52,875 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-08 12:45:52,875 INFO L290 TraceCheckUtils]: 24: Hoare triple {156807#(<= ~counter~0 4)} assume !!(0 != ~r~0); {156807#(<= ~counter~0 4)} is VALID [2022-04-08 12:45:52,876 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {156675#true} {156807#(<= ~counter~0 4)} #94#return; {156807#(<= ~counter~0 4)} is VALID [2022-04-08 12:45:52,876 INFO L290 TraceCheckUtils]: 22: Hoare triple {156675#true} assume true; {156675#true} is VALID [2022-04-08 12:45:52,876 INFO L290 TraceCheckUtils]: 21: Hoare triple {156675#true} assume !(0 == ~cond); {156675#true} is VALID [2022-04-08 12:45:52,876 INFO L290 TraceCheckUtils]: 20: Hoare triple {156675#true} ~cond := #in~cond; {156675#true} is VALID [2022-04-08 12:45:52,876 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-08 12:45:52,876 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-08 12:45:52,878 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-08 12:45:52,878 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-08 12:45:52,878 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {156675#true} {156782#(<= ~counter~0 3)} #92#return; {156782#(<= ~counter~0 3)} is VALID [2022-04-08 12:45:52,878 INFO L290 TraceCheckUtils]: 14: Hoare triple {156675#true} assume true; {156675#true} is VALID [2022-04-08 12:45:52,878 INFO L290 TraceCheckUtils]: 13: Hoare triple {156675#true} assume !(0 == ~cond); {156675#true} is VALID [2022-04-08 12:45:52,878 INFO L290 TraceCheckUtils]: 12: Hoare triple {156675#true} ~cond := #in~cond; {156675#true} is VALID [2022-04-08 12:45:52,879 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-08 12:45:52,879 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {156675#true} {156782#(<= ~counter~0 3)} #90#return; {156782#(<= ~counter~0 3)} is VALID [2022-04-08 12:45:52,879 INFO L290 TraceCheckUtils]: 9: Hoare triple {156675#true} assume true; {156675#true} is VALID [2022-04-08 12:45:52,879 INFO L290 TraceCheckUtils]: 8: Hoare triple {156675#true} assume !(0 == ~cond); {156675#true} is VALID [2022-04-08 12:45:52,879 INFO L290 TraceCheckUtils]: 7: Hoare triple {156675#true} ~cond := #in~cond; {156675#true} is VALID [2022-04-08 12:45:52,879 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-08 12:45:52,879 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-08 12:45:52,880 INFO L272 TraceCheckUtils]: 4: Hoare triple {156782#(<= ~counter~0 3)} call #t~ret9 := main(); {156782#(<= ~counter~0 3)} is VALID [2022-04-08 12:45:52,880 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {156782#(<= ~counter~0 3)} {156675#true} #102#return; {156782#(<= ~counter~0 3)} is VALID [2022-04-08 12:45:52,880 INFO L290 TraceCheckUtils]: 2: Hoare triple {156782#(<= ~counter~0 3)} assume true; {156782#(<= ~counter~0 3)} is VALID [2022-04-08 12:45:52,881 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-08 12:45:52,881 INFO L272 TraceCheckUtils]: 0: Hoare triple {156675#true} call ULTIMATE.init(); {156675#true} is VALID [2022-04-08 12:45:52,881 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-08 12:45:52,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:45:52,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449107817] [2022-04-08 12:45:52,881 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:45:52,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [952491219] [2022-04-08 12:45:52,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [952491219] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:45:52,882 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:45:52,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 24 [2022-04-08 12:45:52,882 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:45:52,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1232365837] [2022-04-08 12:45:52,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1232365837] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:45:52,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:45:52,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-08 12:45:52,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008919493] [2022-04-08 12:45:52,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:45:52,883 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-08 12:45:52,883 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:45:52,883 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-08 12:45:53,050 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-08 12:45:53,051 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-08 12:45:53,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:45:53,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-08 12:45:53,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-08 12:45:53,051 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-08 12:45:58,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:45:58,080 INFO L93 Difference]: Finished difference Result 1021 states and 1392 transitions. [2022-04-08 12:45:58,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-08 12:45:58,081 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-08 12:45:58,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:45:58,081 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-08 12:45:58,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 356 transitions. [2022-04-08 12:45:58,083 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-08 12:45:58,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 356 transitions. [2022-04-08 12:45:58,085 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 356 transitions. [2022-04-08 12:45:58,516 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-08 12:45:58,547 INFO L225 Difference]: With dead ends: 1021 [2022-04-08 12:45:58,547 INFO L226 Difference]: Without dead ends: 851 [2022-04-08 12:45:58,547 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 286 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=566, Invalid=916, Unknown=0, NotChecked=0, Total=1482 [2022-04-08 12:45:58,551 INFO L913 BasicCegarLoop]: 78 mSDtfsCounter, 265 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.7s IncrementalHoareTripleChecker+Time [2022-04-08 12:45:58,551 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [265 Valid, 348 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-08 12:45:58,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2022-04-08 12:46:01,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 851. [2022-04-08 12:46:01,669 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:46:01,669 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-08 12:46:01,670 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-08 12:46:01,670 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-08 12:46:01,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:46:01,693 INFO L93 Difference]: Finished difference Result 851 states and 1131 transitions. [2022-04-08 12:46:01,693 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1131 transitions. [2022-04-08 12:46:01,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:46:01,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:46:01,694 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-08 12:46:01,695 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-08 12:46:01,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:46:01,717 INFO L93 Difference]: Finished difference Result 851 states and 1131 transitions. [2022-04-08 12:46:01,717 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1131 transitions. [2022-04-08 12:46:01,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:46:01,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:46:01,718 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:46:01,718 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:46:01,719 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-08 12:46:01,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1131 transitions. [2022-04-08 12:46:01,753 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1131 transitions. Word has length 155 [2022-04-08 12:46:01,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:46:01,753 INFO L478 AbstractCegarLoop]: Abstraction has 851 states and 1131 transitions. [2022-04-08 12:46:01,754 INFO L479 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-08 12:46:01,754 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 851 states and 1131 transitions. [2022-04-08 12:46:15,621 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1131 edges. 1128 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-08 12:46:15,621 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1131 transitions. [2022-04-08 12:46:15,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-04-08 12:46:15,623 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:46:15,623 INFO L499 BasicCegarLoop]: 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-08 12:46:15,627 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-08 12:46:15,823 WARN L460 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-08 12:46:15,823 INFO L403 AbstractCegarLoop]: === Iteration 55 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:46:15,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:46:15,823 INFO L85 PathProgramCache]: Analyzing trace with hash -61113684, now seen corresponding path program 17 times [2022-04-08 12:46:15,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:46:15,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [798085145] [2022-04-08 12:46:15,824 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:46:15,824 INFO L85 PathProgramCache]: Analyzing trace with hash -61113684, now seen corresponding path program 18 times [2022-04-08 12:46:15,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:46:15,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546294144] [2022-04-08 12:46:15,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:46:15,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:46:15,837 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:46:15,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [317050804] [2022-04-08 12:46:15,837 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 12:46:15,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:46:15,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:46:15,838 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-08 12:46:15,842 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-08 12:46:16,487 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-08 12:46:16,487 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:46:16,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-08 12:46:16,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:46:16,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:46:17,279 INFO L272 TraceCheckUtils]: 0: Hoare triple {163104#true} call ULTIMATE.init(); {163104#true} is VALID [2022-04-08 12:46:17,280 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-08 12:46:17,280 INFO L290 TraceCheckUtils]: 2: Hoare triple {163112#(<= ~counter~0 0)} assume true; {163112#(<= ~counter~0 0)} is VALID [2022-04-08 12:46:17,281 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {163112#(<= ~counter~0 0)} {163104#true} #102#return; {163112#(<= ~counter~0 0)} is VALID [2022-04-08 12:46:17,281 INFO L272 TraceCheckUtils]: 4: Hoare triple {163112#(<= ~counter~0 0)} call #t~ret9 := main(); {163112#(<= ~counter~0 0)} is VALID [2022-04-08 12:46:17,281 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-08 12:46:17,281 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-08 12:46:17,282 INFO L290 TraceCheckUtils]: 7: Hoare triple {163112#(<= ~counter~0 0)} ~cond := #in~cond; {163112#(<= ~counter~0 0)} is VALID [2022-04-08 12:46:17,282 INFO L290 TraceCheckUtils]: 8: Hoare triple {163112#(<= ~counter~0 0)} assume !(0 == ~cond); {163112#(<= ~counter~0 0)} is VALID [2022-04-08 12:46:17,282 INFO L290 TraceCheckUtils]: 9: Hoare triple {163112#(<= ~counter~0 0)} assume true; {163112#(<= ~counter~0 0)} is VALID [2022-04-08 12:46:17,283 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {163112#(<= ~counter~0 0)} {163112#(<= ~counter~0 0)} #90#return; {163112#(<= ~counter~0 0)} is VALID [2022-04-08 12:46:17,283 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-08 12:46:17,283 INFO L290 TraceCheckUtils]: 12: Hoare triple {163112#(<= ~counter~0 0)} ~cond := #in~cond; {163112#(<= ~counter~0 0)} is VALID [2022-04-08 12:46:17,283 INFO L290 TraceCheckUtils]: 13: Hoare triple {163112#(<= ~counter~0 0)} assume !(0 == ~cond); {163112#(<= ~counter~0 0)} is VALID [2022-04-08 12:46:17,284 INFO L290 TraceCheckUtils]: 14: Hoare triple {163112#(<= ~counter~0 0)} assume true; {163112#(<= ~counter~0 0)} is VALID [2022-04-08 12:46:17,284 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {163112#(<= ~counter~0 0)} {163112#(<= ~counter~0 0)} #92#return; {163112#(<= ~counter~0 0)} is VALID [2022-04-08 12:46:17,284 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-08 12:46:17,288 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-08 12:46:17,288 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-08 12:46:17,289 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-08 12:46:17,289 INFO L290 TraceCheckUtils]: 20: Hoare triple {163161#(<= ~counter~0 1)} ~cond := #in~cond; {163161#(<= ~counter~0 1)} is VALID [2022-04-08 12:46:17,289 INFO L290 TraceCheckUtils]: 21: Hoare triple {163161#(<= ~counter~0 1)} assume !(0 == ~cond); {163161#(<= ~counter~0 1)} is VALID [2022-04-08 12:46:17,289 INFO L290 TraceCheckUtils]: 22: Hoare triple {163161#(<= ~counter~0 1)} assume true; {163161#(<= ~counter~0 1)} is VALID [2022-04-08 12:46:17,290 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {163161#(<= ~counter~0 1)} {163161#(<= ~counter~0 1)} #94#return; {163161#(<= ~counter~0 1)} is VALID [2022-04-08 12:46:17,290 INFO L290 TraceCheckUtils]: 24: Hoare triple {163161#(<= ~counter~0 1)} assume !!(0 != ~r~0); {163161#(<= ~counter~0 1)} is VALID [2022-04-08 12:46:17,292 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-08 12:46:17,292 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-08 12:46:17,293 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-08 12:46:17,293 INFO L290 TraceCheckUtils]: 28: Hoare triple {163186#(<= ~counter~0 2)} ~cond := #in~cond; {163186#(<= ~counter~0 2)} is VALID [2022-04-08 12:46:17,293 INFO L290 TraceCheckUtils]: 29: Hoare triple {163186#(<= ~counter~0 2)} assume !(0 == ~cond); {163186#(<= ~counter~0 2)} is VALID [2022-04-08 12:46:17,294 INFO L290 TraceCheckUtils]: 30: Hoare triple {163186#(<= ~counter~0 2)} assume true; {163186#(<= ~counter~0 2)} is VALID [2022-04-08 12:46:17,294 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {163186#(<= ~counter~0 2)} {163186#(<= ~counter~0 2)} #96#return; {163186#(<= ~counter~0 2)} is VALID [2022-04-08 12:46:17,294 INFO L290 TraceCheckUtils]: 32: Hoare triple {163186#(<= ~counter~0 2)} assume !(~r~0 > 0); {163186#(<= ~counter~0 2)} is VALID [2022-04-08 12:46:17,296 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-08 12:46:17,296 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-08 12:46:17,297 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-08 12:46:17,297 INFO L290 TraceCheckUtils]: 36: Hoare triple {163211#(<= ~counter~0 3)} ~cond := #in~cond; {163211#(<= ~counter~0 3)} is VALID [2022-04-08 12:46:17,297 INFO L290 TraceCheckUtils]: 37: Hoare triple {163211#(<= ~counter~0 3)} assume !(0 == ~cond); {163211#(<= ~counter~0 3)} is VALID [2022-04-08 12:46:17,297 INFO L290 TraceCheckUtils]: 38: Hoare triple {163211#(<= ~counter~0 3)} assume true; {163211#(<= ~counter~0 3)} is VALID [2022-04-08 12:46:17,298 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {163211#(<= ~counter~0 3)} {163211#(<= ~counter~0 3)} #98#return; {163211#(<= ~counter~0 3)} is VALID [2022-04-08 12:46:17,298 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-08 12:46:17,299 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-08 12:46:17,300 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-08 12:46:17,300 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-08 12:46:17,300 INFO L290 TraceCheckUtils]: 44: Hoare triple {163236#(<= ~counter~0 4)} ~cond := #in~cond; {163236#(<= ~counter~0 4)} is VALID [2022-04-08 12:46:17,301 INFO L290 TraceCheckUtils]: 45: Hoare triple {163236#(<= ~counter~0 4)} assume !(0 == ~cond); {163236#(<= ~counter~0 4)} is VALID [2022-04-08 12:46:17,301 INFO L290 TraceCheckUtils]: 46: Hoare triple {163236#(<= ~counter~0 4)} assume true; {163236#(<= ~counter~0 4)} is VALID [2022-04-08 12:46:17,301 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {163236#(<= ~counter~0 4)} {163236#(<= ~counter~0 4)} #98#return; {163236#(<= ~counter~0 4)} is VALID [2022-04-08 12:46:17,302 INFO L290 TraceCheckUtils]: 48: Hoare triple {163236#(<= ~counter~0 4)} assume !(~r~0 < 0); {163236#(<= ~counter~0 4)} is VALID [2022-04-08 12:46:17,303 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-08 12:46:17,304 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-08 12:46:17,304 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-08 12:46:17,304 INFO L290 TraceCheckUtils]: 52: Hoare triple {163261#(<= ~counter~0 5)} ~cond := #in~cond; {163261#(<= ~counter~0 5)} is VALID [2022-04-08 12:46:17,305 INFO L290 TraceCheckUtils]: 53: Hoare triple {163261#(<= ~counter~0 5)} assume !(0 == ~cond); {163261#(<= ~counter~0 5)} is VALID [2022-04-08 12:46:17,305 INFO L290 TraceCheckUtils]: 54: Hoare triple {163261#(<= ~counter~0 5)} assume true; {163261#(<= ~counter~0 5)} is VALID [2022-04-08 12:46:17,305 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {163261#(<= ~counter~0 5)} {163261#(<= ~counter~0 5)} #94#return; {163261#(<= ~counter~0 5)} is VALID [2022-04-08 12:46:17,306 INFO L290 TraceCheckUtils]: 56: Hoare triple {163261#(<= ~counter~0 5)} assume !!(0 != ~r~0); {163261#(<= ~counter~0 5)} is VALID [2022-04-08 12:46:17,307 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-08 12:46:17,307 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-08 12:46:17,308 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-08 12:46:17,308 INFO L290 TraceCheckUtils]: 60: Hoare triple {163286#(<= ~counter~0 6)} ~cond := #in~cond; {163286#(<= ~counter~0 6)} is VALID [2022-04-08 12:46:17,308 INFO L290 TraceCheckUtils]: 61: Hoare triple {163286#(<= ~counter~0 6)} assume !(0 == ~cond); {163286#(<= ~counter~0 6)} is VALID [2022-04-08 12:46:17,308 INFO L290 TraceCheckUtils]: 62: Hoare triple {163286#(<= ~counter~0 6)} assume true; {163286#(<= ~counter~0 6)} is VALID [2022-04-08 12:46:17,309 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {163286#(<= ~counter~0 6)} {163286#(<= ~counter~0 6)} #96#return; {163286#(<= ~counter~0 6)} is VALID [2022-04-08 12:46:17,309 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-08 12:46:17,311 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-08 12:46:17,311 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-08 12:46:17,312 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-08 12:46:17,312 INFO L290 TraceCheckUtils]: 68: Hoare triple {163311#(<= ~counter~0 7)} ~cond := #in~cond; {163311#(<= ~counter~0 7)} is VALID [2022-04-08 12:46:17,312 INFO L290 TraceCheckUtils]: 69: Hoare triple {163311#(<= ~counter~0 7)} assume !(0 == ~cond); {163311#(<= ~counter~0 7)} is VALID [2022-04-08 12:46:17,313 INFO L290 TraceCheckUtils]: 70: Hoare triple {163311#(<= ~counter~0 7)} assume true; {163311#(<= ~counter~0 7)} is VALID [2022-04-08 12:46:17,313 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {163311#(<= ~counter~0 7)} {163311#(<= ~counter~0 7)} #96#return; {163311#(<= ~counter~0 7)} is VALID [2022-04-08 12:46:17,313 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-08 12:46:17,315 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-08 12:46:17,315 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-08 12:46:17,316 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-08 12:46:17,316 INFO L290 TraceCheckUtils]: 76: Hoare triple {163336#(<= ~counter~0 8)} ~cond := #in~cond; {163336#(<= ~counter~0 8)} is VALID [2022-04-08 12:46:17,316 INFO L290 TraceCheckUtils]: 77: Hoare triple {163336#(<= ~counter~0 8)} assume !(0 == ~cond); {163336#(<= ~counter~0 8)} is VALID [2022-04-08 12:46:17,316 INFO L290 TraceCheckUtils]: 78: Hoare triple {163336#(<= ~counter~0 8)} assume true; {163336#(<= ~counter~0 8)} is VALID [2022-04-08 12:46:17,317 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {163336#(<= ~counter~0 8)} {163336#(<= ~counter~0 8)} #96#return; {163336#(<= ~counter~0 8)} is VALID [2022-04-08 12:46:17,317 INFO L290 TraceCheckUtils]: 80: Hoare triple {163336#(<= ~counter~0 8)} assume !(~r~0 > 0); {163336#(<= ~counter~0 8)} is VALID [2022-04-08 12:46:17,318 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-08 12:46:17,319 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-08 12:46:17,319 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-08 12:46:17,319 INFO L290 TraceCheckUtils]: 84: Hoare triple {163361#(<= ~counter~0 9)} ~cond := #in~cond; {163361#(<= ~counter~0 9)} is VALID [2022-04-08 12:46:17,320 INFO L290 TraceCheckUtils]: 85: Hoare triple {163361#(<= ~counter~0 9)} assume !(0 == ~cond); {163361#(<= ~counter~0 9)} is VALID [2022-04-08 12:46:17,320 INFO L290 TraceCheckUtils]: 86: Hoare triple {163361#(<= ~counter~0 9)} assume true; {163361#(<= ~counter~0 9)} is VALID [2022-04-08 12:46:17,320 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {163361#(<= ~counter~0 9)} {163361#(<= ~counter~0 9)} #98#return; {163361#(<= ~counter~0 9)} is VALID [2022-04-08 12:46:17,320 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-08 12:46:17,322 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-08 12:46:17,322 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-08 12:46:17,322 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-08 12:46:17,323 INFO L290 TraceCheckUtils]: 92: Hoare triple {163386#(<= ~counter~0 10)} ~cond := #in~cond; {163386#(<= ~counter~0 10)} is VALID [2022-04-08 12:46:17,323 INFO L290 TraceCheckUtils]: 93: Hoare triple {163386#(<= ~counter~0 10)} assume !(0 == ~cond); {163386#(<= ~counter~0 10)} is VALID [2022-04-08 12:46:17,323 INFO L290 TraceCheckUtils]: 94: Hoare triple {163386#(<= ~counter~0 10)} assume true; {163386#(<= ~counter~0 10)} is VALID [2022-04-08 12:46:17,324 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {163386#(<= ~counter~0 10)} {163386#(<= ~counter~0 10)} #98#return; {163386#(<= ~counter~0 10)} is VALID [2022-04-08 12:46:17,324 INFO L290 TraceCheckUtils]: 96: Hoare triple {163386#(<= ~counter~0 10)} assume !(~r~0 < 0); {163386#(<= ~counter~0 10)} is VALID [2022-04-08 12:46:17,325 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-08 12:46:17,325 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-08 12:46:17,326 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-08 12:46:17,326 INFO L290 TraceCheckUtils]: 100: Hoare triple {163411#(<= ~counter~0 11)} ~cond := #in~cond; {163411#(<= ~counter~0 11)} is VALID [2022-04-08 12:46:17,326 INFO L290 TraceCheckUtils]: 101: Hoare triple {163411#(<= ~counter~0 11)} assume !(0 == ~cond); {163411#(<= ~counter~0 11)} is VALID [2022-04-08 12:46:17,327 INFO L290 TraceCheckUtils]: 102: Hoare triple {163411#(<= ~counter~0 11)} assume true; {163411#(<= ~counter~0 11)} is VALID [2022-04-08 12:46:17,327 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {163411#(<= ~counter~0 11)} {163411#(<= ~counter~0 11)} #94#return; {163411#(<= ~counter~0 11)} is VALID [2022-04-08 12:46:17,327 INFO L290 TraceCheckUtils]: 104: Hoare triple {163411#(<= ~counter~0 11)} assume !!(0 != ~r~0); {163411#(<= ~counter~0 11)} is VALID [2022-04-08 12:46:17,328 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-08 12:46:17,329 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-08 12:46:17,329 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-08 12:46:17,329 INFO L290 TraceCheckUtils]: 108: Hoare triple {163436#(<= ~counter~0 12)} ~cond := #in~cond; {163436#(<= ~counter~0 12)} is VALID [2022-04-08 12:46:17,330 INFO L290 TraceCheckUtils]: 109: Hoare triple {163436#(<= ~counter~0 12)} assume !(0 == ~cond); {163436#(<= ~counter~0 12)} is VALID [2022-04-08 12:46:17,330 INFO L290 TraceCheckUtils]: 110: Hoare triple {163436#(<= ~counter~0 12)} assume true; {163436#(<= ~counter~0 12)} is VALID [2022-04-08 12:46:17,330 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {163436#(<= ~counter~0 12)} {163436#(<= ~counter~0 12)} #96#return; {163436#(<= ~counter~0 12)} is VALID [2022-04-08 12:46:17,331 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-08 12:46:17,332 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-08 12:46:17,332 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-08 12:46:17,333 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-08 12:46:17,333 INFO L290 TraceCheckUtils]: 116: Hoare triple {163461#(<= ~counter~0 13)} ~cond := #in~cond; {163461#(<= ~counter~0 13)} is VALID [2022-04-08 12:46:17,333 INFO L290 TraceCheckUtils]: 117: Hoare triple {163461#(<= ~counter~0 13)} assume !(0 == ~cond); {163461#(<= ~counter~0 13)} is VALID [2022-04-08 12:46:17,333 INFO L290 TraceCheckUtils]: 118: Hoare triple {163461#(<= ~counter~0 13)} assume true; {163461#(<= ~counter~0 13)} is VALID [2022-04-08 12:46:17,334 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {163461#(<= ~counter~0 13)} {163461#(<= ~counter~0 13)} #96#return; {163461#(<= ~counter~0 13)} is VALID [2022-04-08 12:46:17,334 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-08 12:46:17,335 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-08 12:46:17,336 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-08 12:46:17,336 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-08 12:46:17,336 INFO L290 TraceCheckUtils]: 124: Hoare triple {163486#(<= ~counter~0 14)} ~cond := #in~cond; {163486#(<= ~counter~0 14)} is VALID [2022-04-08 12:46:17,336 INFO L290 TraceCheckUtils]: 125: Hoare triple {163486#(<= ~counter~0 14)} assume !(0 == ~cond); {163486#(<= ~counter~0 14)} is VALID [2022-04-08 12:46:17,337 INFO L290 TraceCheckUtils]: 126: Hoare triple {163486#(<= ~counter~0 14)} assume true; {163486#(<= ~counter~0 14)} is VALID [2022-04-08 12:46:17,337 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {163486#(<= ~counter~0 14)} {163486#(<= ~counter~0 14)} #96#return; {163486#(<= ~counter~0 14)} is VALID [2022-04-08 12:46:17,337 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-08 12:46:17,339 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-08 12:46:17,339 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-08 12:46:17,339 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-08 12:46:17,340 INFO L290 TraceCheckUtils]: 132: Hoare triple {163511#(<= ~counter~0 15)} ~cond := #in~cond; {163511#(<= ~counter~0 15)} is VALID [2022-04-08 12:46:17,340 INFO L290 TraceCheckUtils]: 133: Hoare triple {163511#(<= ~counter~0 15)} assume !(0 == ~cond); {163511#(<= ~counter~0 15)} is VALID [2022-04-08 12:46:17,340 INFO L290 TraceCheckUtils]: 134: Hoare triple {163511#(<= ~counter~0 15)} assume true; {163511#(<= ~counter~0 15)} is VALID [2022-04-08 12:46:17,341 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {163511#(<= ~counter~0 15)} {163511#(<= ~counter~0 15)} #96#return; {163511#(<= ~counter~0 15)} is VALID [2022-04-08 12:46:17,341 INFO L290 TraceCheckUtils]: 136: Hoare triple {163511#(<= ~counter~0 15)} assume !(~r~0 > 0); {163511#(<= ~counter~0 15)} is VALID [2022-04-08 12:46:17,342 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-08 12:46:17,342 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-08 12:46:17,343 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-08 12:46:17,343 INFO L290 TraceCheckUtils]: 140: Hoare triple {163536#(<= ~counter~0 16)} ~cond := #in~cond; {163536#(<= ~counter~0 16)} is VALID [2022-04-08 12:46:17,343 INFO L290 TraceCheckUtils]: 141: Hoare triple {163536#(<= ~counter~0 16)} assume !(0 == ~cond); {163536#(<= ~counter~0 16)} is VALID [2022-04-08 12:46:17,343 INFO L290 TraceCheckUtils]: 142: Hoare triple {163536#(<= ~counter~0 16)} assume true; {163536#(<= ~counter~0 16)} is VALID [2022-04-08 12:46:17,344 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {163536#(<= ~counter~0 16)} {163536#(<= ~counter~0 16)} #98#return; {163536#(<= ~counter~0 16)} is VALID [2022-04-08 12:46:17,344 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-08 12:46:17,345 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-08 12:46:17,346 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-08 12:46:17,346 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-08 12:46:17,346 INFO L290 TraceCheckUtils]: 148: Hoare triple {163561#(<= ~counter~0 17)} ~cond := #in~cond; {163561#(<= ~counter~0 17)} is VALID [2022-04-08 12:46:17,347 INFO L290 TraceCheckUtils]: 149: Hoare triple {163561#(<= ~counter~0 17)} assume !(0 == ~cond); {163561#(<= ~counter~0 17)} is VALID [2022-04-08 12:46:17,347 INFO L290 TraceCheckUtils]: 150: Hoare triple {163561#(<= ~counter~0 17)} assume true; {163561#(<= ~counter~0 17)} is VALID [2022-04-08 12:46:17,347 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {163561#(<= ~counter~0 17)} {163561#(<= ~counter~0 17)} #98#return; {163561#(<= ~counter~0 17)} is VALID [2022-04-08 12:46:17,348 INFO L290 TraceCheckUtils]: 152: Hoare triple {163561#(<= ~counter~0 17)} assume !(~r~0 < 0); {163561#(<= ~counter~0 17)} is VALID [2022-04-08 12:46:17,348 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-08 12:46:17,348 INFO L290 TraceCheckUtils]: 154: Hoare triple {163586#(<= |main_#t~post6| 17)} assume !(#t~post6 < 20);havoc #t~post6; {163105#false} is VALID [2022-04-08 12:46:17,348 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-08 12:46:17,348 INFO L290 TraceCheckUtils]: 156: Hoare triple {163105#false} ~cond := #in~cond; {163105#false} is VALID [2022-04-08 12:46:17,349 INFO L290 TraceCheckUtils]: 157: Hoare triple {163105#false} assume 0 == ~cond; {163105#false} is VALID [2022-04-08 12:46:17,349 INFO L290 TraceCheckUtils]: 158: Hoare triple {163105#false} assume !false; {163105#false} is VALID [2022-04-08 12:46:17,349 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-08 12:46:17,349 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:46:18,040 INFO L290 TraceCheckUtils]: 158: Hoare triple {163105#false} assume !false; {163105#false} is VALID [2022-04-08 12:46:18,040 INFO L290 TraceCheckUtils]: 157: Hoare triple {163105#false} assume 0 == ~cond; {163105#false} is VALID [2022-04-08 12:46:18,040 INFO L290 TraceCheckUtils]: 156: Hoare triple {163105#false} ~cond := #in~cond; {163105#false} is VALID [2022-04-08 12:46:18,040 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-08 12:46:18,040 INFO L290 TraceCheckUtils]: 154: Hoare triple {163614#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {163105#false} is VALID [2022-04-08 12:46:18,041 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-08 12:46:18,041 INFO L290 TraceCheckUtils]: 152: Hoare triple {163618#(< ~counter~0 20)} assume !(~r~0 < 0); {163618#(< ~counter~0 20)} is VALID [2022-04-08 12:46:18,041 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {163104#true} {163618#(< ~counter~0 20)} #98#return; {163618#(< ~counter~0 20)} is VALID [2022-04-08 12:46:18,041 INFO L290 TraceCheckUtils]: 150: Hoare triple {163104#true} assume true; {163104#true} is VALID [2022-04-08 12:46:18,042 INFO L290 TraceCheckUtils]: 149: Hoare triple {163104#true} assume !(0 == ~cond); {163104#true} is VALID [2022-04-08 12:46:18,042 INFO L290 TraceCheckUtils]: 148: Hoare triple {163104#true} ~cond := #in~cond; {163104#true} is VALID [2022-04-08 12:46:18,042 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-08 12:46:18,042 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-08 12:46:18,045 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-08 12:46:18,045 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-08 12:46:18,046 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {163104#true} {163643#(< ~counter~0 19)} #98#return; {163643#(< ~counter~0 19)} is VALID [2022-04-08 12:46:18,046 INFO L290 TraceCheckUtils]: 142: Hoare triple {163104#true} assume true; {163104#true} is VALID [2022-04-08 12:46:18,046 INFO L290 TraceCheckUtils]: 141: Hoare triple {163104#true} assume !(0 == ~cond); {163104#true} is VALID [2022-04-08 12:46:18,046 INFO L290 TraceCheckUtils]: 140: Hoare triple {163104#true} ~cond := #in~cond; {163104#true} is VALID [2022-04-08 12:46:18,046 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-08 12:46:18,046 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-08 12:46:18,048 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-08 12:46:18,048 INFO L290 TraceCheckUtils]: 136: Hoare triple {163561#(<= ~counter~0 17)} assume !(~r~0 > 0); {163561#(<= ~counter~0 17)} is VALID [2022-04-08 12:46:18,048 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {163104#true} {163561#(<= ~counter~0 17)} #96#return; {163561#(<= ~counter~0 17)} is VALID [2022-04-08 12:46:18,049 INFO L290 TraceCheckUtils]: 134: Hoare triple {163104#true} assume true; {163104#true} is VALID [2022-04-08 12:46:18,049 INFO L290 TraceCheckUtils]: 133: Hoare triple {163104#true} assume !(0 == ~cond); {163104#true} is VALID [2022-04-08 12:46:18,049 INFO L290 TraceCheckUtils]: 132: Hoare triple {163104#true} ~cond := #in~cond; {163104#true} is VALID [2022-04-08 12:46:18,049 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-08 12:46:18,049 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-08 12:46:18,050 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-08 12:46:18,051 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-08 12:46:18,051 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {163104#true} {163536#(<= ~counter~0 16)} #96#return; {163536#(<= ~counter~0 16)} is VALID [2022-04-08 12:46:18,051 INFO L290 TraceCheckUtils]: 126: Hoare triple {163104#true} assume true; {163104#true} is VALID [2022-04-08 12:46:18,051 INFO L290 TraceCheckUtils]: 125: Hoare triple {163104#true} assume !(0 == ~cond); {163104#true} is VALID [2022-04-08 12:46:18,051 INFO L290 TraceCheckUtils]: 124: Hoare triple {163104#true} ~cond := #in~cond; {163104#true} is VALID [2022-04-08 12:46:18,051 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-08 12:46:18,051 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-08 12:46:18,053 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-08 12:46:18,053 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-08 12:46:18,053 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {163104#true} {163511#(<= ~counter~0 15)} #96#return; {163511#(<= ~counter~0 15)} is VALID [2022-04-08 12:46:18,054 INFO L290 TraceCheckUtils]: 118: Hoare triple {163104#true} assume true; {163104#true} is VALID [2022-04-08 12:46:18,054 INFO L290 TraceCheckUtils]: 117: Hoare triple {163104#true} assume !(0 == ~cond); {163104#true} is VALID [2022-04-08 12:46:18,054 INFO L290 TraceCheckUtils]: 116: Hoare triple {163104#true} ~cond := #in~cond; {163104#true} is VALID [2022-04-08 12:46:18,054 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-08 12:46:18,054 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-08 12:46:18,055 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-08 12:46:18,056 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-08 12:46:18,056 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {163104#true} {163486#(<= ~counter~0 14)} #96#return; {163486#(<= ~counter~0 14)} is VALID [2022-04-08 12:46:18,056 INFO L290 TraceCheckUtils]: 110: Hoare triple {163104#true} assume true; {163104#true} is VALID [2022-04-08 12:46:18,056 INFO L290 TraceCheckUtils]: 109: Hoare triple {163104#true} assume !(0 == ~cond); {163104#true} is VALID [2022-04-08 12:46:18,056 INFO L290 TraceCheckUtils]: 108: Hoare triple {163104#true} ~cond := #in~cond; {163104#true} is VALID [2022-04-08 12:46:18,056 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-08 12:46:18,056 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-08 12:46:18,058 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-08 12:46:18,058 INFO L290 TraceCheckUtils]: 104: Hoare triple {163461#(<= ~counter~0 13)} assume !!(0 != ~r~0); {163461#(<= ~counter~0 13)} is VALID [2022-04-08 12:46:18,058 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {163104#true} {163461#(<= ~counter~0 13)} #94#return; {163461#(<= ~counter~0 13)} is VALID [2022-04-08 12:46:18,059 INFO L290 TraceCheckUtils]: 102: Hoare triple {163104#true} assume true; {163104#true} is VALID [2022-04-08 12:46:18,059 INFO L290 TraceCheckUtils]: 101: Hoare triple {163104#true} assume !(0 == ~cond); {163104#true} is VALID [2022-04-08 12:46:18,059 INFO L290 TraceCheckUtils]: 100: Hoare triple {163104#true} ~cond := #in~cond; {163104#true} is VALID [2022-04-08 12:46:18,059 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-08 12:46:18,059 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-08 12:46:18,060 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-08 12:46:18,061 INFO L290 TraceCheckUtils]: 96: Hoare triple {163436#(<= ~counter~0 12)} assume !(~r~0 < 0); {163436#(<= ~counter~0 12)} is VALID [2022-04-08 12:46:18,061 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {163104#true} {163436#(<= ~counter~0 12)} #98#return; {163436#(<= ~counter~0 12)} is VALID [2022-04-08 12:46:18,061 INFO L290 TraceCheckUtils]: 94: Hoare triple {163104#true} assume true; {163104#true} is VALID [2022-04-08 12:46:18,061 INFO L290 TraceCheckUtils]: 93: Hoare triple {163104#true} assume !(0 == ~cond); {163104#true} is VALID [2022-04-08 12:46:18,061 INFO L290 TraceCheckUtils]: 92: Hoare triple {163104#true} ~cond := #in~cond; {163104#true} is VALID [2022-04-08 12:46:18,061 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-08 12:46:18,061 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-08 12:46:18,063 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-08 12:46:18,063 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-08 12:46:18,063 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {163104#true} {163411#(<= ~counter~0 11)} #98#return; {163411#(<= ~counter~0 11)} is VALID [2022-04-08 12:46:18,064 INFO L290 TraceCheckUtils]: 86: Hoare triple {163104#true} assume true; {163104#true} is VALID [2022-04-08 12:46:18,064 INFO L290 TraceCheckUtils]: 85: Hoare triple {163104#true} assume !(0 == ~cond); {163104#true} is VALID [2022-04-08 12:46:18,064 INFO L290 TraceCheckUtils]: 84: Hoare triple {163104#true} ~cond := #in~cond; {163104#true} is VALID [2022-04-08 12:46:18,064 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-08 12:46:18,064 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-08 12:46:18,065 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-08 12:46:18,066 INFO L290 TraceCheckUtils]: 80: Hoare triple {163386#(<= ~counter~0 10)} assume !(~r~0 > 0); {163386#(<= ~counter~0 10)} is VALID [2022-04-08 12:46:18,066 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {163104#true} {163386#(<= ~counter~0 10)} #96#return; {163386#(<= ~counter~0 10)} is VALID [2022-04-08 12:46:18,066 INFO L290 TraceCheckUtils]: 78: Hoare triple {163104#true} assume true; {163104#true} is VALID [2022-04-08 12:46:18,066 INFO L290 TraceCheckUtils]: 77: Hoare triple {163104#true} assume !(0 == ~cond); {163104#true} is VALID [2022-04-08 12:46:18,066 INFO L290 TraceCheckUtils]: 76: Hoare triple {163104#true} ~cond := #in~cond; {163104#true} is VALID [2022-04-08 12:46:18,066 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-08 12:46:18,066 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-08 12:46:18,068 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-08 12:46:18,068 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-08 12:46:18,068 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {163104#true} {163361#(<= ~counter~0 9)} #96#return; {163361#(<= ~counter~0 9)} is VALID [2022-04-08 12:46:18,069 INFO L290 TraceCheckUtils]: 70: Hoare triple {163104#true} assume true; {163104#true} is VALID [2022-04-08 12:46:18,069 INFO L290 TraceCheckUtils]: 69: Hoare triple {163104#true} assume !(0 == ~cond); {163104#true} is VALID [2022-04-08 12:46:18,069 INFO L290 TraceCheckUtils]: 68: Hoare triple {163104#true} ~cond := #in~cond; {163104#true} is VALID [2022-04-08 12:46:18,069 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-08 12:46:18,069 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-08 12:46:18,070 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-08 12:46:18,070 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-08 12:46:18,071 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {163104#true} {163336#(<= ~counter~0 8)} #96#return; {163336#(<= ~counter~0 8)} is VALID [2022-04-08 12:46:18,071 INFO L290 TraceCheckUtils]: 62: Hoare triple {163104#true} assume true; {163104#true} is VALID [2022-04-08 12:46:18,071 INFO L290 TraceCheckUtils]: 61: Hoare triple {163104#true} assume !(0 == ~cond); {163104#true} is VALID [2022-04-08 12:46:18,071 INFO L290 TraceCheckUtils]: 60: Hoare triple {163104#true} ~cond := #in~cond; {163104#true} is VALID [2022-04-08 12:46:18,071 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-08 12:46:18,071 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-08 12:46:18,073 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-08 12:46:18,073 INFO L290 TraceCheckUtils]: 56: Hoare triple {163311#(<= ~counter~0 7)} assume !!(0 != ~r~0); {163311#(<= ~counter~0 7)} is VALID [2022-04-08 12:46:18,073 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {163104#true} {163311#(<= ~counter~0 7)} #94#return; {163311#(<= ~counter~0 7)} is VALID [2022-04-08 12:46:18,073 INFO L290 TraceCheckUtils]: 54: Hoare triple {163104#true} assume true; {163104#true} is VALID [2022-04-08 12:46:18,074 INFO L290 TraceCheckUtils]: 53: Hoare triple {163104#true} assume !(0 == ~cond); {163104#true} is VALID [2022-04-08 12:46:18,074 INFO L290 TraceCheckUtils]: 52: Hoare triple {163104#true} ~cond := #in~cond; {163104#true} is VALID [2022-04-08 12:46:18,074 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-08 12:46:18,074 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-08 12:46:18,075 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-08 12:46:18,075 INFO L290 TraceCheckUtils]: 48: Hoare triple {163286#(<= ~counter~0 6)} assume !(~r~0 < 0); {163286#(<= ~counter~0 6)} is VALID [2022-04-08 12:46:18,076 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {163104#true} {163286#(<= ~counter~0 6)} #98#return; {163286#(<= ~counter~0 6)} is VALID [2022-04-08 12:46:18,076 INFO L290 TraceCheckUtils]: 46: Hoare triple {163104#true} assume true; {163104#true} is VALID [2022-04-08 12:46:18,076 INFO L290 TraceCheckUtils]: 45: Hoare triple {163104#true} assume !(0 == ~cond); {163104#true} is VALID [2022-04-08 12:46:18,076 INFO L290 TraceCheckUtils]: 44: Hoare triple {163104#true} ~cond := #in~cond; {163104#true} is VALID [2022-04-08 12:46:18,076 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-08 12:46:18,076 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-08 12:46:18,078 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-08 12:46:18,078 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-08 12:46:18,078 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {163104#true} {163261#(<= ~counter~0 5)} #98#return; {163261#(<= ~counter~0 5)} is VALID [2022-04-08 12:46:18,078 INFO L290 TraceCheckUtils]: 38: Hoare triple {163104#true} assume true; {163104#true} is VALID [2022-04-08 12:46:18,079 INFO L290 TraceCheckUtils]: 37: Hoare triple {163104#true} assume !(0 == ~cond); {163104#true} is VALID [2022-04-08 12:46:18,079 INFO L290 TraceCheckUtils]: 36: Hoare triple {163104#true} ~cond := #in~cond; {163104#true} is VALID [2022-04-08 12:46:18,079 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-08 12:46:18,079 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-08 12:46:18,080 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-08 12:46:18,080 INFO L290 TraceCheckUtils]: 32: Hoare triple {163236#(<= ~counter~0 4)} assume !(~r~0 > 0); {163236#(<= ~counter~0 4)} is VALID [2022-04-08 12:46:18,081 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {163104#true} {163236#(<= ~counter~0 4)} #96#return; {163236#(<= ~counter~0 4)} is VALID [2022-04-08 12:46:18,081 INFO L290 TraceCheckUtils]: 30: Hoare triple {163104#true} assume true; {163104#true} is VALID [2022-04-08 12:46:18,081 INFO L290 TraceCheckUtils]: 29: Hoare triple {163104#true} assume !(0 == ~cond); {163104#true} is VALID [2022-04-08 12:46:18,081 INFO L290 TraceCheckUtils]: 28: Hoare triple {163104#true} ~cond := #in~cond; {163104#true} is VALID [2022-04-08 12:46:18,081 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-08 12:46:18,081 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-08 12:46:18,083 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-08 12:46:18,083 INFO L290 TraceCheckUtils]: 24: Hoare triple {163211#(<= ~counter~0 3)} assume !!(0 != ~r~0); {163211#(<= ~counter~0 3)} is VALID [2022-04-08 12:46:18,084 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {163104#true} {163211#(<= ~counter~0 3)} #94#return; {163211#(<= ~counter~0 3)} is VALID [2022-04-08 12:46:18,084 INFO L290 TraceCheckUtils]: 22: Hoare triple {163104#true} assume true; {163104#true} is VALID [2022-04-08 12:46:18,084 INFO L290 TraceCheckUtils]: 21: Hoare triple {163104#true} assume !(0 == ~cond); {163104#true} is VALID [2022-04-08 12:46:18,084 INFO L290 TraceCheckUtils]: 20: Hoare triple {163104#true} ~cond := #in~cond; {163104#true} is VALID [2022-04-08 12:46:18,084 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-08 12:46:18,084 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-08 12:46:18,085 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-08 12:46:18,086 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-08 12:46:18,086 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {163104#true} {163186#(<= ~counter~0 2)} #92#return; {163186#(<= ~counter~0 2)} is VALID [2022-04-08 12:46:18,086 INFO L290 TraceCheckUtils]: 14: Hoare triple {163104#true} assume true; {163104#true} is VALID [2022-04-08 12:46:18,086 INFO L290 TraceCheckUtils]: 13: Hoare triple {163104#true} assume !(0 == ~cond); {163104#true} is VALID [2022-04-08 12:46:18,086 INFO L290 TraceCheckUtils]: 12: Hoare triple {163104#true} ~cond := #in~cond; {163104#true} is VALID [2022-04-08 12:46:18,086 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-08 12:46:18,087 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {163104#true} {163186#(<= ~counter~0 2)} #90#return; {163186#(<= ~counter~0 2)} is VALID [2022-04-08 12:46:18,087 INFO L290 TraceCheckUtils]: 9: Hoare triple {163104#true} assume true; {163104#true} is VALID [2022-04-08 12:46:18,087 INFO L290 TraceCheckUtils]: 8: Hoare triple {163104#true} assume !(0 == ~cond); {163104#true} is VALID [2022-04-08 12:46:18,087 INFO L290 TraceCheckUtils]: 7: Hoare triple {163104#true} ~cond := #in~cond; {163104#true} is VALID [2022-04-08 12:46:18,087 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-08 12:46:18,087 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-08 12:46:18,088 INFO L272 TraceCheckUtils]: 4: Hoare triple {163186#(<= ~counter~0 2)} call #t~ret9 := main(); {163186#(<= ~counter~0 2)} is VALID [2022-04-08 12:46:18,088 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {163186#(<= ~counter~0 2)} {163104#true} #102#return; {163186#(<= ~counter~0 2)} is VALID [2022-04-08 12:46:18,088 INFO L290 TraceCheckUtils]: 2: Hoare triple {163186#(<= ~counter~0 2)} assume true; {163186#(<= ~counter~0 2)} is VALID [2022-04-08 12:46:18,088 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-08 12:46:18,089 INFO L272 TraceCheckUtils]: 0: Hoare triple {163104#true} call ULTIMATE.init(); {163104#true} is VALID [2022-04-08 12:46:18,089 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-08 12:46:18,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:46:18,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546294144] [2022-04-08 12:46:18,089 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:46:18,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317050804] [2022-04-08 12:46:18,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [317050804] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:46:18,089 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:46:18,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 24 [2022-04-08 12:46:18,090 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:46:18,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [798085145] [2022-04-08 12:46:18,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [798085145] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:46:18,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:46:18,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-08 12:46:18,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754860615] [2022-04-08 12:46:18,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:46:18,090 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-08 12:46:18,090 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:46:18,091 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-08 12:46:18,265 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-08 12:46:18,265 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-08 12:46:18,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:46:18,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-08 12:46:18,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-08 12:46:18,266 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-08 12:46:23,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:46:23,648 INFO L93 Difference]: Finished difference Result 902 states and 1201 transitions. [2022-04-08 12:46:23,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-08 12:46:23,649 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-08 12:46:23,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:46:23,649 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-08 12:46:23,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 354 transitions. [2022-04-08 12:46:23,651 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-08 12:46:23,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 354 transitions. [2022-04-08 12:46:23,653 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 354 transitions. [2022-04-08 12:46:24,088 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-08 12:46:24,120 INFO L225 Difference]: With dead ends: 902 [2022-04-08 12:46:24,120 INFO L226 Difference]: Without dead ends: 897 [2022-04-08 12:46:24,120 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 294 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=519, Invalid=887, Unknown=0, NotChecked=0, Total=1406 [2022-04-08 12:46:24,120 INFO L913 BasicCegarLoop]: 81 mSDtfsCounter, 268 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 234 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.7s IncrementalHoareTripleChecker+Time [2022-04-08 12:46:24,120 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [268 Valid, 397 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [234 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-08 12:46:24,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2022-04-08 12:46:27,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 875. [2022-04-08 12:46:27,336 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:46:27,337 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-08 12:46:27,337 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-08 12:46:27,338 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-08 12:46:27,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:46:27,363 INFO L93 Difference]: Finished difference Result 897 states and 1195 transitions. [2022-04-08 12:46:27,363 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1195 transitions. [2022-04-08 12:46:27,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:46:27,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:46:27,365 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-08 12:46:27,365 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-08 12:46:27,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:46:27,390 INFO L93 Difference]: Finished difference Result 897 states and 1195 transitions. [2022-04-08 12:46:27,390 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1195 transitions. [2022-04-08 12:46:27,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:46:27,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:46:27,391 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:46:27,391 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:46:27,392 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-08 12:46:27,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1169 transitions. [2022-04-08 12:46:27,428 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1169 transitions. Word has length 159 [2022-04-08 12:46:27,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:46:27,428 INFO L478 AbstractCegarLoop]: Abstraction has 875 states and 1169 transitions. [2022-04-08 12:46:27,428 INFO L479 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-08 12:46:27,428 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 875 states and 1169 transitions. [2022-04-08 12:46:37,575 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1169 edges. 1169 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:46:37,575 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1169 transitions. [2022-04-08 12:46:37,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-04-08 12:46:37,577 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:46:37,577 INFO L499 BasicCegarLoop]: 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-08 12:46:37,584 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-08 12:46:37,777 WARN L460 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-08 12:46:37,777 INFO L403 AbstractCegarLoop]: === Iteration 56 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:46:37,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:46:37,778 INFO L85 PathProgramCache]: Analyzing trace with hash -160708573, now seen corresponding path program 29 times [2022-04-08 12:46:37,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:46:37,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1199594192] [2022-04-08 12:46:37,778 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:46:37,778 INFO L85 PathProgramCache]: Analyzing trace with hash -160708573, now seen corresponding path program 30 times [2022-04-08 12:46:37,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:46:37,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037578275] [2022-04-08 12:46:37,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:46:37,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:46:37,792 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:46:37,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [741668739] [2022-04-08 12:46:37,792 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 12:46:37,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:46:37,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:46:37,793 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-08 12:46:37,794 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-08 12:46:38,814 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-08 12:46:38,814 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:46:38,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-08 12:46:38,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:46:38,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:46:39,652 INFO L272 TraceCheckUtils]: 0: Hoare triple {169457#true} call ULTIMATE.init(); {169457#true} is VALID [2022-04-08 12:46:39,653 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-08 12:46:39,653 INFO L290 TraceCheckUtils]: 2: Hoare triple {169465#(<= ~counter~0 0)} assume true; {169465#(<= ~counter~0 0)} is VALID [2022-04-08 12:46:39,654 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {169465#(<= ~counter~0 0)} {169457#true} #102#return; {169465#(<= ~counter~0 0)} is VALID [2022-04-08 12:46:39,654 INFO L272 TraceCheckUtils]: 4: Hoare triple {169465#(<= ~counter~0 0)} call #t~ret9 := main(); {169465#(<= ~counter~0 0)} is VALID [2022-04-08 12:46:39,654 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-08 12:46:39,655 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-08 12:46:39,655 INFO L290 TraceCheckUtils]: 7: Hoare triple {169465#(<= ~counter~0 0)} ~cond := #in~cond; {169465#(<= ~counter~0 0)} is VALID [2022-04-08 12:46:39,655 INFO L290 TraceCheckUtils]: 8: Hoare triple {169465#(<= ~counter~0 0)} assume !(0 == ~cond); {169465#(<= ~counter~0 0)} is VALID [2022-04-08 12:46:39,655 INFO L290 TraceCheckUtils]: 9: Hoare triple {169465#(<= ~counter~0 0)} assume true; {169465#(<= ~counter~0 0)} is VALID [2022-04-08 12:46:39,656 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {169465#(<= ~counter~0 0)} {169465#(<= ~counter~0 0)} #90#return; {169465#(<= ~counter~0 0)} is VALID [2022-04-08 12:46:39,656 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-08 12:46:39,657 INFO L290 TraceCheckUtils]: 12: Hoare triple {169465#(<= ~counter~0 0)} ~cond := #in~cond; {169465#(<= ~counter~0 0)} is VALID [2022-04-08 12:46:39,657 INFO L290 TraceCheckUtils]: 13: Hoare triple {169465#(<= ~counter~0 0)} assume !(0 == ~cond); {169465#(<= ~counter~0 0)} is VALID [2022-04-08 12:46:39,657 INFO L290 TraceCheckUtils]: 14: Hoare triple {169465#(<= ~counter~0 0)} assume true; {169465#(<= ~counter~0 0)} is VALID [2022-04-08 12:46:39,658 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {169465#(<= ~counter~0 0)} {169465#(<= ~counter~0 0)} #92#return; {169465#(<= ~counter~0 0)} is VALID [2022-04-08 12:46:39,658 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-08 12:46:39,662 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-08 12:46:39,662 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-08 12:46:39,663 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-08 12:46:39,663 INFO L290 TraceCheckUtils]: 20: Hoare triple {169514#(<= ~counter~0 1)} ~cond := #in~cond; {169514#(<= ~counter~0 1)} is VALID [2022-04-08 12:46:39,663 INFO L290 TraceCheckUtils]: 21: Hoare triple {169514#(<= ~counter~0 1)} assume !(0 == ~cond); {169514#(<= ~counter~0 1)} is VALID [2022-04-08 12:46:39,663 INFO L290 TraceCheckUtils]: 22: Hoare triple {169514#(<= ~counter~0 1)} assume true; {169514#(<= ~counter~0 1)} is VALID [2022-04-08 12:46:39,664 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {169514#(<= ~counter~0 1)} {169514#(<= ~counter~0 1)} #94#return; {169514#(<= ~counter~0 1)} is VALID [2022-04-08 12:46:39,664 INFO L290 TraceCheckUtils]: 24: Hoare triple {169514#(<= ~counter~0 1)} assume !!(0 != ~r~0); {169514#(<= ~counter~0 1)} is VALID [2022-04-08 12:46:39,666 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-08 12:46:39,666 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-08 12:46:39,666 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-08 12:46:39,667 INFO L290 TraceCheckUtils]: 28: Hoare triple {169539#(<= ~counter~0 2)} ~cond := #in~cond; {169539#(<= ~counter~0 2)} is VALID [2022-04-08 12:46:39,667 INFO L290 TraceCheckUtils]: 29: Hoare triple {169539#(<= ~counter~0 2)} assume !(0 == ~cond); {169539#(<= ~counter~0 2)} is VALID [2022-04-08 12:46:39,667 INFO L290 TraceCheckUtils]: 30: Hoare triple {169539#(<= ~counter~0 2)} assume true; {169539#(<= ~counter~0 2)} is VALID [2022-04-08 12:46:39,667 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {169539#(<= ~counter~0 2)} {169539#(<= ~counter~0 2)} #96#return; {169539#(<= ~counter~0 2)} is VALID [2022-04-08 12:46:39,668 INFO L290 TraceCheckUtils]: 32: Hoare triple {169539#(<= ~counter~0 2)} assume !(~r~0 > 0); {169539#(<= ~counter~0 2)} is VALID [2022-04-08 12:46:39,669 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-08 12:46:39,669 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-08 12:46:39,670 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-08 12:46:39,670 INFO L290 TraceCheckUtils]: 36: Hoare triple {169564#(<= ~counter~0 3)} ~cond := #in~cond; {169564#(<= ~counter~0 3)} is VALID [2022-04-08 12:46:39,670 INFO L290 TraceCheckUtils]: 37: Hoare triple {169564#(<= ~counter~0 3)} assume !(0 == ~cond); {169564#(<= ~counter~0 3)} is VALID [2022-04-08 12:46:39,671 INFO L290 TraceCheckUtils]: 38: Hoare triple {169564#(<= ~counter~0 3)} assume true; {169564#(<= ~counter~0 3)} is VALID [2022-04-08 12:46:39,671 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {169564#(<= ~counter~0 3)} {169564#(<= ~counter~0 3)} #98#return; {169564#(<= ~counter~0 3)} is VALID [2022-04-08 12:46:39,671 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-08 12:46:39,673 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-08 12:46:39,673 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-08 12:46:39,673 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-08 12:46:39,674 INFO L290 TraceCheckUtils]: 44: Hoare triple {169589#(<= ~counter~0 4)} ~cond := #in~cond; {169589#(<= ~counter~0 4)} is VALID [2022-04-08 12:46:39,674 INFO L290 TraceCheckUtils]: 45: Hoare triple {169589#(<= ~counter~0 4)} assume !(0 == ~cond); {169589#(<= ~counter~0 4)} is VALID [2022-04-08 12:46:39,674 INFO L290 TraceCheckUtils]: 46: Hoare triple {169589#(<= ~counter~0 4)} assume true; {169589#(<= ~counter~0 4)} is VALID [2022-04-08 12:46:39,675 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {169589#(<= ~counter~0 4)} {169589#(<= ~counter~0 4)} #98#return; {169589#(<= ~counter~0 4)} is VALID [2022-04-08 12:46:39,675 INFO L290 TraceCheckUtils]: 48: Hoare triple {169589#(<= ~counter~0 4)} assume !(~r~0 < 0); {169589#(<= ~counter~0 4)} is VALID [2022-04-08 12:46:39,676 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-08 12:46:39,677 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-08 12:46:39,677 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-08 12:46:39,677 INFO L290 TraceCheckUtils]: 52: Hoare triple {169614#(<= ~counter~0 5)} ~cond := #in~cond; {169614#(<= ~counter~0 5)} is VALID [2022-04-08 12:46:39,678 INFO L290 TraceCheckUtils]: 53: Hoare triple {169614#(<= ~counter~0 5)} assume !(0 == ~cond); {169614#(<= ~counter~0 5)} is VALID [2022-04-08 12:46:39,678 INFO L290 TraceCheckUtils]: 54: Hoare triple {169614#(<= ~counter~0 5)} assume true; {169614#(<= ~counter~0 5)} is VALID [2022-04-08 12:46:39,678 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {169614#(<= ~counter~0 5)} {169614#(<= ~counter~0 5)} #94#return; {169614#(<= ~counter~0 5)} is VALID [2022-04-08 12:46:39,678 INFO L290 TraceCheckUtils]: 56: Hoare triple {169614#(<= ~counter~0 5)} assume !!(0 != ~r~0); {169614#(<= ~counter~0 5)} is VALID [2022-04-08 12:46:39,680 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-08 12:46:39,680 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-08 12:46:39,681 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-08 12:46:39,681 INFO L290 TraceCheckUtils]: 60: Hoare triple {169639#(<= ~counter~0 6)} ~cond := #in~cond; {169639#(<= ~counter~0 6)} is VALID [2022-04-08 12:46:39,681 INFO L290 TraceCheckUtils]: 61: Hoare triple {169639#(<= ~counter~0 6)} assume !(0 == ~cond); {169639#(<= ~counter~0 6)} is VALID [2022-04-08 12:46:39,681 INFO L290 TraceCheckUtils]: 62: Hoare triple {169639#(<= ~counter~0 6)} assume true; {169639#(<= ~counter~0 6)} is VALID [2022-04-08 12:46:39,682 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {169639#(<= ~counter~0 6)} {169639#(<= ~counter~0 6)} #96#return; {169639#(<= ~counter~0 6)} is VALID [2022-04-08 12:46:39,682 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-08 12:46:39,684 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-08 12:46:39,684 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-08 12:46:39,684 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-08 12:46:39,685 INFO L290 TraceCheckUtils]: 68: Hoare triple {169664#(<= ~counter~0 7)} ~cond := #in~cond; {169664#(<= ~counter~0 7)} is VALID [2022-04-08 12:46:39,685 INFO L290 TraceCheckUtils]: 69: Hoare triple {169664#(<= ~counter~0 7)} assume !(0 == ~cond); {169664#(<= ~counter~0 7)} is VALID [2022-04-08 12:46:39,685 INFO L290 TraceCheckUtils]: 70: Hoare triple {169664#(<= ~counter~0 7)} assume true; {169664#(<= ~counter~0 7)} is VALID [2022-04-08 12:46:39,685 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {169664#(<= ~counter~0 7)} {169664#(<= ~counter~0 7)} #96#return; {169664#(<= ~counter~0 7)} is VALID [2022-04-08 12:46:39,686 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-08 12:46:39,687 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-08 12:46:39,687 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-08 12:46:39,688 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-08 12:46:39,688 INFO L290 TraceCheckUtils]: 76: Hoare triple {169689#(<= ~counter~0 8)} ~cond := #in~cond; {169689#(<= ~counter~0 8)} is VALID [2022-04-08 12:46:39,688 INFO L290 TraceCheckUtils]: 77: Hoare triple {169689#(<= ~counter~0 8)} assume !(0 == ~cond); {169689#(<= ~counter~0 8)} is VALID [2022-04-08 12:46:39,689 INFO L290 TraceCheckUtils]: 78: Hoare triple {169689#(<= ~counter~0 8)} assume true; {169689#(<= ~counter~0 8)} is VALID [2022-04-08 12:46:39,689 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {169689#(<= ~counter~0 8)} {169689#(<= ~counter~0 8)} #96#return; {169689#(<= ~counter~0 8)} is VALID [2022-04-08 12:46:39,689 INFO L290 TraceCheckUtils]: 80: Hoare triple {169689#(<= ~counter~0 8)} assume !(~r~0 > 0); {169689#(<= ~counter~0 8)} is VALID [2022-04-08 12:46:39,691 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-08 12:46:39,691 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-08 12:46:39,691 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-08 12:46:39,692 INFO L290 TraceCheckUtils]: 84: Hoare triple {169714#(<= ~counter~0 9)} ~cond := #in~cond; {169714#(<= ~counter~0 9)} is VALID [2022-04-08 12:46:39,692 INFO L290 TraceCheckUtils]: 85: Hoare triple {169714#(<= ~counter~0 9)} assume !(0 == ~cond); {169714#(<= ~counter~0 9)} is VALID [2022-04-08 12:46:39,692 INFO L290 TraceCheckUtils]: 86: Hoare triple {169714#(<= ~counter~0 9)} assume true; {169714#(<= ~counter~0 9)} is VALID [2022-04-08 12:46:39,693 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {169714#(<= ~counter~0 9)} {169714#(<= ~counter~0 9)} #98#return; {169714#(<= ~counter~0 9)} is VALID [2022-04-08 12:46:39,693 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-08 12:46:39,694 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-08 12:46:39,695 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-08 12:46:39,695 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-08 12:46:39,695 INFO L290 TraceCheckUtils]: 92: Hoare triple {169739#(<= ~counter~0 10)} ~cond := #in~cond; {169739#(<= ~counter~0 10)} is VALID [2022-04-08 12:46:39,696 INFO L290 TraceCheckUtils]: 93: Hoare triple {169739#(<= ~counter~0 10)} assume !(0 == ~cond); {169739#(<= ~counter~0 10)} is VALID [2022-04-08 12:46:39,696 INFO L290 TraceCheckUtils]: 94: Hoare triple {169739#(<= ~counter~0 10)} assume true; {169739#(<= ~counter~0 10)} is VALID [2022-04-08 12:46:39,696 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {169739#(<= ~counter~0 10)} {169739#(<= ~counter~0 10)} #98#return; {169739#(<= ~counter~0 10)} is VALID [2022-04-08 12:46:39,697 INFO L290 TraceCheckUtils]: 96: Hoare triple {169739#(<= ~counter~0 10)} assume !(~r~0 < 0); {169739#(<= ~counter~0 10)} is VALID [2022-04-08 12:46:39,698 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-08 12:46:39,698 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-08 12:46:39,699 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-08 12:46:39,699 INFO L290 TraceCheckUtils]: 100: Hoare triple {169764#(<= ~counter~0 11)} ~cond := #in~cond; {169764#(<= ~counter~0 11)} is VALID [2022-04-08 12:46:39,699 INFO L290 TraceCheckUtils]: 101: Hoare triple {169764#(<= ~counter~0 11)} assume !(0 == ~cond); {169764#(<= ~counter~0 11)} is VALID [2022-04-08 12:46:39,699 INFO L290 TraceCheckUtils]: 102: Hoare triple {169764#(<= ~counter~0 11)} assume true; {169764#(<= ~counter~0 11)} is VALID [2022-04-08 12:46:39,700 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {169764#(<= ~counter~0 11)} {169764#(<= ~counter~0 11)} #94#return; {169764#(<= ~counter~0 11)} is VALID [2022-04-08 12:46:39,700 INFO L290 TraceCheckUtils]: 104: Hoare triple {169764#(<= ~counter~0 11)} assume !!(0 != ~r~0); {169764#(<= ~counter~0 11)} is VALID [2022-04-08 12:46:39,701 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-08 12:46:39,702 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-08 12:46:39,702 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-08 12:46:39,702 INFO L290 TraceCheckUtils]: 108: Hoare triple {169789#(<= ~counter~0 12)} ~cond := #in~cond; {169789#(<= ~counter~0 12)} is VALID [2022-04-08 12:46:39,703 INFO L290 TraceCheckUtils]: 109: Hoare triple {169789#(<= ~counter~0 12)} assume !(0 == ~cond); {169789#(<= ~counter~0 12)} is VALID [2022-04-08 12:46:39,703 INFO L290 TraceCheckUtils]: 110: Hoare triple {169789#(<= ~counter~0 12)} assume true; {169789#(<= ~counter~0 12)} is VALID [2022-04-08 12:46:39,703 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {169789#(<= ~counter~0 12)} {169789#(<= ~counter~0 12)} #96#return; {169789#(<= ~counter~0 12)} is VALID [2022-04-08 12:46:39,704 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-08 12:46:39,705 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-08 12:46:39,705 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-08 12:46:39,706 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-08 12:46:39,706 INFO L290 TraceCheckUtils]: 116: Hoare triple {169814#(<= ~counter~0 13)} ~cond := #in~cond; {169814#(<= ~counter~0 13)} is VALID [2022-04-08 12:46:39,706 INFO L290 TraceCheckUtils]: 117: Hoare triple {169814#(<= ~counter~0 13)} assume !(0 == ~cond); {169814#(<= ~counter~0 13)} is VALID [2022-04-08 12:46:39,706 INFO L290 TraceCheckUtils]: 118: Hoare triple {169814#(<= ~counter~0 13)} assume true; {169814#(<= ~counter~0 13)} is VALID [2022-04-08 12:46:39,707 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {169814#(<= ~counter~0 13)} {169814#(<= ~counter~0 13)} #96#return; {169814#(<= ~counter~0 13)} is VALID [2022-04-08 12:46:39,707 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-08 12:46:39,709 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-08 12:46:39,709 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-08 12:46:39,710 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-08 12:46:39,710 INFO L290 TraceCheckUtils]: 124: Hoare triple {169839#(<= ~counter~0 14)} ~cond := #in~cond; {169839#(<= ~counter~0 14)} is VALID [2022-04-08 12:46:39,710 INFO L290 TraceCheckUtils]: 125: Hoare triple {169839#(<= ~counter~0 14)} assume !(0 == ~cond); {169839#(<= ~counter~0 14)} is VALID [2022-04-08 12:46:39,710 INFO L290 TraceCheckUtils]: 126: Hoare triple {169839#(<= ~counter~0 14)} assume true; {169839#(<= ~counter~0 14)} is VALID [2022-04-08 12:46:39,711 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {169839#(<= ~counter~0 14)} {169839#(<= ~counter~0 14)} #96#return; {169839#(<= ~counter~0 14)} is VALID [2022-04-08 12:46:39,711 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-08 12:46:39,713 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-08 12:46:39,713 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-08 12:46:39,713 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-08 12:46:39,714 INFO L290 TraceCheckUtils]: 132: Hoare triple {169864#(<= ~counter~0 15)} ~cond := #in~cond; {169864#(<= ~counter~0 15)} is VALID [2022-04-08 12:46:39,714 INFO L290 TraceCheckUtils]: 133: Hoare triple {169864#(<= ~counter~0 15)} assume !(0 == ~cond); {169864#(<= ~counter~0 15)} is VALID [2022-04-08 12:46:39,714 INFO L290 TraceCheckUtils]: 134: Hoare triple {169864#(<= ~counter~0 15)} assume true; {169864#(<= ~counter~0 15)} is VALID [2022-04-08 12:46:39,715 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {169864#(<= ~counter~0 15)} {169864#(<= ~counter~0 15)} #96#return; {169864#(<= ~counter~0 15)} is VALID [2022-04-08 12:46:39,715 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-08 12:46:39,716 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-08 12:46:39,716 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-08 12:46:39,717 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-08 12:46:39,717 INFO L290 TraceCheckUtils]: 140: Hoare triple {169889#(<= ~counter~0 16)} ~cond := #in~cond; {169889#(<= ~counter~0 16)} is VALID [2022-04-08 12:46:39,717 INFO L290 TraceCheckUtils]: 141: Hoare triple {169889#(<= ~counter~0 16)} assume !(0 == ~cond); {169889#(<= ~counter~0 16)} is VALID [2022-04-08 12:46:39,718 INFO L290 TraceCheckUtils]: 142: Hoare triple {169889#(<= ~counter~0 16)} assume true; {169889#(<= ~counter~0 16)} is VALID [2022-04-08 12:46:39,718 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {169889#(<= ~counter~0 16)} {169889#(<= ~counter~0 16)} #96#return; {169889#(<= ~counter~0 16)} is VALID [2022-04-08 12:46:39,718 INFO L290 TraceCheckUtils]: 144: Hoare triple {169889#(<= ~counter~0 16)} assume !(~r~0 > 0); {169889#(<= ~counter~0 16)} is VALID [2022-04-08 12:46:39,720 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-08 12:46:39,720 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-08 12:46:39,720 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-08 12:46:39,721 INFO L290 TraceCheckUtils]: 148: Hoare triple {169914#(<= ~counter~0 17)} ~cond := #in~cond; {169914#(<= ~counter~0 17)} is VALID [2022-04-08 12:46:39,721 INFO L290 TraceCheckUtils]: 149: Hoare triple {169914#(<= ~counter~0 17)} assume !(0 == ~cond); {169914#(<= ~counter~0 17)} is VALID [2022-04-08 12:46:39,721 INFO L290 TraceCheckUtils]: 150: Hoare triple {169914#(<= ~counter~0 17)} assume true; {169914#(<= ~counter~0 17)} is VALID [2022-04-08 12:46:39,722 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {169914#(<= ~counter~0 17)} {169914#(<= ~counter~0 17)} #98#return; {169914#(<= ~counter~0 17)} is VALID [2022-04-08 12:46:39,722 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-08 12:46:39,722 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-08 12:46:39,723 INFO L290 TraceCheckUtils]: 154: Hoare triple {169939#(<= |main_#t~post8| 17)} assume !(#t~post8 < 20);havoc #t~post8; {169458#false} is VALID [2022-04-08 12:46:39,723 INFO L290 TraceCheckUtils]: 155: Hoare triple {169458#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {169458#false} is VALID [2022-04-08 12:46:39,723 INFO L290 TraceCheckUtils]: 156: Hoare triple {169458#false} assume !(#t~post6 < 20);havoc #t~post6; {169458#false} is VALID [2022-04-08 12:46:39,723 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-08 12:46:39,723 INFO L290 TraceCheckUtils]: 158: Hoare triple {169458#false} ~cond := #in~cond; {169458#false} is VALID [2022-04-08 12:46:39,723 INFO L290 TraceCheckUtils]: 159: Hoare triple {169458#false} assume 0 == ~cond; {169458#false} is VALID [2022-04-08 12:46:39,723 INFO L290 TraceCheckUtils]: 160: Hoare triple {169458#false} assume !false; {169458#false} is VALID [2022-04-08 12:46:39,724 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-08 12:46:39,724 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:46:40,411 INFO L290 TraceCheckUtils]: 160: Hoare triple {169458#false} assume !false; {169458#false} is VALID [2022-04-08 12:46:40,411 INFO L290 TraceCheckUtils]: 159: Hoare triple {169458#false} assume 0 == ~cond; {169458#false} is VALID [2022-04-08 12:46:40,411 INFO L290 TraceCheckUtils]: 158: Hoare triple {169458#false} ~cond := #in~cond; {169458#false} is VALID [2022-04-08 12:46:40,412 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-08 12:46:40,412 INFO L290 TraceCheckUtils]: 156: Hoare triple {169458#false} assume !(#t~post6 < 20);havoc #t~post6; {169458#false} is VALID [2022-04-08 12:46:40,412 INFO L290 TraceCheckUtils]: 155: Hoare triple {169458#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {169458#false} is VALID [2022-04-08 12:46:40,412 INFO L290 TraceCheckUtils]: 154: Hoare triple {169979#(< |main_#t~post8| 20)} assume !(#t~post8 < 20);havoc #t~post8; {169458#false} is VALID [2022-04-08 12:46:40,412 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-08 12:46:40,413 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-08 12:46:40,413 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {169457#true} {169983#(< ~counter~0 20)} #98#return; {169983#(< ~counter~0 20)} is VALID [2022-04-08 12:46:40,413 INFO L290 TraceCheckUtils]: 150: Hoare triple {169457#true} assume true; {169457#true} is VALID [2022-04-08 12:46:40,413 INFO L290 TraceCheckUtils]: 149: Hoare triple {169457#true} assume !(0 == ~cond); {169457#true} is VALID [2022-04-08 12:46:40,413 INFO L290 TraceCheckUtils]: 148: Hoare triple {169457#true} ~cond := #in~cond; {169457#true} is VALID [2022-04-08 12:46:40,413 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-08 12:46:40,414 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-08 12:46:40,418 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-08 12:46:40,418 INFO L290 TraceCheckUtils]: 144: Hoare triple {170008#(< ~counter~0 19)} assume !(~r~0 > 0); {170008#(< ~counter~0 19)} is VALID [2022-04-08 12:46:40,419 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {169457#true} {170008#(< ~counter~0 19)} #96#return; {170008#(< ~counter~0 19)} is VALID [2022-04-08 12:46:40,419 INFO L290 TraceCheckUtils]: 142: Hoare triple {169457#true} assume true; {169457#true} is VALID [2022-04-08 12:46:40,419 INFO L290 TraceCheckUtils]: 141: Hoare triple {169457#true} assume !(0 == ~cond); {169457#true} is VALID [2022-04-08 12:46:40,419 INFO L290 TraceCheckUtils]: 140: Hoare triple {169457#true} ~cond := #in~cond; {169457#true} is VALID [2022-04-08 12:46:40,419 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-08 12:46:40,419 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-08 12:46:40,422 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-08 12:46:40,423 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-08 12:46:40,423 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {169457#true} {169914#(<= ~counter~0 17)} #96#return; {169914#(<= ~counter~0 17)} is VALID [2022-04-08 12:46:40,423 INFO L290 TraceCheckUtils]: 134: Hoare triple {169457#true} assume true; {169457#true} is VALID [2022-04-08 12:46:40,423 INFO L290 TraceCheckUtils]: 133: Hoare triple {169457#true} assume !(0 == ~cond); {169457#true} is VALID [2022-04-08 12:46:40,424 INFO L290 TraceCheckUtils]: 132: Hoare triple {169457#true} ~cond := #in~cond; {169457#true} is VALID [2022-04-08 12:46:40,424 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-08 12:46:40,424 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-08 12:46:40,426 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-08 12:46:40,426 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-08 12:46:40,427 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {169457#true} {169889#(<= ~counter~0 16)} #96#return; {169889#(<= ~counter~0 16)} is VALID [2022-04-08 12:46:40,427 INFO L290 TraceCheckUtils]: 126: Hoare triple {169457#true} assume true; {169457#true} is VALID [2022-04-08 12:46:40,427 INFO L290 TraceCheckUtils]: 125: Hoare triple {169457#true} assume !(0 == ~cond); {169457#true} is VALID [2022-04-08 12:46:40,427 INFO L290 TraceCheckUtils]: 124: Hoare triple {169457#true} ~cond := #in~cond; {169457#true} is VALID [2022-04-08 12:46:40,427 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-08 12:46:40,427 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-08 12:46:40,429 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-08 12:46:40,429 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-08 12:46:40,430 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {169457#true} {169864#(<= ~counter~0 15)} #96#return; {169864#(<= ~counter~0 15)} is VALID [2022-04-08 12:46:40,430 INFO L290 TraceCheckUtils]: 118: Hoare triple {169457#true} assume true; {169457#true} is VALID [2022-04-08 12:46:40,430 INFO L290 TraceCheckUtils]: 117: Hoare triple {169457#true} assume !(0 == ~cond); {169457#true} is VALID [2022-04-08 12:46:40,430 INFO L290 TraceCheckUtils]: 116: Hoare triple {169457#true} ~cond := #in~cond; {169457#true} is VALID [2022-04-08 12:46:40,430 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-08 12:46:40,430 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-08 12:46:40,433 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-08 12:46:40,433 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-08 12:46:40,433 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {169457#true} {169839#(<= ~counter~0 14)} #96#return; {169839#(<= ~counter~0 14)} is VALID [2022-04-08 12:46:40,434 INFO L290 TraceCheckUtils]: 110: Hoare triple {169457#true} assume true; {169457#true} is VALID [2022-04-08 12:46:40,434 INFO L290 TraceCheckUtils]: 109: Hoare triple {169457#true} assume !(0 == ~cond); {169457#true} is VALID [2022-04-08 12:46:40,434 INFO L290 TraceCheckUtils]: 108: Hoare triple {169457#true} ~cond := #in~cond; {169457#true} is VALID [2022-04-08 12:46:40,434 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-08 12:46:40,434 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-08 12:46:40,436 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-08 12:46:40,437 INFO L290 TraceCheckUtils]: 104: Hoare triple {169814#(<= ~counter~0 13)} assume !!(0 != ~r~0); {169814#(<= ~counter~0 13)} is VALID [2022-04-08 12:46:40,437 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {169457#true} {169814#(<= ~counter~0 13)} #94#return; {169814#(<= ~counter~0 13)} is VALID [2022-04-08 12:46:40,437 INFO L290 TraceCheckUtils]: 102: Hoare triple {169457#true} assume true; {169457#true} is VALID [2022-04-08 12:46:40,437 INFO L290 TraceCheckUtils]: 101: Hoare triple {169457#true} assume !(0 == ~cond); {169457#true} is VALID [2022-04-08 12:46:40,437 INFO L290 TraceCheckUtils]: 100: Hoare triple {169457#true} ~cond := #in~cond; {169457#true} is VALID [2022-04-08 12:46:40,437 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-08 12:46:40,438 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-08 12:46:40,440 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-08 12:46:40,440 INFO L290 TraceCheckUtils]: 96: Hoare triple {169789#(<= ~counter~0 12)} assume !(~r~0 < 0); {169789#(<= ~counter~0 12)} is VALID [2022-04-08 12:46:40,440 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {169457#true} {169789#(<= ~counter~0 12)} #98#return; {169789#(<= ~counter~0 12)} is VALID [2022-04-08 12:46:40,440 INFO L290 TraceCheckUtils]: 94: Hoare triple {169457#true} assume true; {169457#true} is VALID [2022-04-08 12:46:40,441 INFO L290 TraceCheckUtils]: 93: Hoare triple {169457#true} assume !(0 == ~cond); {169457#true} is VALID [2022-04-08 12:46:40,441 INFO L290 TraceCheckUtils]: 92: Hoare triple {169457#true} ~cond := #in~cond; {169457#true} is VALID [2022-04-08 12:46:40,441 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-08 12:46:40,441 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-08 12:46:40,443 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-08 12:46:40,443 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-08 12:46:40,444 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {169457#true} {169764#(<= ~counter~0 11)} #98#return; {169764#(<= ~counter~0 11)} is VALID [2022-04-08 12:46:40,444 INFO L290 TraceCheckUtils]: 86: Hoare triple {169457#true} assume true; {169457#true} is VALID [2022-04-08 12:46:40,444 INFO L290 TraceCheckUtils]: 85: Hoare triple {169457#true} assume !(0 == ~cond); {169457#true} is VALID [2022-04-08 12:46:40,444 INFO L290 TraceCheckUtils]: 84: Hoare triple {169457#true} ~cond := #in~cond; {169457#true} is VALID [2022-04-08 12:46:40,444 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-08 12:46:40,444 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-08 12:46:40,446 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-08 12:46:40,446 INFO L290 TraceCheckUtils]: 80: Hoare triple {169739#(<= ~counter~0 10)} assume !(~r~0 > 0); {169739#(<= ~counter~0 10)} is VALID [2022-04-08 12:46:40,447 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {169457#true} {169739#(<= ~counter~0 10)} #96#return; {169739#(<= ~counter~0 10)} is VALID [2022-04-08 12:46:40,447 INFO L290 TraceCheckUtils]: 78: Hoare triple {169457#true} assume true; {169457#true} is VALID [2022-04-08 12:46:40,447 INFO L290 TraceCheckUtils]: 77: Hoare triple {169457#true} assume !(0 == ~cond); {169457#true} is VALID [2022-04-08 12:46:40,447 INFO L290 TraceCheckUtils]: 76: Hoare triple {169457#true} ~cond := #in~cond; {169457#true} is VALID [2022-04-08 12:46:40,447 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-08 12:46:40,447 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-08 12:46:40,449 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-08 12:46:40,450 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-08 12:46:40,450 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {169457#true} {169714#(<= ~counter~0 9)} #96#return; {169714#(<= ~counter~0 9)} is VALID [2022-04-08 12:46:40,450 INFO L290 TraceCheckUtils]: 70: Hoare triple {169457#true} assume true; {169457#true} is VALID [2022-04-08 12:46:40,450 INFO L290 TraceCheckUtils]: 69: Hoare triple {169457#true} assume !(0 == ~cond); {169457#true} is VALID [2022-04-08 12:46:40,450 INFO L290 TraceCheckUtils]: 68: Hoare triple {169457#true} ~cond := #in~cond; {169457#true} is VALID [2022-04-08 12:46:40,450 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-08 12:46:40,451 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-08 12:46:40,453 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-08 12:46:40,453 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-08 12:46:40,454 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {169457#true} {169689#(<= ~counter~0 8)} #96#return; {169689#(<= ~counter~0 8)} is VALID [2022-04-08 12:46:40,454 INFO L290 TraceCheckUtils]: 62: Hoare triple {169457#true} assume true; {169457#true} is VALID [2022-04-08 12:46:40,454 INFO L290 TraceCheckUtils]: 61: Hoare triple {169457#true} assume !(0 == ~cond); {169457#true} is VALID [2022-04-08 12:46:40,454 INFO L290 TraceCheckUtils]: 60: Hoare triple {169457#true} ~cond := #in~cond; {169457#true} is VALID [2022-04-08 12:46:40,454 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-08 12:46:40,454 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-08 12:46:40,456 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-08 12:46:40,457 INFO L290 TraceCheckUtils]: 56: Hoare triple {169664#(<= ~counter~0 7)} assume !!(0 != ~r~0); {169664#(<= ~counter~0 7)} is VALID [2022-04-08 12:46:40,457 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {169457#true} {169664#(<= ~counter~0 7)} #94#return; {169664#(<= ~counter~0 7)} is VALID [2022-04-08 12:46:40,457 INFO L290 TraceCheckUtils]: 54: Hoare triple {169457#true} assume true; {169457#true} is VALID [2022-04-08 12:46:40,457 INFO L290 TraceCheckUtils]: 53: Hoare triple {169457#true} assume !(0 == ~cond); {169457#true} is VALID [2022-04-08 12:46:40,457 INFO L290 TraceCheckUtils]: 52: Hoare triple {169457#true} ~cond := #in~cond; {169457#true} is VALID [2022-04-08 12:46:40,457 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-08 12:46:40,458 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-08 12:46:40,459 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-08 12:46:40,460 INFO L290 TraceCheckUtils]: 48: Hoare triple {169639#(<= ~counter~0 6)} assume !(~r~0 < 0); {169639#(<= ~counter~0 6)} is VALID [2022-04-08 12:46:40,460 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {169457#true} {169639#(<= ~counter~0 6)} #98#return; {169639#(<= ~counter~0 6)} is VALID [2022-04-08 12:46:40,460 INFO L290 TraceCheckUtils]: 46: Hoare triple {169457#true} assume true; {169457#true} is VALID [2022-04-08 12:46:40,460 INFO L290 TraceCheckUtils]: 45: Hoare triple {169457#true} assume !(0 == ~cond); {169457#true} is VALID [2022-04-08 12:46:40,460 INFO L290 TraceCheckUtils]: 44: Hoare triple {169457#true} ~cond := #in~cond; {169457#true} is VALID [2022-04-08 12:46:40,461 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-08 12:46:40,461 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-08 12:46:40,463 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-08 12:46:40,463 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-08 12:46:40,464 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {169457#true} {169614#(<= ~counter~0 5)} #98#return; {169614#(<= ~counter~0 5)} is VALID [2022-04-08 12:46:40,464 INFO L290 TraceCheckUtils]: 38: Hoare triple {169457#true} assume true; {169457#true} is VALID [2022-04-08 12:46:40,464 INFO L290 TraceCheckUtils]: 37: Hoare triple {169457#true} assume !(0 == ~cond); {169457#true} is VALID [2022-04-08 12:46:40,464 INFO L290 TraceCheckUtils]: 36: Hoare triple {169457#true} ~cond := #in~cond; {169457#true} is VALID [2022-04-08 12:46:40,464 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-08 12:46:40,464 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-08 12:46:40,466 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-08 12:46:40,466 INFO L290 TraceCheckUtils]: 32: Hoare triple {169589#(<= ~counter~0 4)} assume !(~r~0 > 0); {169589#(<= ~counter~0 4)} is VALID [2022-04-08 12:46:40,467 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {169457#true} {169589#(<= ~counter~0 4)} #96#return; {169589#(<= ~counter~0 4)} is VALID [2022-04-08 12:46:40,467 INFO L290 TraceCheckUtils]: 30: Hoare triple {169457#true} assume true; {169457#true} is VALID [2022-04-08 12:46:40,467 INFO L290 TraceCheckUtils]: 29: Hoare triple {169457#true} assume !(0 == ~cond); {169457#true} is VALID [2022-04-08 12:46:40,467 INFO L290 TraceCheckUtils]: 28: Hoare triple {169457#true} ~cond := #in~cond; {169457#true} is VALID [2022-04-08 12:46:40,467 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-08 12:46:40,467 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-08 12:46:40,470 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-08 12:46:40,470 INFO L290 TraceCheckUtils]: 24: Hoare triple {169564#(<= ~counter~0 3)} assume !!(0 != ~r~0); {169564#(<= ~counter~0 3)} is VALID [2022-04-08 12:46:40,471 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {169457#true} {169564#(<= ~counter~0 3)} #94#return; {169564#(<= ~counter~0 3)} is VALID [2022-04-08 12:46:40,471 INFO L290 TraceCheckUtils]: 22: Hoare triple {169457#true} assume true; {169457#true} is VALID [2022-04-08 12:46:40,471 INFO L290 TraceCheckUtils]: 21: Hoare triple {169457#true} assume !(0 == ~cond); {169457#true} is VALID [2022-04-08 12:46:40,471 INFO L290 TraceCheckUtils]: 20: Hoare triple {169457#true} ~cond := #in~cond; {169457#true} is VALID [2022-04-08 12:46:40,471 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-08 12:46:40,471 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-08 12:46:40,473 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-08 12:46:40,474 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-08 12:46:40,474 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {169457#true} {169539#(<= ~counter~0 2)} #92#return; {169539#(<= ~counter~0 2)} is VALID [2022-04-08 12:46:40,474 INFO L290 TraceCheckUtils]: 14: Hoare triple {169457#true} assume true; {169457#true} is VALID [2022-04-08 12:46:40,474 INFO L290 TraceCheckUtils]: 13: Hoare triple {169457#true} assume !(0 == ~cond); {169457#true} is VALID [2022-04-08 12:46:40,474 INFO L290 TraceCheckUtils]: 12: Hoare triple {169457#true} ~cond := #in~cond; {169457#true} is VALID [2022-04-08 12:46:40,474 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-08 12:46:40,475 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {169457#true} {169539#(<= ~counter~0 2)} #90#return; {169539#(<= ~counter~0 2)} is VALID [2022-04-08 12:46:40,475 INFO L290 TraceCheckUtils]: 9: Hoare triple {169457#true} assume true; {169457#true} is VALID [2022-04-08 12:46:40,475 INFO L290 TraceCheckUtils]: 8: Hoare triple {169457#true} assume !(0 == ~cond); {169457#true} is VALID [2022-04-08 12:46:40,475 INFO L290 TraceCheckUtils]: 7: Hoare triple {169457#true} ~cond := #in~cond; {169457#true} is VALID [2022-04-08 12:46:40,475 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-08 12:46:40,475 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-08 12:46:40,476 INFO L272 TraceCheckUtils]: 4: Hoare triple {169539#(<= ~counter~0 2)} call #t~ret9 := main(); {169539#(<= ~counter~0 2)} is VALID [2022-04-08 12:46:40,476 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {169539#(<= ~counter~0 2)} {169457#true} #102#return; {169539#(<= ~counter~0 2)} is VALID [2022-04-08 12:46:40,476 INFO L290 TraceCheckUtils]: 2: Hoare triple {169539#(<= ~counter~0 2)} assume true; {169539#(<= ~counter~0 2)} is VALID [2022-04-08 12:46:40,477 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-08 12:46:40,477 INFO L272 TraceCheckUtils]: 0: Hoare triple {169457#true} call ULTIMATE.init(); {169457#true} is VALID [2022-04-08 12:46:40,477 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-08 12:46:40,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:46:40,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037578275] [2022-04-08 12:46:40,477 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:46:40,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741668739] [2022-04-08 12:46:40,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [741668739] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:46:40,477 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:46:40,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 24 [2022-04-08 12:46:40,478 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:46:40,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1199594192] [2022-04-08 12:46:40,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1199594192] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:46:40,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:46:40,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-08 12:46:40,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597824452] [2022-04-08 12:46:40,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:46:40,478 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-08 12:46:40,478 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:46:40,479 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-08 12:46:40,724 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-08 12:46:40,724 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-08 12:46:40,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:46:40,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-08 12:46:40,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-08 12:46:40,725 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-08 12:46:46,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:46:46,377 INFO L93 Difference]: Finished difference Result 1079 states and 1471 transitions. [2022-04-08 12:46:46,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-08 12:46:46,377 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-08 12:46:46,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:46:46,378 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-08 12:46:46,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 376 transitions. [2022-04-08 12:46:46,380 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-08 12:46:46,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 376 transitions. [2022-04-08 12:46:46,382 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 376 transitions. [2022-04-08 12:46:46,862 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-08 12:46:46,897 INFO L225 Difference]: With dead ends: 1079 [2022-04-08 12:46:46,898 INFO L226 Difference]: Without dead ends: 901 [2022-04-08 12:46:46,898 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 298 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=551, Invalid=931, Unknown=0, NotChecked=0, Total=1482 [2022-04-08 12:46:46,898 INFO L913 BasicCegarLoop]: 81 mSDtfsCounter, 242 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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, 0.7s IncrementalHoareTripleChecker+Time [2022-04-08 12:46:46,898 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [242 Valid, 404 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-08 12:46:46,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2022-04-08 12:46:50,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 890. [2022-04-08 12:46:50,198 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:46:50,199 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-08 12:46:50,199 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-08 12:46:50,200 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-08 12:46:50,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:46:50,224 INFO L93 Difference]: Finished difference Result 901 states and 1198 transitions. [2022-04-08 12:46:50,224 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1198 transitions. [2022-04-08 12:46:50,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:46:50,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:46:50,226 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-08 12:46:50,226 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-08 12:46:50,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:46:50,251 INFO L93 Difference]: Finished difference Result 901 states and 1198 transitions. [2022-04-08 12:46:50,251 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1198 transitions. [2022-04-08 12:46:50,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:46:50,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:46:50,252 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:46:50,252 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:46:50,253 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-08 12:46:50,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1187 transitions. [2022-04-08 12:46:50,285 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1187 transitions. Word has length 161 [2022-04-08 12:46:50,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:46:50,285 INFO L478 AbstractCegarLoop]: Abstraction has 890 states and 1187 transitions. [2022-04-08 12:46:50,285 INFO L479 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-08 12:46:50,285 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 890 states and 1187 transitions. [2022-04-08 12:47:03,933 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1187 edges. 1186 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 12:47:03,933 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1187 transitions. [2022-04-08 12:47:03,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-04-08 12:47:03,935 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:47:03,935 INFO L499 BasicCegarLoop]: 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-08 12:47:03,943 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Ended with exit code 0 [2022-04-08 12:47:04,140 WARN L460 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-08 12:47:04,141 INFO L403 AbstractCegarLoop]: === Iteration 57 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:47:04,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:47:04,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1942329766, now seen corresponding path program 25 times [2022-04-08 12:47:04,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:47:04,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1844386872] [2022-04-08 12:47:04,141 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:47:04,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1942329766, now seen corresponding path program 26 times [2022-04-08 12:47:04,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:47:04,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373571291] [2022-04-08 12:47:04,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:47:04,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:47:04,154 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:47:04,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [638836855] [2022-04-08 12:47:04,155 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:47:04,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:47:04,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:47:04,155 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-08 12:47:04,156 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-08 12:47:04,224 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:47:04,224 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:47:04,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-08 12:47:04,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:47:04,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:47:05,116 INFO L272 TraceCheckUtils]: 0: Hoare triple {176216#true} call ULTIMATE.init(); {176216#true} is VALID [2022-04-08 12:47:05,117 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-08 12:47:05,117 INFO L290 TraceCheckUtils]: 2: Hoare triple {176224#(<= ~counter~0 0)} assume true; {176224#(<= ~counter~0 0)} is VALID [2022-04-08 12:47:05,118 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {176224#(<= ~counter~0 0)} {176216#true} #102#return; {176224#(<= ~counter~0 0)} is VALID [2022-04-08 12:47:05,118 INFO L272 TraceCheckUtils]: 4: Hoare triple {176224#(<= ~counter~0 0)} call #t~ret9 := main(); {176224#(<= ~counter~0 0)} is VALID [2022-04-08 12:47:05,118 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-08 12:47:05,119 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-08 12:47:05,119 INFO L290 TraceCheckUtils]: 7: Hoare triple {176224#(<= ~counter~0 0)} ~cond := #in~cond; {176224#(<= ~counter~0 0)} is VALID [2022-04-08 12:47:05,119 INFO L290 TraceCheckUtils]: 8: Hoare triple {176224#(<= ~counter~0 0)} assume !(0 == ~cond); {176224#(<= ~counter~0 0)} is VALID [2022-04-08 12:47:05,119 INFO L290 TraceCheckUtils]: 9: Hoare triple {176224#(<= ~counter~0 0)} assume true; {176224#(<= ~counter~0 0)} is VALID [2022-04-08 12:47:05,120 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {176224#(<= ~counter~0 0)} {176224#(<= ~counter~0 0)} #90#return; {176224#(<= ~counter~0 0)} is VALID [2022-04-08 12:47:05,120 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-08 12:47:05,120 INFO L290 TraceCheckUtils]: 12: Hoare triple {176224#(<= ~counter~0 0)} ~cond := #in~cond; {176224#(<= ~counter~0 0)} is VALID [2022-04-08 12:47:05,121 INFO L290 TraceCheckUtils]: 13: Hoare triple {176224#(<= ~counter~0 0)} assume !(0 == ~cond); {176224#(<= ~counter~0 0)} is VALID [2022-04-08 12:47:05,121 INFO L290 TraceCheckUtils]: 14: Hoare triple {176224#(<= ~counter~0 0)} assume true; {176224#(<= ~counter~0 0)} is VALID [2022-04-08 12:47:05,121 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {176224#(<= ~counter~0 0)} {176224#(<= ~counter~0 0)} #92#return; {176224#(<= ~counter~0 0)} is VALID [2022-04-08 12:47:05,121 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-08 12:47:05,125 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-08 12:47:05,125 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-08 12:47:05,126 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-08 12:47:05,126 INFO L290 TraceCheckUtils]: 20: Hoare triple {176273#(<= ~counter~0 1)} ~cond := #in~cond; {176273#(<= ~counter~0 1)} is VALID [2022-04-08 12:47:05,126 INFO L290 TraceCheckUtils]: 21: Hoare triple {176273#(<= ~counter~0 1)} assume !(0 == ~cond); {176273#(<= ~counter~0 1)} is VALID [2022-04-08 12:47:05,126 INFO L290 TraceCheckUtils]: 22: Hoare triple {176273#(<= ~counter~0 1)} assume true; {176273#(<= ~counter~0 1)} is VALID [2022-04-08 12:47:05,127 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {176273#(<= ~counter~0 1)} {176273#(<= ~counter~0 1)} #94#return; {176273#(<= ~counter~0 1)} is VALID [2022-04-08 12:47:05,127 INFO L290 TraceCheckUtils]: 24: Hoare triple {176273#(<= ~counter~0 1)} assume !!(0 != ~r~0); {176273#(<= ~counter~0 1)} is VALID [2022-04-08 12:47:05,129 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-08 12:47:05,129 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-08 12:47:05,129 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-08 12:47:05,130 INFO L290 TraceCheckUtils]: 28: Hoare triple {176298#(<= ~counter~0 2)} ~cond := #in~cond; {176298#(<= ~counter~0 2)} is VALID [2022-04-08 12:47:05,130 INFO L290 TraceCheckUtils]: 29: Hoare triple {176298#(<= ~counter~0 2)} assume !(0 == ~cond); {176298#(<= ~counter~0 2)} is VALID [2022-04-08 12:47:05,130 INFO L290 TraceCheckUtils]: 30: Hoare triple {176298#(<= ~counter~0 2)} assume true; {176298#(<= ~counter~0 2)} is VALID [2022-04-08 12:47:05,131 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {176298#(<= ~counter~0 2)} {176298#(<= ~counter~0 2)} #96#return; {176298#(<= ~counter~0 2)} is VALID [2022-04-08 12:47:05,131 INFO L290 TraceCheckUtils]: 32: Hoare triple {176298#(<= ~counter~0 2)} assume !(~r~0 > 0); {176298#(<= ~counter~0 2)} is VALID [2022-04-08 12:47:05,132 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-08 12:47:05,133 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-08 12:47:05,133 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-08 12:47:05,133 INFO L290 TraceCheckUtils]: 36: Hoare triple {176323#(<= ~counter~0 3)} ~cond := #in~cond; {176323#(<= ~counter~0 3)} is VALID [2022-04-08 12:47:05,134 INFO L290 TraceCheckUtils]: 37: Hoare triple {176323#(<= ~counter~0 3)} assume !(0 == ~cond); {176323#(<= ~counter~0 3)} is VALID [2022-04-08 12:47:05,134 INFO L290 TraceCheckUtils]: 38: Hoare triple {176323#(<= ~counter~0 3)} assume true; {176323#(<= ~counter~0 3)} is VALID [2022-04-08 12:47:05,134 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {176323#(<= ~counter~0 3)} {176323#(<= ~counter~0 3)} #98#return; {176323#(<= ~counter~0 3)} is VALID [2022-04-08 12:47:05,135 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-08 12:47:05,136 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-08 12:47:05,137 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-08 12:47:05,137 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-08 12:47:05,137 INFO L290 TraceCheckUtils]: 44: Hoare triple {176348#(<= ~counter~0 4)} ~cond := #in~cond; {176348#(<= ~counter~0 4)} is VALID [2022-04-08 12:47:05,138 INFO L290 TraceCheckUtils]: 45: Hoare triple {176348#(<= ~counter~0 4)} assume !(0 == ~cond); {176348#(<= ~counter~0 4)} is VALID [2022-04-08 12:47:05,138 INFO L290 TraceCheckUtils]: 46: Hoare triple {176348#(<= ~counter~0 4)} assume true; {176348#(<= ~counter~0 4)} is VALID [2022-04-08 12:47:05,138 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {176348#(<= ~counter~0 4)} {176348#(<= ~counter~0 4)} #98#return; {176348#(<= ~counter~0 4)} is VALID [2022-04-08 12:47:05,138 INFO L290 TraceCheckUtils]: 48: Hoare triple {176348#(<= ~counter~0 4)} assume !(~r~0 < 0); {176348#(<= ~counter~0 4)} is VALID [2022-04-08 12:47:05,140 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-08 12:47:05,140 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-08 12:47:05,141 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-08 12:47:05,141 INFO L290 TraceCheckUtils]: 52: Hoare triple {176373#(<= ~counter~0 5)} ~cond := #in~cond; {176373#(<= ~counter~0 5)} is VALID [2022-04-08 12:47:05,141 INFO L290 TraceCheckUtils]: 53: Hoare triple {176373#(<= ~counter~0 5)} assume !(0 == ~cond); {176373#(<= ~counter~0 5)} is VALID [2022-04-08 12:47:05,141 INFO L290 TraceCheckUtils]: 54: Hoare triple {176373#(<= ~counter~0 5)} assume true; {176373#(<= ~counter~0 5)} is VALID [2022-04-08 12:47:05,142 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {176373#(<= ~counter~0 5)} {176373#(<= ~counter~0 5)} #94#return; {176373#(<= ~counter~0 5)} is VALID [2022-04-08 12:47:05,142 INFO L290 TraceCheckUtils]: 56: Hoare triple {176373#(<= ~counter~0 5)} assume !!(0 != ~r~0); {176373#(<= ~counter~0 5)} is VALID [2022-04-08 12:47:05,144 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-08 12:47:05,144 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-08 12:47:05,144 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-08 12:47:05,144 INFO L290 TraceCheckUtils]: 60: Hoare triple {176398#(<= ~counter~0 6)} ~cond := #in~cond; {176398#(<= ~counter~0 6)} is VALID [2022-04-08 12:47:05,145 INFO L290 TraceCheckUtils]: 61: Hoare triple {176398#(<= ~counter~0 6)} assume !(0 == ~cond); {176398#(<= ~counter~0 6)} is VALID [2022-04-08 12:47:05,145 INFO L290 TraceCheckUtils]: 62: Hoare triple {176398#(<= ~counter~0 6)} assume true; {176398#(<= ~counter~0 6)} is VALID [2022-04-08 12:47:05,145 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {176398#(<= ~counter~0 6)} {176398#(<= ~counter~0 6)} #96#return; {176398#(<= ~counter~0 6)} is VALID [2022-04-08 12:47:05,146 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-08 12:47:05,147 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-08 12:47:05,147 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-08 12:47:05,148 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-08 12:47:05,148 INFO L290 TraceCheckUtils]: 68: Hoare triple {176423#(<= ~counter~0 7)} ~cond := #in~cond; {176423#(<= ~counter~0 7)} is VALID [2022-04-08 12:47:05,148 INFO L290 TraceCheckUtils]: 69: Hoare triple {176423#(<= ~counter~0 7)} assume !(0 == ~cond); {176423#(<= ~counter~0 7)} is VALID [2022-04-08 12:47:05,149 INFO L290 TraceCheckUtils]: 70: Hoare triple {176423#(<= ~counter~0 7)} assume true; {176423#(<= ~counter~0 7)} is VALID [2022-04-08 12:47:05,149 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {176423#(<= ~counter~0 7)} {176423#(<= ~counter~0 7)} #96#return; {176423#(<= ~counter~0 7)} is VALID [2022-04-08 12:47:05,149 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-08 12:47:05,151 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-08 12:47:05,151 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-08 12:47:05,152 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-08 12:47:05,152 INFO L290 TraceCheckUtils]: 76: Hoare triple {176448#(<= ~counter~0 8)} ~cond := #in~cond; {176448#(<= ~counter~0 8)} is VALID [2022-04-08 12:47:05,152 INFO L290 TraceCheckUtils]: 77: Hoare triple {176448#(<= ~counter~0 8)} assume !(0 == ~cond); {176448#(<= ~counter~0 8)} is VALID [2022-04-08 12:47:05,153 INFO L290 TraceCheckUtils]: 78: Hoare triple {176448#(<= ~counter~0 8)} assume true; {176448#(<= ~counter~0 8)} is VALID [2022-04-08 12:47:05,153 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {176448#(<= ~counter~0 8)} {176448#(<= ~counter~0 8)} #96#return; {176448#(<= ~counter~0 8)} is VALID [2022-04-08 12:47:05,153 INFO L290 TraceCheckUtils]: 80: Hoare triple {176448#(<= ~counter~0 8)} assume !(~r~0 > 0); {176448#(<= ~counter~0 8)} is VALID [2022-04-08 12:47:05,155 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-08 12:47:05,155 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-08 12:47:05,156 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-08 12:47:05,156 INFO L290 TraceCheckUtils]: 84: Hoare triple {176473#(<= ~counter~0 9)} ~cond := #in~cond; {176473#(<= ~counter~0 9)} is VALID [2022-04-08 12:47:05,156 INFO L290 TraceCheckUtils]: 85: Hoare triple {176473#(<= ~counter~0 9)} assume !(0 == ~cond); {176473#(<= ~counter~0 9)} is VALID [2022-04-08 12:47:05,156 INFO L290 TraceCheckUtils]: 86: Hoare triple {176473#(<= ~counter~0 9)} assume true; {176473#(<= ~counter~0 9)} is VALID [2022-04-08 12:47:05,157 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {176473#(<= ~counter~0 9)} {176473#(<= ~counter~0 9)} #98#return; {176473#(<= ~counter~0 9)} is VALID [2022-04-08 12:47:05,157 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-08 12:47:05,159 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-08 12:47:05,159 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-08 12:47:05,159 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-08 12:47:05,160 INFO L290 TraceCheckUtils]: 92: Hoare triple {176498#(<= ~counter~0 10)} ~cond := #in~cond; {176498#(<= ~counter~0 10)} is VALID [2022-04-08 12:47:05,160 INFO L290 TraceCheckUtils]: 93: Hoare triple {176498#(<= ~counter~0 10)} assume !(0 == ~cond); {176498#(<= ~counter~0 10)} is VALID [2022-04-08 12:47:05,160 INFO L290 TraceCheckUtils]: 94: Hoare triple {176498#(<= ~counter~0 10)} assume true; {176498#(<= ~counter~0 10)} is VALID [2022-04-08 12:47:05,161 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {176498#(<= ~counter~0 10)} {176498#(<= ~counter~0 10)} #98#return; {176498#(<= ~counter~0 10)} is VALID [2022-04-08 12:47:05,161 INFO L290 TraceCheckUtils]: 96: Hoare triple {176498#(<= ~counter~0 10)} assume !(~r~0 < 0); {176498#(<= ~counter~0 10)} is VALID [2022-04-08 12:47:05,162 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-08 12:47:05,162 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-08 12:47:05,163 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-08 12:47:05,163 INFO L290 TraceCheckUtils]: 100: Hoare triple {176523#(<= ~counter~0 11)} ~cond := #in~cond; {176523#(<= ~counter~0 11)} is VALID [2022-04-08 12:47:05,163 INFO L290 TraceCheckUtils]: 101: Hoare triple {176523#(<= ~counter~0 11)} assume !(0 == ~cond); {176523#(<= ~counter~0 11)} is VALID [2022-04-08 12:47:05,164 INFO L290 TraceCheckUtils]: 102: Hoare triple {176523#(<= ~counter~0 11)} assume true; {176523#(<= ~counter~0 11)} is VALID [2022-04-08 12:47:05,164 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {176523#(<= ~counter~0 11)} {176523#(<= ~counter~0 11)} #94#return; {176523#(<= ~counter~0 11)} is VALID [2022-04-08 12:47:05,164 INFO L290 TraceCheckUtils]: 104: Hoare triple {176523#(<= ~counter~0 11)} assume !!(0 != ~r~0); {176523#(<= ~counter~0 11)} is VALID [2022-04-08 12:47:05,166 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-08 12:47:05,166 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-08 12:47:05,166 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-08 12:47:05,167 INFO L290 TraceCheckUtils]: 108: Hoare triple {176548#(<= ~counter~0 12)} ~cond := #in~cond; {176548#(<= ~counter~0 12)} is VALID [2022-04-08 12:47:05,167 INFO L290 TraceCheckUtils]: 109: Hoare triple {176548#(<= ~counter~0 12)} assume !(0 == ~cond); {176548#(<= ~counter~0 12)} is VALID [2022-04-08 12:47:05,167 INFO L290 TraceCheckUtils]: 110: Hoare triple {176548#(<= ~counter~0 12)} assume true; {176548#(<= ~counter~0 12)} is VALID [2022-04-08 12:47:05,168 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {176548#(<= ~counter~0 12)} {176548#(<= ~counter~0 12)} #96#return; {176548#(<= ~counter~0 12)} is VALID [2022-04-08 12:47:05,168 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-08 12:47:05,169 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-08 12:47:05,170 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-08 12:47:05,170 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-08 12:47:05,170 INFO L290 TraceCheckUtils]: 116: Hoare triple {176573#(<= ~counter~0 13)} ~cond := #in~cond; {176573#(<= ~counter~0 13)} is VALID [2022-04-08 12:47:05,171 INFO L290 TraceCheckUtils]: 117: Hoare triple {176573#(<= ~counter~0 13)} assume !(0 == ~cond); {176573#(<= ~counter~0 13)} is VALID [2022-04-08 12:47:05,171 INFO L290 TraceCheckUtils]: 118: Hoare triple {176573#(<= ~counter~0 13)} assume true; {176573#(<= ~counter~0 13)} is VALID [2022-04-08 12:47:05,171 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {176573#(<= ~counter~0 13)} {176573#(<= ~counter~0 13)} #96#return; {176573#(<= ~counter~0 13)} is VALID [2022-04-08 12:47:05,172 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-08 12:47:05,173 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-08 12:47:05,174 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-08 12:47:05,174 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-08 12:47:05,174 INFO L290 TraceCheckUtils]: 124: Hoare triple {176598#(<= ~counter~0 14)} ~cond := #in~cond; {176598#(<= ~counter~0 14)} is VALID [2022-04-08 12:47:05,174 INFO L290 TraceCheckUtils]: 125: Hoare triple {176598#(<= ~counter~0 14)} assume !(0 == ~cond); {176598#(<= ~counter~0 14)} is VALID [2022-04-08 12:47:05,175 INFO L290 TraceCheckUtils]: 126: Hoare triple {176598#(<= ~counter~0 14)} assume true; {176598#(<= ~counter~0 14)} is VALID [2022-04-08 12:47:05,175 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {176598#(<= ~counter~0 14)} {176598#(<= ~counter~0 14)} #96#return; {176598#(<= ~counter~0 14)} is VALID [2022-04-08 12:47:05,175 INFO L290 TraceCheckUtils]: 128: Hoare triple {176598#(<= ~counter~0 14)} assume !(~r~0 > 0); {176598#(<= ~counter~0 14)} is VALID [2022-04-08 12:47:05,177 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-08 12:47:05,177 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-08 12:47:05,178 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-08 12:47:05,178 INFO L290 TraceCheckUtils]: 132: Hoare triple {176623#(<= ~counter~0 15)} ~cond := #in~cond; {176623#(<= ~counter~0 15)} is VALID [2022-04-08 12:47:05,178 INFO L290 TraceCheckUtils]: 133: Hoare triple {176623#(<= ~counter~0 15)} assume !(0 == ~cond); {176623#(<= ~counter~0 15)} is VALID [2022-04-08 12:47:05,179 INFO L290 TraceCheckUtils]: 134: Hoare triple {176623#(<= ~counter~0 15)} assume true; {176623#(<= ~counter~0 15)} is VALID [2022-04-08 12:47:05,179 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {176623#(<= ~counter~0 15)} {176623#(<= ~counter~0 15)} #98#return; {176623#(<= ~counter~0 15)} is VALID [2022-04-08 12:47:05,179 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-08 12:47:05,181 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-08 12:47:05,181 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-08 12:47:05,181 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-08 12:47:05,182 INFO L290 TraceCheckUtils]: 140: Hoare triple {176648#(<= ~counter~0 16)} ~cond := #in~cond; {176648#(<= ~counter~0 16)} is VALID [2022-04-08 12:47:05,182 INFO L290 TraceCheckUtils]: 141: Hoare triple {176648#(<= ~counter~0 16)} assume !(0 == ~cond); {176648#(<= ~counter~0 16)} is VALID [2022-04-08 12:47:05,182 INFO L290 TraceCheckUtils]: 142: Hoare triple {176648#(<= ~counter~0 16)} assume true; {176648#(<= ~counter~0 16)} is VALID [2022-04-08 12:47:05,183 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {176648#(<= ~counter~0 16)} {176648#(<= ~counter~0 16)} #98#return; {176648#(<= ~counter~0 16)} is VALID [2022-04-08 12:47:05,183 INFO L290 TraceCheckUtils]: 144: Hoare triple {176648#(<= ~counter~0 16)} assume !(~r~0 < 0); {176648#(<= ~counter~0 16)} is VALID [2022-04-08 12:47:05,184 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-08 12:47:05,185 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-08 12:47:05,185 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-08 12:47:05,185 INFO L290 TraceCheckUtils]: 148: Hoare triple {176673#(<= ~counter~0 17)} ~cond := #in~cond; {176673#(<= ~counter~0 17)} is VALID [2022-04-08 12:47:05,186 INFO L290 TraceCheckUtils]: 149: Hoare triple {176673#(<= ~counter~0 17)} assume !(0 == ~cond); {176673#(<= ~counter~0 17)} is VALID [2022-04-08 12:47:05,186 INFO L290 TraceCheckUtils]: 150: Hoare triple {176673#(<= ~counter~0 17)} assume true; {176673#(<= ~counter~0 17)} is VALID [2022-04-08 12:47:05,186 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {176673#(<= ~counter~0 17)} {176673#(<= ~counter~0 17)} #94#return; {176673#(<= ~counter~0 17)} is VALID [2022-04-08 12:47:05,187 INFO L290 TraceCheckUtils]: 152: Hoare triple {176673#(<= ~counter~0 17)} assume !!(0 != ~r~0); {176673#(<= ~counter~0 17)} is VALID [2022-04-08 12:47:05,187 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-08 12:47:05,187 INFO L290 TraceCheckUtils]: 154: Hoare triple {176698#(<= |main_#t~post7| 17)} assume !(#t~post7 < 20);havoc #t~post7; {176217#false} is VALID [2022-04-08 12:47:05,187 INFO L290 TraceCheckUtils]: 155: Hoare triple {176217#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {176217#false} is VALID [2022-04-08 12:47:05,187 INFO L290 TraceCheckUtils]: 156: Hoare triple {176217#false} assume !(#t~post8 < 20);havoc #t~post8; {176217#false} is VALID [2022-04-08 12:47:05,188 INFO L290 TraceCheckUtils]: 157: Hoare triple {176217#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {176217#false} is VALID [2022-04-08 12:47:05,188 INFO L290 TraceCheckUtils]: 158: Hoare triple {176217#false} assume !(#t~post6 < 20);havoc #t~post6; {176217#false} is VALID [2022-04-08 12:47:05,188 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-08 12:47:05,188 INFO L290 TraceCheckUtils]: 160: Hoare triple {176217#false} ~cond := #in~cond; {176217#false} is VALID [2022-04-08 12:47:05,188 INFO L290 TraceCheckUtils]: 161: Hoare triple {176217#false} assume 0 == ~cond; {176217#false} is VALID [2022-04-08 12:47:05,188 INFO L290 TraceCheckUtils]: 162: Hoare triple {176217#false} assume !false; {176217#false} is VALID [2022-04-08 12:47:05,188 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-08 12:47:05,188 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:47:05,879 INFO L290 TraceCheckUtils]: 162: Hoare triple {176217#false} assume !false; {176217#false} is VALID [2022-04-08 12:47:05,879 INFO L290 TraceCheckUtils]: 161: Hoare triple {176217#false} assume 0 == ~cond; {176217#false} is VALID [2022-04-08 12:47:05,879 INFO L290 TraceCheckUtils]: 160: Hoare triple {176217#false} ~cond := #in~cond; {176217#false} is VALID [2022-04-08 12:47:05,879 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-08 12:47:05,879 INFO L290 TraceCheckUtils]: 158: Hoare triple {176217#false} assume !(#t~post6 < 20);havoc #t~post6; {176217#false} is VALID [2022-04-08 12:47:05,879 INFO L290 TraceCheckUtils]: 157: Hoare triple {176217#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {176217#false} is VALID [2022-04-08 12:47:05,879 INFO L290 TraceCheckUtils]: 156: Hoare triple {176217#false} assume !(#t~post8 < 20);havoc #t~post8; {176217#false} is VALID [2022-04-08 12:47:05,879 INFO L290 TraceCheckUtils]: 155: Hoare triple {176217#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {176217#false} is VALID [2022-04-08 12:47:05,880 INFO L290 TraceCheckUtils]: 154: Hoare triple {176750#(< |main_#t~post7| 20)} assume !(#t~post7 < 20);havoc #t~post7; {176217#false} is VALID [2022-04-08 12:47:05,880 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-08 12:47:05,880 INFO L290 TraceCheckUtils]: 152: Hoare triple {176754#(< ~counter~0 20)} assume !!(0 != ~r~0); {176754#(< ~counter~0 20)} is VALID [2022-04-08 12:47:05,881 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {176216#true} {176754#(< ~counter~0 20)} #94#return; {176754#(< ~counter~0 20)} is VALID [2022-04-08 12:47:05,881 INFO L290 TraceCheckUtils]: 150: Hoare triple {176216#true} assume true; {176216#true} is VALID [2022-04-08 12:47:05,881 INFO L290 TraceCheckUtils]: 149: Hoare triple {176216#true} assume !(0 == ~cond); {176216#true} is VALID [2022-04-08 12:47:05,881 INFO L290 TraceCheckUtils]: 148: Hoare triple {176216#true} ~cond := #in~cond; {176216#true} is VALID [2022-04-08 12:47:05,881 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-08 12:47:05,881 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-08 12:47:05,885 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-08 12:47:05,885 INFO L290 TraceCheckUtils]: 144: Hoare triple {176779#(< ~counter~0 19)} assume !(~r~0 < 0); {176779#(< ~counter~0 19)} is VALID [2022-04-08 12:47:05,886 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {176216#true} {176779#(< ~counter~0 19)} #98#return; {176779#(< ~counter~0 19)} is VALID [2022-04-08 12:47:05,886 INFO L290 TraceCheckUtils]: 142: Hoare triple {176216#true} assume true; {176216#true} is VALID [2022-04-08 12:47:05,886 INFO L290 TraceCheckUtils]: 141: Hoare triple {176216#true} assume !(0 == ~cond); {176216#true} is VALID [2022-04-08 12:47:05,886 INFO L290 TraceCheckUtils]: 140: Hoare triple {176216#true} ~cond := #in~cond; {176216#true} is VALID [2022-04-08 12:47:05,886 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-08 12:47:05,886 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-08 12:47:05,888 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-08 12:47:05,889 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-08 12:47:05,889 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {176216#true} {176673#(<= ~counter~0 17)} #98#return; {176673#(<= ~counter~0 17)} is VALID [2022-04-08 12:47:05,889 INFO L290 TraceCheckUtils]: 134: Hoare triple {176216#true} assume true; {176216#true} is VALID [2022-04-08 12:47:05,889 INFO L290 TraceCheckUtils]: 133: Hoare triple {176216#true} assume !(0 == ~cond); {176216#true} is VALID [2022-04-08 12:47:05,890 INFO L290 TraceCheckUtils]: 132: Hoare triple {176216#true} ~cond := #in~cond; {176216#true} is VALID [2022-04-08 12:47:05,890 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-08 12:47:05,890 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-08 12:47:05,893 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-08 12:47:05,893 INFO L290 TraceCheckUtils]: 128: Hoare triple {176648#(<= ~counter~0 16)} assume !(~r~0 > 0); {176648#(<= ~counter~0 16)} is VALID [2022-04-08 12:47:05,894 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {176216#true} {176648#(<= ~counter~0 16)} #96#return; {176648#(<= ~counter~0 16)} is VALID [2022-04-08 12:47:05,894 INFO L290 TraceCheckUtils]: 126: Hoare triple {176216#true} assume true; {176216#true} is VALID [2022-04-08 12:47:05,894 INFO L290 TraceCheckUtils]: 125: Hoare triple {176216#true} assume !(0 == ~cond); {176216#true} is VALID [2022-04-08 12:47:05,894 INFO L290 TraceCheckUtils]: 124: Hoare triple {176216#true} ~cond := #in~cond; {176216#true} is VALID [2022-04-08 12:47:05,894 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-08 12:47:05,894 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-08 12:47:05,896 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-08 12:47:05,897 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-08 12:47:05,897 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {176216#true} {176623#(<= ~counter~0 15)} #96#return; {176623#(<= ~counter~0 15)} is VALID [2022-04-08 12:47:05,897 INFO L290 TraceCheckUtils]: 118: Hoare triple {176216#true} assume true; {176216#true} is VALID [2022-04-08 12:47:05,897 INFO L290 TraceCheckUtils]: 117: Hoare triple {176216#true} assume !(0 == ~cond); {176216#true} is VALID [2022-04-08 12:47:05,898 INFO L290 TraceCheckUtils]: 116: Hoare triple {176216#true} ~cond := #in~cond; {176216#true} is VALID [2022-04-08 12:47:05,898 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-08 12:47:05,898 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-08 12:47:05,900 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-08 12:47:05,900 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-08 12:47:05,901 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {176216#true} {176598#(<= ~counter~0 14)} #96#return; {176598#(<= ~counter~0 14)} is VALID [2022-04-08 12:47:05,901 INFO L290 TraceCheckUtils]: 110: Hoare triple {176216#true} assume true; {176216#true} is VALID [2022-04-08 12:47:05,901 INFO L290 TraceCheckUtils]: 109: Hoare triple {176216#true} assume !(0 == ~cond); {176216#true} is VALID [2022-04-08 12:47:05,901 INFO L290 TraceCheckUtils]: 108: Hoare triple {176216#true} ~cond := #in~cond; {176216#true} is VALID [2022-04-08 12:47:05,901 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-08 12:47:05,901 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-08 12:47:05,903 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-08 12:47:05,903 INFO L290 TraceCheckUtils]: 104: Hoare triple {176573#(<= ~counter~0 13)} assume !!(0 != ~r~0); {176573#(<= ~counter~0 13)} is VALID [2022-04-08 12:47:05,904 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {176216#true} {176573#(<= ~counter~0 13)} #94#return; {176573#(<= ~counter~0 13)} is VALID [2022-04-08 12:47:05,904 INFO L290 TraceCheckUtils]: 102: Hoare triple {176216#true} assume true; {176216#true} is VALID [2022-04-08 12:47:05,904 INFO L290 TraceCheckUtils]: 101: Hoare triple {176216#true} assume !(0 == ~cond); {176216#true} is VALID [2022-04-08 12:47:05,904 INFO L290 TraceCheckUtils]: 100: Hoare triple {176216#true} ~cond := #in~cond; {176216#true} is VALID [2022-04-08 12:47:05,904 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-08 12:47:05,904 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-08 12:47:05,906 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-08 12:47:05,907 INFO L290 TraceCheckUtils]: 96: Hoare triple {176548#(<= ~counter~0 12)} assume !(~r~0 < 0); {176548#(<= ~counter~0 12)} is VALID [2022-04-08 12:47:05,907 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {176216#true} {176548#(<= ~counter~0 12)} #98#return; {176548#(<= ~counter~0 12)} is VALID [2022-04-08 12:47:05,907 INFO L290 TraceCheckUtils]: 94: Hoare triple {176216#true} assume true; {176216#true} is VALID [2022-04-08 12:47:05,907 INFO L290 TraceCheckUtils]: 93: Hoare triple {176216#true} assume !(0 == ~cond); {176216#true} is VALID [2022-04-08 12:47:05,907 INFO L290 TraceCheckUtils]: 92: Hoare triple {176216#true} ~cond := #in~cond; {176216#true} is VALID [2022-04-08 12:47:05,908 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-08 12:47:05,908 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-08 12:47:05,910 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-08 12:47:05,910 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-08 12:47:05,911 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {176216#true} {176523#(<= ~counter~0 11)} #98#return; {176523#(<= ~counter~0 11)} is VALID [2022-04-08 12:47:05,911 INFO L290 TraceCheckUtils]: 86: Hoare triple {176216#true} assume true; {176216#true} is VALID [2022-04-08 12:47:05,911 INFO L290 TraceCheckUtils]: 85: Hoare triple {176216#true} assume !(0 == ~cond); {176216#true} is VALID [2022-04-08 12:47:05,911 INFO L290 TraceCheckUtils]: 84: Hoare triple {176216#true} ~cond := #in~cond; {176216#true} is VALID [2022-04-08 12:47:05,911 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-08 12:47:05,911 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-08 12:47:05,913 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-08 12:47:05,914 INFO L290 TraceCheckUtils]: 80: Hoare triple {176498#(<= ~counter~0 10)} assume !(~r~0 > 0); {176498#(<= ~counter~0 10)} is VALID [2022-04-08 12:47:05,914 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {176216#true} {176498#(<= ~counter~0 10)} #96#return; {176498#(<= ~counter~0 10)} is VALID [2022-04-08 12:47:05,914 INFO L290 TraceCheckUtils]: 78: Hoare triple {176216#true} assume true; {176216#true} is VALID [2022-04-08 12:47:05,914 INFO L290 TraceCheckUtils]: 77: Hoare triple {176216#true} assume !(0 == ~cond); {176216#true} is VALID [2022-04-08 12:47:05,914 INFO L290 TraceCheckUtils]: 76: Hoare triple {176216#true} ~cond := #in~cond; {176216#true} is VALID [2022-04-08 12:47:05,914 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-08 12:47:05,915 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-08 12:47:05,916 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-08 12:47:05,917 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-08 12:47:05,917 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {176216#true} {176473#(<= ~counter~0 9)} #96#return; {176473#(<= ~counter~0 9)} is VALID [2022-04-08 12:47:05,917 INFO L290 TraceCheckUtils]: 70: Hoare triple {176216#true} assume true; {176216#true} is VALID [2022-04-08 12:47:05,918 INFO L290 TraceCheckUtils]: 69: Hoare triple {176216#true} assume !(0 == ~cond); {176216#true} is VALID [2022-04-08 12:47:05,918 INFO L290 TraceCheckUtils]: 68: Hoare triple {176216#true} ~cond := #in~cond; {176216#true} is VALID [2022-04-08 12:47:05,918 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-08 12:47:05,918 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-08 12:47:05,920 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-08 12:47:05,921 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-08 12:47:05,921 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {176216#true} {176448#(<= ~counter~0 8)} #96#return; {176448#(<= ~counter~0 8)} is VALID [2022-04-08 12:47:05,921 INFO L290 TraceCheckUtils]: 62: Hoare triple {176216#true} assume true; {176216#true} is VALID [2022-04-08 12:47:05,922 INFO L290 TraceCheckUtils]: 61: Hoare triple {176216#true} assume !(0 == ~cond); {176216#true} is VALID [2022-04-08 12:47:05,922 INFO L290 TraceCheckUtils]: 60: Hoare triple {176216#true} ~cond := #in~cond; {176216#true} is VALID [2022-04-08 12:47:05,922 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-08 12:47:05,922 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-08 12:47:05,924 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-08 12:47:05,924 INFO L290 TraceCheckUtils]: 56: Hoare triple {176423#(<= ~counter~0 7)} assume !!(0 != ~r~0); {176423#(<= ~counter~0 7)} is VALID [2022-04-08 12:47:05,925 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {176216#true} {176423#(<= ~counter~0 7)} #94#return; {176423#(<= ~counter~0 7)} is VALID [2022-04-08 12:47:05,925 INFO L290 TraceCheckUtils]: 54: Hoare triple {176216#true} assume true; {176216#true} is VALID [2022-04-08 12:47:05,925 INFO L290 TraceCheckUtils]: 53: Hoare triple {176216#true} assume !(0 == ~cond); {176216#true} is VALID [2022-04-08 12:47:05,925 INFO L290 TraceCheckUtils]: 52: Hoare triple {176216#true} ~cond := #in~cond; {176216#true} is VALID [2022-04-08 12:47:05,925 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-08 12:47:05,925 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-08 12:47:05,927 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-08 12:47:05,928 INFO L290 TraceCheckUtils]: 48: Hoare triple {176398#(<= ~counter~0 6)} assume !(~r~0 < 0); {176398#(<= ~counter~0 6)} is VALID [2022-04-08 12:47:05,928 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {176216#true} {176398#(<= ~counter~0 6)} #98#return; {176398#(<= ~counter~0 6)} is VALID [2022-04-08 12:47:05,928 INFO L290 TraceCheckUtils]: 46: Hoare triple {176216#true} assume true; {176216#true} is VALID [2022-04-08 12:47:05,928 INFO L290 TraceCheckUtils]: 45: Hoare triple {176216#true} assume !(0 == ~cond); {176216#true} is VALID [2022-04-08 12:47:05,928 INFO L290 TraceCheckUtils]: 44: Hoare triple {176216#true} ~cond := #in~cond; {176216#true} is VALID [2022-04-08 12:47:05,928 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-08 12:47:05,929 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-08 12:47:05,930 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-08 12:47:05,931 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-08 12:47:05,931 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {176216#true} {176373#(<= ~counter~0 5)} #98#return; {176373#(<= ~counter~0 5)} is VALID [2022-04-08 12:47:05,931 INFO L290 TraceCheckUtils]: 38: Hoare triple {176216#true} assume true; {176216#true} is VALID [2022-04-08 12:47:05,931 INFO L290 TraceCheckUtils]: 37: Hoare triple {176216#true} assume !(0 == ~cond); {176216#true} is VALID [2022-04-08 12:47:05,931 INFO L290 TraceCheckUtils]: 36: Hoare triple {176216#true} ~cond := #in~cond; {176216#true} is VALID [2022-04-08 12:47:05,931 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-08 12:47:05,932 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-08 12:47:05,933 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-08 12:47:05,933 INFO L290 TraceCheckUtils]: 32: Hoare triple {176348#(<= ~counter~0 4)} assume !(~r~0 > 0); {176348#(<= ~counter~0 4)} is VALID [2022-04-08 12:47:05,934 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {176216#true} {176348#(<= ~counter~0 4)} #96#return; {176348#(<= ~counter~0 4)} is VALID [2022-04-08 12:47:05,934 INFO L290 TraceCheckUtils]: 30: Hoare triple {176216#true} assume true; {176216#true} is VALID [2022-04-08 12:47:05,934 INFO L290 TraceCheckUtils]: 29: Hoare triple {176216#true} assume !(0 == ~cond); {176216#true} is VALID [2022-04-08 12:47:05,934 INFO L290 TraceCheckUtils]: 28: Hoare triple {176216#true} ~cond := #in~cond; {176216#true} is VALID [2022-04-08 12:47:05,934 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-08 12:47:05,934 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-08 12:47:05,936 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-08 12:47:05,936 INFO L290 TraceCheckUtils]: 24: Hoare triple {176323#(<= ~counter~0 3)} assume !!(0 != ~r~0); {176323#(<= ~counter~0 3)} is VALID [2022-04-08 12:47:05,937 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {176216#true} {176323#(<= ~counter~0 3)} #94#return; {176323#(<= ~counter~0 3)} is VALID [2022-04-08 12:47:05,937 INFO L290 TraceCheckUtils]: 22: Hoare triple {176216#true} assume true; {176216#true} is VALID [2022-04-08 12:47:05,937 INFO L290 TraceCheckUtils]: 21: Hoare triple {176216#true} assume !(0 == ~cond); {176216#true} is VALID [2022-04-08 12:47:05,937 INFO L290 TraceCheckUtils]: 20: Hoare triple {176216#true} ~cond := #in~cond; {176216#true} is VALID [2022-04-08 12:47:05,937 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-08 12:47:05,937 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-08 12:47:05,939 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-08 12:47:05,940 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-08 12:47:05,940 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {176216#true} {176298#(<= ~counter~0 2)} #92#return; {176298#(<= ~counter~0 2)} is VALID [2022-04-08 12:47:05,940 INFO L290 TraceCheckUtils]: 14: Hoare triple {176216#true} assume true; {176216#true} is VALID [2022-04-08 12:47:05,940 INFO L290 TraceCheckUtils]: 13: Hoare triple {176216#true} assume !(0 == ~cond); {176216#true} is VALID [2022-04-08 12:47:05,940 INFO L290 TraceCheckUtils]: 12: Hoare triple {176216#true} ~cond := #in~cond; {176216#true} is VALID [2022-04-08 12:47:05,940 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-08 12:47:05,941 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {176216#true} {176298#(<= ~counter~0 2)} #90#return; {176298#(<= ~counter~0 2)} is VALID [2022-04-08 12:47:05,941 INFO L290 TraceCheckUtils]: 9: Hoare triple {176216#true} assume true; {176216#true} is VALID [2022-04-08 12:47:05,941 INFO L290 TraceCheckUtils]: 8: Hoare triple {176216#true} assume !(0 == ~cond); {176216#true} is VALID [2022-04-08 12:47:05,941 INFO L290 TraceCheckUtils]: 7: Hoare triple {176216#true} ~cond := #in~cond; {176216#true} is VALID [2022-04-08 12:47:05,941 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-08 12:47:05,941 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-08 12:47:05,941 INFO L272 TraceCheckUtils]: 4: Hoare triple {176298#(<= ~counter~0 2)} call #t~ret9 := main(); {176298#(<= ~counter~0 2)} is VALID [2022-04-08 12:47:05,942 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {176298#(<= ~counter~0 2)} {176216#true} #102#return; {176298#(<= ~counter~0 2)} is VALID [2022-04-08 12:47:05,942 INFO L290 TraceCheckUtils]: 2: Hoare triple {176298#(<= ~counter~0 2)} assume true; {176298#(<= ~counter~0 2)} is VALID [2022-04-08 12:47:05,942 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-08 12:47:05,942 INFO L272 TraceCheckUtils]: 0: Hoare triple {176216#true} call ULTIMATE.init(); {176216#true} is VALID [2022-04-08 12:47:05,943 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-08 12:47:05,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:47:05,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373571291] [2022-04-08 12:47:05,943 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:47:05,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638836855] [2022-04-08 12:47:05,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638836855] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:47:05,943 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:47:05,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 24 [2022-04-08 12:47:05,943 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:47:05,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1844386872] [2022-04-08 12:47:05,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1844386872] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:47:05,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:47:05,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-08 12:47:05,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454063061] [2022-04-08 12:47:05,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:47:05,944 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-08 12:47:05,944 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:47:05,944 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-08 12:47:06,179 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-08 12:47:06,179 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-08 12:47:06,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:47:06,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-08 12:47:06,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-08 12:47:06,180 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-08 12:47:12,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:47:12,389 INFO L93 Difference]: Finished difference Result 1077 states and 1465 transitions. [2022-04-08 12:47:12,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-08 12:47:12,389 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-08 12:47:12,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:47:12,389 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-08 12:47:12,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 376 transitions. [2022-04-08 12:47:12,392 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-08 12:47:12,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 376 transitions. [2022-04-08 12:47:12,395 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 376 transitions. [2022-04-08 12:47:12,929 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-08 12:47:12,966 INFO L225 Difference]: With dead ends: 1077 [2022-04-08 12:47:12,967 INFO L226 Difference]: Without dead ends: 907 [2022-04-08 12:47:12,967 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 302 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=588, Invalid=972, Unknown=0, NotChecked=0, Total=1560 [2022-04-08 12:47:12,968 INFO L913 BasicCegarLoop]: 81 mSDtfsCounter, 284 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 278 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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, 0.9s IncrementalHoareTripleChecker+Time [2022-04-08 12:47:12,968 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [284 Valid, 380 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [278 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-08 12:47:12,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2022-04-08 12:47:16,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 907. [2022-04-08 12:47:16,479 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:47:16,480 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-08 12:47:16,480 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-08 12:47:16,481 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-08 12:47:16,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:47:16,505 INFO L93 Difference]: Finished difference Result 907 states and 1204 transitions. [2022-04-08 12:47:16,505 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1204 transitions. [2022-04-08 12:47:16,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:47:16,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:47:16,507 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-08 12:47:16,507 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-08 12:47:16,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:47:16,532 INFO L93 Difference]: Finished difference Result 907 states and 1204 transitions. [2022-04-08 12:47:16,532 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1204 transitions. [2022-04-08 12:47:16,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:47:16,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:47:16,533 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:47:16,533 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:47:16,533 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-08 12:47:16,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1204 transitions. [2022-04-08 12:47:16,567 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1204 transitions. Word has length 163 [2022-04-08 12:47:16,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:47:16,567 INFO L478 AbstractCegarLoop]: Abstraction has 907 states and 1204 transitions. [2022-04-08 12:47:16,567 INFO L479 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-08 12:47:16,567 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 907 states and 1204 transitions. [2022-04-08 12:47:29,477 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1204 edges. 1202 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-08 12:47:29,477 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1204 transitions. [2022-04-08 12:47:29,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-04-08 12:47:29,479 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:47:29,479 INFO L499 BasicCegarLoop]: 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-08 12:47:29,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Forceful destruction successful, exit code 0 [2022-04-08 12:47:29,679 WARN L460 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-08 12:47:29,679 INFO L403 AbstractCegarLoop]: === Iteration 58 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:47:29,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:47:29,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1797417137, now seen corresponding path program 19 times [2022-04-08 12:47:29,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:47:29,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2109270730] [2022-04-08 12:47:29,680 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:47:29,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1797417137, now seen corresponding path program 20 times [2022-04-08 12:47:29,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:47:29,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961640234] [2022-04-08 12:47:29,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:47:29,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:47:29,693 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:47:29,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2005227521] [2022-04-08 12:47:29,693 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:47:29,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:47:29,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:47:29,694 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-08 12:47:29,695 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-08 12:47:29,762 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:47:29,762 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:47:29,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-08 12:47:29,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:47:29,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:47:30,655 INFO L272 TraceCheckUtils]: 0: Hoare triple {183031#true} call ULTIMATE.init(); {183031#true} is VALID [2022-04-08 12:47:30,655 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-08 12:47:30,656 INFO L290 TraceCheckUtils]: 2: Hoare triple {183039#(<= ~counter~0 0)} assume true; {183039#(<= ~counter~0 0)} is VALID [2022-04-08 12:47:30,656 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {183039#(<= ~counter~0 0)} {183031#true} #102#return; {183039#(<= ~counter~0 0)} is VALID [2022-04-08 12:47:30,656 INFO L272 TraceCheckUtils]: 4: Hoare triple {183039#(<= ~counter~0 0)} call #t~ret9 := main(); {183039#(<= ~counter~0 0)} is VALID [2022-04-08 12:47:30,657 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-08 12:47:30,657 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-08 12:47:30,657 INFO L290 TraceCheckUtils]: 7: Hoare triple {183039#(<= ~counter~0 0)} ~cond := #in~cond; {183039#(<= ~counter~0 0)} is VALID [2022-04-08 12:47:30,657 INFO L290 TraceCheckUtils]: 8: Hoare triple {183039#(<= ~counter~0 0)} assume !(0 == ~cond); {183039#(<= ~counter~0 0)} is VALID [2022-04-08 12:47:30,658 INFO L290 TraceCheckUtils]: 9: Hoare triple {183039#(<= ~counter~0 0)} assume true; {183039#(<= ~counter~0 0)} is VALID [2022-04-08 12:47:30,658 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {183039#(<= ~counter~0 0)} {183039#(<= ~counter~0 0)} #90#return; {183039#(<= ~counter~0 0)} is VALID [2022-04-08 12:47:30,659 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-08 12:47:30,659 INFO L290 TraceCheckUtils]: 12: Hoare triple {183039#(<= ~counter~0 0)} ~cond := #in~cond; {183039#(<= ~counter~0 0)} is VALID [2022-04-08 12:47:30,659 INFO L290 TraceCheckUtils]: 13: Hoare triple {183039#(<= ~counter~0 0)} assume !(0 == ~cond); {183039#(<= ~counter~0 0)} is VALID [2022-04-08 12:47:30,659 INFO L290 TraceCheckUtils]: 14: Hoare triple {183039#(<= ~counter~0 0)} assume true; {183039#(<= ~counter~0 0)} is VALID [2022-04-08 12:47:30,660 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {183039#(<= ~counter~0 0)} {183039#(<= ~counter~0 0)} #92#return; {183039#(<= ~counter~0 0)} is VALID [2022-04-08 12:47:30,660 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-08 12:47:30,664 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-08 12:47:30,664 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-08 12:47:30,664 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-08 12:47:30,665 INFO L290 TraceCheckUtils]: 20: Hoare triple {183088#(<= ~counter~0 1)} ~cond := #in~cond; {183088#(<= ~counter~0 1)} is VALID [2022-04-08 12:47:30,665 INFO L290 TraceCheckUtils]: 21: Hoare triple {183088#(<= ~counter~0 1)} assume !(0 == ~cond); {183088#(<= ~counter~0 1)} is VALID [2022-04-08 12:47:30,665 INFO L290 TraceCheckUtils]: 22: Hoare triple {183088#(<= ~counter~0 1)} assume true; {183088#(<= ~counter~0 1)} is VALID [2022-04-08 12:47:30,666 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {183088#(<= ~counter~0 1)} {183088#(<= ~counter~0 1)} #94#return; {183088#(<= ~counter~0 1)} is VALID [2022-04-08 12:47:30,666 INFO L290 TraceCheckUtils]: 24: Hoare triple {183088#(<= ~counter~0 1)} assume !!(0 != ~r~0); {183088#(<= ~counter~0 1)} is VALID [2022-04-08 12:47:30,668 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-08 12:47:30,668 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-08 12:47:30,668 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-08 12:47:30,669 INFO L290 TraceCheckUtils]: 28: Hoare triple {183113#(<= ~counter~0 2)} ~cond := #in~cond; {183113#(<= ~counter~0 2)} is VALID [2022-04-08 12:47:30,669 INFO L290 TraceCheckUtils]: 29: Hoare triple {183113#(<= ~counter~0 2)} assume !(0 == ~cond); {183113#(<= ~counter~0 2)} is VALID [2022-04-08 12:47:30,669 INFO L290 TraceCheckUtils]: 30: Hoare triple {183113#(<= ~counter~0 2)} assume true; {183113#(<= ~counter~0 2)} is VALID [2022-04-08 12:47:30,670 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {183113#(<= ~counter~0 2)} {183113#(<= ~counter~0 2)} #96#return; {183113#(<= ~counter~0 2)} is VALID [2022-04-08 12:47:30,670 INFO L290 TraceCheckUtils]: 32: Hoare triple {183113#(<= ~counter~0 2)} assume !(~r~0 > 0); {183113#(<= ~counter~0 2)} is VALID [2022-04-08 12:47:30,671 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-08 12:47:30,672 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-08 12:47:30,672 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-08 12:47:30,672 INFO L290 TraceCheckUtils]: 36: Hoare triple {183138#(<= ~counter~0 3)} ~cond := #in~cond; {183138#(<= ~counter~0 3)} is VALID [2022-04-08 12:47:30,673 INFO L290 TraceCheckUtils]: 37: Hoare triple {183138#(<= ~counter~0 3)} assume !(0 == ~cond); {183138#(<= ~counter~0 3)} is VALID [2022-04-08 12:47:30,673 INFO L290 TraceCheckUtils]: 38: Hoare triple {183138#(<= ~counter~0 3)} assume true; {183138#(<= ~counter~0 3)} is VALID [2022-04-08 12:47:30,673 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {183138#(<= ~counter~0 3)} {183138#(<= ~counter~0 3)} #98#return; {183138#(<= ~counter~0 3)} is VALID [2022-04-08 12:47:30,674 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-08 12:47:30,675 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-08 12:47:30,676 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-08 12:47:30,676 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-08 12:47:30,676 INFO L290 TraceCheckUtils]: 44: Hoare triple {183163#(<= ~counter~0 4)} ~cond := #in~cond; {183163#(<= ~counter~0 4)} is VALID [2022-04-08 12:47:30,677 INFO L290 TraceCheckUtils]: 45: Hoare triple {183163#(<= ~counter~0 4)} assume !(0 == ~cond); {183163#(<= ~counter~0 4)} is VALID [2022-04-08 12:47:30,677 INFO L290 TraceCheckUtils]: 46: Hoare triple {183163#(<= ~counter~0 4)} assume true; {183163#(<= ~counter~0 4)} is VALID [2022-04-08 12:47:30,677 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {183163#(<= ~counter~0 4)} {183163#(<= ~counter~0 4)} #98#return; {183163#(<= ~counter~0 4)} is VALID [2022-04-08 12:47:30,677 INFO L290 TraceCheckUtils]: 48: Hoare triple {183163#(<= ~counter~0 4)} assume !(~r~0 < 0); {183163#(<= ~counter~0 4)} is VALID [2022-04-08 12:47:30,679 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-08 12:47:30,679 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-08 12:47:30,680 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-08 12:47:30,680 INFO L290 TraceCheckUtils]: 52: Hoare triple {183188#(<= ~counter~0 5)} ~cond := #in~cond; {183188#(<= ~counter~0 5)} is VALID [2022-04-08 12:47:30,680 INFO L290 TraceCheckUtils]: 53: Hoare triple {183188#(<= ~counter~0 5)} assume !(0 == ~cond); {183188#(<= ~counter~0 5)} is VALID [2022-04-08 12:47:30,681 INFO L290 TraceCheckUtils]: 54: Hoare triple {183188#(<= ~counter~0 5)} assume true; {183188#(<= ~counter~0 5)} is VALID [2022-04-08 12:47:30,681 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {183188#(<= ~counter~0 5)} {183188#(<= ~counter~0 5)} #94#return; {183188#(<= ~counter~0 5)} is VALID [2022-04-08 12:47:30,681 INFO L290 TraceCheckUtils]: 56: Hoare triple {183188#(<= ~counter~0 5)} assume !!(0 != ~r~0); {183188#(<= ~counter~0 5)} is VALID [2022-04-08 12:47:30,683 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-08 12:47:30,683 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-08 12:47:30,684 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-08 12:47:30,684 INFO L290 TraceCheckUtils]: 60: Hoare triple {183213#(<= ~counter~0 6)} ~cond := #in~cond; {183213#(<= ~counter~0 6)} is VALID [2022-04-08 12:47:30,684 INFO L290 TraceCheckUtils]: 61: Hoare triple {183213#(<= ~counter~0 6)} assume !(0 == ~cond); {183213#(<= ~counter~0 6)} is VALID [2022-04-08 12:47:30,684 INFO L290 TraceCheckUtils]: 62: Hoare triple {183213#(<= ~counter~0 6)} assume true; {183213#(<= ~counter~0 6)} is VALID [2022-04-08 12:47:30,685 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {183213#(<= ~counter~0 6)} {183213#(<= ~counter~0 6)} #96#return; {183213#(<= ~counter~0 6)} is VALID [2022-04-08 12:47:30,685 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-08 12:47:30,687 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-08 12:47:30,687 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-08 12:47:30,687 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-08 12:47:30,688 INFO L290 TraceCheckUtils]: 68: Hoare triple {183238#(<= ~counter~0 7)} ~cond := #in~cond; {183238#(<= ~counter~0 7)} is VALID [2022-04-08 12:47:30,688 INFO L290 TraceCheckUtils]: 69: Hoare triple {183238#(<= ~counter~0 7)} assume !(0 == ~cond); {183238#(<= ~counter~0 7)} is VALID [2022-04-08 12:47:30,688 INFO L290 TraceCheckUtils]: 70: Hoare triple {183238#(<= ~counter~0 7)} assume true; {183238#(<= ~counter~0 7)} is VALID [2022-04-08 12:47:30,689 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {183238#(<= ~counter~0 7)} {183238#(<= ~counter~0 7)} #96#return; {183238#(<= ~counter~0 7)} is VALID [2022-04-08 12:47:30,689 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-08 12:47:30,690 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-08 12:47:30,690 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-08 12:47:30,691 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-08 12:47:30,691 INFO L290 TraceCheckUtils]: 76: Hoare triple {183263#(<= ~counter~0 8)} ~cond := #in~cond; {183263#(<= ~counter~0 8)} is VALID [2022-04-08 12:47:30,692 INFO L290 TraceCheckUtils]: 77: Hoare triple {183263#(<= ~counter~0 8)} assume !(0 == ~cond); {183263#(<= ~counter~0 8)} is VALID [2022-04-08 12:47:30,692 INFO L290 TraceCheckUtils]: 78: Hoare triple {183263#(<= ~counter~0 8)} assume true; {183263#(<= ~counter~0 8)} is VALID [2022-04-08 12:47:30,692 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {183263#(<= ~counter~0 8)} {183263#(<= ~counter~0 8)} #96#return; {183263#(<= ~counter~0 8)} is VALID [2022-04-08 12:47:30,693 INFO L290 TraceCheckUtils]: 80: Hoare triple {183263#(<= ~counter~0 8)} assume !(~r~0 > 0); {183263#(<= ~counter~0 8)} is VALID [2022-04-08 12:47:30,694 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-08 12:47:30,695 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-08 12:47:30,695 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-08 12:47:30,695 INFO L290 TraceCheckUtils]: 84: Hoare triple {183288#(<= ~counter~0 9)} ~cond := #in~cond; {183288#(<= ~counter~0 9)} is VALID [2022-04-08 12:47:30,696 INFO L290 TraceCheckUtils]: 85: Hoare triple {183288#(<= ~counter~0 9)} assume !(0 == ~cond); {183288#(<= ~counter~0 9)} is VALID [2022-04-08 12:47:30,696 INFO L290 TraceCheckUtils]: 86: Hoare triple {183288#(<= ~counter~0 9)} assume true; {183288#(<= ~counter~0 9)} is VALID [2022-04-08 12:47:30,696 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {183288#(<= ~counter~0 9)} {183288#(<= ~counter~0 9)} #98#return; {183288#(<= ~counter~0 9)} is VALID [2022-04-08 12:47:30,697 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-08 12:47:30,698 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-08 12:47:30,698 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-08 12:47:30,699 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-08 12:47:30,699 INFO L290 TraceCheckUtils]: 92: Hoare triple {183313#(<= ~counter~0 10)} ~cond := #in~cond; {183313#(<= ~counter~0 10)} is VALID [2022-04-08 12:47:30,699 INFO L290 TraceCheckUtils]: 93: Hoare triple {183313#(<= ~counter~0 10)} assume !(0 == ~cond); {183313#(<= ~counter~0 10)} is VALID [2022-04-08 12:47:30,700 INFO L290 TraceCheckUtils]: 94: Hoare triple {183313#(<= ~counter~0 10)} assume true; {183313#(<= ~counter~0 10)} is VALID [2022-04-08 12:47:30,700 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {183313#(<= ~counter~0 10)} {183313#(<= ~counter~0 10)} #98#return; {183313#(<= ~counter~0 10)} is VALID [2022-04-08 12:47:30,700 INFO L290 TraceCheckUtils]: 96: Hoare triple {183313#(<= ~counter~0 10)} assume !(~r~0 < 0); {183313#(<= ~counter~0 10)} is VALID [2022-04-08 12:47:30,702 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-08 12:47:30,702 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-08 12:47:30,703 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-08 12:47:30,703 INFO L290 TraceCheckUtils]: 100: Hoare triple {183338#(<= ~counter~0 11)} ~cond := #in~cond; {183338#(<= ~counter~0 11)} is VALID [2022-04-08 12:47:30,703 INFO L290 TraceCheckUtils]: 101: Hoare triple {183338#(<= ~counter~0 11)} assume !(0 == ~cond); {183338#(<= ~counter~0 11)} is VALID [2022-04-08 12:47:30,703 INFO L290 TraceCheckUtils]: 102: Hoare triple {183338#(<= ~counter~0 11)} assume true; {183338#(<= ~counter~0 11)} is VALID [2022-04-08 12:47:30,704 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {183338#(<= ~counter~0 11)} {183338#(<= ~counter~0 11)} #94#return; {183338#(<= ~counter~0 11)} is VALID [2022-04-08 12:47:30,704 INFO L290 TraceCheckUtils]: 104: Hoare triple {183338#(<= ~counter~0 11)} assume !!(0 != ~r~0); {183338#(<= ~counter~0 11)} is VALID [2022-04-08 12:47:30,706 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-08 12:47:30,706 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-08 12:47:30,707 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-08 12:47:30,707 INFO L290 TraceCheckUtils]: 108: Hoare triple {183363#(<= ~counter~0 12)} ~cond := #in~cond; {183363#(<= ~counter~0 12)} is VALID [2022-04-08 12:47:30,707 INFO L290 TraceCheckUtils]: 109: Hoare triple {183363#(<= ~counter~0 12)} assume !(0 == ~cond); {183363#(<= ~counter~0 12)} is VALID [2022-04-08 12:47:30,708 INFO L290 TraceCheckUtils]: 110: Hoare triple {183363#(<= ~counter~0 12)} assume true; {183363#(<= ~counter~0 12)} is VALID [2022-04-08 12:47:30,708 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {183363#(<= ~counter~0 12)} {183363#(<= ~counter~0 12)} #96#return; {183363#(<= ~counter~0 12)} is VALID [2022-04-08 12:47:30,708 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-08 12:47:30,710 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-08 12:47:30,710 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-08 12:47:30,711 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-08 12:47:30,711 INFO L290 TraceCheckUtils]: 116: Hoare triple {183388#(<= ~counter~0 13)} ~cond := #in~cond; {183388#(<= ~counter~0 13)} is VALID [2022-04-08 12:47:30,711 INFO L290 TraceCheckUtils]: 117: Hoare triple {183388#(<= ~counter~0 13)} assume !(0 == ~cond); {183388#(<= ~counter~0 13)} is VALID [2022-04-08 12:47:30,711 INFO L290 TraceCheckUtils]: 118: Hoare triple {183388#(<= ~counter~0 13)} assume true; {183388#(<= ~counter~0 13)} is VALID [2022-04-08 12:47:30,712 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {183388#(<= ~counter~0 13)} {183388#(<= ~counter~0 13)} #96#return; {183388#(<= ~counter~0 13)} is VALID [2022-04-08 12:47:30,712 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-08 12:47:30,714 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-08 12:47:30,714 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-08 12:47:30,714 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-08 12:47:30,715 INFO L290 TraceCheckUtils]: 124: Hoare triple {183413#(<= ~counter~0 14)} ~cond := #in~cond; {183413#(<= ~counter~0 14)} is VALID [2022-04-08 12:47:30,715 INFO L290 TraceCheckUtils]: 125: Hoare triple {183413#(<= ~counter~0 14)} assume !(0 == ~cond); {183413#(<= ~counter~0 14)} is VALID [2022-04-08 12:47:30,715 INFO L290 TraceCheckUtils]: 126: Hoare triple {183413#(<= ~counter~0 14)} assume true; {183413#(<= ~counter~0 14)} is VALID [2022-04-08 12:47:30,716 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {183413#(<= ~counter~0 14)} {183413#(<= ~counter~0 14)} #96#return; {183413#(<= ~counter~0 14)} is VALID [2022-04-08 12:47:30,716 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-08 12:47:30,717 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-08 12:47:30,717 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-08 12:47:30,718 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-08 12:47:30,718 INFO L290 TraceCheckUtils]: 132: Hoare triple {183438#(<= ~counter~0 15)} ~cond := #in~cond; {183438#(<= ~counter~0 15)} is VALID [2022-04-08 12:47:30,718 INFO L290 TraceCheckUtils]: 133: Hoare triple {183438#(<= ~counter~0 15)} assume !(0 == ~cond); {183438#(<= ~counter~0 15)} is VALID [2022-04-08 12:47:30,719 INFO L290 TraceCheckUtils]: 134: Hoare triple {183438#(<= ~counter~0 15)} assume true; {183438#(<= ~counter~0 15)} is VALID [2022-04-08 12:47:30,719 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {183438#(<= ~counter~0 15)} {183438#(<= ~counter~0 15)} #96#return; {183438#(<= ~counter~0 15)} is VALID [2022-04-08 12:47:30,719 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-08 12:47:30,721 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-08 12:47:30,721 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-08 12:47:30,722 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-08 12:47:30,722 INFO L290 TraceCheckUtils]: 140: Hoare triple {183463#(<= ~counter~0 16)} ~cond := #in~cond; {183463#(<= ~counter~0 16)} is VALID [2022-04-08 12:47:30,722 INFO L290 TraceCheckUtils]: 141: Hoare triple {183463#(<= ~counter~0 16)} assume !(0 == ~cond); {183463#(<= ~counter~0 16)} is VALID [2022-04-08 12:47:30,722 INFO L290 TraceCheckUtils]: 142: Hoare triple {183463#(<= ~counter~0 16)} assume true; {183463#(<= ~counter~0 16)} is VALID [2022-04-08 12:47:30,723 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {183463#(<= ~counter~0 16)} {183463#(<= ~counter~0 16)} #96#return; {183463#(<= ~counter~0 16)} is VALID [2022-04-08 12:47:30,723 INFO L290 TraceCheckUtils]: 144: Hoare triple {183463#(<= ~counter~0 16)} assume !(~r~0 > 0); {183463#(<= ~counter~0 16)} is VALID [2022-04-08 12:47:30,725 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-08 12:47:30,726 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-08 12:47:30,726 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-08 12:47:30,726 INFO L290 TraceCheckUtils]: 148: Hoare triple {183488#(<= ~counter~0 17)} ~cond := #in~cond; {183488#(<= ~counter~0 17)} is VALID [2022-04-08 12:47:30,727 INFO L290 TraceCheckUtils]: 149: Hoare triple {183488#(<= ~counter~0 17)} assume !(0 == ~cond); {183488#(<= ~counter~0 17)} is VALID [2022-04-08 12:47:30,727 INFO L290 TraceCheckUtils]: 150: Hoare triple {183488#(<= ~counter~0 17)} assume true; {183488#(<= ~counter~0 17)} is VALID [2022-04-08 12:47:30,727 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {183488#(<= ~counter~0 17)} {183488#(<= ~counter~0 17)} #98#return; {183488#(<= ~counter~0 17)} is VALID [2022-04-08 12:47:30,728 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-08 12:47:30,730 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-08 12:47:30,730 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-08 12:47:30,730 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-08 12:47:30,731 INFO L290 TraceCheckUtils]: 156: Hoare triple {183513#(<= ~counter~0 18)} ~cond := #in~cond; {183513#(<= ~counter~0 18)} is VALID [2022-04-08 12:47:30,731 INFO L290 TraceCheckUtils]: 157: Hoare triple {183513#(<= ~counter~0 18)} assume !(0 == ~cond); {183513#(<= ~counter~0 18)} is VALID [2022-04-08 12:47:30,731 INFO L290 TraceCheckUtils]: 158: Hoare triple {183513#(<= ~counter~0 18)} assume true; {183513#(<= ~counter~0 18)} is VALID [2022-04-08 12:47:30,732 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {183513#(<= ~counter~0 18)} {183513#(<= ~counter~0 18)} #98#return; {183513#(<= ~counter~0 18)} is VALID [2022-04-08 12:47:30,732 INFO L290 TraceCheckUtils]: 160: Hoare triple {183513#(<= ~counter~0 18)} assume !(~r~0 < 0); {183513#(<= ~counter~0 18)} is VALID [2022-04-08 12:47:30,732 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-08 12:47:30,733 INFO L290 TraceCheckUtils]: 162: Hoare triple {183538#(<= |main_#t~post6| 18)} assume !(#t~post6 < 20);havoc #t~post6; {183032#false} is VALID [2022-04-08 12:47:30,733 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-08 12:47:30,733 INFO L290 TraceCheckUtils]: 164: Hoare triple {183032#false} ~cond := #in~cond; {183032#false} is VALID [2022-04-08 12:47:30,733 INFO L290 TraceCheckUtils]: 165: Hoare triple {183032#false} assume 0 == ~cond; {183032#false} is VALID [2022-04-08 12:47:30,733 INFO L290 TraceCheckUtils]: 166: Hoare triple {183032#false} assume !false; {183032#false} is VALID [2022-04-08 12:47:30,733 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-08 12:47:30,733 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:47:31,416 INFO L290 TraceCheckUtils]: 166: Hoare triple {183032#false} assume !false; {183032#false} is VALID [2022-04-08 12:47:31,417 INFO L290 TraceCheckUtils]: 165: Hoare triple {183032#false} assume 0 == ~cond; {183032#false} is VALID [2022-04-08 12:47:31,417 INFO L290 TraceCheckUtils]: 164: Hoare triple {183032#false} ~cond := #in~cond; {183032#false} is VALID [2022-04-08 12:47:31,417 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-08 12:47:31,417 INFO L290 TraceCheckUtils]: 162: Hoare triple {183566#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {183032#false} is VALID [2022-04-08 12:47:31,417 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-08 12:47:31,418 INFO L290 TraceCheckUtils]: 160: Hoare triple {183570#(< ~counter~0 20)} assume !(~r~0 < 0); {183570#(< ~counter~0 20)} is VALID [2022-04-08 12:47:31,418 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {183031#true} {183570#(< ~counter~0 20)} #98#return; {183570#(< ~counter~0 20)} is VALID [2022-04-08 12:47:31,418 INFO L290 TraceCheckUtils]: 158: Hoare triple {183031#true} assume true; {183031#true} is VALID [2022-04-08 12:47:31,418 INFO L290 TraceCheckUtils]: 157: Hoare triple {183031#true} assume !(0 == ~cond); {183031#true} is VALID [2022-04-08 12:47:31,419 INFO L290 TraceCheckUtils]: 156: Hoare triple {183031#true} ~cond := #in~cond; {183031#true} is VALID [2022-04-08 12:47:31,419 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-08 12:47:31,419 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-08 12:47:31,423 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-08 12:47:31,423 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-08 12:47:31,424 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {183031#true} {183513#(<= ~counter~0 18)} #98#return; {183513#(<= ~counter~0 18)} is VALID [2022-04-08 12:47:31,424 INFO L290 TraceCheckUtils]: 150: Hoare triple {183031#true} assume true; {183031#true} is VALID [2022-04-08 12:47:31,424 INFO L290 TraceCheckUtils]: 149: Hoare triple {183031#true} assume !(0 == ~cond); {183031#true} is VALID [2022-04-08 12:47:31,424 INFO L290 TraceCheckUtils]: 148: Hoare triple {183031#true} ~cond := #in~cond; {183031#true} is VALID [2022-04-08 12:47:31,424 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-08 12:47:31,424 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-08 12:47:31,426 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-08 12:47:31,426 INFO L290 TraceCheckUtils]: 144: Hoare triple {183488#(<= ~counter~0 17)} assume !(~r~0 > 0); {183488#(<= ~counter~0 17)} is VALID [2022-04-08 12:47:31,427 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {183031#true} {183488#(<= ~counter~0 17)} #96#return; {183488#(<= ~counter~0 17)} is VALID [2022-04-08 12:47:31,427 INFO L290 TraceCheckUtils]: 142: Hoare triple {183031#true} assume true; {183031#true} is VALID [2022-04-08 12:47:31,427 INFO L290 TraceCheckUtils]: 141: Hoare triple {183031#true} assume !(0 == ~cond); {183031#true} is VALID [2022-04-08 12:47:31,427 INFO L290 TraceCheckUtils]: 140: Hoare triple {183031#true} ~cond := #in~cond; {183031#true} is VALID [2022-04-08 12:47:31,427 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-08 12:47:31,427 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-08 12:47:31,429 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-08 12:47:31,429 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-08 12:47:31,429 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {183031#true} {183463#(<= ~counter~0 16)} #96#return; {183463#(<= ~counter~0 16)} is VALID [2022-04-08 12:47:31,430 INFO L290 TraceCheckUtils]: 134: Hoare triple {183031#true} assume true; {183031#true} is VALID [2022-04-08 12:47:31,430 INFO L290 TraceCheckUtils]: 133: Hoare triple {183031#true} assume !(0 == ~cond); {183031#true} is VALID [2022-04-08 12:47:31,430 INFO L290 TraceCheckUtils]: 132: Hoare triple {183031#true} ~cond := #in~cond; {183031#true} is VALID [2022-04-08 12:47:31,430 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-08 12:47:31,430 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-08 12:47:31,432 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-08 12:47:31,432 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-08 12:47:31,432 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {183031#true} {183438#(<= ~counter~0 15)} #96#return; {183438#(<= ~counter~0 15)} is VALID [2022-04-08 12:47:31,432 INFO L290 TraceCheckUtils]: 126: Hoare triple {183031#true} assume true; {183031#true} is VALID [2022-04-08 12:47:31,432 INFO L290 TraceCheckUtils]: 125: Hoare triple {183031#true} assume !(0 == ~cond); {183031#true} is VALID [2022-04-08 12:47:31,433 INFO L290 TraceCheckUtils]: 124: Hoare triple {183031#true} ~cond := #in~cond; {183031#true} is VALID [2022-04-08 12:47:31,433 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-08 12:47:31,433 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-08 12:47:31,434 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-08 12:47:31,435 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-08 12:47:31,435 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {183031#true} {183413#(<= ~counter~0 14)} #96#return; {183413#(<= ~counter~0 14)} is VALID [2022-04-08 12:47:31,435 INFO L290 TraceCheckUtils]: 118: Hoare triple {183031#true} assume true; {183031#true} is VALID [2022-04-08 12:47:31,435 INFO L290 TraceCheckUtils]: 117: Hoare triple {183031#true} assume !(0 == ~cond); {183031#true} is VALID [2022-04-08 12:47:31,436 INFO L290 TraceCheckUtils]: 116: Hoare triple {183031#true} ~cond := #in~cond; {183031#true} is VALID [2022-04-08 12:47:31,436 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-08 12:47:31,436 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-08 12:47:31,438 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-08 12:47:31,439 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-08 12:47:31,439 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {183031#true} {183388#(<= ~counter~0 13)} #96#return; {183388#(<= ~counter~0 13)} is VALID [2022-04-08 12:47:31,439 INFO L290 TraceCheckUtils]: 110: Hoare triple {183031#true} assume true; {183031#true} is VALID [2022-04-08 12:47:31,439 INFO L290 TraceCheckUtils]: 109: Hoare triple {183031#true} assume !(0 == ~cond); {183031#true} is VALID [2022-04-08 12:47:31,439 INFO L290 TraceCheckUtils]: 108: Hoare triple {183031#true} ~cond := #in~cond; {183031#true} is VALID [2022-04-08 12:47:31,440 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-08 12:47:31,440 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-08 12:47:31,442 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-08 12:47:31,442 INFO L290 TraceCheckUtils]: 104: Hoare triple {183363#(<= ~counter~0 12)} assume !!(0 != ~r~0); {183363#(<= ~counter~0 12)} is VALID [2022-04-08 12:47:31,443 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {183031#true} {183363#(<= ~counter~0 12)} #94#return; {183363#(<= ~counter~0 12)} is VALID [2022-04-08 12:47:31,443 INFO L290 TraceCheckUtils]: 102: Hoare triple {183031#true} assume true; {183031#true} is VALID [2022-04-08 12:47:31,443 INFO L290 TraceCheckUtils]: 101: Hoare triple {183031#true} assume !(0 == ~cond); {183031#true} is VALID [2022-04-08 12:47:31,443 INFO L290 TraceCheckUtils]: 100: Hoare triple {183031#true} ~cond := #in~cond; {183031#true} is VALID [2022-04-08 12:47:31,443 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-08 12:47:31,443 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-08 12:47:31,445 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-08 12:47:31,445 INFO L290 TraceCheckUtils]: 96: Hoare triple {183338#(<= ~counter~0 11)} assume !(~r~0 < 0); {183338#(<= ~counter~0 11)} is VALID [2022-04-08 12:47:31,446 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {183031#true} {183338#(<= ~counter~0 11)} #98#return; {183338#(<= ~counter~0 11)} is VALID [2022-04-08 12:47:31,446 INFO L290 TraceCheckUtils]: 94: Hoare triple {183031#true} assume true; {183031#true} is VALID [2022-04-08 12:47:31,446 INFO L290 TraceCheckUtils]: 93: Hoare triple {183031#true} assume !(0 == ~cond); {183031#true} is VALID [2022-04-08 12:47:31,446 INFO L290 TraceCheckUtils]: 92: Hoare triple {183031#true} ~cond := #in~cond; {183031#true} is VALID [2022-04-08 12:47:31,446 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-08 12:47:31,447 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-08 12:47:31,449 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-08 12:47:31,449 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-08 12:47:31,450 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {183031#true} {183313#(<= ~counter~0 10)} #98#return; {183313#(<= ~counter~0 10)} is VALID [2022-04-08 12:47:31,450 INFO L290 TraceCheckUtils]: 86: Hoare triple {183031#true} assume true; {183031#true} is VALID [2022-04-08 12:47:31,450 INFO L290 TraceCheckUtils]: 85: Hoare triple {183031#true} assume !(0 == ~cond); {183031#true} is VALID [2022-04-08 12:47:31,450 INFO L290 TraceCheckUtils]: 84: Hoare triple {183031#true} ~cond := #in~cond; {183031#true} is VALID [2022-04-08 12:47:31,450 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-08 12:47:31,450 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-08 12:47:31,453 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-08 12:47:31,453 INFO L290 TraceCheckUtils]: 80: Hoare triple {183288#(<= ~counter~0 9)} assume !(~r~0 > 0); {183288#(<= ~counter~0 9)} is VALID [2022-04-08 12:47:31,453 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {183031#true} {183288#(<= ~counter~0 9)} #96#return; {183288#(<= ~counter~0 9)} is VALID [2022-04-08 12:47:31,454 INFO L290 TraceCheckUtils]: 78: Hoare triple {183031#true} assume true; {183031#true} is VALID [2022-04-08 12:47:31,454 INFO L290 TraceCheckUtils]: 77: Hoare triple {183031#true} assume !(0 == ~cond); {183031#true} is VALID [2022-04-08 12:47:31,454 INFO L290 TraceCheckUtils]: 76: Hoare triple {183031#true} ~cond := #in~cond; {183031#true} is VALID [2022-04-08 12:47:31,454 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-08 12:47:31,454 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-08 12:47:31,456 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-08 12:47:31,456 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-08 12:47:31,457 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {183031#true} {183263#(<= ~counter~0 8)} #96#return; {183263#(<= ~counter~0 8)} is VALID [2022-04-08 12:47:31,457 INFO L290 TraceCheckUtils]: 70: Hoare triple {183031#true} assume true; {183031#true} is VALID [2022-04-08 12:47:31,457 INFO L290 TraceCheckUtils]: 69: Hoare triple {183031#true} assume !(0 == ~cond); {183031#true} is VALID [2022-04-08 12:47:31,457 INFO L290 TraceCheckUtils]: 68: Hoare triple {183031#true} ~cond := #in~cond; {183031#true} is VALID [2022-04-08 12:47:31,457 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-08 12:47:31,457 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-08 12:47:31,459 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-08 12:47:31,459 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-08 12:47:31,460 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {183031#true} {183238#(<= ~counter~0 7)} #96#return; {183238#(<= ~counter~0 7)} is VALID [2022-04-08 12:47:31,460 INFO L290 TraceCheckUtils]: 62: Hoare triple {183031#true} assume true; {183031#true} is VALID [2022-04-08 12:47:31,460 INFO L290 TraceCheckUtils]: 61: Hoare triple {183031#true} assume !(0 == ~cond); {183031#true} is VALID [2022-04-08 12:47:31,460 INFO L290 TraceCheckUtils]: 60: Hoare triple {183031#true} ~cond := #in~cond; {183031#true} is VALID [2022-04-08 12:47:31,460 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-08 12:47:31,460 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-08 12:47:31,462 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-08 12:47:31,462 INFO L290 TraceCheckUtils]: 56: Hoare triple {183213#(<= ~counter~0 6)} assume !!(0 != ~r~0); {183213#(<= ~counter~0 6)} is VALID [2022-04-08 12:47:31,463 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {183031#true} {183213#(<= ~counter~0 6)} #94#return; {183213#(<= ~counter~0 6)} is VALID [2022-04-08 12:47:31,463 INFO L290 TraceCheckUtils]: 54: Hoare triple {183031#true} assume true; {183031#true} is VALID [2022-04-08 12:47:31,463 INFO L290 TraceCheckUtils]: 53: Hoare triple {183031#true} assume !(0 == ~cond); {183031#true} is VALID [2022-04-08 12:47:31,463 INFO L290 TraceCheckUtils]: 52: Hoare triple {183031#true} ~cond := #in~cond; {183031#true} is VALID [2022-04-08 12:47:31,463 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-08 12:47:31,463 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-08 12:47:31,465 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-08 12:47:31,466 INFO L290 TraceCheckUtils]: 48: Hoare triple {183188#(<= ~counter~0 5)} assume !(~r~0 < 0); {183188#(<= ~counter~0 5)} is VALID [2022-04-08 12:47:31,466 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {183031#true} {183188#(<= ~counter~0 5)} #98#return; {183188#(<= ~counter~0 5)} is VALID [2022-04-08 12:47:31,466 INFO L290 TraceCheckUtils]: 46: Hoare triple {183031#true} assume true; {183031#true} is VALID [2022-04-08 12:47:31,466 INFO L290 TraceCheckUtils]: 45: Hoare triple {183031#true} assume !(0 == ~cond); {183031#true} is VALID [2022-04-08 12:47:31,466 INFO L290 TraceCheckUtils]: 44: Hoare triple {183031#true} ~cond := #in~cond; {183031#true} is VALID [2022-04-08 12:47:31,466 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-08 12:47:31,467 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-08 12:47:31,469 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-08 12:47:31,469 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-08 12:47:31,469 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {183031#true} {183163#(<= ~counter~0 4)} #98#return; {183163#(<= ~counter~0 4)} is VALID [2022-04-08 12:47:31,469 INFO L290 TraceCheckUtils]: 38: Hoare triple {183031#true} assume true; {183031#true} is VALID [2022-04-08 12:47:31,470 INFO L290 TraceCheckUtils]: 37: Hoare triple {183031#true} assume !(0 == ~cond); {183031#true} is VALID [2022-04-08 12:47:31,470 INFO L290 TraceCheckUtils]: 36: Hoare triple {183031#true} ~cond := #in~cond; {183031#true} is VALID [2022-04-08 12:47:31,470 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-08 12:47:31,470 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-08 12:47:31,472 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-08 12:47:31,472 INFO L290 TraceCheckUtils]: 32: Hoare triple {183138#(<= ~counter~0 3)} assume !(~r~0 > 0); {183138#(<= ~counter~0 3)} is VALID [2022-04-08 12:47:31,473 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {183031#true} {183138#(<= ~counter~0 3)} #96#return; {183138#(<= ~counter~0 3)} is VALID [2022-04-08 12:47:31,473 INFO L290 TraceCheckUtils]: 30: Hoare triple {183031#true} assume true; {183031#true} is VALID [2022-04-08 12:47:31,473 INFO L290 TraceCheckUtils]: 29: Hoare triple {183031#true} assume !(0 == ~cond); {183031#true} is VALID [2022-04-08 12:47:31,473 INFO L290 TraceCheckUtils]: 28: Hoare triple {183031#true} ~cond := #in~cond; {183031#true} is VALID [2022-04-08 12:47:31,473 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-08 12:47:31,474 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-08 12:47:31,476 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-08 12:47:31,476 INFO L290 TraceCheckUtils]: 24: Hoare triple {183113#(<= ~counter~0 2)} assume !!(0 != ~r~0); {183113#(<= ~counter~0 2)} is VALID [2022-04-08 12:47:31,477 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {183031#true} {183113#(<= ~counter~0 2)} #94#return; {183113#(<= ~counter~0 2)} is VALID [2022-04-08 12:47:31,477 INFO L290 TraceCheckUtils]: 22: Hoare triple {183031#true} assume true; {183031#true} is VALID [2022-04-08 12:47:31,477 INFO L290 TraceCheckUtils]: 21: Hoare triple {183031#true} assume !(0 == ~cond); {183031#true} is VALID [2022-04-08 12:47:31,477 INFO L290 TraceCheckUtils]: 20: Hoare triple {183031#true} ~cond := #in~cond; {183031#true} is VALID [2022-04-08 12:47:31,477 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-08 12:47:31,477 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-08 12:47:31,479 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-08 12:47:31,479 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-08 12:47:31,479 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {183031#true} {183088#(<= ~counter~0 1)} #92#return; {183088#(<= ~counter~0 1)} is VALID [2022-04-08 12:47:31,479 INFO L290 TraceCheckUtils]: 14: Hoare triple {183031#true} assume true; {183031#true} is VALID [2022-04-08 12:47:31,479 INFO L290 TraceCheckUtils]: 13: Hoare triple {183031#true} assume !(0 == ~cond); {183031#true} is VALID [2022-04-08 12:47:31,479 INFO L290 TraceCheckUtils]: 12: Hoare triple {183031#true} ~cond := #in~cond; {183031#true} is VALID [2022-04-08 12:47:31,480 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-08 12:47:31,480 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {183031#true} {183088#(<= ~counter~0 1)} #90#return; {183088#(<= ~counter~0 1)} is VALID [2022-04-08 12:47:31,480 INFO L290 TraceCheckUtils]: 9: Hoare triple {183031#true} assume true; {183031#true} is VALID [2022-04-08 12:47:31,480 INFO L290 TraceCheckUtils]: 8: Hoare triple {183031#true} assume !(0 == ~cond); {183031#true} is VALID [2022-04-08 12:47:31,480 INFO L290 TraceCheckUtils]: 7: Hoare triple {183031#true} ~cond := #in~cond; {183031#true} is VALID [2022-04-08 12:47:31,480 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-08 12:47:31,480 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-08 12:47:31,481 INFO L272 TraceCheckUtils]: 4: Hoare triple {183088#(<= ~counter~0 1)} call #t~ret9 := main(); {183088#(<= ~counter~0 1)} is VALID [2022-04-08 12:47:31,481 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {183088#(<= ~counter~0 1)} {183031#true} #102#return; {183088#(<= ~counter~0 1)} is VALID [2022-04-08 12:47:31,481 INFO L290 TraceCheckUtils]: 2: Hoare triple {183088#(<= ~counter~0 1)} assume true; {183088#(<= ~counter~0 1)} is VALID [2022-04-08 12:47:31,482 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-08 12:47:31,482 INFO L272 TraceCheckUtils]: 0: Hoare triple {183031#true} call ULTIMATE.init(); {183031#true} is VALID [2022-04-08 12:47:31,482 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-08 12:47:31,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:47:31,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961640234] [2022-04-08 12:47:31,482 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:47:31,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005227521] [2022-04-08 12:47:31,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2005227521] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:47:31,482 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:47:31,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 24 [2022-04-08 12:47:31,483 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:47:31,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2109270730] [2022-04-08 12:47:31,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2109270730] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:47:31,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:47:31,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-08 12:47:31,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159494058] [2022-04-08 12:47:31,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:47:31,483 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-08 12:47:31,484 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:47:31,484 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-08 12:47:31,754 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-08 12:47:31,754 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-08 12:47:31,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:47:31,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-08 12:47:31,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-08 12:47:31,755 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-08 12:47:38,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:47:38,316 INFO L93 Difference]: Finished difference Result 958 states and 1274 transitions. [2022-04-08 12:47:38,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-08 12:47:38,316 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-08 12:47:38,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:47:38,317 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-08 12:47:38,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 374 transitions. [2022-04-08 12:47:38,322 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-08 12:47:38,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 374 transitions. [2022-04-08 12:47:38,325 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 374 transitions. [2022-04-08 12:47:38,841 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-08 12:47:38,885 INFO L225 Difference]: With dead ends: 958 [2022-04-08 12:47:38,885 INFO L226 Difference]: Without dead ends: 953 [2022-04-08 12:47:38,885 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 310 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=539, Invalid=943, Unknown=0, NotChecked=0, Total=1482 [2022-04-08 12:47:38,885 INFO L913 BasicCegarLoop]: 84 mSDtfsCounter, 344 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 339 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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, 0.9s IncrementalHoareTripleChecker+Time [2022-04-08 12:47:38,886 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [344 Valid, 388 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [339 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-08 12:47:38,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2022-04-08 12:47:42,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 931. [2022-04-08 12:47:42,451 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:47:42,452 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-08 12:47:42,453 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-08 12:47:42,453 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-08 12:47:42,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:47:42,483 INFO L93 Difference]: Finished difference Result 953 states and 1268 transitions. [2022-04-08 12:47:42,483 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1268 transitions. [2022-04-08 12:47:42,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:47:42,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:47:42,485 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-08 12:47:42,485 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-08 12:47:42,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:47:42,520 INFO L93 Difference]: Finished difference Result 953 states and 1268 transitions. [2022-04-08 12:47:42,520 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1268 transitions. [2022-04-08 12:47:42,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:47:42,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:47:42,521 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:47:42,521 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:47:42,522 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-08 12:47:42,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1242 transitions. [2022-04-08 12:47:42,558 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1242 transitions. Word has length 167 [2022-04-08 12:47:42,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:47:42,558 INFO L478 AbstractCegarLoop]: Abstraction has 931 states and 1242 transitions. [2022-04-08 12:47:42,558 INFO L479 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-08 12:47:42,558 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 931 states and 1242 transitions. [2022-04-08 12:47:54,046 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1242 edges. 1241 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 12:47:54,046 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1242 transitions. [2022-04-08 12:47:54,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-04-08 12:47:54,047 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:47:54,048 INFO L499 BasicCegarLoop]: 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-08 12:47:54,064 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-08 12:47:54,248 WARN L460 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-08 12:47:54,248 INFO L403 AbstractCegarLoop]: === Iteration 59 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:47:54,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:47:54,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1993951238, now seen corresponding path program 31 times [2022-04-08 12:47:54,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:47:54,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1165420254] [2022-04-08 12:47:54,249 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:47:54,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1993951238, now seen corresponding path program 32 times [2022-04-08 12:47:54,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:47:54,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314033939] [2022-04-08 12:47:54,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:47:54,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:47:54,262 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:47:54,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [729830986] [2022-04-08 12:47:54,263 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:47:54,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:47:54,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:47:54,263 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-08 12:47:54,264 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-08 12:47:54,336 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:47:54,336 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:47:54,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-08 12:47:54,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:47:54,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:47:55,235 INFO L272 TraceCheckUtils]: 0: Hoare triple {189770#true} call ULTIMATE.init(); {189770#true} is VALID [2022-04-08 12:47:55,235 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-08 12:47:55,236 INFO L290 TraceCheckUtils]: 2: Hoare triple {189778#(<= ~counter~0 0)} assume true; {189778#(<= ~counter~0 0)} is VALID [2022-04-08 12:47:55,236 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {189778#(<= ~counter~0 0)} {189770#true} #102#return; {189778#(<= ~counter~0 0)} is VALID [2022-04-08 12:47:55,236 INFO L272 TraceCheckUtils]: 4: Hoare triple {189778#(<= ~counter~0 0)} call #t~ret9 := main(); {189778#(<= ~counter~0 0)} is VALID [2022-04-08 12:47:55,236 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-08 12:47:55,237 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-08 12:47:55,237 INFO L290 TraceCheckUtils]: 7: Hoare triple {189778#(<= ~counter~0 0)} ~cond := #in~cond; {189778#(<= ~counter~0 0)} is VALID [2022-04-08 12:47:55,237 INFO L290 TraceCheckUtils]: 8: Hoare triple {189778#(<= ~counter~0 0)} assume !(0 == ~cond); {189778#(<= ~counter~0 0)} is VALID [2022-04-08 12:47:55,238 INFO L290 TraceCheckUtils]: 9: Hoare triple {189778#(<= ~counter~0 0)} assume true; {189778#(<= ~counter~0 0)} is VALID [2022-04-08 12:47:55,238 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {189778#(<= ~counter~0 0)} {189778#(<= ~counter~0 0)} #90#return; {189778#(<= ~counter~0 0)} is VALID [2022-04-08 12:47:55,238 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-08 12:47:55,239 INFO L290 TraceCheckUtils]: 12: Hoare triple {189778#(<= ~counter~0 0)} ~cond := #in~cond; {189778#(<= ~counter~0 0)} is VALID [2022-04-08 12:47:55,239 INFO L290 TraceCheckUtils]: 13: Hoare triple {189778#(<= ~counter~0 0)} assume !(0 == ~cond); {189778#(<= ~counter~0 0)} is VALID [2022-04-08 12:47:55,239 INFO L290 TraceCheckUtils]: 14: Hoare triple {189778#(<= ~counter~0 0)} assume true; {189778#(<= ~counter~0 0)} is VALID [2022-04-08 12:47:55,240 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {189778#(<= ~counter~0 0)} {189778#(<= ~counter~0 0)} #92#return; {189778#(<= ~counter~0 0)} is VALID [2022-04-08 12:47:55,240 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-08 12:47:55,244 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-08 12:47:55,244 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-08 12:47:55,244 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-08 12:47:55,245 INFO L290 TraceCheckUtils]: 20: Hoare triple {189827#(<= ~counter~0 1)} ~cond := #in~cond; {189827#(<= ~counter~0 1)} is VALID [2022-04-08 12:47:55,245 INFO L290 TraceCheckUtils]: 21: Hoare triple {189827#(<= ~counter~0 1)} assume !(0 == ~cond); {189827#(<= ~counter~0 1)} is VALID [2022-04-08 12:47:55,245 INFO L290 TraceCheckUtils]: 22: Hoare triple {189827#(<= ~counter~0 1)} assume true; {189827#(<= ~counter~0 1)} is VALID [2022-04-08 12:47:55,246 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {189827#(<= ~counter~0 1)} {189827#(<= ~counter~0 1)} #94#return; {189827#(<= ~counter~0 1)} is VALID [2022-04-08 12:47:55,246 INFO L290 TraceCheckUtils]: 24: Hoare triple {189827#(<= ~counter~0 1)} assume !!(0 != ~r~0); {189827#(<= ~counter~0 1)} is VALID [2022-04-08 12:47:55,248 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-08 12:47:55,248 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-08 12:47:55,249 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-08 12:47:55,249 INFO L290 TraceCheckUtils]: 28: Hoare triple {189852#(<= ~counter~0 2)} ~cond := #in~cond; {189852#(<= ~counter~0 2)} is VALID [2022-04-08 12:47:55,249 INFO L290 TraceCheckUtils]: 29: Hoare triple {189852#(<= ~counter~0 2)} assume !(0 == ~cond); {189852#(<= ~counter~0 2)} is VALID [2022-04-08 12:47:55,249 INFO L290 TraceCheckUtils]: 30: Hoare triple {189852#(<= ~counter~0 2)} assume true; {189852#(<= ~counter~0 2)} is VALID [2022-04-08 12:47:55,250 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {189852#(<= ~counter~0 2)} {189852#(<= ~counter~0 2)} #96#return; {189852#(<= ~counter~0 2)} is VALID [2022-04-08 12:47:55,250 INFO L290 TraceCheckUtils]: 32: Hoare triple {189852#(<= ~counter~0 2)} assume !(~r~0 > 0); {189852#(<= ~counter~0 2)} is VALID [2022-04-08 12:47:55,252 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-08 12:47:55,252 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-08 12:47:55,252 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-08 12:47:55,253 INFO L290 TraceCheckUtils]: 36: Hoare triple {189877#(<= ~counter~0 3)} ~cond := #in~cond; {189877#(<= ~counter~0 3)} is VALID [2022-04-08 12:47:55,253 INFO L290 TraceCheckUtils]: 37: Hoare triple {189877#(<= ~counter~0 3)} assume !(0 == ~cond); {189877#(<= ~counter~0 3)} is VALID [2022-04-08 12:47:55,253 INFO L290 TraceCheckUtils]: 38: Hoare triple {189877#(<= ~counter~0 3)} assume true; {189877#(<= ~counter~0 3)} is VALID [2022-04-08 12:47:55,254 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {189877#(<= ~counter~0 3)} {189877#(<= ~counter~0 3)} #98#return; {189877#(<= ~counter~0 3)} is VALID [2022-04-08 12:47:55,254 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-08 12:47:55,255 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-08 12:47:55,256 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-08 12:47:55,256 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-08 12:47:55,256 INFO L290 TraceCheckUtils]: 44: Hoare triple {189902#(<= ~counter~0 4)} ~cond := #in~cond; {189902#(<= ~counter~0 4)} is VALID [2022-04-08 12:47:55,257 INFO L290 TraceCheckUtils]: 45: Hoare triple {189902#(<= ~counter~0 4)} assume !(0 == ~cond); {189902#(<= ~counter~0 4)} is VALID [2022-04-08 12:47:55,257 INFO L290 TraceCheckUtils]: 46: Hoare triple {189902#(<= ~counter~0 4)} assume true; {189902#(<= ~counter~0 4)} is VALID [2022-04-08 12:47:55,257 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {189902#(<= ~counter~0 4)} {189902#(<= ~counter~0 4)} #98#return; {189902#(<= ~counter~0 4)} is VALID [2022-04-08 12:47:55,258 INFO L290 TraceCheckUtils]: 48: Hoare triple {189902#(<= ~counter~0 4)} assume !(~r~0 < 0); {189902#(<= ~counter~0 4)} is VALID [2022-04-08 12:47:55,259 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-08 12:47:55,260 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-08 12:47:55,260 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-08 12:47:55,260 INFO L290 TraceCheckUtils]: 52: Hoare triple {189927#(<= ~counter~0 5)} ~cond := #in~cond; {189927#(<= ~counter~0 5)} is VALID [2022-04-08 12:47:55,261 INFO L290 TraceCheckUtils]: 53: Hoare triple {189927#(<= ~counter~0 5)} assume !(0 == ~cond); {189927#(<= ~counter~0 5)} is VALID [2022-04-08 12:47:55,261 INFO L290 TraceCheckUtils]: 54: Hoare triple {189927#(<= ~counter~0 5)} assume true; {189927#(<= ~counter~0 5)} is VALID [2022-04-08 12:47:55,261 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {189927#(<= ~counter~0 5)} {189927#(<= ~counter~0 5)} #94#return; {189927#(<= ~counter~0 5)} is VALID [2022-04-08 12:47:55,262 INFO L290 TraceCheckUtils]: 56: Hoare triple {189927#(<= ~counter~0 5)} assume !!(0 != ~r~0); {189927#(<= ~counter~0 5)} is VALID [2022-04-08 12:47:55,263 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-08 12:47:55,264 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-08 12:47:55,264 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-08 12:47:55,264 INFO L290 TraceCheckUtils]: 60: Hoare triple {189952#(<= ~counter~0 6)} ~cond := #in~cond; {189952#(<= ~counter~0 6)} is VALID [2022-04-08 12:47:55,265 INFO L290 TraceCheckUtils]: 61: Hoare triple {189952#(<= ~counter~0 6)} assume !(0 == ~cond); {189952#(<= ~counter~0 6)} is VALID [2022-04-08 12:47:55,265 INFO L290 TraceCheckUtils]: 62: Hoare triple {189952#(<= ~counter~0 6)} assume true; {189952#(<= ~counter~0 6)} is VALID [2022-04-08 12:47:55,265 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {189952#(<= ~counter~0 6)} {189952#(<= ~counter~0 6)} #96#return; {189952#(<= ~counter~0 6)} is VALID [2022-04-08 12:47:55,266 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-08 12:47:55,267 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-08 12:47:55,268 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-08 12:47:55,268 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-08 12:47:55,268 INFO L290 TraceCheckUtils]: 68: Hoare triple {189977#(<= ~counter~0 7)} ~cond := #in~cond; {189977#(<= ~counter~0 7)} is VALID [2022-04-08 12:47:55,269 INFO L290 TraceCheckUtils]: 69: Hoare triple {189977#(<= ~counter~0 7)} assume !(0 == ~cond); {189977#(<= ~counter~0 7)} is VALID [2022-04-08 12:47:55,269 INFO L290 TraceCheckUtils]: 70: Hoare triple {189977#(<= ~counter~0 7)} assume true; {189977#(<= ~counter~0 7)} is VALID [2022-04-08 12:47:55,269 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {189977#(<= ~counter~0 7)} {189977#(<= ~counter~0 7)} #96#return; {189977#(<= ~counter~0 7)} is VALID [2022-04-08 12:47:55,270 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-08 12:47:55,271 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-08 12:47:55,271 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-08 12:47:55,272 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-08 12:47:55,272 INFO L290 TraceCheckUtils]: 76: Hoare triple {190002#(<= ~counter~0 8)} ~cond := #in~cond; {190002#(<= ~counter~0 8)} is VALID [2022-04-08 12:47:55,272 INFO L290 TraceCheckUtils]: 77: Hoare triple {190002#(<= ~counter~0 8)} assume !(0 == ~cond); {190002#(<= ~counter~0 8)} is VALID [2022-04-08 12:47:55,273 INFO L290 TraceCheckUtils]: 78: Hoare triple {190002#(<= ~counter~0 8)} assume true; {190002#(<= ~counter~0 8)} is VALID [2022-04-08 12:47:55,273 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {190002#(<= ~counter~0 8)} {190002#(<= ~counter~0 8)} #96#return; {190002#(<= ~counter~0 8)} is VALID [2022-04-08 12:47:55,273 INFO L290 TraceCheckUtils]: 80: Hoare triple {190002#(<= ~counter~0 8)} assume !(~r~0 > 0); {190002#(<= ~counter~0 8)} is VALID [2022-04-08 12:47:55,275 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-08 12:47:55,275 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-08 12:47:55,276 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-08 12:47:55,276 INFO L290 TraceCheckUtils]: 84: Hoare triple {190027#(<= ~counter~0 9)} ~cond := #in~cond; {190027#(<= ~counter~0 9)} is VALID [2022-04-08 12:47:55,276 INFO L290 TraceCheckUtils]: 85: Hoare triple {190027#(<= ~counter~0 9)} assume !(0 == ~cond); {190027#(<= ~counter~0 9)} is VALID [2022-04-08 12:47:55,277 INFO L290 TraceCheckUtils]: 86: Hoare triple {190027#(<= ~counter~0 9)} assume true; {190027#(<= ~counter~0 9)} is VALID [2022-04-08 12:47:55,277 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {190027#(<= ~counter~0 9)} {190027#(<= ~counter~0 9)} #98#return; {190027#(<= ~counter~0 9)} is VALID [2022-04-08 12:47:55,277 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-08 12:47:55,279 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-08 12:47:55,280 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-08 12:47:55,280 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-08 12:47:55,280 INFO L290 TraceCheckUtils]: 92: Hoare triple {190052#(<= ~counter~0 10)} ~cond := #in~cond; {190052#(<= ~counter~0 10)} is VALID [2022-04-08 12:47:55,281 INFO L290 TraceCheckUtils]: 93: Hoare triple {190052#(<= ~counter~0 10)} assume !(0 == ~cond); {190052#(<= ~counter~0 10)} is VALID [2022-04-08 12:47:55,281 INFO L290 TraceCheckUtils]: 94: Hoare triple {190052#(<= ~counter~0 10)} assume true; {190052#(<= ~counter~0 10)} is VALID [2022-04-08 12:47:55,281 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {190052#(<= ~counter~0 10)} {190052#(<= ~counter~0 10)} #98#return; {190052#(<= ~counter~0 10)} is VALID [2022-04-08 12:47:55,282 INFO L290 TraceCheckUtils]: 96: Hoare triple {190052#(<= ~counter~0 10)} assume !(~r~0 < 0); {190052#(<= ~counter~0 10)} is VALID [2022-04-08 12:47:55,283 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-08 12:47:55,284 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-08 12:47:55,284 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-08 12:47:55,284 INFO L290 TraceCheckUtils]: 100: Hoare triple {190077#(<= ~counter~0 11)} ~cond := #in~cond; {190077#(<= ~counter~0 11)} is VALID [2022-04-08 12:47:55,285 INFO L290 TraceCheckUtils]: 101: Hoare triple {190077#(<= ~counter~0 11)} assume !(0 == ~cond); {190077#(<= ~counter~0 11)} is VALID [2022-04-08 12:47:55,285 INFO L290 TraceCheckUtils]: 102: Hoare triple {190077#(<= ~counter~0 11)} assume true; {190077#(<= ~counter~0 11)} is VALID [2022-04-08 12:47:55,285 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {190077#(<= ~counter~0 11)} {190077#(<= ~counter~0 11)} #94#return; {190077#(<= ~counter~0 11)} is VALID [2022-04-08 12:47:55,285 INFO L290 TraceCheckUtils]: 104: Hoare triple {190077#(<= ~counter~0 11)} assume !!(0 != ~r~0); {190077#(<= ~counter~0 11)} is VALID [2022-04-08 12:47:55,287 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-08 12:47:55,287 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-08 12:47:55,288 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-08 12:47:55,288 INFO L290 TraceCheckUtils]: 108: Hoare triple {190102#(<= ~counter~0 12)} ~cond := #in~cond; {190102#(<= ~counter~0 12)} is VALID [2022-04-08 12:47:55,288 INFO L290 TraceCheckUtils]: 109: Hoare triple {190102#(<= ~counter~0 12)} assume !(0 == ~cond); {190102#(<= ~counter~0 12)} is VALID [2022-04-08 12:47:55,289 INFO L290 TraceCheckUtils]: 110: Hoare triple {190102#(<= ~counter~0 12)} assume true; {190102#(<= ~counter~0 12)} is VALID [2022-04-08 12:47:55,289 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {190102#(<= ~counter~0 12)} {190102#(<= ~counter~0 12)} #96#return; {190102#(<= ~counter~0 12)} is VALID [2022-04-08 12:47:55,289 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-08 12:47:55,291 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-08 12:47:55,291 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-08 12:47:55,292 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-08 12:47:55,292 INFO L290 TraceCheckUtils]: 116: Hoare triple {190127#(<= ~counter~0 13)} ~cond := #in~cond; {190127#(<= ~counter~0 13)} is VALID [2022-04-08 12:47:55,292 INFO L290 TraceCheckUtils]: 117: Hoare triple {190127#(<= ~counter~0 13)} assume !(0 == ~cond); {190127#(<= ~counter~0 13)} is VALID [2022-04-08 12:47:55,292 INFO L290 TraceCheckUtils]: 118: Hoare triple {190127#(<= ~counter~0 13)} assume true; {190127#(<= ~counter~0 13)} is VALID [2022-04-08 12:47:55,293 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {190127#(<= ~counter~0 13)} {190127#(<= ~counter~0 13)} #96#return; {190127#(<= ~counter~0 13)} is VALID [2022-04-08 12:47:55,293 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-08 12:47:55,295 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-08 12:47:55,295 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-08 12:47:55,295 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-08 12:47:55,296 INFO L290 TraceCheckUtils]: 124: Hoare triple {190152#(<= ~counter~0 14)} ~cond := #in~cond; {190152#(<= ~counter~0 14)} is VALID [2022-04-08 12:47:55,296 INFO L290 TraceCheckUtils]: 125: Hoare triple {190152#(<= ~counter~0 14)} assume !(0 == ~cond); {190152#(<= ~counter~0 14)} is VALID [2022-04-08 12:47:55,296 INFO L290 TraceCheckUtils]: 126: Hoare triple {190152#(<= ~counter~0 14)} assume true; {190152#(<= ~counter~0 14)} is VALID [2022-04-08 12:47:55,297 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {190152#(<= ~counter~0 14)} {190152#(<= ~counter~0 14)} #96#return; {190152#(<= ~counter~0 14)} is VALID [2022-04-08 12:47:55,297 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-08 12:47:55,300 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-08 12:47:55,300 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-08 12:47:55,301 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-08 12:47:55,301 INFO L290 TraceCheckUtils]: 132: Hoare triple {190177#(<= ~counter~0 15)} ~cond := #in~cond; {190177#(<= ~counter~0 15)} is VALID [2022-04-08 12:47:55,301 INFO L290 TraceCheckUtils]: 133: Hoare triple {190177#(<= ~counter~0 15)} assume !(0 == ~cond); {190177#(<= ~counter~0 15)} is VALID [2022-04-08 12:47:55,301 INFO L290 TraceCheckUtils]: 134: Hoare triple {190177#(<= ~counter~0 15)} assume true; {190177#(<= ~counter~0 15)} is VALID [2022-04-08 12:47:55,302 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {190177#(<= ~counter~0 15)} {190177#(<= ~counter~0 15)} #96#return; {190177#(<= ~counter~0 15)} is VALID [2022-04-08 12:47:55,302 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-08 12:47:55,304 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-08 12:47:55,304 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-08 12:47:55,304 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-08 12:47:55,305 INFO L290 TraceCheckUtils]: 140: Hoare triple {190202#(<= ~counter~0 16)} ~cond := #in~cond; {190202#(<= ~counter~0 16)} is VALID [2022-04-08 12:47:55,305 INFO L290 TraceCheckUtils]: 141: Hoare triple {190202#(<= ~counter~0 16)} assume !(0 == ~cond); {190202#(<= ~counter~0 16)} is VALID [2022-04-08 12:47:55,305 INFO L290 TraceCheckUtils]: 142: Hoare triple {190202#(<= ~counter~0 16)} assume true; {190202#(<= ~counter~0 16)} is VALID [2022-04-08 12:47:55,306 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {190202#(<= ~counter~0 16)} {190202#(<= ~counter~0 16)} #96#return; {190202#(<= ~counter~0 16)} is VALID [2022-04-08 12:47:55,306 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-08 12:47:55,308 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-08 12:47:55,308 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-08 12:47:55,309 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-08 12:47:55,309 INFO L290 TraceCheckUtils]: 148: Hoare triple {190227#(<= ~counter~0 17)} ~cond := #in~cond; {190227#(<= ~counter~0 17)} is VALID [2022-04-08 12:47:55,309 INFO L290 TraceCheckUtils]: 149: Hoare triple {190227#(<= ~counter~0 17)} assume !(0 == ~cond); {190227#(<= ~counter~0 17)} is VALID [2022-04-08 12:47:55,309 INFO L290 TraceCheckUtils]: 150: Hoare triple {190227#(<= ~counter~0 17)} assume true; {190227#(<= ~counter~0 17)} is VALID [2022-04-08 12:47:55,310 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {190227#(<= ~counter~0 17)} {190227#(<= ~counter~0 17)} #96#return; {190227#(<= ~counter~0 17)} is VALID [2022-04-08 12:47:55,310 INFO L290 TraceCheckUtils]: 152: Hoare triple {190227#(<= ~counter~0 17)} assume !(~r~0 > 0); {190227#(<= ~counter~0 17)} is VALID [2022-04-08 12:47:55,312 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-08 12:47:55,312 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-08 12:47:55,312 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-08 12:47:55,313 INFO L290 TraceCheckUtils]: 156: Hoare triple {190252#(<= ~counter~0 18)} ~cond := #in~cond; {190252#(<= ~counter~0 18)} is VALID [2022-04-08 12:47:55,313 INFO L290 TraceCheckUtils]: 157: Hoare triple {190252#(<= ~counter~0 18)} assume !(0 == ~cond); {190252#(<= ~counter~0 18)} is VALID [2022-04-08 12:47:55,313 INFO L290 TraceCheckUtils]: 158: Hoare triple {190252#(<= ~counter~0 18)} assume true; {190252#(<= ~counter~0 18)} is VALID [2022-04-08 12:47:55,314 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {190252#(<= ~counter~0 18)} {190252#(<= ~counter~0 18)} #98#return; {190252#(<= ~counter~0 18)} is VALID [2022-04-08 12:47:55,314 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-08 12:47:55,314 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-08 12:47:55,315 INFO L290 TraceCheckUtils]: 162: Hoare triple {190277#(<= |main_#t~post8| 18)} assume !(#t~post8 < 20);havoc #t~post8; {189771#false} is VALID [2022-04-08 12:47:55,315 INFO L290 TraceCheckUtils]: 163: Hoare triple {189771#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {189771#false} is VALID [2022-04-08 12:47:55,315 INFO L290 TraceCheckUtils]: 164: Hoare triple {189771#false} assume !(#t~post6 < 20);havoc #t~post6; {189771#false} is VALID [2022-04-08 12:47:55,315 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-08 12:47:55,315 INFO L290 TraceCheckUtils]: 166: Hoare triple {189771#false} ~cond := #in~cond; {189771#false} is VALID [2022-04-08 12:47:55,315 INFO L290 TraceCheckUtils]: 167: Hoare triple {189771#false} assume 0 == ~cond; {189771#false} is VALID [2022-04-08 12:47:55,315 INFO L290 TraceCheckUtils]: 168: Hoare triple {189771#false} assume !false; {189771#false} is VALID [2022-04-08 12:47:55,315 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-08 12:47:55,315 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:47:56,029 INFO L290 TraceCheckUtils]: 168: Hoare triple {189771#false} assume !false; {189771#false} is VALID [2022-04-08 12:47:56,029 INFO L290 TraceCheckUtils]: 167: Hoare triple {189771#false} assume 0 == ~cond; {189771#false} is VALID [2022-04-08 12:47:56,029 INFO L290 TraceCheckUtils]: 166: Hoare triple {189771#false} ~cond := #in~cond; {189771#false} is VALID [2022-04-08 12:47:56,029 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-08 12:47:56,029 INFO L290 TraceCheckUtils]: 164: Hoare triple {189771#false} assume !(#t~post6 < 20);havoc #t~post6; {189771#false} is VALID [2022-04-08 12:47:56,029 INFO L290 TraceCheckUtils]: 163: Hoare triple {189771#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {189771#false} is VALID [2022-04-08 12:47:56,029 INFO L290 TraceCheckUtils]: 162: Hoare triple {190317#(< |main_#t~post8| 20)} assume !(#t~post8 < 20);havoc #t~post8; {189771#false} is VALID [2022-04-08 12:47:56,030 INFO L290 TraceCheckUtils]: 161: Hoare triple {190321#(< ~counter~0 20)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {190317#(< |main_#t~post8| 20)} is VALID [2022-04-08 12:47:56,030 INFO L290 TraceCheckUtils]: 160: Hoare triple {190321#(< ~counter~0 20)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {190321#(< ~counter~0 20)} is VALID [2022-04-08 12:47:56,030 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {189770#true} {190321#(< ~counter~0 20)} #98#return; {190321#(< ~counter~0 20)} is VALID [2022-04-08 12:47:56,031 INFO L290 TraceCheckUtils]: 158: Hoare triple {189770#true} assume true; {189770#true} is VALID [2022-04-08 12:47:56,031 INFO L290 TraceCheckUtils]: 157: Hoare triple {189770#true} assume !(0 == ~cond); {189770#true} is VALID [2022-04-08 12:47:56,031 INFO L290 TraceCheckUtils]: 156: Hoare triple {189770#true} ~cond := #in~cond; {189770#true} is VALID [2022-04-08 12:47:56,031 INFO L272 TraceCheckUtils]: 155: Hoare triple {190321#(< ~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)); {189770#true} is VALID [2022-04-08 12:47:56,031 INFO L290 TraceCheckUtils]: 154: Hoare triple {190321#(< ~counter~0 20)} assume !!(#t~post8 < 20);havoc #t~post8; {190321#(< ~counter~0 20)} is VALID [2022-04-08 12:47:56,035 INFO L290 TraceCheckUtils]: 153: Hoare triple {190252#(<= ~counter~0 18)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {190321#(< ~counter~0 20)} is VALID [2022-04-08 12:47:56,035 INFO L290 TraceCheckUtils]: 152: Hoare triple {190252#(<= ~counter~0 18)} assume !(~r~0 > 0); {190252#(<= ~counter~0 18)} is VALID [2022-04-08 12:47:56,036 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {189770#true} {190252#(<= ~counter~0 18)} #96#return; {190252#(<= ~counter~0 18)} is VALID [2022-04-08 12:47:56,036 INFO L290 TraceCheckUtils]: 150: Hoare triple {189770#true} assume true; {189770#true} is VALID [2022-04-08 12:47:56,036 INFO L290 TraceCheckUtils]: 149: Hoare triple {189770#true} assume !(0 == ~cond); {189770#true} is VALID [2022-04-08 12:47:56,036 INFO L290 TraceCheckUtils]: 148: Hoare triple {189770#true} ~cond := #in~cond; {189770#true} is VALID [2022-04-08 12:47:56,036 INFO L272 TraceCheckUtils]: 147: 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)); {189770#true} is VALID [2022-04-08 12:47:56,036 INFO L290 TraceCheckUtils]: 146: Hoare triple {190252#(<= ~counter~0 18)} assume !!(#t~post7 < 20);havoc #t~post7; {190252#(<= ~counter~0 18)} is VALID [2022-04-08 12:47:56,038 INFO L290 TraceCheckUtils]: 145: Hoare triple {190227#(<= ~counter~0 17)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {190252#(<= ~counter~0 18)} is VALID [2022-04-08 12:47:56,038 INFO L290 TraceCheckUtils]: 144: Hoare triple {190227#(<= ~counter~0 17)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {190227#(<= ~counter~0 17)} is VALID [2022-04-08 12:47:56,039 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {189770#true} {190227#(<= ~counter~0 17)} #96#return; {190227#(<= ~counter~0 17)} is VALID [2022-04-08 12:47:56,039 INFO L290 TraceCheckUtils]: 142: Hoare triple {189770#true} assume true; {189770#true} is VALID [2022-04-08 12:47:56,039 INFO L290 TraceCheckUtils]: 141: Hoare triple {189770#true} assume !(0 == ~cond); {189770#true} is VALID [2022-04-08 12:47:56,039 INFO L290 TraceCheckUtils]: 140: Hoare triple {189770#true} ~cond := #in~cond; {189770#true} is VALID [2022-04-08 12:47:56,039 INFO L272 TraceCheckUtils]: 139: 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)); {189770#true} is VALID [2022-04-08 12:47:56,039 INFO L290 TraceCheckUtils]: 138: Hoare triple {190227#(<= ~counter~0 17)} assume !!(#t~post7 < 20);havoc #t~post7; {190227#(<= ~counter~0 17)} is VALID [2022-04-08 12:47:56,041 INFO L290 TraceCheckUtils]: 137: Hoare triple {190202#(<= ~counter~0 16)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {190227#(<= ~counter~0 17)} is VALID [2022-04-08 12:47:56,041 INFO L290 TraceCheckUtils]: 136: 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-08 12:47:56,042 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {189770#true} {190202#(<= ~counter~0 16)} #96#return; {190202#(<= ~counter~0 16)} is VALID [2022-04-08 12:47:56,042 INFO L290 TraceCheckUtils]: 134: Hoare triple {189770#true} assume true; {189770#true} is VALID [2022-04-08 12:47:56,042 INFO L290 TraceCheckUtils]: 133: Hoare triple {189770#true} assume !(0 == ~cond); {189770#true} is VALID [2022-04-08 12:47:56,042 INFO L290 TraceCheckUtils]: 132: Hoare triple {189770#true} ~cond := #in~cond; {189770#true} is VALID [2022-04-08 12:47:56,042 INFO L272 TraceCheckUtils]: 131: 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)); {189770#true} is VALID [2022-04-08 12:47:56,042 INFO L290 TraceCheckUtils]: 130: Hoare triple {190202#(<= ~counter~0 16)} assume !!(#t~post7 < 20);havoc #t~post7; {190202#(<= ~counter~0 16)} is VALID [2022-04-08 12:47:56,044 INFO L290 TraceCheckUtils]: 129: Hoare triple {190177#(<= ~counter~0 15)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {190202#(<= ~counter~0 16)} is VALID [2022-04-08 12:47:56,044 INFO L290 TraceCheckUtils]: 128: 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-08 12:47:56,044 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {189770#true} {190177#(<= ~counter~0 15)} #96#return; {190177#(<= ~counter~0 15)} is VALID [2022-04-08 12:47:56,044 INFO L290 TraceCheckUtils]: 126: Hoare triple {189770#true} assume true; {189770#true} is VALID [2022-04-08 12:47:56,045 INFO L290 TraceCheckUtils]: 125: Hoare triple {189770#true} assume !(0 == ~cond); {189770#true} is VALID [2022-04-08 12:47:56,045 INFO L290 TraceCheckUtils]: 124: Hoare triple {189770#true} ~cond := #in~cond; {189770#true} is VALID [2022-04-08 12:47:56,045 INFO L272 TraceCheckUtils]: 123: 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)); {189770#true} is VALID [2022-04-08 12:47:56,045 INFO L290 TraceCheckUtils]: 122: Hoare triple {190177#(<= ~counter~0 15)} assume !!(#t~post7 < 20);havoc #t~post7; {190177#(<= ~counter~0 15)} is VALID [2022-04-08 12:47:56,047 INFO L290 TraceCheckUtils]: 121: Hoare triple {190152#(<= ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {190177#(<= ~counter~0 15)} is VALID [2022-04-08 12:47:56,047 INFO L290 TraceCheckUtils]: 120: 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-08 12:47:56,048 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {189770#true} {190152#(<= ~counter~0 14)} #96#return; {190152#(<= ~counter~0 14)} is VALID [2022-04-08 12:47:56,048 INFO L290 TraceCheckUtils]: 118: Hoare triple {189770#true} assume true; {189770#true} is VALID [2022-04-08 12:47:56,048 INFO L290 TraceCheckUtils]: 117: Hoare triple {189770#true} assume !(0 == ~cond); {189770#true} is VALID [2022-04-08 12:47:56,048 INFO L290 TraceCheckUtils]: 116: Hoare triple {189770#true} ~cond := #in~cond; {189770#true} is VALID [2022-04-08 12:47:56,048 INFO L272 TraceCheckUtils]: 115: 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)); {189770#true} is VALID [2022-04-08 12:47:56,048 INFO L290 TraceCheckUtils]: 114: Hoare triple {190152#(<= ~counter~0 14)} assume !!(#t~post7 < 20);havoc #t~post7; {190152#(<= ~counter~0 14)} is VALID [2022-04-08 12:47:56,050 INFO L290 TraceCheckUtils]: 113: Hoare triple {190127#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {190152#(<= ~counter~0 14)} is VALID [2022-04-08 12:47:56,050 INFO L290 TraceCheckUtils]: 112: 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-08 12:47:56,050 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {189770#true} {190127#(<= ~counter~0 13)} #96#return; {190127#(<= ~counter~0 13)} is VALID [2022-04-08 12:47:56,051 INFO L290 TraceCheckUtils]: 110: Hoare triple {189770#true} assume true; {189770#true} is VALID [2022-04-08 12:47:56,051 INFO L290 TraceCheckUtils]: 109: Hoare triple {189770#true} assume !(0 == ~cond); {189770#true} is VALID [2022-04-08 12:47:56,051 INFO L290 TraceCheckUtils]: 108: Hoare triple {189770#true} ~cond := #in~cond; {189770#true} is VALID [2022-04-08 12:47:56,051 INFO L272 TraceCheckUtils]: 107: 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)); {189770#true} is VALID [2022-04-08 12:47:56,051 INFO L290 TraceCheckUtils]: 106: Hoare triple {190127#(<= ~counter~0 13)} assume !!(#t~post7 < 20);havoc #t~post7; {190127#(<= ~counter~0 13)} is VALID [2022-04-08 12:47:56,053 INFO L290 TraceCheckUtils]: 105: Hoare triple {190102#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {190127#(<= ~counter~0 13)} is VALID [2022-04-08 12:47:56,053 INFO L290 TraceCheckUtils]: 104: Hoare triple {190102#(<= ~counter~0 12)} assume !!(0 != ~r~0); {190102#(<= ~counter~0 12)} is VALID [2022-04-08 12:47:56,053 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {189770#true} {190102#(<= ~counter~0 12)} #94#return; {190102#(<= ~counter~0 12)} is VALID [2022-04-08 12:47:56,053 INFO L290 TraceCheckUtils]: 102: Hoare triple {189770#true} assume true; {189770#true} is VALID [2022-04-08 12:47:56,053 INFO L290 TraceCheckUtils]: 101: Hoare triple {189770#true} assume !(0 == ~cond); {189770#true} is VALID [2022-04-08 12:47:56,054 INFO L290 TraceCheckUtils]: 100: Hoare triple {189770#true} ~cond := #in~cond; {189770#true} is VALID [2022-04-08 12:47:56,054 INFO L272 TraceCheckUtils]: 99: 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)); {189770#true} is VALID [2022-04-08 12:47:56,054 INFO L290 TraceCheckUtils]: 98: Hoare triple {190102#(<= ~counter~0 12)} assume !!(#t~post6 < 20);havoc #t~post6; {190102#(<= ~counter~0 12)} is VALID [2022-04-08 12:47:56,055 INFO L290 TraceCheckUtils]: 97: Hoare triple {190077#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {190102#(<= ~counter~0 12)} is VALID [2022-04-08 12:47:56,056 INFO L290 TraceCheckUtils]: 96: Hoare triple {190077#(<= ~counter~0 11)} assume !(~r~0 < 0); {190077#(<= ~counter~0 11)} is VALID [2022-04-08 12:47:56,056 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {189770#true} {190077#(<= ~counter~0 11)} #98#return; {190077#(<= ~counter~0 11)} is VALID [2022-04-08 12:47:56,056 INFO L290 TraceCheckUtils]: 94: Hoare triple {189770#true} assume true; {189770#true} is VALID [2022-04-08 12:47:56,056 INFO L290 TraceCheckUtils]: 93: Hoare triple {189770#true} assume !(0 == ~cond); {189770#true} is VALID [2022-04-08 12:47:56,056 INFO L290 TraceCheckUtils]: 92: Hoare triple {189770#true} ~cond := #in~cond; {189770#true} is VALID [2022-04-08 12:47:56,056 INFO L272 TraceCheckUtils]: 91: 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)); {189770#true} is VALID [2022-04-08 12:47:56,057 INFO L290 TraceCheckUtils]: 90: Hoare triple {190077#(<= ~counter~0 11)} assume !!(#t~post8 < 20);havoc #t~post8; {190077#(<= ~counter~0 11)} is VALID [2022-04-08 12:47:56,058 INFO L290 TraceCheckUtils]: 89: Hoare triple {190052#(<= ~counter~0 10)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {190077#(<= ~counter~0 11)} is VALID [2022-04-08 12:47:56,058 INFO L290 TraceCheckUtils]: 88: Hoare triple {190052#(<= ~counter~0 10)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {190052#(<= ~counter~0 10)} is VALID [2022-04-08 12:47:56,059 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {189770#true} {190052#(<= ~counter~0 10)} #98#return; {190052#(<= ~counter~0 10)} is VALID [2022-04-08 12:47:56,059 INFO L290 TraceCheckUtils]: 86: Hoare triple {189770#true} assume true; {189770#true} is VALID [2022-04-08 12:47:56,059 INFO L290 TraceCheckUtils]: 85: Hoare triple {189770#true} assume !(0 == ~cond); {189770#true} is VALID [2022-04-08 12:47:56,059 INFO L290 TraceCheckUtils]: 84: Hoare triple {189770#true} ~cond := #in~cond; {189770#true} is VALID [2022-04-08 12:47:56,059 INFO L272 TraceCheckUtils]: 83: 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)); {189770#true} is VALID [2022-04-08 12:47:56,059 INFO L290 TraceCheckUtils]: 82: Hoare triple {190052#(<= ~counter~0 10)} assume !!(#t~post8 < 20);havoc #t~post8; {190052#(<= ~counter~0 10)} is VALID [2022-04-08 12:47:56,061 INFO L290 TraceCheckUtils]: 81: Hoare triple {190027#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {190052#(<= ~counter~0 10)} is VALID [2022-04-08 12:47:56,061 INFO L290 TraceCheckUtils]: 80: Hoare triple {190027#(<= ~counter~0 9)} assume !(~r~0 > 0); {190027#(<= ~counter~0 9)} is VALID [2022-04-08 12:47:56,062 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {189770#true} {190027#(<= ~counter~0 9)} #96#return; {190027#(<= ~counter~0 9)} is VALID [2022-04-08 12:47:56,062 INFO L290 TraceCheckUtils]: 78: Hoare triple {189770#true} assume true; {189770#true} is VALID [2022-04-08 12:47:56,062 INFO L290 TraceCheckUtils]: 77: Hoare triple {189770#true} assume !(0 == ~cond); {189770#true} is VALID [2022-04-08 12:47:56,062 INFO L290 TraceCheckUtils]: 76: Hoare triple {189770#true} ~cond := #in~cond; {189770#true} is VALID [2022-04-08 12:47:56,062 INFO L272 TraceCheckUtils]: 75: 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)); {189770#true} is VALID [2022-04-08 12:47:56,062 INFO L290 TraceCheckUtils]: 74: Hoare triple {190027#(<= ~counter~0 9)} assume !!(#t~post7 < 20);havoc #t~post7; {190027#(<= ~counter~0 9)} is VALID [2022-04-08 12:47:56,064 INFO L290 TraceCheckUtils]: 73: Hoare triple {190002#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {190027#(<= ~counter~0 9)} is VALID [2022-04-08 12:47:56,064 INFO L290 TraceCheckUtils]: 72: Hoare triple {190002#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {190002#(<= ~counter~0 8)} is VALID [2022-04-08 12:47:56,065 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {189770#true} {190002#(<= ~counter~0 8)} #96#return; {190002#(<= ~counter~0 8)} is VALID [2022-04-08 12:47:56,065 INFO L290 TraceCheckUtils]: 70: Hoare triple {189770#true} assume true; {189770#true} is VALID [2022-04-08 12:47:56,065 INFO L290 TraceCheckUtils]: 69: Hoare triple {189770#true} assume !(0 == ~cond); {189770#true} is VALID [2022-04-08 12:47:56,065 INFO L290 TraceCheckUtils]: 68: Hoare triple {189770#true} ~cond := #in~cond; {189770#true} is VALID [2022-04-08 12:47:56,065 INFO L272 TraceCheckUtils]: 67: 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)); {189770#true} is VALID [2022-04-08 12:47:56,065 INFO L290 TraceCheckUtils]: 66: Hoare triple {190002#(<= ~counter~0 8)} assume !!(#t~post7 < 20);havoc #t~post7; {190002#(<= ~counter~0 8)} is VALID [2022-04-08 12:47:56,067 INFO L290 TraceCheckUtils]: 65: Hoare triple {189977#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {190002#(<= ~counter~0 8)} is VALID [2022-04-08 12:47:56,067 INFO L290 TraceCheckUtils]: 64: 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-08 12:47:56,068 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {189770#true} {189977#(<= ~counter~0 7)} #96#return; {189977#(<= ~counter~0 7)} is VALID [2022-04-08 12:47:56,068 INFO L290 TraceCheckUtils]: 62: Hoare triple {189770#true} assume true; {189770#true} is VALID [2022-04-08 12:47:56,068 INFO L290 TraceCheckUtils]: 61: Hoare triple {189770#true} assume !(0 == ~cond); {189770#true} is VALID [2022-04-08 12:47:56,068 INFO L290 TraceCheckUtils]: 60: Hoare triple {189770#true} ~cond := #in~cond; {189770#true} is VALID [2022-04-08 12:47:56,068 INFO L272 TraceCheckUtils]: 59: 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)); {189770#true} is VALID [2022-04-08 12:47:56,068 INFO L290 TraceCheckUtils]: 58: Hoare triple {189977#(<= ~counter~0 7)} assume !!(#t~post7 < 20);havoc #t~post7; {189977#(<= ~counter~0 7)} is VALID [2022-04-08 12:47:56,070 INFO L290 TraceCheckUtils]: 57: Hoare triple {189952#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {189977#(<= ~counter~0 7)} is VALID [2022-04-08 12:47:56,070 INFO L290 TraceCheckUtils]: 56: Hoare triple {189952#(<= ~counter~0 6)} assume !!(0 != ~r~0); {189952#(<= ~counter~0 6)} is VALID [2022-04-08 12:47:56,071 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {189770#true} {189952#(<= ~counter~0 6)} #94#return; {189952#(<= ~counter~0 6)} is VALID [2022-04-08 12:47:56,071 INFO L290 TraceCheckUtils]: 54: Hoare triple {189770#true} assume true; {189770#true} is VALID [2022-04-08 12:47:56,071 INFO L290 TraceCheckUtils]: 53: Hoare triple {189770#true} assume !(0 == ~cond); {189770#true} is VALID [2022-04-08 12:47:56,071 INFO L290 TraceCheckUtils]: 52: Hoare triple {189770#true} ~cond := #in~cond; {189770#true} is VALID [2022-04-08 12:47:56,071 INFO L272 TraceCheckUtils]: 51: 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)); {189770#true} is VALID [2022-04-08 12:47:56,071 INFO L290 TraceCheckUtils]: 50: Hoare triple {189952#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {189952#(<= ~counter~0 6)} is VALID [2022-04-08 12:47:56,073 INFO L290 TraceCheckUtils]: 49: Hoare triple {189927#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {189952#(<= ~counter~0 6)} is VALID [2022-04-08 12:47:56,073 INFO L290 TraceCheckUtils]: 48: Hoare triple {189927#(<= ~counter~0 5)} assume !(~r~0 < 0); {189927#(<= ~counter~0 5)} is VALID [2022-04-08 12:47:56,073 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {189770#true} {189927#(<= ~counter~0 5)} #98#return; {189927#(<= ~counter~0 5)} is VALID [2022-04-08 12:47:56,073 INFO L290 TraceCheckUtils]: 46: Hoare triple {189770#true} assume true; {189770#true} is VALID [2022-04-08 12:47:56,073 INFO L290 TraceCheckUtils]: 45: Hoare triple {189770#true} assume !(0 == ~cond); {189770#true} is VALID [2022-04-08 12:47:56,074 INFO L290 TraceCheckUtils]: 44: Hoare triple {189770#true} ~cond := #in~cond; {189770#true} is VALID [2022-04-08 12:47:56,074 INFO L272 TraceCheckUtils]: 43: 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)); {189770#true} is VALID [2022-04-08 12:47:56,074 INFO L290 TraceCheckUtils]: 42: Hoare triple {189927#(<= ~counter~0 5)} assume !!(#t~post8 < 20);havoc #t~post8; {189927#(<= ~counter~0 5)} is VALID [2022-04-08 12:47:56,075 INFO L290 TraceCheckUtils]: 41: Hoare triple {189902#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {189927#(<= ~counter~0 5)} is VALID [2022-04-08 12:47:56,076 INFO L290 TraceCheckUtils]: 40: Hoare triple {189902#(<= ~counter~0 4)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {189902#(<= ~counter~0 4)} is VALID [2022-04-08 12:47:56,076 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {189770#true} {189902#(<= ~counter~0 4)} #98#return; {189902#(<= ~counter~0 4)} is VALID [2022-04-08 12:47:56,076 INFO L290 TraceCheckUtils]: 38: Hoare triple {189770#true} assume true; {189770#true} is VALID [2022-04-08 12:47:56,076 INFO L290 TraceCheckUtils]: 37: Hoare triple {189770#true} assume !(0 == ~cond); {189770#true} is VALID [2022-04-08 12:47:56,076 INFO L290 TraceCheckUtils]: 36: Hoare triple {189770#true} ~cond := #in~cond; {189770#true} is VALID [2022-04-08 12:47:56,076 INFO L272 TraceCheckUtils]: 35: 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)); {189770#true} is VALID [2022-04-08 12:47:56,077 INFO L290 TraceCheckUtils]: 34: Hoare triple {189902#(<= ~counter~0 4)} assume !!(#t~post8 < 20);havoc #t~post8; {189902#(<= ~counter~0 4)} is VALID [2022-04-08 12:47:56,078 INFO L290 TraceCheckUtils]: 33: Hoare triple {189877#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {189902#(<= ~counter~0 4)} is VALID [2022-04-08 12:47:56,078 INFO L290 TraceCheckUtils]: 32: Hoare triple {189877#(<= ~counter~0 3)} assume !(~r~0 > 0); {189877#(<= ~counter~0 3)} is VALID [2022-04-08 12:47:56,079 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {189770#true} {189877#(<= ~counter~0 3)} #96#return; {189877#(<= ~counter~0 3)} is VALID [2022-04-08 12:47:56,079 INFO L290 TraceCheckUtils]: 30: Hoare triple {189770#true} assume true; {189770#true} is VALID [2022-04-08 12:47:56,079 INFO L290 TraceCheckUtils]: 29: Hoare triple {189770#true} assume !(0 == ~cond); {189770#true} is VALID [2022-04-08 12:47:56,079 INFO L290 TraceCheckUtils]: 28: Hoare triple {189770#true} ~cond := #in~cond; {189770#true} is VALID [2022-04-08 12:47:56,079 INFO L272 TraceCheckUtils]: 27: 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)); {189770#true} is VALID [2022-04-08 12:47:56,079 INFO L290 TraceCheckUtils]: 26: Hoare triple {189877#(<= ~counter~0 3)} assume !!(#t~post7 < 20);havoc #t~post7; {189877#(<= ~counter~0 3)} is VALID [2022-04-08 12:47:56,081 INFO L290 TraceCheckUtils]: 25: Hoare triple {189852#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {189877#(<= ~counter~0 3)} is VALID [2022-04-08 12:47:56,081 INFO L290 TraceCheckUtils]: 24: Hoare triple {189852#(<= ~counter~0 2)} assume !!(0 != ~r~0); {189852#(<= ~counter~0 2)} is VALID [2022-04-08 12:47:56,082 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {189770#true} {189852#(<= ~counter~0 2)} #94#return; {189852#(<= ~counter~0 2)} is VALID [2022-04-08 12:47:56,082 INFO L290 TraceCheckUtils]: 22: Hoare triple {189770#true} assume true; {189770#true} is VALID [2022-04-08 12:47:56,082 INFO L290 TraceCheckUtils]: 21: Hoare triple {189770#true} assume !(0 == ~cond); {189770#true} is VALID [2022-04-08 12:47:56,082 INFO L290 TraceCheckUtils]: 20: Hoare triple {189770#true} ~cond := #in~cond; {189770#true} is VALID [2022-04-08 12:47:56,082 INFO L272 TraceCheckUtils]: 19: 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)); {189770#true} is VALID [2022-04-08 12:47:56,082 INFO L290 TraceCheckUtils]: 18: Hoare triple {189852#(<= ~counter~0 2)} assume !!(#t~post6 < 20);havoc #t~post6; {189852#(<= ~counter~0 2)} is VALID [2022-04-08 12:47:56,084 INFO L290 TraceCheckUtils]: 17: Hoare triple {189827#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {189852#(<= ~counter~0 2)} is VALID [2022-04-08 12:47:56,084 INFO L290 TraceCheckUtils]: 16: Hoare triple {189827#(<= ~counter~0 1)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {189827#(<= ~counter~0 1)} is VALID [2022-04-08 12:47:56,084 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {189770#true} {189827#(<= ~counter~0 1)} #92#return; {189827#(<= ~counter~0 1)} is VALID [2022-04-08 12:47:56,084 INFO L290 TraceCheckUtils]: 14: Hoare triple {189770#true} assume true; {189770#true} is VALID [2022-04-08 12:47:56,084 INFO L290 TraceCheckUtils]: 13: Hoare triple {189770#true} assume !(0 == ~cond); {189770#true} is VALID [2022-04-08 12:47:56,085 INFO L290 TraceCheckUtils]: 12: Hoare triple {189770#true} ~cond := #in~cond; {189770#true} is VALID [2022-04-08 12:47:56,085 INFO L272 TraceCheckUtils]: 11: Hoare triple {189827#(<= ~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)); {189770#true} is VALID [2022-04-08 12:47:56,085 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {189770#true} {189827#(<= ~counter~0 1)} #90#return; {189827#(<= ~counter~0 1)} is VALID [2022-04-08 12:47:56,085 INFO L290 TraceCheckUtils]: 9: Hoare triple {189770#true} assume true; {189770#true} is VALID [2022-04-08 12:47:56,085 INFO L290 TraceCheckUtils]: 8: Hoare triple {189770#true} assume !(0 == ~cond); {189770#true} is VALID [2022-04-08 12:47:56,085 INFO L290 TraceCheckUtils]: 7: Hoare triple {189770#true} ~cond := #in~cond; {189770#true} is VALID [2022-04-08 12:47:56,085 INFO L272 TraceCheckUtils]: 6: Hoare triple {189827#(<= ~counter~0 1)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {189770#true} is VALID [2022-04-08 12:47:56,086 INFO L290 TraceCheckUtils]: 5: Hoare triple {189827#(<= ~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; {189827#(<= ~counter~0 1)} is VALID [2022-04-08 12:47:56,086 INFO L272 TraceCheckUtils]: 4: Hoare triple {189827#(<= ~counter~0 1)} call #t~ret9 := main(); {189827#(<= ~counter~0 1)} is VALID [2022-04-08 12:47:56,086 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {189827#(<= ~counter~0 1)} {189770#true} #102#return; {189827#(<= ~counter~0 1)} is VALID [2022-04-08 12:47:56,086 INFO L290 TraceCheckUtils]: 2: Hoare triple {189827#(<= ~counter~0 1)} assume true; {189827#(<= ~counter~0 1)} is VALID [2022-04-08 12:47:56,087 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; {189827#(<= ~counter~0 1)} is VALID [2022-04-08 12:47:56,087 INFO L272 TraceCheckUtils]: 0: Hoare triple {189770#true} call ULTIMATE.init(); {189770#true} is VALID [2022-04-08 12:47:56,087 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 42 proven. 242 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2022-04-08 12:47:56,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:47:56,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314033939] [2022-04-08 12:47:56,087 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:47:56,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729830986] [2022-04-08 12:47:56,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [729830986] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:47:56,088 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:47:56,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 24 [2022-04-08 12:47:56,088 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:47:56,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1165420254] [2022-04-08 12:47:56,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1165420254] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:47:56,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:47:56,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-08 12:47:56,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578981053] [2022-04-08 12:47:56,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:47:56,089 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.545454545454546) internal successors, (122), 21 states have internal predecessors, (122), 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 169 [2022-04-08 12:47:56,089 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:47:56,089 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 5.545454545454546) internal successors, (122), 21 states have internal predecessors, (122), 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-08 12:47:56,323 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 166 edges. 166 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:47:56,323 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-08 12:47:56,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:47:56,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-08 12:47:56,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-08 12:47:56,324 INFO L87 Difference]: Start difference. First operand 931 states and 1242 transitions. Second operand has 22 states, 22 states have (on average 5.545454545454546) internal successors, (122), 21 states have internal predecessors, (122), 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-08 12:48:03,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:48:03,137 INFO L93 Difference]: Finished difference Result 1135 states and 1544 transitions. [2022-04-08 12:48:03,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-08 12:48:03,137 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.545454545454546) internal successors, (122), 21 states have internal predecessors, (122), 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 169 [2022-04-08 12:48:03,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:48:03,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 5.545454545454546) internal successors, (122), 21 states have internal predecessors, (122), 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-08 12:48:03,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 396 transitions. [2022-04-08 12:48:03,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 5.545454545454546) internal successors, (122), 21 states have internal predecessors, (122), 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-08 12:48:03,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 396 transitions. [2022-04-08 12:48:03,143 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 396 transitions. [2022-04-08 12:48:03,700 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 396 edges. 396 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:48:03,740 INFO L225 Difference]: With dead ends: 1135 [2022-04-08 12:48:03,740 INFO L226 Difference]: Without dead ends: 957 [2022-04-08 12:48:03,740 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 314 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=572, Invalid=988, Unknown=0, NotChecked=0, Total=1560 [2022-04-08 12:48:03,740 INFO L913 BasicCegarLoop]: 84 mSDtfsCounter, 314 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 302 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 302 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-08 12:48:03,741 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [314 Valid, 424 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [302 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-08 12:48:03,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2022-04-08 12:48:07,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 946. [2022-04-08 12:48:07,433 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:48:07,434 INFO L82 GeneralOperation]: Start isEquivalent. First operand 957 states. Second operand has 946 states, 708 states have (on average 1.1751412429378532) internal successors, (832), 720 states have internal predecessors, (832), 215 states have call successors, (215), 24 states have call predecessors, (215), 22 states have return successors, (213), 201 states have call predecessors, (213), 213 states have call successors, (213) [2022-04-08 12:48:07,435 INFO L74 IsIncluded]: Start isIncluded. First operand 957 states. Second operand has 946 states, 708 states have (on average 1.1751412429378532) internal successors, (832), 720 states have internal predecessors, (832), 215 states have call successors, (215), 24 states have call predecessors, (215), 22 states have return successors, (213), 201 states have call predecessors, (213), 213 states have call successors, (213) [2022-04-08 12:48:07,435 INFO L87 Difference]: Start difference. First operand 957 states. Second operand has 946 states, 708 states have (on average 1.1751412429378532) internal successors, (832), 720 states have internal predecessors, (832), 215 states have call successors, (215), 24 states have call predecessors, (215), 22 states have return successors, (213), 201 states have call predecessors, (213), 213 states have call successors, (213) [2022-04-08 12:48:07,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:48:07,462 INFO L93 Difference]: Finished difference Result 957 states and 1271 transitions. [2022-04-08 12:48:07,462 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1271 transitions. [2022-04-08 12:48:07,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:48:07,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:48:07,464 INFO L74 IsIncluded]: Start isIncluded. First operand has 946 states, 708 states have (on average 1.1751412429378532) internal successors, (832), 720 states have internal predecessors, (832), 215 states have call successors, (215), 24 states have call predecessors, (215), 22 states have return successors, (213), 201 states have call predecessors, (213), 213 states have call successors, (213) Second operand 957 states. [2022-04-08 12:48:07,464 INFO L87 Difference]: Start difference. First operand has 946 states, 708 states have (on average 1.1751412429378532) internal successors, (832), 720 states have internal predecessors, (832), 215 states have call successors, (215), 24 states have call predecessors, (215), 22 states have return successors, (213), 201 states have call predecessors, (213), 213 states have call successors, (213) Second operand 957 states. [2022-04-08 12:48:07,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:48:07,491 INFO L93 Difference]: Finished difference Result 957 states and 1271 transitions. [2022-04-08 12:48:07,491 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1271 transitions. [2022-04-08 12:48:07,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:48:07,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:48:07,492 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:48:07,492 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:48:07,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 946 states, 708 states have (on average 1.1751412429378532) internal successors, (832), 720 states have internal predecessors, (832), 215 states have call successors, (215), 24 states have call predecessors, (215), 22 states have return successors, (213), 201 states have call predecessors, (213), 213 states have call successors, (213) [2022-04-08 12:48:07,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 1260 transitions. [2022-04-08 12:48:07,529 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 1260 transitions. Word has length 169 [2022-04-08 12:48:07,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:48:07,529 INFO L478 AbstractCegarLoop]: Abstraction has 946 states and 1260 transitions. [2022-04-08 12:48:07,529 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.545454545454546) internal successors, (122), 21 states have internal predecessors, (122), 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-08 12:48:07,529 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 946 states and 1260 transitions. [2022-04-08 12:48:23,779 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1260 edges. 1259 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 12:48:23,780 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 1260 transitions. [2022-04-08 12:48:23,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-04-08 12:48:23,781 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:48:23,781 INFO L499 BasicCegarLoop]: trace histogram [19, 18, 18, 9, 8, 8, 8, 7, 6, 6, 6, 5, 5, 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-08 12:48:23,798 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Forceful destruction successful, exit code 0 [2022-04-08 12:48:23,982 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2022-04-08 12:48:23,982 INFO L403 AbstractCegarLoop]: === Iteration 60 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:48:23,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:48:23,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1121656631, now seen corresponding path program 27 times [2022-04-08 12:48:23,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:48:23,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1097879139] [2022-04-08 12:48:23,983 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:48:23,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1121656631, now seen corresponding path program 28 times [2022-04-08 12:48:23,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:48:23,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900998322] [2022-04-08 12:48:23,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:48:23,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:48:23,998 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:48:23,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2053823844] [2022-04-08 12:48:23,999 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 12:48:23,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:48:23,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:48:23,999 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:48:24,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2022-04-08 12:48:24,130 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 12:48:24,131 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:48:24,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-08 12:48:24,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:48:24,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:48:25,000 INFO L272 TraceCheckUtils]: 0: Hoare triple {196915#true} call ULTIMATE.init(); {196915#true} is VALID [2022-04-08 12:48:25,000 INFO L290 TraceCheckUtils]: 1: Hoare triple {196915#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; {196923#(<= ~counter~0 0)} is VALID [2022-04-08 12:48:25,001 INFO L290 TraceCheckUtils]: 2: Hoare triple {196923#(<= ~counter~0 0)} assume true; {196923#(<= ~counter~0 0)} is VALID [2022-04-08 12:48:25,001 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {196923#(<= ~counter~0 0)} {196915#true} #102#return; {196923#(<= ~counter~0 0)} is VALID [2022-04-08 12:48:25,001 INFO L272 TraceCheckUtils]: 4: Hoare triple {196923#(<= ~counter~0 0)} call #t~ret9 := main(); {196923#(<= ~counter~0 0)} is VALID [2022-04-08 12:48:25,001 INFO L290 TraceCheckUtils]: 5: Hoare triple {196923#(<= ~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; {196923#(<= ~counter~0 0)} is VALID [2022-04-08 12:48:25,002 INFO L272 TraceCheckUtils]: 6: Hoare triple {196923#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {196923#(<= ~counter~0 0)} is VALID [2022-04-08 12:48:25,002 INFO L290 TraceCheckUtils]: 7: Hoare triple {196923#(<= ~counter~0 0)} ~cond := #in~cond; {196923#(<= ~counter~0 0)} is VALID [2022-04-08 12:48:25,002 INFO L290 TraceCheckUtils]: 8: Hoare triple {196923#(<= ~counter~0 0)} assume !(0 == ~cond); {196923#(<= ~counter~0 0)} is VALID [2022-04-08 12:48:25,003 INFO L290 TraceCheckUtils]: 9: Hoare triple {196923#(<= ~counter~0 0)} assume true; {196923#(<= ~counter~0 0)} is VALID [2022-04-08 12:48:25,003 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {196923#(<= ~counter~0 0)} {196923#(<= ~counter~0 0)} #90#return; {196923#(<= ~counter~0 0)} is VALID [2022-04-08 12:48:25,003 INFO L272 TraceCheckUtils]: 11: Hoare triple {196923#(<= ~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)); {196923#(<= ~counter~0 0)} is VALID [2022-04-08 12:48:25,004 INFO L290 TraceCheckUtils]: 12: Hoare triple {196923#(<= ~counter~0 0)} ~cond := #in~cond; {196923#(<= ~counter~0 0)} is VALID [2022-04-08 12:48:25,004 INFO L290 TraceCheckUtils]: 13: Hoare triple {196923#(<= ~counter~0 0)} assume !(0 == ~cond); {196923#(<= ~counter~0 0)} is VALID [2022-04-08 12:48:25,004 INFO L290 TraceCheckUtils]: 14: Hoare triple {196923#(<= ~counter~0 0)} assume true; {196923#(<= ~counter~0 0)} is VALID [2022-04-08 12:48:25,005 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {196923#(<= ~counter~0 0)} {196923#(<= ~counter~0 0)} #92#return; {196923#(<= ~counter~0 0)} is VALID [2022-04-08 12:48:25,005 INFO L290 TraceCheckUtils]: 16: Hoare triple {196923#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {196923#(<= ~counter~0 0)} is VALID [2022-04-08 12:48:25,009 INFO L290 TraceCheckUtils]: 17: Hoare triple {196923#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {196972#(<= ~counter~0 1)} is VALID [2022-04-08 12:48:25,009 INFO L290 TraceCheckUtils]: 18: Hoare triple {196972#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {196972#(<= ~counter~0 1)} is VALID [2022-04-08 12:48:25,010 INFO L272 TraceCheckUtils]: 19: Hoare triple {196972#(<= ~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)); {196972#(<= ~counter~0 1)} is VALID [2022-04-08 12:48:25,010 INFO L290 TraceCheckUtils]: 20: Hoare triple {196972#(<= ~counter~0 1)} ~cond := #in~cond; {196972#(<= ~counter~0 1)} is VALID [2022-04-08 12:48:25,010 INFO L290 TraceCheckUtils]: 21: Hoare triple {196972#(<= ~counter~0 1)} assume !(0 == ~cond); {196972#(<= ~counter~0 1)} is VALID [2022-04-08 12:48:25,011 INFO L290 TraceCheckUtils]: 22: Hoare triple {196972#(<= ~counter~0 1)} assume true; {196972#(<= ~counter~0 1)} is VALID [2022-04-08 12:48:25,011 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {196972#(<= ~counter~0 1)} {196972#(<= ~counter~0 1)} #94#return; {196972#(<= ~counter~0 1)} is VALID [2022-04-08 12:48:25,011 INFO L290 TraceCheckUtils]: 24: Hoare triple {196972#(<= ~counter~0 1)} assume !!(0 != ~r~0); {196972#(<= ~counter~0 1)} is VALID [2022-04-08 12:48:25,013 INFO L290 TraceCheckUtils]: 25: Hoare triple {196972#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {196997#(<= ~counter~0 2)} is VALID [2022-04-08 12:48:25,013 INFO L290 TraceCheckUtils]: 26: Hoare triple {196997#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {196997#(<= ~counter~0 2)} is VALID [2022-04-08 12:48:25,014 INFO L272 TraceCheckUtils]: 27: Hoare triple {196997#(<= ~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)); {196997#(<= ~counter~0 2)} is VALID [2022-04-08 12:48:25,014 INFO L290 TraceCheckUtils]: 28: Hoare triple {196997#(<= ~counter~0 2)} ~cond := #in~cond; {196997#(<= ~counter~0 2)} is VALID [2022-04-08 12:48:25,014 INFO L290 TraceCheckUtils]: 29: Hoare triple {196997#(<= ~counter~0 2)} assume !(0 == ~cond); {196997#(<= ~counter~0 2)} is VALID [2022-04-08 12:48:25,014 INFO L290 TraceCheckUtils]: 30: Hoare triple {196997#(<= ~counter~0 2)} assume true; {196997#(<= ~counter~0 2)} is VALID [2022-04-08 12:48:25,015 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {196997#(<= ~counter~0 2)} {196997#(<= ~counter~0 2)} #96#return; {196997#(<= ~counter~0 2)} is VALID [2022-04-08 12:48:25,015 INFO L290 TraceCheckUtils]: 32: Hoare triple {196997#(<= ~counter~0 2)} assume !(~r~0 > 0); {196997#(<= ~counter~0 2)} is VALID [2022-04-08 12:48:25,017 INFO L290 TraceCheckUtils]: 33: Hoare triple {196997#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {197022#(<= ~counter~0 3)} is VALID [2022-04-08 12:48:25,017 INFO L290 TraceCheckUtils]: 34: Hoare triple {197022#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {197022#(<= ~counter~0 3)} is VALID [2022-04-08 12:48:25,017 INFO L272 TraceCheckUtils]: 35: Hoare triple {197022#(<= ~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)); {197022#(<= ~counter~0 3)} is VALID [2022-04-08 12:48:25,018 INFO L290 TraceCheckUtils]: 36: Hoare triple {197022#(<= ~counter~0 3)} ~cond := #in~cond; {197022#(<= ~counter~0 3)} is VALID [2022-04-08 12:48:25,018 INFO L290 TraceCheckUtils]: 37: Hoare triple {197022#(<= ~counter~0 3)} assume !(0 == ~cond); {197022#(<= ~counter~0 3)} is VALID [2022-04-08 12:48:25,018 INFO L290 TraceCheckUtils]: 38: Hoare triple {197022#(<= ~counter~0 3)} assume true; {197022#(<= ~counter~0 3)} is VALID [2022-04-08 12:48:25,019 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {197022#(<= ~counter~0 3)} {197022#(<= ~counter~0 3)} #98#return; {197022#(<= ~counter~0 3)} is VALID [2022-04-08 12:48:25,019 INFO L290 TraceCheckUtils]: 40: Hoare triple {197022#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {197022#(<= ~counter~0 3)} is VALID [2022-04-08 12:48:25,021 INFO L290 TraceCheckUtils]: 41: Hoare triple {197022#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {197047#(<= ~counter~0 4)} is VALID [2022-04-08 12:48:25,021 INFO L290 TraceCheckUtils]: 42: Hoare triple {197047#(<= ~counter~0 4)} assume !!(#t~post8 < 20);havoc #t~post8; {197047#(<= ~counter~0 4)} is VALID [2022-04-08 12:48:25,021 INFO L272 TraceCheckUtils]: 43: Hoare triple {197047#(<= ~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)); {197047#(<= ~counter~0 4)} is VALID [2022-04-08 12:48:25,022 INFO L290 TraceCheckUtils]: 44: Hoare triple {197047#(<= ~counter~0 4)} ~cond := #in~cond; {197047#(<= ~counter~0 4)} is VALID [2022-04-08 12:48:25,022 INFO L290 TraceCheckUtils]: 45: Hoare triple {197047#(<= ~counter~0 4)} assume !(0 == ~cond); {197047#(<= ~counter~0 4)} is VALID [2022-04-08 12:48:25,022 INFO L290 TraceCheckUtils]: 46: Hoare triple {197047#(<= ~counter~0 4)} assume true; {197047#(<= ~counter~0 4)} is VALID [2022-04-08 12:48:25,023 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {197047#(<= ~counter~0 4)} {197047#(<= ~counter~0 4)} #98#return; {197047#(<= ~counter~0 4)} is VALID [2022-04-08 12:48:25,023 INFO L290 TraceCheckUtils]: 48: Hoare triple {197047#(<= ~counter~0 4)} assume !(~r~0 < 0); {197047#(<= ~counter~0 4)} is VALID [2022-04-08 12:48:25,024 INFO L290 TraceCheckUtils]: 49: Hoare triple {197047#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {197072#(<= ~counter~0 5)} is VALID [2022-04-08 12:48:25,025 INFO L290 TraceCheckUtils]: 50: Hoare triple {197072#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {197072#(<= ~counter~0 5)} is VALID [2022-04-08 12:48:25,025 INFO L272 TraceCheckUtils]: 51: Hoare triple {197072#(<= ~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)); {197072#(<= ~counter~0 5)} is VALID [2022-04-08 12:48:25,025 INFO L290 TraceCheckUtils]: 52: Hoare triple {197072#(<= ~counter~0 5)} ~cond := #in~cond; {197072#(<= ~counter~0 5)} is VALID [2022-04-08 12:48:25,026 INFO L290 TraceCheckUtils]: 53: Hoare triple {197072#(<= ~counter~0 5)} assume !(0 == ~cond); {197072#(<= ~counter~0 5)} is VALID [2022-04-08 12:48:25,026 INFO L290 TraceCheckUtils]: 54: Hoare triple {197072#(<= ~counter~0 5)} assume true; {197072#(<= ~counter~0 5)} is VALID [2022-04-08 12:48:25,026 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {197072#(<= ~counter~0 5)} {197072#(<= ~counter~0 5)} #94#return; {197072#(<= ~counter~0 5)} is VALID [2022-04-08 12:48:25,027 INFO L290 TraceCheckUtils]: 56: Hoare triple {197072#(<= ~counter~0 5)} assume !!(0 != ~r~0); {197072#(<= ~counter~0 5)} is VALID [2022-04-08 12:48:25,028 INFO L290 TraceCheckUtils]: 57: Hoare triple {197072#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {197097#(<= ~counter~0 6)} is VALID [2022-04-08 12:48:25,028 INFO L290 TraceCheckUtils]: 58: Hoare triple {197097#(<= ~counter~0 6)} assume !!(#t~post7 < 20);havoc #t~post7; {197097#(<= ~counter~0 6)} is VALID [2022-04-08 12:48:25,029 INFO L272 TraceCheckUtils]: 59: Hoare triple {197097#(<= ~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)); {197097#(<= ~counter~0 6)} is VALID [2022-04-08 12:48:25,029 INFO L290 TraceCheckUtils]: 60: Hoare triple {197097#(<= ~counter~0 6)} ~cond := #in~cond; {197097#(<= ~counter~0 6)} is VALID [2022-04-08 12:48:25,029 INFO L290 TraceCheckUtils]: 61: Hoare triple {197097#(<= ~counter~0 6)} assume !(0 == ~cond); {197097#(<= ~counter~0 6)} is VALID [2022-04-08 12:48:25,030 INFO L290 TraceCheckUtils]: 62: Hoare triple {197097#(<= ~counter~0 6)} assume true; {197097#(<= ~counter~0 6)} is VALID [2022-04-08 12:48:25,030 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {197097#(<= ~counter~0 6)} {197097#(<= ~counter~0 6)} #96#return; {197097#(<= ~counter~0 6)} is VALID [2022-04-08 12:48:25,030 INFO L290 TraceCheckUtils]: 64: Hoare triple {197097#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {197097#(<= ~counter~0 6)} is VALID [2022-04-08 12:48:25,032 INFO L290 TraceCheckUtils]: 65: Hoare triple {197097#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {197122#(<= ~counter~0 7)} is VALID [2022-04-08 12:48:25,032 INFO L290 TraceCheckUtils]: 66: Hoare triple {197122#(<= ~counter~0 7)} assume !!(#t~post7 < 20);havoc #t~post7; {197122#(<= ~counter~0 7)} is VALID [2022-04-08 12:48:25,033 INFO L272 TraceCheckUtils]: 67: Hoare triple {197122#(<= ~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)); {197122#(<= ~counter~0 7)} is VALID [2022-04-08 12:48:25,033 INFO L290 TraceCheckUtils]: 68: Hoare triple {197122#(<= ~counter~0 7)} ~cond := #in~cond; {197122#(<= ~counter~0 7)} is VALID [2022-04-08 12:48:25,033 INFO L290 TraceCheckUtils]: 69: Hoare triple {197122#(<= ~counter~0 7)} assume !(0 == ~cond); {197122#(<= ~counter~0 7)} is VALID [2022-04-08 12:48:25,033 INFO L290 TraceCheckUtils]: 70: Hoare triple {197122#(<= ~counter~0 7)} assume true; {197122#(<= ~counter~0 7)} is VALID [2022-04-08 12:48:25,034 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {197122#(<= ~counter~0 7)} {197122#(<= ~counter~0 7)} #96#return; {197122#(<= ~counter~0 7)} is VALID [2022-04-08 12:48:25,034 INFO L290 TraceCheckUtils]: 72: Hoare triple {197122#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {197122#(<= ~counter~0 7)} is VALID [2022-04-08 12:48:25,036 INFO L290 TraceCheckUtils]: 73: Hoare triple {197122#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {197147#(<= ~counter~0 8)} is VALID [2022-04-08 12:48:25,036 INFO L290 TraceCheckUtils]: 74: Hoare triple {197147#(<= ~counter~0 8)} assume !!(#t~post7 < 20);havoc #t~post7; {197147#(<= ~counter~0 8)} is VALID [2022-04-08 12:48:25,036 INFO L272 TraceCheckUtils]: 75: Hoare triple {197147#(<= ~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)); {197147#(<= ~counter~0 8)} is VALID [2022-04-08 12:48:25,037 INFO L290 TraceCheckUtils]: 76: Hoare triple {197147#(<= ~counter~0 8)} ~cond := #in~cond; {197147#(<= ~counter~0 8)} is VALID [2022-04-08 12:48:25,037 INFO L290 TraceCheckUtils]: 77: Hoare triple {197147#(<= ~counter~0 8)} assume !(0 == ~cond); {197147#(<= ~counter~0 8)} is VALID [2022-04-08 12:48:25,037 INFO L290 TraceCheckUtils]: 78: Hoare triple {197147#(<= ~counter~0 8)} assume true; {197147#(<= ~counter~0 8)} is VALID [2022-04-08 12:48:25,038 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {197147#(<= ~counter~0 8)} {197147#(<= ~counter~0 8)} #96#return; {197147#(<= ~counter~0 8)} is VALID [2022-04-08 12:48:25,038 INFO L290 TraceCheckUtils]: 80: Hoare triple {197147#(<= ~counter~0 8)} assume !(~r~0 > 0); {197147#(<= ~counter~0 8)} is VALID [2022-04-08 12:48:25,039 INFO L290 TraceCheckUtils]: 81: Hoare triple {197147#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {197172#(<= ~counter~0 9)} is VALID [2022-04-08 12:48:25,040 INFO L290 TraceCheckUtils]: 82: Hoare triple {197172#(<= ~counter~0 9)} assume !!(#t~post8 < 20);havoc #t~post8; {197172#(<= ~counter~0 9)} is VALID [2022-04-08 12:48:25,040 INFO L272 TraceCheckUtils]: 83: Hoare triple {197172#(<= ~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)); {197172#(<= ~counter~0 9)} is VALID [2022-04-08 12:48:25,041 INFO L290 TraceCheckUtils]: 84: Hoare triple {197172#(<= ~counter~0 9)} ~cond := #in~cond; {197172#(<= ~counter~0 9)} is VALID [2022-04-08 12:48:25,041 INFO L290 TraceCheckUtils]: 85: Hoare triple {197172#(<= ~counter~0 9)} assume !(0 == ~cond); {197172#(<= ~counter~0 9)} is VALID [2022-04-08 12:48:25,041 INFO L290 TraceCheckUtils]: 86: Hoare triple {197172#(<= ~counter~0 9)} assume true; {197172#(<= ~counter~0 9)} is VALID [2022-04-08 12:48:25,041 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {197172#(<= ~counter~0 9)} {197172#(<= ~counter~0 9)} #98#return; {197172#(<= ~counter~0 9)} is VALID [2022-04-08 12:48:25,042 INFO L290 TraceCheckUtils]: 88: Hoare triple {197172#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {197172#(<= ~counter~0 9)} is VALID [2022-04-08 12:48:25,043 INFO L290 TraceCheckUtils]: 89: Hoare triple {197172#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {197197#(<= ~counter~0 10)} is VALID [2022-04-08 12:48:25,044 INFO L290 TraceCheckUtils]: 90: Hoare triple {197197#(<= ~counter~0 10)} assume !!(#t~post8 < 20);havoc #t~post8; {197197#(<= ~counter~0 10)} is VALID [2022-04-08 12:48:25,044 INFO L272 TraceCheckUtils]: 91: Hoare triple {197197#(<= ~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)); {197197#(<= ~counter~0 10)} is VALID [2022-04-08 12:48:25,044 INFO L290 TraceCheckUtils]: 92: Hoare triple {197197#(<= ~counter~0 10)} ~cond := #in~cond; {197197#(<= ~counter~0 10)} is VALID [2022-04-08 12:48:25,045 INFO L290 TraceCheckUtils]: 93: Hoare triple {197197#(<= ~counter~0 10)} assume !(0 == ~cond); {197197#(<= ~counter~0 10)} is VALID [2022-04-08 12:48:25,045 INFO L290 TraceCheckUtils]: 94: Hoare triple {197197#(<= ~counter~0 10)} assume true; {197197#(<= ~counter~0 10)} is VALID [2022-04-08 12:48:25,045 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {197197#(<= ~counter~0 10)} {197197#(<= ~counter~0 10)} #98#return; {197197#(<= ~counter~0 10)} is VALID [2022-04-08 12:48:25,046 INFO L290 TraceCheckUtils]: 96: Hoare triple {197197#(<= ~counter~0 10)} assume !(~r~0 < 0); {197197#(<= ~counter~0 10)} is VALID [2022-04-08 12:48:25,047 INFO L290 TraceCheckUtils]: 97: Hoare triple {197197#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {197222#(<= ~counter~0 11)} is VALID [2022-04-08 12:48:25,047 INFO L290 TraceCheckUtils]: 98: Hoare triple {197222#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {197222#(<= ~counter~0 11)} is VALID [2022-04-08 12:48:25,048 INFO L272 TraceCheckUtils]: 99: Hoare triple {197222#(<= ~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)); {197222#(<= ~counter~0 11)} is VALID [2022-04-08 12:48:25,048 INFO L290 TraceCheckUtils]: 100: Hoare triple {197222#(<= ~counter~0 11)} ~cond := #in~cond; {197222#(<= ~counter~0 11)} is VALID [2022-04-08 12:48:25,048 INFO L290 TraceCheckUtils]: 101: Hoare triple {197222#(<= ~counter~0 11)} assume !(0 == ~cond); {197222#(<= ~counter~0 11)} is VALID [2022-04-08 12:48:25,049 INFO L290 TraceCheckUtils]: 102: Hoare triple {197222#(<= ~counter~0 11)} assume true; {197222#(<= ~counter~0 11)} is VALID [2022-04-08 12:48:25,049 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {197222#(<= ~counter~0 11)} {197222#(<= ~counter~0 11)} #94#return; {197222#(<= ~counter~0 11)} is VALID [2022-04-08 12:48:25,049 INFO L290 TraceCheckUtils]: 104: Hoare triple {197222#(<= ~counter~0 11)} assume !!(0 != ~r~0); {197222#(<= ~counter~0 11)} is VALID [2022-04-08 12:48:25,051 INFO L290 TraceCheckUtils]: 105: Hoare triple {197222#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {197247#(<= ~counter~0 12)} is VALID [2022-04-08 12:48:25,051 INFO L290 TraceCheckUtils]: 106: Hoare triple {197247#(<= ~counter~0 12)} assume !!(#t~post7 < 20);havoc #t~post7; {197247#(<= ~counter~0 12)} is VALID [2022-04-08 12:48:25,052 INFO L272 TraceCheckUtils]: 107: Hoare triple {197247#(<= ~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)); {197247#(<= ~counter~0 12)} is VALID [2022-04-08 12:48:25,052 INFO L290 TraceCheckUtils]: 108: Hoare triple {197247#(<= ~counter~0 12)} ~cond := #in~cond; {197247#(<= ~counter~0 12)} is VALID [2022-04-08 12:48:25,052 INFO L290 TraceCheckUtils]: 109: Hoare triple {197247#(<= ~counter~0 12)} assume !(0 == ~cond); {197247#(<= ~counter~0 12)} is VALID [2022-04-08 12:48:25,052 INFO L290 TraceCheckUtils]: 110: Hoare triple {197247#(<= ~counter~0 12)} assume true; {197247#(<= ~counter~0 12)} is VALID [2022-04-08 12:48:25,053 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {197247#(<= ~counter~0 12)} {197247#(<= ~counter~0 12)} #96#return; {197247#(<= ~counter~0 12)} is VALID [2022-04-08 12:48:25,053 INFO L290 TraceCheckUtils]: 112: Hoare triple {197247#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {197247#(<= ~counter~0 12)} is VALID [2022-04-08 12:48:25,055 INFO L290 TraceCheckUtils]: 113: Hoare triple {197247#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {197272#(<= ~counter~0 13)} is VALID [2022-04-08 12:48:25,056 INFO L290 TraceCheckUtils]: 114: Hoare triple {197272#(<= ~counter~0 13)} assume !!(#t~post7 < 20);havoc #t~post7; {197272#(<= ~counter~0 13)} is VALID [2022-04-08 12:48:25,056 INFO L272 TraceCheckUtils]: 115: Hoare triple {197272#(<= ~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)); {197272#(<= ~counter~0 13)} is VALID [2022-04-08 12:48:25,056 INFO L290 TraceCheckUtils]: 116: Hoare triple {197272#(<= ~counter~0 13)} ~cond := #in~cond; {197272#(<= ~counter~0 13)} is VALID [2022-04-08 12:48:25,057 INFO L290 TraceCheckUtils]: 117: Hoare triple {197272#(<= ~counter~0 13)} assume !(0 == ~cond); {197272#(<= ~counter~0 13)} is VALID [2022-04-08 12:48:25,057 INFO L290 TraceCheckUtils]: 118: Hoare triple {197272#(<= ~counter~0 13)} assume true; {197272#(<= ~counter~0 13)} is VALID [2022-04-08 12:48:25,057 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {197272#(<= ~counter~0 13)} {197272#(<= ~counter~0 13)} #96#return; {197272#(<= ~counter~0 13)} is VALID [2022-04-08 12:48:25,058 INFO L290 TraceCheckUtils]: 120: Hoare triple {197272#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {197272#(<= ~counter~0 13)} is VALID [2022-04-08 12:48:25,059 INFO L290 TraceCheckUtils]: 121: Hoare triple {197272#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {197297#(<= ~counter~0 14)} is VALID [2022-04-08 12:48:25,060 INFO L290 TraceCheckUtils]: 122: Hoare triple {197297#(<= ~counter~0 14)} assume !!(#t~post7 < 20);havoc #t~post7; {197297#(<= ~counter~0 14)} is VALID [2022-04-08 12:48:25,060 INFO L272 TraceCheckUtils]: 123: Hoare triple {197297#(<= ~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)); {197297#(<= ~counter~0 14)} is VALID [2022-04-08 12:48:25,060 INFO L290 TraceCheckUtils]: 124: Hoare triple {197297#(<= ~counter~0 14)} ~cond := #in~cond; {197297#(<= ~counter~0 14)} is VALID [2022-04-08 12:48:25,061 INFO L290 TraceCheckUtils]: 125: Hoare triple {197297#(<= ~counter~0 14)} assume !(0 == ~cond); {197297#(<= ~counter~0 14)} is VALID [2022-04-08 12:48:25,061 INFO L290 TraceCheckUtils]: 126: Hoare triple {197297#(<= ~counter~0 14)} assume true; {197297#(<= ~counter~0 14)} is VALID [2022-04-08 12:48:25,061 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {197297#(<= ~counter~0 14)} {197297#(<= ~counter~0 14)} #96#return; {197297#(<= ~counter~0 14)} is VALID [2022-04-08 12:48:25,062 INFO L290 TraceCheckUtils]: 128: Hoare triple {197297#(<= ~counter~0 14)} assume !(~r~0 > 0); {197297#(<= ~counter~0 14)} is VALID [2022-04-08 12:48:25,063 INFO L290 TraceCheckUtils]: 129: Hoare triple {197297#(<= ~counter~0 14)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {197322#(<= ~counter~0 15)} is VALID [2022-04-08 12:48:25,064 INFO L290 TraceCheckUtils]: 130: Hoare triple {197322#(<= ~counter~0 15)} assume !!(#t~post8 < 20);havoc #t~post8; {197322#(<= ~counter~0 15)} is VALID [2022-04-08 12:48:25,064 INFO L272 TraceCheckUtils]: 131: Hoare triple {197322#(<= ~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)); {197322#(<= ~counter~0 15)} is VALID [2022-04-08 12:48:25,065 INFO L290 TraceCheckUtils]: 132: Hoare triple {197322#(<= ~counter~0 15)} ~cond := #in~cond; {197322#(<= ~counter~0 15)} is VALID [2022-04-08 12:48:25,065 INFO L290 TraceCheckUtils]: 133: Hoare triple {197322#(<= ~counter~0 15)} assume !(0 == ~cond); {197322#(<= ~counter~0 15)} is VALID [2022-04-08 12:48:25,065 INFO L290 TraceCheckUtils]: 134: Hoare triple {197322#(<= ~counter~0 15)} assume true; {197322#(<= ~counter~0 15)} is VALID [2022-04-08 12:48:25,066 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {197322#(<= ~counter~0 15)} {197322#(<= ~counter~0 15)} #98#return; {197322#(<= ~counter~0 15)} is VALID [2022-04-08 12:48:25,066 INFO L290 TraceCheckUtils]: 136: Hoare triple {197322#(<= ~counter~0 15)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {197322#(<= ~counter~0 15)} is VALID [2022-04-08 12:48:25,068 INFO L290 TraceCheckUtils]: 137: Hoare triple {197322#(<= ~counter~0 15)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {197347#(<= ~counter~0 16)} is VALID [2022-04-08 12:48:25,068 INFO L290 TraceCheckUtils]: 138: Hoare triple {197347#(<= ~counter~0 16)} assume !!(#t~post8 < 20);havoc #t~post8; {197347#(<= ~counter~0 16)} is VALID [2022-04-08 12:48:25,068 INFO L272 TraceCheckUtils]: 139: Hoare triple {197347#(<= ~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)); {197347#(<= ~counter~0 16)} is VALID [2022-04-08 12:48:25,069 INFO L290 TraceCheckUtils]: 140: Hoare triple {197347#(<= ~counter~0 16)} ~cond := #in~cond; {197347#(<= ~counter~0 16)} is VALID [2022-04-08 12:48:25,069 INFO L290 TraceCheckUtils]: 141: Hoare triple {197347#(<= ~counter~0 16)} assume !(0 == ~cond); {197347#(<= ~counter~0 16)} is VALID [2022-04-08 12:48:25,069 INFO L290 TraceCheckUtils]: 142: Hoare triple {197347#(<= ~counter~0 16)} assume true; {197347#(<= ~counter~0 16)} is VALID [2022-04-08 12:48:25,070 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {197347#(<= ~counter~0 16)} {197347#(<= ~counter~0 16)} #98#return; {197347#(<= ~counter~0 16)} is VALID [2022-04-08 12:48:25,070 INFO L290 TraceCheckUtils]: 144: Hoare triple {197347#(<= ~counter~0 16)} assume !(~r~0 < 0); {197347#(<= ~counter~0 16)} is VALID [2022-04-08 12:48:25,072 INFO L290 TraceCheckUtils]: 145: Hoare triple {197347#(<= ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {197372#(<= ~counter~0 17)} is VALID [2022-04-08 12:48:25,072 INFO L290 TraceCheckUtils]: 146: Hoare triple {197372#(<= ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {197372#(<= ~counter~0 17)} is VALID [2022-04-08 12:48:25,073 INFO L272 TraceCheckUtils]: 147: Hoare triple {197372#(<= ~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)); {197372#(<= ~counter~0 17)} is VALID [2022-04-08 12:48:25,073 INFO L290 TraceCheckUtils]: 148: Hoare triple {197372#(<= ~counter~0 17)} ~cond := #in~cond; {197372#(<= ~counter~0 17)} is VALID [2022-04-08 12:48:25,073 INFO L290 TraceCheckUtils]: 149: Hoare triple {197372#(<= ~counter~0 17)} assume !(0 == ~cond); {197372#(<= ~counter~0 17)} is VALID [2022-04-08 12:48:25,073 INFO L290 TraceCheckUtils]: 150: Hoare triple {197372#(<= ~counter~0 17)} assume true; {197372#(<= ~counter~0 17)} is VALID [2022-04-08 12:48:25,074 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {197372#(<= ~counter~0 17)} {197372#(<= ~counter~0 17)} #94#return; {197372#(<= ~counter~0 17)} is VALID [2022-04-08 12:48:25,074 INFO L290 TraceCheckUtils]: 152: Hoare triple {197372#(<= ~counter~0 17)} assume !!(0 != ~r~0); {197372#(<= ~counter~0 17)} is VALID [2022-04-08 12:48:25,077 INFO L290 TraceCheckUtils]: 153: Hoare triple {197372#(<= ~counter~0 17)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {197397#(<= ~counter~0 18)} is VALID [2022-04-08 12:48:25,077 INFO L290 TraceCheckUtils]: 154: Hoare triple {197397#(<= ~counter~0 18)} assume !!(#t~post7 < 20);havoc #t~post7; {197397#(<= ~counter~0 18)} is VALID [2022-04-08 12:48:25,077 INFO L272 TraceCheckUtils]: 155: Hoare triple {197397#(<= ~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)); {197397#(<= ~counter~0 18)} is VALID [2022-04-08 12:48:25,078 INFO L290 TraceCheckUtils]: 156: Hoare triple {197397#(<= ~counter~0 18)} ~cond := #in~cond; {197397#(<= ~counter~0 18)} is VALID [2022-04-08 12:48:25,078 INFO L290 TraceCheckUtils]: 157: Hoare triple {197397#(<= ~counter~0 18)} assume !(0 == ~cond); {197397#(<= ~counter~0 18)} is VALID [2022-04-08 12:48:25,078 INFO L290 TraceCheckUtils]: 158: Hoare triple {197397#(<= ~counter~0 18)} assume true; {197397#(<= ~counter~0 18)} is VALID [2022-04-08 12:48:25,079 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {197397#(<= ~counter~0 18)} {197397#(<= ~counter~0 18)} #96#return; {197397#(<= ~counter~0 18)} is VALID [2022-04-08 12:48:25,079 INFO L290 TraceCheckUtils]: 160: Hoare triple {197397#(<= ~counter~0 18)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {197397#(<= ~counter~0 18)} is VALID [2022-04-08 12:48:25,079 INFO L290 TraceCheckUtils]: 161: Hoare triple {197397#(<= ~counter~0 18)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {197422#(<= |main_#t~post7| 18)} is VALID [2022-04-08 12:48:25,080 INFO L290 TraceCheckUtils]: 162: Hoare triple {197422#(<= |main_#t~post7| 18)} assume !(#t~post7 < 20);havoc #t~post7; {196916#false} is VALID [2022-04-08 12:48:25,080 INFO L290 TraceCheckUtils]: 163: Hoare triple {196916#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {196916#false} is VALID [2022-04-08 12:48:25,080 INFO L290 TraceCheckUtils]: 164: Hoare triple {196916#false} assume !(#t~post8 < 20);havoc #t~post8; {196916#false} is VALID [2022-04-08 12:48:25,080 INFO L290 TraceCheckUtils]: 165: Hoare triple {196916#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {196916#false} is VALID [2022-04-08 12:48:25,080 INFO L290 TraceCheckUtils]: 166: Hoare triple {196916#false} assume !(#t~post6 < 20);havoc #t~post6; {196916#false} is VALID [2022-04-08 12:48:25,080 INFO L272 TraceCheckUtils]: 167: Hoare triple {196916#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)); {196916#false} is VALID [2022-04-08 12:48:25,080 INFO L290 TraceCheckUtils]: 168: Hoare triple {196916#false} ~cond := #in~cond; {196916#false} is VALID [2022-04-08 12:48:25,080 INFO L290 TraceCheckUtils]: 169: Hoare triple {196916#false} assume 0 == ~cond; {196916#false} is VALID [2022-04-08 12:48:25,080 INFO L290 TraceCheckUtils]: 170: Hoare triple {196916#false} assume !false; {196916#false} is VALID [2022-04-08 12:48:25,080 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 56 proven. 824 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 12:48:25,080 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:48:25,805 INFO L290 TraceCheckUtils]: 170: Hoare triple {196916#false} assume !false; {196916#false} is VALID [2022-04-08 12:48:25,806 INFO L290 TraceCheckUtils]: 169: Hoare triple {196916#false} assume 0 == ~cond; {196916#false} is VALID [2022-04-08 12:48:25,806 INFO L290 TraceCheckUtils]: 168: Hoare triple {196916#false} ~cond := #in~cond; {196916#false} is VALID [2022-04-08 12:48:25,806 INFO L272 TraceCheckUtils]: 167: Hoare triple {196916#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)); {196916#false} is VALID [2022-04-08 12:48:25,806 INFO L290 TraceCheckUtils]: 166: Hoare triple {196916#false} assume !(#t~post6 < 20);havoc #t~post6; {196916#false} is VALID [2022-04-08 12:48:25,806 INFO L290 TraceCheckUtils]: 165: Hoare triple {196916#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {196916#false} is VALID [2022-04-08 12:48:25,806 INFO L290 TraceCheckUtils]: 164: Hoare triple {196916#false} assume !(#t~post8 < 20);havoc #t~post8; {196916#false} is VALID [2022-04-08 12:48:25,806 INFO L290 TraceCheckUtils]: 163: Hoare triple {196916#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {196916#false} is VALID [2022-04-08 12:48:25,806 INFO L290 TraceCheckUtils]: 162: Hoare triple {197474#(< |main_#t~post7| 20)} assume !(#t~post7 < 20);havoc #t~post7; {196916#false} is VALID [2022-04-08 12:48:25,807 INFO L290 TraceCheckUtils]: 161: Hoare triple {197478#(< ~counter~0 20)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {197474#(< |main_#t~post7| 20)} is VALID [2022-04-08 12:48:25,807 INFO L290 TraceCheckUtils]: 160: Hoare triple {197478#(< ~counter~0 20)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {197478#(< ~counter~0 20)} is VALID [2022-04-08 12:48:25,807 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {196915#true} {197478#(< ~counter~0 20)} #96#return; {197478#(< ~counter~0 20)} is VALID [2022-04-08 12:48:25,807 INFO L290 TraceCheckUtils]: 158: Hoare triple {196915#true} assume true; {196915#true} is VALID [2022-04-08 12:48:25,807 INFO L290 TraceCheckUtils]: 157: Hoare triple {196915#true} assume !(0 == ~cond); {196915#true} is VALID [2022-04-08 12:48:25,808 INFO L290 TraceCheckUtils]: 156: Hoare triple {196915#true} ~cond := #in~cond; {196915#true} is VALID [2022-04-08 12:48:25,808 INFO L272 TraceCheckUtils]: 155: Hoare triple {197478#(< ~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)); {196915#true} is VALID [2022-04-08 12:48:25,808 INFO L290 TraceCheckUtils]: 154: Hoare triple {197478#(< ~counter~0 20)} assume !!(#t~post7 < 20);havoc #t~post7; {197478#(< ~counter~0 20)} is VALID [2022-04-08 12:48:25,812 INFO L290 TraceCheckUtils]: 153: Hoare triple {197397#(<= ~counter~0 18)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {197478#(< ~counter~0 20)} is VALID [2022-04-08 12:48:25,813 INFO L290 TraceCheckUtils]: 152: Hoare triple {197397#(<= ~counter~0 18)} assume !!(0 != ~r~0); {197397#(<= ~counter~0 18)} is VALID [2022-04-08 12:48:25,813 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {196915#true} {197397#(<= ~counter~0 18)} #94#return; {197397#(<= ~counter~0 18)} is VALID [2022-04-08 12:48:25,813 INFO L290 TraceCheckUtils]: 150: Hoare triple {196915#true} assume true; {196915#true} is VALID [2022-04-08 12:48:25,813 INFO L290 TraceCheckUtils]: 149: Hoare triple {196915#true} assume !(0 == ~cond); {196915#true} is VALID [2022-04-08 12:48:25,813 INFO L290 TraceCheckUtils]: 148: Hoare triple {196915#true} ~cond := #in~cond; {196915#true} is VALID [2022-04-08 12:48:25,813 INFO L272 TraceCheckUtils]: 147: Hoare triple {197397#(<= ~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)); {196915#true} is VALID [2022-04-08 12:48:25,814 INFO L290 TraceCheckUtils]: 146: Hoare triple {197397#(<= ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {197397#(<= ~counter~0 18)} is VALID [2022-04-08 12:48:25,815 INFO L290 TraceCheckUtils]: 145: Hoare triple {197372#(<= ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {197397#(<= ~counter~0 18)} is VALID [2022-04-08 12:48:25,816 INFO L290 TraceCheckUtils]: 144: Hoare triple {197372#(<= ~counter~0 17)} assume !(~r~0 < 0); {197372#(<= ~counter~0 17)} is VALID [2022-04-08 12:48:25,816 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {196915#true} {197372#(<= ~counter~0 17)} #98#return; {197372#(<= ~counter~0 17)} is VALID [2022-04-08 12:48:25,816 INFO L290 TraceCheckUtils]: 142: Hoare triple {196915#true} assume true; {196915#true} is VALID [2022-04-08 12:48:25,816 INFO L290 TraceCheckUtils]: 141: Hoare triple {196915#true} assume !(0 == ~cond); {196915#true} is VALID [2022-04-08 12:48:25,816 INFO L290 TraceCheckUtils]: 140: Hoare triple {196915#true} ~cond := #in~cond; {196915#true} is VALID [2022-04-08 12:48:25,817 INFO L272 TraceCheckUtils]: 139: Hoare triple {197372#(<= ~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)); {196915#true} is VALID [2022-04-08 12:48:25,817 INFO L290 TraceCheckUtils]: 138: Hoare triple {197372#(<= ~counter~0 17)} assume !!(#t~post8 < 20);havoc #t~post8; {197372#(<= ~counter~0 17)} is VALID [2022-04-08 12:48:25,819 INFO L290 TraceCheckUtils]: 137: Hoare triple {197347#(<= ~counter~0 16)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {197372#(<= ~counter~0 17)} is VALID [2022-04-08 12:48:25,820 INFO L290 TraceCheckUtils]: 136: Hoare triple {197347#(<= ~counter~0 16)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {197347#(<= ~counter~0 16)} is VALID [2022-04-08 12:48:25,820 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {196915#true} {197347#(<= ~counter~0 16)} #98#return; {197347#(<= ~counter~0 16)} is VALID [2022-04-08 12:48:25,820 INFO L290 TraceCheckUtils]: 134: Hoare triple {196915#true} assume true; {196915#true} is VALID [2022-04-08 12:48:25,820 INFO L290 TraceCheckUtils]: 133: Hoare triple {196915#true} assume !(0 == ~cond); {196915#true} is VALID [2022-04-08 12:48:25,820 INFO L290 TraceCheckUtils]: 132: Hoare triple {196915#true} ~cond := #in~cond; {196915#true} is VALID [2022-04-08 12:48:25,820 INFO L272 TraceCheckUtils]: 131: Hoare triple {197347#(<= ~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)); {196915#true} is VALID [2022-04-08 12:48:25,821 INFO L290 TraceCheckUtils]: 130: Hoare triple {197347#(<= ~counter~0 16)} assume !!(#t~post8 < 20);havoc #t~post8; {197347#(<= ~counter~0 16)} is VALID [2022-04-08 12:48:25,822 INFO L290 TraceCheckUtils]: 129: Hoare triple {197322#(<= ~counter~0 15)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {197347#(<= ~counter~0 16)} is VALID [2022-04-08 12:48:25,822 INFO L290 TraceCheckUtils]: 128: Hoare triple {197322#(<= ~counter~0 15)} assume !(~r~0 > 0); {197322#(<= ~counter~0 15)} is VALID [2022-04-08 12:48:25,823 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {196915#true} {197322#(<= ~counter~0 15)} #96#return; {197322#(<= ~counter~0 15)} is VALID [2022-04-08 12:48:25,823 INFO L290 TraceCheckUtils]: 126: Hoare triple {196915#true} assume true; {196915#true} is VALID [2022-04-08 12:48:25,823 INFO L290 TraceCheckUtils]: 125: Hoare triple {196915#true} assume !(0 == ~cond); {196915#true} is VALID [2022-04-08 12:48:25,823 INFO L290 TraceCheckUtils]: 124: Hoare triple {196915#true} ~cond := #in~cond; {196915#true} is VALID [2022-04-08 12:48:25,823 INFO L272 TraceCheckUtils]: 123: Hoare triple {197322#(<= ~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)); {196915#true} is VALID [2022-04-08 12:48:25,823 INFO L290 TraceCheckUtils]: 122: Hoare triple {197322#(<= ~counter~0 15)} assume !!(#t~post7 < 20);havoc #t~post7; {197322#(<= ~counter~0 15)} is VALID [2022-04-08 12:48:25,825 INFO L290 TraceCheckUtils]: 121: Hoare triple {197297#(<= ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {197322#(<= ~counter~0 15)} is VALID [2022-04-08 12:48:25,825 INFO L290 TraceCheckUtils]: 120: Hoare triple {197297#(<= ~counter~0 14)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {197297#(<= ~counter~0 14)} is VALID [2022-04-08 12:48:25,826 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {196915#true} {197297#(<= ~counter~0 14)} #96#return; {197297#(<= ~counter~0 14)} is VALID [2022-04-08 12:48:25,826 INFO L290 TraceCheckUtils]: 118: Hoare triple {196915#true} assume true; {196915#true} is VALID [2022-04-08 12:48:25,826 INFO L290 TraceCheckUtils]: 117: Hoare triple {196915#true} assume !(0 == ~cond); {196915#true} is VALID [2022-04-08 12:48:25,826 INFO L290 TraceCheckUtils]: 116: Hoare triple {196915#true} ~cond := #in~cond; {196915#true} is VALID [2022-04-08 12:48:25,826 INFO L272 TraceCheckUtils]: 115: Hoare triple {197297#(<= ~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)); {196915#true} is VALID [2022-04-08 12:48:25,826 INFO L290 TraceCheckUtils]: 114: Hoare triple {197297#(<= ~counter~0 14)} assume !!(#t~post7 < 20);havoc #t~post7; {197297#(<= ~counter~0 14)} is VALID [2022-04-08 12:48:25,828 INFO L290 TraceCheckUtils]: 113: Hoare triple {197272#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {197297#(<= ~counter~0 14)} is VALID [2022-04-08 12:48:25,828 INFO L290 TraceCheckUtils]: 112: Hoare triple {197272#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {197272#(<= ~counter~0 13)} is VALID [2022-04-08 12:48:25,829 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {196915#true} {197272#(<= ~counter~0 13)} #96#return; {197272#(<= ~counter~0 13)} is VALID [2022-04-08 12:48:25,829 INFO L290 TraceCheckUtils]: 110: Hoare triple {196915#true} assume true; {196915#true} is VALID [2022-04-08 12:48:25,829 INFO L290 TraceCheckUtils]: 109: Hoare triple {196915#true} assume !(0 == ~cond); {196915#true} is VALID [2022-04-08 12:48:25,829 INFO L290 TraceCheckUtils]: 108: Hoare triple {196915#true} ~cond := #in~cond; {196915#true} is VALID [2022-04-08 12:48:25,829 INFO L272 TraceCheckUtils]: 107: Hoare triple {197272#(<= ~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)); {196915#true} is VALID [2022-04-08 12:48:25,829 INFO L290 TraceCheckUtils]: 106: Hoare triple {197272#(<= ~counter~0 13)} assume !!(#t~post7 < 20);havoc #t~post7; {197272#(<= ~counter~0 13)} is VALID [2022-04-08 12:48:25,831 INFO L290 TraceCheckUtils]: 105: Hoare triple {197247#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {197272#(<= ~counter~0 13)} is VALID [2022-04-08 12:48:25,831 INFO L290 TraceCheckUtils]: 104: Hoare triple {197247#(<= ~counter~0 12)} assume !!(0 != ~r~0); {197247#(<= ~counter~0 12)} is VALID [2022-04-08 12:48:25,832 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {196915#true} {197247#(<= ~counter~0 12)} #94#return; {197247#(<= ~counter~0 12)} is VALID [2022-04-08 12:48:25,832 INFO L290 TraceCheckUtils]: 102: Hoare triple {196915#true} assume true; {196915#true} is VALID [2022-04-08 12:48:25,832 INFO L290 TraceCheckUtils]: 101: Hoare triple {196915#true} assume !(0 == ~cond); {196915#true} is VALID [2022-04-08 12:48:25,832 INFO L290 TraceCheckUtils]: 100: Hoare triple {196915#true} ~cond := #in~cond; {196915#true} is VALID [2022-04-08 12:48:25,832 INFO L272 TraceCheckUtils]: 99: Hoare triple {197247#(<= ~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)); {196915#true} is VALID [2022-04-08 12:48:25,832 INFO L290 TraceCheckUtils]: 98: Hoare triple {197247#(<= ~counter~0 12)} assume !!(#t~post6 < 20);havoc #t~post6; {197247#(<= ~counter~0 12)} is VALID [2022-04-08 12:48:25,834 INFO L290 TraceCheckUtils]: 97: Hoare triple {197222#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {197247#(<= ~counter~0 12)} is VALID [2022-04-08 12:48:25,835 INFO L290 TraceCheckUtils]: 96: Hoare triple {197222#(<= ~counter~0 11)} assume !(~r~0 < 0); {197222#(<= ~counter~0 11)} is VALID [2022-04-08 12:48:25,835 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {196915#true} {197222#(<= ~counter~0 11)} #98#return; {197222#(<= ~counter~0 11)} is VALID [2022-04-08 12:48:25,835 INFO L290 TraceCheckUtils]: 94: Hoare triple {196915#true} assume true; {196915#true} is VALID [2022-04-08 12:48:25,835 INFO L290 TraceCheckUtils]: 93: Hoare triple {196915#true} assume !(0 == ~cond); {196915#true} is VALID [2022-04-08 12:48:25,835 INFO L290 TraceCheckUtils]: 92: Hoare triple {196915#true} ~cond := #in~cond; {196915#true} is VALID [2022-04-08 12:48:25,836 INFO L272 TraceCheckUtils]: 91: Hoare triple {197222#(<= ~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)); {196915#true} is VALID [2022-04-08 12:48:25,836 INFO L290 TraceCheckUtils]: 90: Hoare triple {197222#(<= ~counter~0 11)} assume !!(#t~post8 < 20);havoc #t~post8; {197222#(<= ~counter~0 11)} is VALID [2022-04-08 12:48:25,838 INFO L290 TraceCheckUtils]: 89: Hoare triple {197197#(<= ~counter~0 10)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {197222#(<= ~counter~0 11)} is VALID [2022-04-08 12:48:25,838 INFO L290 TraceCheckUtils]: 88: Hoare triple {197197#(<= ~counter~0 10)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {197197#(<= ~counter~0 10)} is VALID [2022-04-08 12:48:25,838 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {196915#true} {197197#(<= ~counter~0 10)} #98#return; {197197#(<= ~counter~0 10)} is VALID [2022-04-08 12:48:25,838 INFO L290 TraceCheckUtils]: 86: Hoare triple {196915#true} assume true; {196915#true} is VALID [2022-04-08 12:48:25,839 INFO L290 TraceCheckUtils]: 85: Hoare triple {196915#true} assume !(0 == ~cond); {196915#true} is VALID [2022-04-08 12:48:25,839 INFO L290 TraceCheckUtils]: 84: Hoare triple {196915#true} ~cond := #in~cond; {196915#true} is VALID [2022-04-08 12:48:25,839 INFO L272 TraceCheckUtils]: 83: Hoare triple {197197#(<= ~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)); {196915#true} is VALID [2022-04-08 12:48:25,839 INFO L290 TraceCheckUtils]: 82: Hoare triple {197197#(<= ~counter~0 10)} assume !!(#t~post8 < 20);havoc #t~post8; {197197#(<= ~counter~0 10)} is VALID [2022-04-08 12:48:25,841 INFO L290 TraceCheckUtils]: 81: Hoare triple {197172#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {197197#(<= ~counter~0 10)} is VALID [2022-04-08 12:48:25,841 INFO L290 TraceCheckUtils]: 80: Hoare triple {197172#(<= ~counter~0 9)} assume !(~r~0 > 0); {197172#(<= ~counter~0 9)} is VALID [2022-04-08 12:48:25,841 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {196915#true} {197172#(<= ~counter~0 9)} #96#return; {197172#(<= ~counter~0 9)} is VALID [2022-04-08 12:48:25,841 INFO L290 TraceCheckUtils]: 78: Hoare triple {196915#true} assume true; {196915#true} is VALID [2022-04-08 12:48:25,841 INFO L290 TraceCheckUtils]: 77: Hoare triple {196915#true} assume !(0 == ~cond); {196915#true} is VALID [2022-04-08 12:48:25,842 INFO L290 TraceCheckUtils]: 76: Hoare triple {196915#true} ~cond := #in~cond; {196915#true} is VALID [2022-04-08 12:48:25,842 INFO L272 TraceCheckUtils]: 75: Hoare triple {197172#(<= ~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)); {196915#true} is VALID [2022-04-08 12:48:25,842 INFO L290 TraceCheckUtils]: 74: Hoare triple {197172#(<= ~counter~0 9)} assume !!(#t~post7 < 20);havoc #t~post7; {197172#(<= ~counter~0 9)} is VALID [2022-04-08 12:48:25,843 INFO L290 TraceCheckUtils]: 73: Hoare triple {197147#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {197172#(<= ~counter~0 9)} is VALID [2022-04-08 12:48:25,844 INFO L290 TraceCheckUtils]: 72: Hoare triple {197147#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {197147#(<= ~counter~0 8)} is VALID [2022-04-08 12:48:25,844 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {196915#true} {197147#(<= ~counter~0 8)} #96#return; {197147#(<= ~counter~0 8)} is VALID [2022-04-08 12:48:25,844 INFO L290 TraceCheckUtils]: 70: Hoare triple {196915#true} assume true; {196915#true} is VALID [2022-04-08 12:48:25,844 INFO L290 TraceCheckUtils]: 69: Hoare triple {196915#true} assume !(0 == ~cond); {196915#true} is VALID [2022-04-08 12:48:25,844 INFO L290 TraceCheckUtils]: 68: Hoare triple {196915#true} ~cond := #in~cond; {196915#true} is VALID [2022-04-08 12:48:25,844 INFO L272 TraceCheckUtils]: 67: Hoare triple {197147#(<= ~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)); {196915#true} is VALID [2022-04-08 12:48:25,845 INFO L290 TraceCheckUtils]: 66: Hoare triple {197147#(<= ~counter~0 8)} assume !!(#t~post7 < 20);havoc #t~post7; {197147#(<= ~counter~0 8)} is VALID [2022-04-08 12:48:25,846 INFO L290 TraceCheckUtils]: 65: Hoare triple {197122#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {197147#(<= ~counter~0 8)} is VALID [2022-04-08 12:48:25,846 INFO L290 TraceCheckUtils]: 64: Hoare triple {197122#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {197122#(<= ~counter~0 7)} is VALID [2022-04-08 12:48:25,847 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {196915#true} {197122#(<= ~counter~0 7)} #96#return; {197122#(<= ~counter~0 7)} is VALID [2022-04-08 12:48:25,847 INFO L290 TraceCheckUtils]: 62: Hoare triple {196915#true} assume true; {196915#true} is VALID [2022-04-08 12:48:25,847 INFO L290 TraceCheckUtils]: 61: Hoare triple {196915#true} assume !(0 == ~cond); {196915#true} is VALID [2022-04-08 12:48:25,847 INFO L290 TraceCheckUtils]: 60: Hoare triple {196915#true} ~cond := #in~cond; {196915#true} is VALID [2022-04-08 12:48:25,847 INFO L272 TraceCheckUtils]: 59: Hoare triple {197122#(<= ~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)); {196915#true} is VALID [2022-04-08 12:48:25,847 INFO L290 TraceCheckUtils]: 58: Hoare triple {197122#(<= ~counter~0 7)} assume !!(#t~post7 < 20);havoc #t~post7; {197122#(<= ~counter~0 7)} is VALID [2022-04-08 12:48:25,849 INFO L290 TraceCheckUtils]: 57: Hoare triple {197097#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {197122#(<= ~counter~0 7)} is VALID [2022-04-08 12:48:25,850 INFO L290 TraceCheckUtils]: 56: Hoare triple {197097#(<= ~counter~0 6)} assume !!(0 != ~r~0); {197097#(<= ~counter~0 6)} is VALID [2022-04-08 12:48:25,850 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {196915#true} {197097#(<= ~counter~0 6)} #94#return; {197097#(<= ~counter~0 6)} is VALID [2022-04-08 12:48:25,850 INFO L290 TraceCheckUtils]: 54: Hoare triple {196915#true} assume true; {196915#true} is VALID [2022-04-08 12:48:25,850 INFO L290 TraceCheckUtils]: 53: Hoare triple {196915#true} assume !(0 == ~cond); {196915#true} is VALID [2022-04-08 12:48:25,850 INFO L290 TraceCheckUtils]: 52: Hoare triple {196915#true} ~cond := #in~cond; {196915#true} is VALID [2022-04-08 12:48:25,850 INFO L272 TraceCheckUtils]: 51: Hoare triple {197097#(<= ~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)); {196915#true} is VALID [2022-04-08 12:48:25,851 INFO L290 TraceCheckUtils]: 50: Hoare triple {197097#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {197097#(<= ~counter~0 6)} is VALID [2022-04-08 12:48:25,853 INFO L290 TraceCheckUtils]: 49: Hoare triple {197072#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {197097#(<= ~counter~0 6)} is VALID [2022-04-08 12:48:25,853 INFO L290 TraceCheckUtils]: 48: Hoare triple {197072#(<= ~counter~0 5)} assume !(~r~0 < 0); {197072#(<= ~counter~0 5)} is VALID [2022-04-08 12:48:25,853 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {196915#true} {197072#(<= ~counter~0 5)} #98#return; {197072#(<= ~counter~0 5)} is VALID [2022-04-08 12:48:25,853 INFO L290 TraceCheckUtils]: 46: Hoare triple {196915#true} assume true; {196915#true} is VALID [2022-04-08 12:48:25,853 INFO L290 TraceCheckUtils]: 45: Hoare triple {196915#true} assume !(0 == ~cond); {196915#true} is VALID [2022-04-08 12:48:25,854 INFO L290 TraceCheckUtils]: 44: Hoare triple {196915#true} ~cond := #in~cond; {196915#true} is VALID [2022-04-08 12:48:25,854 INFO L272 TraceCheckUtils]: 43: Hoare triple {197072#(<= ~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)); {196915#true} is VALID [2022-04-08 12:48:25,854 INFO L290 TraceCheckUtils]: 42: Hoare triple {197072#(<= ~counter~0 5)} assume !!(#t~post8 < 20);havoc #t~post8; {197072#(<= ~counter~0 5)} is VALID [2022-04-08 12:48:25,855 INFO L290 TraceCheckUtils]: 41: Hoare triple {197047#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {197072#(<= ~counter~0 5)} is VALID [2022-04-08 12:48:25,856 INFO L290 TraceCheckUtils]: 40: Hoare triple {197047#(<= ~counter~0 4)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {197047#(<= ~counter~0 4)} is VALID [2022-04-08 12:48:25,856 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {196915#true} {197047#(<= ~counter~0 4)} #98#return; {197047#(<= ~counter~0 4)} is VALID [2022-04-08 12:48:25,856 INFO L290 TraceCheckUtils]: 38: Hoare triple {196915#true} assume true; {196915#true} is VALID [2022-04-08 12:48:25,856 INFO L290 TraceCheckUtils]: 37: Hoare triple {196915#true} assume !(0 == ~cond); {196915#true} is VALID [2022-04-08 12:48:25,856 INFO L290 TraceCheckUtils]: 36: Hoare triple {196915#true} ~cond := #in~cond; {196915#true} is VALID [2022-04-08 12:48:25,856 INFO L272 TraceCheckUtils]: 35: Hoare triple {197047#(<= ~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)); {196915#true} is VALID [2022-04-08 12:48:25,857 INFO L290 TraceCheckUtils]: 34: Hoare triple {197047#(<= ~counter~0 4)} assume !!(#t~post8 < 20);havoc #t~post8; {197047#(<= ~counter~0 4)} is VALID [2022-04-08 12:48:25,858 INFO L290 TraceCheckUtils]: 33: Hoare triple {197022#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {197047#(<= ~counter~0 4)} is VALID [2022-04-08 12:48:25,858 INFO L290 TraceCheckUtils]: 32: Hoare triple {197022#(<= ~counter~0 3)} assume !(~r~0 > 0); {197022#(<= ~counter~0 3)} is VALID [2022-04-08 12:48:25,859 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {196915#true} {197022#(<= ~counter~0 3)} #96#return; {197022#(<= ~counter~0 3)} is VALID [2022-04-08 12:48:25,859 INFO L290 TraceCheckUtils]: 30: Hoare triple {196915#true} assume true; {196915#true} is VALID [2022-04-08 12:48:25,859 INFO L290 TraceCheckUtils]: 29: Hoare triple {196915#true} assume !(0 == ~cond); {196915#true} is VALID [2022-04-08 12:48:25,859 INFO L290 TraceCheckUtils]: 28: Hoare triple {196915#true} ~cond := #in~cond; {196915#true} is VALID [2022-04-08 12:48:25,859 INFO L272 TraceCheckUtils]: 27: Hoare triple {197022#(<= ~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)); {196915#true} is VALID [2022-04-08 12:48:25,859 INFO L290 TraceCheckUtils]: 26: Hoare triple {197022#(<= ~counter~0 3)} assume !!(#t~post7 < 20);havoc #t~post7; {197022#(<= ~counter~0 3)} is VALID [2022-04-08 12:48:25,861 INFO L290 TraceCheckUtils]: 25: Hoare triple {196997#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {197022#(<= ~counter~0 3)} is VALID [2022-04-08 12:48:25,861 INFO L290 TraceCheckUtils]: 24: Hoare triple {196997#(<= ~counter~0 2)} assume !!(0 != ~r~0); {196997#(<= ~counter~0 2)} is VALID [2022-04-08 12:48:25,862 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {196915#true} {196997#(<= ~counter~0 2)} #94#return; {196997#(<= ~counter~0 2)} is VALID [2022-04-08 12:48:25,862 INFO L290 TraceCheckUtils]: 22: Hoare triple {196915#true} assume true; {196915#true} is VALID [2022-04-08 12:48:25,862 INFO L290 TraceCheckUtils]: 21: Hoare triple {196915#true} assume !(0 == ~cond); {196915#true} is VALID [2022-04-08 12:48:25,862 INFO L290 TraceCheckUtils]: 20: Hoare triple {196915#true} ~cond := #in~cond; {196915#true} is VALID [2022-04-08 12:48:25,862 INFO L272 TraceCheckUtils]: 19: Hoare triple {196997#(<= ~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)); {196915#true} is VALID [2022-04-08 12:48:25,862 INFO L290 TraceCheckUtils]: 18: Hoare triple {196997#(<= ~counter~0 2)} assume !!(#t~post6 < 20);havoc #t~post6; {196997#(<= ~counter~0 2)} is VALID [2022-04-08 12:48:25,864 INFO L290 TraceCheckUtils]: 17: Hoare triple {196972#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {196997#(<= ~counter~0 2)} is VALID [2022-04-08 12:48:25,864 INFO L290 TraceCheckUtils]: 16: Hoare triple {196972#(<= ~counter~0 1)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {196972#(<= ~counter~0 1)} is VALID [2022-04-08 12:48:25,865 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {196915#true} {196972#(<= ~counter~0 1)} #92#return; {196972#(<= ~counter~0 1)} is VALID [2022-04-08 12:48:25,865 INFO L290 TraceCheckUtils]: 14: Hoare triple {196915#true} assume true; {196915#true} is VALID [2022-04-08 12:48:25,865 INFO L290 TraceCheckUtils]: 13: Hoare triple {196915#true} assume !(0 == ~cond); {196915#true} is VALID [2022-04-08 12:48:25,865 INFO L290 TraceCheckUtils]: 12: Hoare triple {196915#true} ~cond := #in~cond; {196915#true} is VALID [2022-04-08 12:48:25,865 INFO L272 TraceCheckUtils]: 11: Hoare triple {196972#(<= ~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)); {196915#true} is VALID [2022-04-08 12:48:25,865 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {196915#true} {196972#(<= ~counter~0 1)} #90#return; {196972#(<= ~counter~0 1)} is VALID [2022-04-08 12:48:25,865 INFO L290 TraceCheckUtils]: 9: Hoare triple {196915#true} assume true; {196915#true} is VALID [2022-04-08 12:48:25,865 INFO L290 TraceCheckUtils]: 8: Hoare triple {196915#true} assume !(0 == ~cond); {196915#true} is VALID [2022-04-08 12:48:25,866 INFO L290 TraceCheckUtils]: 7: Hoare triple {196915#true} ~cond := #in~cond; {196915#true} is VALID [2022-04-08 12:48:25,866 INFO L272 TraceCheckUtils]: 6: Hoare triple {196972#(<= ~counter~0 1)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {196915#true} is VALID [2022-04-08 12:48:25,866 INFO L290 TraceCheckUtils]: 5: Hoare triple {196972#(<= ~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; {196972#(<= ~counter~0 1)} is VALID [2022-04-08 12:48:25,866 INFO L272 TraceCheckUtils]: 4: Hoare triple {196972#(<= ~counter~0 1)} call #t~ret9 := main(); {196972#(<= ~counter~0 1)} is VALID [2022-04-08 12:48:25,866 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {196972#(<= ~counter~0 1)} {196915#true} #102#return; {196972#(<= ~counter~0 1)} is VALID [2022-04-08 12:48:25,867 INFO L290 TraceCheckUtils]: 2: Hoare triple {196972#(<= ~counter~0 1)} assume true; {196972#(<= ~counter~0 1)} is VALID [2022-04-08 12:48:25,867 INFO L290 TraceCheckUtils]: 1: Hoare triple {196915#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; {196972#(<= ~counter~0 1)} is VALID [2022-04-08 12:48:25,867 INFO L272 TraceCheckUtils]: 0: Hoare triple {196915#true} call ULTIMATE.init(); {196915#true} is VALID [2022-04-08 12:48:25,867 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 56 proven. 212 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2022-04-08 12:48:25,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:48:25,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900998322] [2022-04-08 12:48:25,868 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:48:25,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053823844] [2022-04-08 12:48:25,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053823844] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:48:25,868 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:48:25,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 24 [2022-04-08 12:48:25,868 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:48:25,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1097879139] [2022-04-08 12:48:25,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1097879139] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:48:25,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:48:25,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-08 12:48:25,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602906040] [2022-04-08 12:48:25,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:48:25,869 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.636363636363637) internal successors, (124), 21 states have internal predecessors, (124), 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 171 [2022-04-08 12:48:25,869 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:48:25,869 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 5.636363636363637) internal successors, (124), 21 states have internal predecessors, (124), 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-08 12:48:26,132 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:48:26,132 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-08 12:48:26,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:48:26,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-08 12:48:26,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-08 12:48:26,132 INFO L87 Difference]: Start difference. First operand 946 states and 1260 transitions. Second operand has 22 states, 22 states have (on average 5.636363636363637) internal successors, (124), 21 states have internal predecessors, (124), 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-08 12:48:32,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:48:32,760 INFO L93 Difference]: Finished difference Result 1133 states and 1538 transitions. [2022-04-08 12:48:32,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-08 12:48:32,760 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.636363636363637) internal successors, (124), 21 states have internal predecessors, (124), 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 171 [2022-04-08 12:48:32,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:48:32,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 5.636363636363637) internal successors, (124), 21 states have internal predecessors, (124), 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-08 12:48:32,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 396 transitions. [2022-04-08 12:48:32,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 5.636363636363637) internal successors, (124), 21 states have internal predecessors, (124), 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-08 12:48:32,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 396 transitions. [2022-04-08 12:48:32,766 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 396 transitions. [2022-04-08 12:48:33,368 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 396 edges. 396 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:48:33,417 INFO L225 Difference]: With dead ends: 1133 [2022-04-08 12:48:33,417 INFO L226 Difference]: Without dead ends: 963 [2022-04-08 12:48:33,418 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 318 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=610, Invalid=1030, Unknown=0, NotChecked=0, Total=1640 [2022-04-08 12:48:33,418 INFO L913 BasicCegarLoop]: 84 mSDtfsCounter, 311 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 327 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 327 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-08 12:48:33,418 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [311 Valid, 393 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [327 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-08 12:48:33,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2022-04-08 12:48:37,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 963. [2022-04-08 12:48:37,168 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:48:37,169 INFO L82 GeneralOperation]: Start isEquivalent. First operand 963 states. Second operand has 963 states, 725 states have (on average 1.1710344827586208) internal successors, (849), 732 states have internal predecessors, (849), 215 states have call successors, (215), 24 states have call predecessors, (215), 22 states have return successors, (213), 206 states have call predecessors, (213), 213 states have call successors, (213) [2022-04-08 12:48:37,170 INFO L74 IsIncluded]: Start isIncluded. First operand 963 states. Second operand has 963 states, 725 states have (on average 1.1710344827586208) internal successors, (849), 732 states have internal predecessors, (849), 215 states have call successors, (215), 24 states have call predecessors, (215), 22 states have return successors, (213), 206 states have call predecessors, (213), 213 states have call successors, (213) [2022-04-08 12:48:37,171 INFO L87 Difference]: Start difference. First operand 963 states. Second operand has 963 states, 725 states have (on average 1.1710344827586208) internal successors, (849), 732 states have internal predecessors, (849), 215 states have call successors, (215), 24 states have call predecessors, (215), 22 states have return successors, (213), 206 states have call predecessors, (213), 213 states have call successors, (213) [2022-04-08 12:48:37,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:48:37,198 INFO L93 Difference]: Finished difference Result 963 states and 1277 transitions. [2022-04-08 12:48:37,198 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1277 transitions. [2022-04-08 12:48:37,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:48:37,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:48:37,199 INFO L74 IsIncluded]: Start isIncluded. First operand has 963 states, 725 states have (on average 1.1710344827586208) internal successors, (849), 732 states have internal predecessors, (849), 215 states have call successors, (215), 24 states have call predecessors, (215), 22 states have return successors, (213), 206 states have call predecessors, (213), 213 states have call successors, (213) Second operand 963 states. [2022-04-08 12:48:37,200 INFO L87 Difference]: Start difference. First operand has 963 states, 725 states have (on average 1.1710344827586208) internal successors, (849), 732 states have internal predecessors, (849), 215 states have call successors, (215), 24 states have call predecessors, (215), 22 states have return successors, (213), 206 states have call predecessors, (213), 213 states have call successors, (213) Second operand 963 states. [2022-04-08 12:48:37,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:48:37,227 INFO L93 Difference]: Finished difference Result 963 states and 1277 transitions. [2022-04-08 12:48:37,227 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1277 transitions. [2022-04-08 12:48:37,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:48:37,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:48:37,228 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:48:37,228 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:48:37,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 963 states, 725 states have (on average 1.1710344827586208) internal successors, (849), 732 states have internal predecessors, (849), 215 states have call successors, (215), 24 states have call predecessors, (215), 22 states have return successors, (213), 206 states have call predecessors, (213), 213 states have call successors, (213) [2022-04-08 12:48:37,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1277 transitions. [2022-04-08 12:48:37,266 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1277 transitions. Word has length 171 [2022-04-08 12:48:37,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:48:37,266 INFO L478 AbstractCegarLoop]: Abstraction has 963 states and 1277 transitions. [2022-04-08 12:48:37,267 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.636363636363637) internal successors, (124), 21 states have internal predecessors, (124), 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-08 12:48:37,267 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 963 states and 1277 transitions. [2022-04-08 12:48:49,568 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1277 edges. 1277 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:48:49,568 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1277 transitions. [2022-04-08 12:48:49,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-04-08 12:48:49,569 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:48:49,570 INFO L499 BasicCegarLoop]: trace histogram [20, 19, 19, 10, 10, 10, 10, 7, 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-08 12:48:49,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Forceful destruction successful, exit code 0 [2022-04-08 12:48:49,770 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59,61 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:48:49,770 INFO L403 AbstractCegarLoop]: === Iteration 61 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:48:49,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:48:49,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1863737586, now seen corresponding path program 21 times [2022-04-08 12:48:49,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:48:49,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [81839394] [2022-04-08 12:48:49,771 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:48:49,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1863737586, now seen corresponding path program 22 times [2022-04-08 12:48:49,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:48:49,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586188187] [2022-04-08 12:48:49,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:48:49,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:48:49,800 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:48:49,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1844878578] [2022-04-08 12:48:49,800 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 12:48:49,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:48:49,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:48:49,807 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:48:49,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2022-04-08 12:48:49,876 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 12:48:49,876 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:48:49,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-08 12:48:49,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:48:49,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:48:50,795 INFO L272 TraceCheckUtils]: 0: Hoare triple {204116#true} call ULTIMATE.init(); {204116#true} is VALID [2022-04-08 12:48:50,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {204116#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; {204124#(<= ~counter~0 0)} is VALID [2022-04-08 12:48:50,796 INFO L290 TraceCheckUtils]: 2: Hoare triple {204124#(<= ~counter~0 0)} assume true; {204124#(<= ~counter~0 0)} is VALID [2022-04-08 12:48:50,796 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {204124#(<= ~counter~0 0)} {204116#true} #102#return; {204124#(<= ~counter~0 0)} is VALID [2022-04-08 12:48:50,796 INFO L272 TraceCheckUtils]: 4: Hoare triple {204124#(<= ~counter~0 0)} call #t~ret9 := main(); {204124#(<= ~counter~0 0)} is VALID [2022-04-08 12:48:50,796 INFO L290 TraceCheckUtils]: 5: Hoare triple {204124#(<= ~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; {204124#(<= ~counter~0 0)} is VALID [2022-04-08 12:48:50,797 INFO L272 TraceCheckUtils]: 6: Hoare triple {204124#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {204124#(<= ~counter~0 0)} is VALID [2022-04-08 12:48:50,797 INFO L290 TraceCheckUtils]: 7: Hoare triple {204124#(<= ~counter~0 0)} ~cond := #in~cond; {204124#(<= ~counter~0 0)} is VALID [2022-04-08 12:48:50,797 INFO L290 TraceCheckUtils]: 8: Hoare triple {204124#(<= ~counter~0 0)} assume !(0 == ~cond); {204124#(<= ~counter~0 0)} is VALID [2022-04-08 12:48:50,798 INFO L290 TraceCheckUtils]: 9: Hoare triple {204124#(<= ~counter~0 0)} assume true; {204124#(<= ~counter~0 0)} is VALID [2022-04-08 12:48:50,798 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {204124#(<= ~counter~0 0)} {204124#(<= ~counter~0 0)} #90#return; {204124#(<= ~counter~0 0)} is VALID [2022-04-08 12:48:50,798 INFO L272 TraceCheckUtils]: 11: Hoare triple {204124#(<= ~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)); {204124#(<= ~counter~0 0)} is VALID [2022-04-08 12:48:50,799 INFO L290 TraceCheckUtils]: 12: Hoare triple {204124#(<= ~counter~0 0)} ~cond := #in~cond; {204124#(<= ~counter~0 0)} is VALID [2022-04-08 12:48:50,799 INFO L290 TraceCheckUtils]: 13: Hoare triple {204124#(<= ~counter~0 0)} assume !(0 == ~cond); {204124#(<= ~counter~0 0)} is VALID [2022-04-08 12:48:50,799 INFO L290 TraceCheckUtils]: 14: Hoare triple {204124#(<= ~counter~0 0)} assume true; {204124#(<= ~counter~0 0)} is VALID [2022-04-08 12:48:50,800 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {204124#(<= ~counter~0 0)} {204124#(<= ~counter~0 0)} #92#return; {204124#(<= ~counter~0 0)} is VALID [2022-04-08 12:48:50,800 INFO L290 TraceCheckUtils]: 16: Hoare triple {204124#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {204124#(<= ~counter~0 0)} is VALID [2022-04-08 12:48:50,805 INFO L290 TraceCheckUtils]: 17: Hoare triple {204124#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {204173#(<= ~counter~0 1)} is VALID [2022-04-08 12:48:50,806 INFO L290 TraceCheckUtils]: 18: Hoare triple {204173#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {204173#(<= ~counter~0 1)} is VALID [2022-04-08 12:48:50,806 INFO L272 TraceCheckUtils]: 19: Hoare triple {204173#(<= ~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)); {204173#(<= ~counter~0 1)} is VALID [2022-04-08 12:48:50,807 INFO L290 TraceCheckUtils]: 20: Hoare triple {204173#(<= ~counter~0 1)} ~cond := #in~cond; {204173#(<= ~counter~0 1)} is VALID [2022-04-08 12:48:50,807 INFO L290 TraceCheckUtils]: 21: Hoare triple {204173#(<= ~counter~0 1)} assume !(0 == ~cond); {204173#(<= ~counter~0 1)} is VALID [2022-04-08 12:48:50,807 INFO L290 TraceCheckUtils]: 22: Hoare triple {204173#(<= ~counter~0 1)} assume true; {204173#(<= ~counter~0 1)} is VALID [2022-04-08 12:48:50,809 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {204173#(<= ~counter~0 1)} {204173#(<= ~counter~0 1)} #94#return; {204173#(<= ~counter~0 1)} is VALID [2022-04-08 12:48:50,809 INFO L290 TraceCheckUtils]: 24: Hoare triple {204173#(<= ~counter~0 1)} assume !!(0 != ~r~0); {204173#(<= ~counter~0 1)} is VALID [2022-04-08 12:48:50,811 INFO L290 TraceCheckUtils]: 25: Hoare triple {204173#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {204198#(<= ~counter~0 2)} is VALID [2022-04-08 12:48:50,811 INFO L290 TraceCheckUtils]: 26: Hoare triple {204198#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {204198#(<= ~counter~0 2)} is VALID [2022-04-08 12:48:50,811 INFO L272 TraceCheckUtils]: 27: Hoare triple {204198#(<= ~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)); {204198#(<= ~counter~0 2)} is VALID [2022-04-08 12:48:50,812 INFO L290 TraceCheckUtils]: 28: Hoare triple {204198#(<= ~counter~0 2)} ~cond := #in~cond; {204198#(<= ~counter~0 2)} is VALID [2022-04-08 12:48:50,812 INFO L290 TraceCheckUtils]: 29: Hoare triple {204198#(<= ~counter~0 2)} assume !(0 == ~cond); {204198#(<= ~counter~0 2)} is VALID [2022-04-08 12:48:50,812 INFO L290 TraceCheckUtils]: 30: Hoare triple {204198#(<= ~counter~0 2)} assume true; {204198#(<= ~counter~0 2)} is VALID [2022-04-08 12:48:50,813 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {204198#(<= ~counter~0 2)} {204198#(<= ~counter~0 2)} #96#return; {204198#(<= ~counter~0 2)} is VALID [2022-04-08 12:48:50,813 INFO L290 TraceCheckUtils]: 32: Hoare triple {204198#(<= ~counter~0 2)} assume !(~r~0 > 0); {204198#(<= ~counter~0 2)} is VALID [2022-04-08 12:48:50,815 INFO L290 TraceCheckUtils]: 33: Hoare triple {204198#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {204223#(<= ~counter~0 3)} is VALID [2022-04-08 12:48:50,815 INFO L290 TraceCheckUtils]: 34: Hoare triple {204223#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {204223#(<= ~counter~0 3)} is VALID [2022-04-08 12:48:50,816 INFO L272 TraceCheckUtils]: 35: Hoare triple {204223#(<= ~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)); {204223#(<= ~counter~0 3)} is VALID [2022-04-08 12:48:50,816 INFO L290 TraceCheckUtils]: 36: Hoare triple {204223#(<= ~counter~0 3)} ~cond := #in~cond; {204223#(<= ~counter~0 3)} is VALID [2022-04-08 12:48:50,816 INFO L290 TraceCheckUtils]: 37: Hoare triple {204223#(<= ~counter~0 3)} assume !(0 == ~cond); {204223#(<= ~counter~0 3)} is VALID [2022-04-08 12:48:50,817 INFO L290 TraceCheckUtils]: 38: Hoare triple {204223#(<= ~counter~0 3)} assume true; {204223#(<= ~counter~0 3)} is VALID [2022-04-08 12:48:50,817 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {204223#(<= ~counter~0 3)} {204223#(<= ~counter~0 3)} #98#return; {204223#(<= ~counter~0 3)} is VALID [2022-04-08 12:48:50,817 INFO L290 TraceCheckUtils]: 40: Hoare triple {204223#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {204223#(<= ~counter~0 3)} is VALID [2022-04-08 12:48:50,821 INFO L290 TraceCheckUtils]: 41: Hoare triple {204223#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {204248#(<= ~counter~0 4)} is VALID [2022-04-08 12:48:50,822 INFO L290 TraceCheckUtils]: 42: Hoare triple {204248#(<= ~counter~0 4)} assume !!(#t~post8 < 20);havoc #t~post8; {204248#(<= ~counter~0 4)} is VALID [2022-04-08 12:48:50,822 INFO L272 TraceCheckUtils]: 43: Hoare triple {204248#(<= ~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)); {204248#(<= ~counter~0 4)} is VALID [2022-04-08 12:48:50,823 INFO L290 TraceCheckUtils]: 44: Hoare triple {204248#(<= ~counter~0 4)} ~cond := #in~cond; {204248#(<= ~counter~0 4)} is VALID [2022-04-08 12:48:50,823 INFO L290 TraceCheckUtils]: 45: Hoare triple {204248#(<= ~counter~0 4)} assume !(0 == ~cond); {204248#(<= ~counter~0 4)} is VALID [2022-04-08 12:48:50,823 INFO L290 TraceCheckUtils]: 46: Hoare triple {204248#(<= ~counter~0 4)} assume true; {204248#(<= ~counter~0 4)} is VALID [2022-04-08 12:48:50,824 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {204248#(<= ~counter~0 4)} {204248#(<= ~counter~0 4)} #98#return; {204248#(<= ~counter~0 4)} is VALID [2022-04-08 12:48:50,824 INFO L290 TraceCheckUtils]: 48: Hoare triple {204248#(<= ~counter~0 4)} assume !(~r~0 < 0); {204248#(<= ~counter~0 4)} is VALID [2022-04-08 12:48:50,826 INFO L290 TraceCheckUtils]: 49: Hoare triple {204248#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {204273#(<= ~counter~0 5)} is VALID [2022-04-08 12:48:50,826 INFO L290 TraceCheckUtils]: 50: Hoare triple {204273#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {204273#(<= ~counter~0 5)} is VALID [2022-04-08 12:48:50,827 INFO L272 TraceCheckUtils]: 51: Hoare triple {204273#(<= ~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)); {204273#(<= ~counter~0 5)} is VALID [2022-04-08 12:48:50,827 INFO L290 TraceCheckUtils]: 52: Hoare triple {204273#(<= ~counter~0 5)} ~cond := #in~cond; {204273#(<= ~counter~0 5)} is VALID [2022-04-08 12:48:50,827 INFO L290 TraceCheckUtils]: 53: Hoare triple {204273#(<= ~counter~0 5)} assume !(0 == ~cond); {204273#(<= ~counter~0 5)} is VALID [2022-04-08 12:48:50,828 INFO L290 TraceCheckUtils]: 54: Hoare triple {204273#(<= ~counter~0 5)} assume true; {204273#(<= ~counter~0 5)} is VALID [2022-04-08 12:48:50,828 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {204273#(<= ~counter~0 5)} {204273#(<= ~counter~0 5)} #94#return; {204273#(<= ~counter~0 5)} is VALID [2022-04-08 12:48:50,828 INFO L290 TraceCheckUtils]: 56: Hoare triple {204273#(<= ~counter~0 5)} assume !!(0 != ~r~0); {204273#(<= ~counter~0 5)} is VALID [2022-04-08 12:48:50,830 INFO L290 TraceCheckUtils]: 57: Hoare triple {204273#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {204298#(<= ~counter~0 6)} is VALID [2022-04-08 12:48:50,830 INFO L290 TraceCheckUtils]: 58: Hoare triple {204298#(<= ~counter~0 6)} assume !!(#t~post7 < 20);havoc #t~post7; {204298#(<= ~counter~0 6)} is VALID [2022-04-08 12:48:50,831 INFO L272 TraceCheckUtils]: 59: Hoare triple {204298#(<= ~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)); {204298#(<= ~counter~0 6)} is VALID [2022-04-08 12:48:50,831 INFO L290 TraceCheckUtils]: 60: Hoare triple {204298#(<= ~counter~0 6)} ~cond := #in~cond; {204298#(<= ~counter~0 6)} is VALID [2022-04-08 12:48:50,831 INFO L290 TraceCheckUtils]: 61: Hoare triple {204298#(<= ~counter~0 6)} assume !(0 == ~cond); {204298#(<= ~counter~0 6)} is VALID [2022-04-08 12:48:50,831 INFO L290 TraceCheckUtils]: 62: Hoare triple {204298#(<= ~counter~0 6)} assume true; {204298#(<= ~counter~0 6)} is VALID [2022-04-08 12:48:50,832 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {204298#(<= ~counter~0 6)} {204298#(<= ~counter~0 6)} #96#return; {204298#(<= ~counter~0 6)} is VALID [2022-04-08 12:48:50,832 INFO L290 TraceCheckUtils]: 64: Hoare triple {204298#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {204298#(<= ~counter~0 6)} is VALID [2022-04-08 12:48:50,835 INFO L290 TraceCheckUtils]: 65: Hoare triple {204298#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {204323#(<= ~counter~0 7)} is VALID [2022-04-08 12:48:50,835 INFO L290 TraceCheckUtils]: 66: Hoare triple {204323#(<= ~counter~0 7)} assume !!(#t~post7 < 20);havoc #t~post7; {204323#(<= ~counter~0 7)} is VALID [2022-04-08 12:48:50,836 INFO L272 TraceCheckUtils]: 67: Hoare triple {204323#(<= ~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)); {204323#(<= ~counter~0 7)} is VALID [2022-04-08 12:48:50,836 INFO L290 TraceCheckUtils]: 68: Hoare triple {204323#(<= ~counter~0 7)} ~cond := #in~cond; {204323#(<= ~counter~0 7)} is VALID [2022-04-08 12:48:50,836 INFO L290 TraceCheckUtils]: 69: Hoare triple {204323#(<= ~counter~0 7)} assume !(0 == ~cond); {204323#(<= ~counter~0 7)} is VALID [2022-04-08 12:48:50,836 INFO L290 TraceCheckUtils]: 70: Hoare triple {204323#(<= ~counter~0 7)} assume true; {204323#(<= ~counter~0 7)} is VALID [2022-04-08 12:48:50,837 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {204323#(<= ~counter~0 7)} {204323#(<= ~counter~0 7)} #96#return; {204323#(<= ~counter~0 7)} is VALID [2022-04-08 12:48:50,837 INFO L290 TraceCheckUtils]: 72: Hoare triple {204323#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {204323#(<= ~counter~0 7)} is VALID [2022-04-08 12:48:50,841 INFO L290 TraceCheckUtils]: 73: Hoare triple {204323#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {204348#(<= ~counter~0 8)} is VALID [2022-04-08 12:48:50,841 INFO L290 TraceCheckUtils]: 74: Hoare triple {204348#(<= ~counter~0 8)} assume !!(#t~post7 < 20);havoc #t~post7; {204348#(<= ~counter~0 8)} is VALID [2022-04-08 12:48:50,841 INFO L272 TraceCheckUtils]: 75: Hoare triple {204348#(<= ~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)); {204348#(<= ~counter~0 8)} is VALID [2022-04-08 12:48:50,842 INFO L290 TraceCheckUtils]: 76: Hoare triple {204348#(<= ~counter~0 8)} ~cond := #in~cond; {204348#(<= ~counter~0 8)} is VALID [2022-04-08 12:48:50,842 INFO L290 TraceCheckUtils]: 77: Hoare triple {204348#(<= ~counter~0 8)} assume !(0 == ~cond); {204348#(<= ~counter~0 8)} is VALID [2022-04-08 12:48:50,842 INFO L290 TraceCheckUtils]: 78: Hoare triple {204348#(<= ~counter~0 8)} assume true; {204348#(<= ~counter~0 8)} is VALID [2022-04-08 12:48:50,843 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {204348#(<= ~counter~0 8)} {204348#(<= ~counter~0 8)} #96#return; {204348#(<= ~counter~0 8)} is VALID [2022-04-08 12:48:50,843 INFO L290 TraceCheckUtils]: 80: Hoare triple {204348#(<= ~counter~0 8)} assume !(~r~0 > 0); {204348#(<= ~counter~0 8)} is VALID [2022-04-08 12:48:50,845 INFO L290 TraceCheckUtils]: 81: Hoare triple {204348#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {204373#(<= ~counter~0 9)} is VALID [2022-04-08 12:48:50,845 INFO L290 TraceCheckUtils]: 82: Hoare triple {204373#(<= ~counter~0 9)} assume !!(#t~post8 < 20);havoc #t~post8; {204373#(<= ~counter~0 9)} is VALID [2022-04-08 12:48:50,846 INFO L272 TraceCheckUtils]: 83: Hoare triple {204373#(<= ~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)); {204373#(<= ~counter~0 9)} is VALID [2022-04-08 12:48:50,846 INFO L290 TraceCheckUtils]: 84: Hoare triple {204373#(<= ~counter~0 9)} ~cond := #in~cond; {204373#(<= ~counter~0 9)} is VALID [2022-04-08 12:48:50,846 INFO L290 TraceCheckUtils]: 85: Hoare triple {204373#(<= ~counter~0 9)} assume !(0 == ~cond); {204373#(<= ~counter~0 9)} is VALID [2022-04-08 12:48:50,846 INFO L290 TraceCheckUtils]: 86: Hoare triple {204373#(<= ~counter~0 9)} assume true; {204373#(<= ~counter~0 9)} is VALID [2022-04-08 12:48:50,847 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {204373#(<= ~counter~0 9)} {204373#(<= ~counter~0 9)} #98#return; {204373#(<= ~counter~0 9)} is VALID [2022-04-08 12:48:50,847 INFO L290 TraceCheckUtils]: 88: Hoare triple {204373#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {204373#(<= ~counter~0 9)} is VALID [2022-04-08 12:48:50,849 INFO L290 TraceCheckUtils]: 89: Hoare triple {204373#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {204398#(<= ~counter~0 10)} is VALID [2022-04-08 12:48:50,849 INFO L290 TraceCheckUtils]: 90: Hoare triple {204398#(<= ~counter~0 10)} assume !!(#t~post8 < 20);havoc #t~post8; {204398#(<= ~counter~0 10)} is VALID [2022-04-08 12:48:50,850 INFO L272 TraceCheckUtils]: 91: Hoare triple {204398#(<= ~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)); {204398#(<= ~counter~0 10)} is VALID [2022-04-08 12:48:50,850 INFO L290 TraceCheckUtils]: 92: Hoare triple {204398#(<= ~counter~0 10)} ~cond := #in~cond; {204398#(<= ~counter~0 10)} is VALID [2022-04-08 12:48:50,850 INFO L290 TraceCheckUtils]: 93: Hoare triple {204398#(<= ~counter~0 10)} assume !(0 == ~cond); {204398#(<= ~counter~0 10)} is VALID [2022-04-08 12:48:50,851 INFO L290 TraceCheckUtils]: 94: Hoare triple {204398#(<= ~counter~0 10)} assume true; {204398#(<= ~counter~0 10)} is VALID [2022-04-08 12:48:50,851 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {204398#(<= ~counter~0 10)} {204398#(<= ~counter~0 10)} #98#return; {204398#(<= ~counter~0 10)} is VALID [2022-04-08 12:48:50,851 INFO L290 TraceCheckUtils]: 96: Hoare triple {204398#(<= ~counter~0 10)} assume !(~r~0 < 0); {204398#(<= ~counter~0 10)} is VALID [2022-04-08 12:48:50,854 INFO L290 TraceCheckUtils]: 97: Hoare triple {204398#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {204423#(<= ~counter~0 11)} is VALID [2022-04-08 12:48:50,855 INFO L290 TraceCheckUtils]: 98: Hoare triple {204423#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {204423#(<= ~counter~0 11)} is VALID [2022-04-08 12:48:50,855 INFO L272 TraceCheckUtils]: 99: Hoare triple {204423#(<= ~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)); {204423#(<= ~counter~0 11)} is VALID [2022-04-08 12:48:50,856 INFO L290 TraceCheckUtils]: 100: Hoare triple {204423#(<= ~counter~0 11)} ~cond := #in~cond; {204423#(<= ~counter~0 11)} is VALID [2022-04-08 12:48:50,856 INFO L290 TraceCheckUtils]: 101: Hoare triple {204423#(<= ~counter~0 11)} assume !(0 == ~cond); {204423#(<= ~counter~0 11)} is VALID [2022-04-08 12:48:50,856 INFO L290 TraceCheckUtils]: 102: Hoare triple {204423#(<= ~counter~0 11)} assume true; {204423#(<= ~counter~0 11)} is VALID [2022-04-08 12:48:50,857 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {204423#(<= ~counter~0 11)} {204423#(<= ~counter~0 11)} #94#return; {204423#(<= ~counter~0 11)} is VALID [2022-04-08 12:48:50,857 INFO L290 TraceCheckUtils]: 104: Hoare triple {204423#(<= ~counter~0 11)} assume !!(0 != ~r~0); {204423#(<= ~counter~0 11)} is VALID [2022-04-08 12:48:50,860 INFO L290 TraceCheckUtils]: 105: Hoare triple {204423#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {204448#(<= ~counter~0 12)} is VALID [2022-04-08 12:48:50,860 INFO L290 TraceCheckUtils]: 106: Hoare triple {204448#(<= ~counter~0 12)} assume !!(#t~post7 < 20);havoc #t~post7; {204448#(<= ~counter~0 12)} is VALID [2022-04-08 12:48:50,861 INFO L272 TraceCheckUtils]: 107: Hoare triple {204448#(<= ~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)); {204448#(<= ~counter~0 12)} is VALID [2022-04-08 12:48:50,861 INFO L290 TraceCheckUtils]: 108: Hoare triple {204448#(<= ~counter~0 12)} ~cond := #in~cond; {204448#(<= ~counter~0 12)} is VALID [2022-04-08 12:48:50,861 INFO L290 TraceCheckUtils]: 109: Hoare triple {204448#(<= ~counter~0 12)} assume !(0 == ~cond); {204448#(<= ~counter~0 12)} is VALID [2022-04-08 12:48:50,861 INFO L290 TraceCheckUtils]: 110: Hoare triple {204448#(<= ~counter~0 12)} assume true; {204448#(<= ~counter~0 12)} is VALID [2022-04-08 12:48:50,862 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {204448#(<= ~counter~0 12)} {204448#(<= ~counter~0 12)} #96#return; {204448#(<= ~counter~0 12)} is VALID [2022-04-08 12:48:50,862 INFO L290 TraceCheckUtils]: 112: Hoare triple {204448#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {204448#(<= ~counter~0 12)} is VALID [2022-04-08 12:48:50,864 INFO L290 TraceCheckUtils]: 113: Hoare triple {204448#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {204473#(<= ~counter~0 13)} is VALID [2022-04-08 12:48:50,864 INFO L290 TraceCheckUtils]: 114: Hoare triple {204473#(<= ~counter~0 13)} assume !!(#t~post7 < 20);havoc #t~post7; {204473#(<= ~counter~0 13)} is VALID [2022-04-08 12:48:50,865 INFO L272 TraceCheckUtils]: 115: Hoare triple {204473#(<= ~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)); {204473#(<= ~counter~0 13)} is VALID [2022-04-08 12:48:50,865 INFO L290 TraceCheckUtils]: 116: Hoare triple {204473#(<= ~counter~0 13)} ~cond := #in~cond; {204473#(<= ~counter~0 13)} is VALID [2022-04-08 12:48:50,865 INFO L290 TraceCheckUtils]: 117: Hoare triple {204473#(<= ~counter~0 13)} assume !(0 == ~cond); {204473#(<= ~counter~0 13)} is VALID [2022-04-08 12:48:50,865 INFO L290 TraceCheckUtils]: 118: Hoare triple {204473#(<= ~counter~0 13)} assume true; {204473#(<= ~counter~0 13)} is VALID [2022-04-08 12:48:50,866 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {204473#(<= ~counter~0 13)} {204473#(<= ~counter~0 13)} #96#return; {204473#(<= ~counter~0 13)} is VALID [2022-04-08 12:48:50,866 INFO L290 TraceCheckUtils]: 120: Hoare triple {204473#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {204473#(<= ~counter~0 13)} is VALID [2022-04-08 12:48:50,868 INFO L290 TraceCheckUtils]: 121: Hoare triple {204473#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {204498#(<= ~counter~0 14)} is VALID [2022-04-08 12:48:50,868 INFO L290 TraceCheckUtils]: 122: Hoare triple {204498#(<= ~counter~0 14)} assume !!(#t~post7 < 20);havoc #t~post7; {204498#(<= ~counter~0 14)} is VALID [2022-04-08 12:48:50,869 INFO L272 TraceCheckUtils]: 123: Hoare triple {204498#(<= ~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)); {204498#(<= ~counter~0 14)} is VALID [2022-04-08 12:48:50,869 INFO L290 TraceCheckUtils]: 124: Hoare triple {204498#(<= ~counter~0 14)} ~cond := #in~cond; {204498#(<= ~counter~0 14)} is VALID [2022-04-08 12:48:50,869 INFO L290 TraceCheckUtils]: 125: Hoare triple {204498#(<= ~counter~0 14)} assume !(0 == ~cond); {204498#(<= ~counter~0 14)} is VALID [2022-04-08 12:48:50,870 INFO L290 TraceCheckUtils]: 126: Hoare triple {204498#(<= ~counter~0 14)} assume true; {204498#(<= ~counter~0 14)} is VALID [2022-04-08 12:48:50,870 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {204498#(<= ~counter~0 14)} {204498#(<= ~counter~0 14)} #96#return; {204498#(<= ~counter~0 14)} is VALID [2022-04-08 12:48:50,870 INFO L290 TraceCheckUtils]: 128: Hoare triple {204498#(<= ~counter~0 14)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {204498#(<= ~counter~0 14)} is VALID [2022-04-08 12:48:50,873 INFO L290 TraceCheckUtils]: 129: Hoare triple {204498#(<= ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {204523#(<= ~counter~0 15)} is VALID [2022-04-08 12:48:50,873 INFO L290 TraceCheckUtils]: 130: Hoare triple {204523#(<= ~counter~0 15)} assume !!(#t~post7 < 20);havoc #t~post7; {204523#(<= ~counter~0 15)} is VALID [2022-04-08 12:48:50,874 INFO L272 TraceCheckUtils]: 131: Hoare triple {204523#(<= ~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)); {204523#(<= ~counter~0 15)} is VALID [2022-04-08 12:48:50,874 INFO L290 TraceCheckUtils]: 132: Hoare triple {204523#(<= ~counter~0 15)} ~cond := #in~cond; {204523#(<= ~counter~0 15)} is VALID [2022-04-08 12:48:50,874 INFO L290 TraceCheckUtils]: 133: Hoare triple {204523#(<= ~counter~0 15)} assume !(0 == ~cond); {204523#(<= ~counter~0 15)} is VALID [2022-04-08 12:48:50,874 INFO L290 TraceCheckUtils]: 134: Hoare triple {204523#(<= ~counter~0 15)} assume true; {204523#(<= ~counter~0 15)} is VALID [2022-04-08 12:48:50,875 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {204523#(<= ~counter~0 15)} {204523#(<= ~counter~0 15)} #96#return; {204523#(<= ~counter~0 15)} is VALID [2022-04-08 12:48:50,875 INFO L290 TraceCheckUtils]: 136: Hoare triple {204523#(<= ~counter~0 15)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {204523#(<= ~counter~0 15)} is VALID [2022-04-08 12:48:50,877 INFO L290 TraceCheckUtils]: 137: Hoare triple {204523#(<= ~counter~0 15)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {204548#(<= ~counter~0 16)} is VALID [2022-04-08 12:48:50,878 INFO L290 TraceCheckUtils]: 138: Hoare triple {204548#(<= ~counter~0 16)} assume !!(#t~post7 < 20);havoc #t~post7; {204548#(<= ~counter~0 16)} is VALID [2022-04-08 12:48:50,878 INFO L272 TraceCheckUtils]: 139: Hoare triple {204548#(<= ~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)); {204548#(<= ~counter~0 16)} is VALID [2022-04-08 12:48:50,878 INFO L290 TraceCheckUtils]: 140: Hoare triple {204548#(<= ~counter~0 16)} ~cond := #in~cond; {204548#(<= ~counter~0 16)} is VALID [2022-04-08 12:48:50,879 INFO L290 TraceCheckUtils]: 141: Hoare triple {204548#(<= ~counter~0 16)} assume !(0 == ~cond); {204548#(<= ~counter~0 16)} is VALID [2022-04-08 12:48:50,879 INFO L290 TraceCheckUtils]: 142: Hoare triple {204548#(<= ~counter~0 16)} assume true; {204548#(<= ~counter~0 16)} is VALID [2022-04-08 12:48:50,879 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {204548#(<= ~counter~0 16)} {204548#(<= ~counter~0 16)} #96#return; {204548#(<= ~counter~0 16)} is VALID [2022-04-08 12:48:50,880 INFO L290 TraceCheckUtils]: 144: Hoare triple {204548#(<= ~counter~0 16)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {204548#(<= ~counter~0 16)} is VALID [2022-04-08 12:48:50,881 INFO L290 TraceCheckUtils]: 145: Hoare triple {204548#(<= ~counter~0 16)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {204573#(<= ~counter~0 17)} is VALID [2022-04-08 12:48:50,882 INFO L290 TraceCheckUtils]: 146: Hoare triple {204573#(<= ~counter~0 17)} assume !!(#t~post7 < 20);havoc #t~post7; {204573#(<= ~counter~0 17)} is VALID [2022-04-08 12:48:50,882 INFO L272 TraceCheckUtils]: 147: Hoare triple {204573#(<= ~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)); {204573#(<= ~counter~0 17)} is VALID [2022-04-08 12:48:50,882 INFO L290 TraceCheckUtils]: 148: Hoare triple {204573#(<= ~counter~0 17)} ~cond := #in~cond; {204573#(<= ~counter~0 17)} is VALID [2022-04-08 12:48:50,883 INFO L290 TraceCheckUtils]: 149: Hoare triple {204573#(<= ~counter~0 17)} assume !(0 == ~cond); {204573#(<= ~counter~0 17)} is VALID [2022-04-08 12:48:50,883 INFO L290 TraceCheckUtils]: 150: Hoare triple {204573#(<= ~counter~0 17)} assume true; {204573#(<= ~counter~0 17)} is VALID [2022-04-08 12:48:50,883 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {204573#(<= ~counter~0 17)} {204573#(<= ~counter~0 17)} #96#return; {204573#(<= ~counter~0 17)} is VALID [2022-04-08 12:48:50,884 INFO L290 TraceCheckUtils]: 152: Hoare triple {204573#(<= ~counter~0 17)} assume !(~r~0 > 0); {204573#(<= ~counter~0 17)} is VALID [2022-04-08 12:48:50,885 INFO L290 TraceCheckUtils]: 153: Hoare triple {204573#(<= ~counter~0 17)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {204598#(<= ~counter~0 18)} is VALID [2022-04-08 12:48:50,885 INFO L290 TraceCheckUtils]: 154: Hoare triple {204598#(<= ~counter~0 18)} assume !!(#t~post8 < 20);havoc #t~post8; {204598#(<= ~counter~0 18)} is VALID [2022-04-08 12:48:50,886 INFO L272 TraceCheckUtils]: 155: Hoare triple {204598#(<= ~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)); {204598#(<= ~counter~0 18)} is VALID [2022-04-08 12:48:50,886 INFO L290 TraceCheckUtils]: 156: Hoare triple {204598#(<= ~counter~0 18)} ~cond := #in~cond; {204598#(<= ~counter~0 18)} is VALID [2022-04-08 12:48:50,886 INFO L290 TraceCheckUtils]: 157: Hoare triple {204598#(<= ~counter~0 18)} assume !(0 == ~cond); {204598#(<= ~counter~0 18)} is VALID [2022-04-08 12:48:50,887 INFO L290 TraceCheckUtils]: 158: Hoare triple {204598#(<= ~counter~0 18)} assume true; {204598#(<= ~counter~0 18)} is VALID [2022-04-08 12:48:50,887 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {204598#(<= ~counter~0 18)} {204598#(<= ~counter~0 18)} #98#return; {204598#(<= ~counter~0 18)} is VALID [2022-04-08 12:48:50,887 INFO L290 TraceCheckUtils]: 160: Hoare triple {204598#(<= ~counter~0 18)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {204598#(<= ~counter~0 18)} is VALID [2022-04-08 12:48:50,889 INFO L290 TraceCheckUtils]: 161: Hoare triple {204598#(<= ~counter~0 18)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {204623#(<= ~counter~0 19)} is VALID [2022-04-08 12:48:50,889 INFO L290 TraceCheckUtils]: 162: Hoare triple {204623#(<= ~counter~0 19)} assume !!(#t~post8 < 20);havoc #t~post8; {204623#(<= ~counter~0 19)} is VALID [2022-04-08 12:48:50,890 INFO L272 TraceCheckUtils]: 163: Hoare triple {204623#(<= ~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)); {204623#(<= ~counter~0 19)} is VALID [2022-04-08 12:48:50,890 INFO L290 TraceCheckUtils]: 164: Hoare triple {204623#(<= ~counter~0 19)} ~cond := #in~cond; {204623#(<= ~counter~0 19)} is VALID [2022-04-08 12:48:50,890 INFO L290 TraceCheckUtils]: 165: Hoare triple {204623#(<= ~counter~0 19)} assume !(0 == ~cond); {204623#(<= ~counter~0 19)} is VALID [2022-04-08 12:48:50,890 INFO L290 TraceCheckUtils]: 166: Hoare triple {204623#(<= ~counter~0 19)} assume true; {204623#(<= ~counter~0 19)} is VALID [2022-04-08 12:48:50,891 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {204623#(<= ~counter~0 19)} {204623#(<= ~counter~0 19)} #98#return; {204623#(<= ~counter~0 19)} is VALID [2022-04-08 12:48:50,891 INFO L290 TraceCheckUtils]: 168: Hoare triple {204623#(<= ~counter~0 19)} assume !(~r~0 < 0); {204623#(<= ~counter~0 19)} is VALID [2022-04-08 12:48:50,891 INFO L290 TraceCheckUtils]: 169: Hoare triple {204623#(<= ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {204648#(<= |main_#t~post6| 19)} is VALID [2022-04-08 12:48:50,892 INFO L290 TraceCheckUtils]: 170: Hoare triple {204648#(<= |main_#t~post6| 19)} assume !(#t~post6 < 20);havoc #t~post6; {204117#false} is VALID [2022-04-08 12:48:50,892 INFO L272 TraceCheckUtils]: 171: Hoare triple {204117#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)); {204117#false} is VALID [2022-04-08 12:48:50,892 INFO L290 TraceCheckUtils]: 172: Hoare triple {204117#false} ~cond := #in~cond; {204117#false} is VALID [2022-04-08 12:48:50,892 INFO L290 TraceCheckUtils]: 173: Hoare triple {204117#false} assume 0 == ~cond; {204117#false} is VALID [2022-04-08 12:48:50,892 INFO L290 TraceCheckUtils]: 174: Hoare triple {204117#false} assume !false; {204117#false} is VALID [2022-04-08 12:48:50,892 INFO L134 CoverageAnalysis]: Checked inductivity of 984 backedges. 38 proven. 942 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 12:48:50,893 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:48:51,600 INFO L290 TraceCheckUtils]: 174: Hoare triple {204117#false} assume !false; {204117#false} is VALID [2022-04-08 12:48:51,601 INFO L290 TraceCheckUtils]: 173: Hoare triple {204117#false} assume 0 == ~cond; {204117#false} is VALID [2022-04-08 12:48:51,601 INFO L290 TraceCheckUtils]: 172: Hoare triple {204117#false} ~cond := #in~cond; {204117#false} is VALID [2022-04-08 12:48:51,601 INFO L272 TraceCheckUtils]: 171: Hoare triple {204117#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)); {204117#false} is VALID [2022-04-08 12:48:51,601 INFO L290 TraceCheckUtils]: 170: Hoare triple {204648#(<= |main_#t~post6| 19)} assume !(#t~post6 < 20);havoc #t~post6; {204117#false} is VALID [2022-04-08 12:48:51,601 INFO L290 TraceCheckUtils]: 169: Hoare triple {204623#(<= ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {204648#(<= |main_#t~post6| 19)} is VALID [2022-04-08 12:48:51,602 INFO L290 TraceCheckUtils]: 168: Hoare triple {204623#(<= ~counter~0 19)} assume !(~r~0 < 0); {204623#(<= ~counter~0 19)} is VALID [2022-04-08 12:48:51,602 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {204116#true} {204623#(<= ~counter~0 19)} #98#return; {204623#(<= ~counter~0 19)} is VALID [2022-04-08 12:48:51,602 INFO L290 TraceCheckUtils]: 166: Hoare triple {204116#true} assume true; {204116#true} is VALID [2022-04-08 12:48:51,602 INFO L290 TraceCheckUtils]: 165: Hoare triple {204116#true} assume !(0 == ~cond); {204116#true} is VALID [2022-04-08 12:48:51,602 INFO L290 TraceCheckUtils]: 164: Hoare triple {204116#true} ~cond := #in~cond; {204116#true} is VALID [2022-04-08 12:48:51,602 INFO L272 TraceCheckUtils]: 163: Hoare triple {204623#(<= ~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)); {204116#true} is VALID [2022-04-08 12:48:51,603 INFO L290 TraceCheckUtils]: 162: Hoare triple {204623#(<= ~counter~0 19)} assume !!(#t~post8 < 20);havoc #t~post8; {204623#(<= ~counter~0 19)} is VALID [2022-04-08 12:48:51,607 INFO L290 TraceCheckUtils]: 161: Hoare triple {204598#(<= ~counter~0 18)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {204623#(<= ~counter~0 19)} is VALID [2022-04-08 12:48:51,607 INFO L290 TraceCheckUtils]: 160: Hoare triple {204598#(<= ~counter~0 18)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {204598#(<= ~counter~0 18)} is VALID [2022-04-08 12:48:51,609 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {204116#true} {204598#(<= ~counter~0 18)} #98#return; {204598#(<= ~counter~0 18)} is VALID [2022-04-08 12:48:51,609 INFO L290 TraceCheckUtils]: 158: Hoare triple {204116#true} assume true; {204116#true} is VALID [2022-04-08 12:48:51,609 INFO L290 TraceCheckUtils]: 157: Hoare triple {204116#true} assume !(0 == ~cond); {204116#true} is VALID [2022-04-08 12:48:51,609 INFO L290 TraceCheckUtils]: 156: Hoare triple {204116#true} ~cond := #in~cond; {204116#true} is VALID [2022-04-08 12:48:51,609 INFO L272 TraceCheckUtils]: 155: Hoare triple {204598#(<= ~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)); {204116#true} is VALID [2022-04-08 12:48:51,609 INFO L290 TraceCheckUtils]: 154: Hoare triple {204598#(<= ~counter~0 18)} assume !!(#t~post8 < 20);havoc #t~post8; {204598#(<= ~counter~0 18)} is VALID [2022-04-08 12:48:51,611 INFO L290 TraceCheckUtils]: 153: Hoare triple {204573#(<= ~counter~0 17)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {204598#(<= ~counter~0 18)} is VALID [2022-04-08 12:48:51,611 INFO L290 TraceCheckUtils]: 152: Hoare triple {204573#(<= ~counter~0 17)} assume !(~r~0 > 0); {204573#(<= ~counter~0 17)} is VALID [2022-04-08 12:48:51,612 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {204116#true} {204573#(<= ~counter~0 17)} #96#return; {204573#(<= ~counter~0 17)} is VALID [2022-04-08 12:48:51,612 INFO L290 TraceCheckUtils]: 150: Hoare triple {204116#true} assume true; {204116#true} is VALID [2022-04-08 12:48:51,612 INFO L290 TraceCheckUtils]: 149: Hoare triple {204116#true} assume !(0 == ~cond); {204116#true} is VALID [2022-04-08 12:48:51,612 INFO L290 TraceCheckUtils]: 148: Hoare triple {204116#true} ~cond := #in~cond; {204116#true} is VALID [2022-04-08 12:48:51,612 INFO L272 TraceCheckUtils]: 147: Hoare triple {204573#(<= ~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)); {204116#true} is VALID [2022-04-08 12:48:51,612 INFO L290 TraceCheckUtils]: 146: Hoare triple {204573#(<= ~counter~0 17)} assume !!(#t~post7 < 20);havoc #t~post7; {204573#(<= ~counter~0 17)} is VALID [2022-04-08 12:48:51,614 INFO L290 TraceCheckUtils]: 145: Hoare triple {204548#(<= ~counter~0 16)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {204573#(<= ~counter~0 17)} is VALID [2022-04-08 12:48:51,614 INFO L290 TraceCheckUtils]: 144: Hoare triple {204548#(<= ~counter~0 16)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {204548#(<= ~counter~0 16)} is VALID [2022-04-08 12:48:51,614 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {204116#true} {204548#(<= ~counter~0 16)} #96#return; {204548#(<= ~counter~0 16)} is VALID [2022-04-08 12:48:51,615 INFO L290 TraceCheckUtils]: 142: Hoare triple {204116#true} assume true; {204116#true} is VALID [2022-04-08 12:48:51,615 INFO L290 TraceCheckUtils]: 141: Hoare triple {204116#true} assume !(0 == ~cond); {204116#true} is VALID [2022-04-08 12:48:51,615 INFO L290 TraceCheckUtils]: 140: Hoare triple {204116#true} ~cond := #in~cond; {204116#true} is VALID [2022-04-08 12:48:51,615 INFO L272 TraceCheckUtils]: 139: Hoare triple {204548#(<= ~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)); {204116#true} is VALID [2022-04-08 12:48:51,615 INFO L290 TraceCheckUtils]: 138: Hoare triple {204548#(<= ~counter~0 16)} assume !!(#t~post7 < 20);havoc #t~post7; {204548#(<= ~counter~0 16)} is VALID [2022-04-08 12:48:51,617 INFO L290 TraceCheckUtils]: 137: Hoare triple {204523#(<= ~counter~0 15)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {204548#(<= ~counter~0 16)} is VALID [2022-04-08 12:48:51,617 INFO L290 TraceCheckUtils]: 136: Hoare triple {204523#(<= ~counter~0 15)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {204523#(<= ~counter~0 15)} is VALID [2022-04-08 12:48:51,617 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {204116#true} {204523#(<= ~counter~0 15)} #96#return; {204523#(<= ~counter~0 15)} is VALID [2022-04-08 12:48:51,617 INFO L290 TraceCheckUtils]: 134: Hoare triple {204116#true} assume true; {204116#true} is VALID [2022-04-08 12:48:51,617 INFO L290 TraceCheckUtils]: 133: Hoare triple {204116#true} assume !(0 == ~cond); {204116#true} is VALID [2022-04-08 12:48:51,618 INFO L290 TraceCheckUtils]: 132: Hoare triple {204116#true} ~cond := #in~cond; {204116#true} is VALID [2022-04-08 12:48:51,618 INFO L272 TraceCheckUtils]: 131: Hoare triple {204523#(<= ~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)); {204116#true} is VALID [2022-04-08 12:48:51,618 INFO L290 TraceCheckUtils]: 130: Hoare triple {204523#(<= ~counter~0 15)} assume !!(#t~post7 < 20);havoc #t~post7; {204523#(<= ~counter~0 15)} is VALID [2022-04-08 12:48:51,619 INFO L290 TraceCheckUtils]: 129: Hoare triple {204498#(<= ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {204523#(<= ~counter~0 15)} is VALID [2022-04-08 12:48:51,620 INFO L290 TraceCheckUtils]: 128: Hoare triple {204498#(<= ~counter~0 14)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {204498#(<= ~counter~0 14)} is VALID [2022-04-08 12:48:51,620 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {204116#true} {204498#(<= ~counter~0 14)} #96#return; {204498#(<= ~counter~0 14)} is VALID [2022-04-08 12:48:51,620 INFO L290 TraceCheckUtils]: 126: Hoare triple {204116#true} assume true; {204116#true} is VALID [2022-04-08 12:48:51,620 INFO L290 TraceCheckUtils]: 125: Hoare triple {204116#true} assume !(0 == ~cond); {204116#true} is VALID [2022-04-08 12:48:51,620 INFO L290 TraceCheckUtils]: 124: Hoare triple {204116#true} ~cond := #in~cond; {204116#true} is VALID [2022-04-08 12:48:51,621 INFO L272 TraceCheckUtils]: 123: Hoare triple {204498#(<= ~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)); {204116#true} is VALID [2022-04-08 12:48:51,621 INFO L290 TraceCheckUtils]: 122: Hoare triple {204498#(<= ~counter~0 14)} assume !!(#t~post7 < 20);havoc #t~post7; {204498#(<= ~counter~0 14)} is VALID [2022-04-08 12:48:51,622 INFO L290 TraceCheckUtils]: 121: Hoare triple {204473#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {204498#(<= ~counter~0 14)} is VALID [2022-04-08 12:48:51,623 INFO L290 TraceCheckUtils]: 120: Hoare triple {204473#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {204473#(<= ~counter~0 13)} is VALID [2022-04-08 12:48:51,623 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {204116#true} {204473#(<= ~counter~0 13)} #96#return; {204473#(<= ~counter~0 13)} is VALID [2022-04-08 12:48:51,623 INFO L290 TraceCheckUtils]: 118: Hoare triple {204116#true} assume true; {204116#true} is VALID [2022-04-08 12:48:51,623 INFO L290 TraceCheckUtils]: 117: Hoare triple {204116#true} assume !(0 == ~cond); {204116#true} is VALID [2022-04-08 12:48:51,623 INFO L290 TraceCheckUtils]: 116: Hoare triple {204116#true} ~cond := #in~cond; {204116#true} is VALID [2022-04-08 12:48:51,623 INFO L272 TraceCheckUtils]: 115: Hoare triple {204473#(<= ~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)); {204116#true} is VALID [2022-04-08 12:48:51,624 INFO L290 TraceCheckUtils]: 114: Hoare triple {204473#(<= ~counter~0 13)} assume !!(#t~post7 < 20);havoc #t~post7; {204473#(<= ~counter~0 13)} is VALID [2022-04-08 12:48:51,625 INFO L290 TraceCheckUtils]: 113: Hoare triple {204448#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {204473#(<= ~counter~0 13)} is VALID [2022-04-08 12:48:51,626 INFO L290 TraceCheckUtils]: 112: Hoare triple {204448#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {204448#(<= ~counter~0 12)} is VALID [2022-04-08 12:48:51,626 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {204116#true} {204448#(<= ~counter~0 12)} #96#return; {204448#(<= ~counter~0 12)} is VALID [2022-04-08 12:48:51,626 INFO L290 TraceCheckUtils]: 110: Hoare triple {204116#true} assume true; {204116#true} is VALID [2022-04-08 12:48:51,626 INFO L290 TraceCheckUtils]: 109: Hoare triple {204116#true} assume !(0 == ~cond); {204116#true} is VALID [2022-04-08 12:48:51,626 INFO L290 TraceCheckUtils]: 108: Hoare triple {204116#true} ~cond := #in~cond; {204116#true} is VALID [2022-04-08 12:48:51,626 INFO L272 TraceCheckUtils]: 107: Hoare triple {204448#(<= ~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)); {204116#true} is VALID [2022-04-08 12:48:51,627 INFO L290 TraceCheckUtils]: 106: Hoare triple {204448#(<= ~counter~0 12)} assume !!(#t~post7 < 20);havoc #t~post7; {204448#(<= ~counter~0 12)} is VALID [2022-04-08 12:48:51,628 INFO L290 TraceCheckUtils]: 105: Hoare triple {204423#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {204448#(<= ~counter~0 12)} is VALID [2022-04-08 12:48:51,629 INFO L290 TraceCheckUtils]: 104: Hoare triple {204423#(<= ~counter~0 11)} assume !!(0 != ~r~0); {204423#(<= ~counter~0 11)} is VALID [2022-04-08 12:48:51,629 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {204116#true} {204423#(<= ~counter~0 11)} #94#return; {204423#(<= ~counter~0 11)} is VALID [2022-04-08 12:48:51,629 INFO L290 TraceCheckUtils]: 102: Hoare triple {204116#true} assume true; {204116#true} is VALID [2022-04-08 12:48:51,629 INFO L290 TraceCheckUtils]: 101: Hoare triple {204116#true} assume !(0 == ~cond); {204116#true} is VALID [2022-04-08 12:48:51,629 INFO L290 TraceCheckUtils]: 100: Hoare triple {204116#true} ~cond := #in~cond; {204116#true} is VALID [2022-04-08 12:48:51,629 INFO L272 TraceCheckUtils]: 99: Hoare triple {204423#(<= ~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)); {204116#true} is VALID [2022-04-08 12:48:51,630 INFO L290 TraceCheckUtils]: 98: Hoare triple {204423#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {204423#(<= ~counter~0 11)} is VALID [2022-04-08 12:48:51,631 INFO L290 TraceCheckUtils]: 97: Hoare triple {204398#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {204423#(<= ~counter~0 11)} is VALID [2022-04-08 12:48:51,631 INFO L290 TraceCheckUtils]: 96: Hoare triple {204398#(<= ~counter~0 10)} assume !(~r~0 < 0); {204398#(<= ~counter~0 10)} is VALID [2022-04-08 12:48:51,632 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {204116#true} {204398#(<= ~counter~0 10)} #98#return; {204398#(<= ~counter~0 10)} is VALID [2022-04-08 12:48:51,632 INFO L290 TraceCheckUtils]: 94: Hoare triple {204116#true} assume true; {204116#true} is VALID [2022-04-08 12:48:51,632 INFO L290 TraceCheckUtils]: 93: Hoare triple {204116#true} assume !(0 == ~cond); {204116#true} is VALID [2022-04-08 12:48:51,632 INFO L290 TraceCheckUtils]: 92: Hoare triple {204116#true} ~cond := #in~cond; {204116#true} is VALID [2022-04-08 12:48:51,632 INFO L272 TraceCheckUtils]: 91: Hoare triple {204398#(<= ~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)); {204116#true} is VALID [2022-04-08 12:48:51,632 INFO L290 TraceCheckUtils]: 90: Hoare triple {204398#(<= ~counter~0 10)} assume !!(#t~post8 < 20);havoc #t~post8; {204398#(<= ~counter~0 10)} is VALID [2022-04-08 12:48:51,634 INFO L290 TraceCheckUtils]: 89: Hoare triple {204373#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {204398#(<= ~counter~0 10)} is VALID [2022-04-08 12:48:51,634 INFO L290 TraceCheckUtils]: 88: Hoare triple {204373#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {204373#(<= ~counter~0 9)} is VALID [2022-04-08 12:48:51,635 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {204116#true} {204373#(<= ~counter~0 9)} #98#return; {204373#(<= ~counter~0 9)} is VALID [2022-04-08 12:48:51,635 INFO L290 TraceCheckUtils]: 86: Hoare triple {204116#true} assume true; {204116#true} is VALID [2022-04-08 12:48:51,635 INFO L290 TraceCheckUtils]: 85: Hoare triple {204116#true} assume !(0 == ~cond); {204116#true} is VALID [2022-04-08 12:48:51,635 INFO L290 TraceCheckUtils]: 84: Hoare triple {204116#true} ~cond := #in~cond; {204116#true} is VALID [2022-04-08 12:48:51,635 INFO L272 TraceCheckUtils]: 83: Hoare triple {204373#(<= ~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)); {204116#true} is VALID [2022-04-08 12:48:51,635 INFO L290 TraceCheckUtils]: 82: Hoare triple {204373#(<= ~counter~0 9)} assume !!(#t~post8 < 20);havoc #t~post8; {204373#(<= ~counter~0 9)} is VALID [2022-04-08 12:48:51,637 INFO L290 TraceCheckUtils]: 81: Hoare triple {204348#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {204373#(<= ~counter~0 9)} is VALID [2022-04-08 12:48:51,637 INFO L290 TraceCheckUtils]: 80: Hoare triple {204348#(<= ~counter~0 8)} assume !(~r~0 > 0); {204348#(<= ~counter~0 8)} is VALID [2022-04-08 12:48:51,638 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {204116#true} {204348#(<= ~counter~0 8)} #96#return; {204348#(<= ~counter~0 8)} is VALID [2022-04-08 12:48:51,638 INFO L290 TraceCheckUtils]: 78: Hoare triple {204116#true} assume true; {204116#true} is VALID [2022-04-08 12:48:51,638 INFO L290 TraceCheckUtils]: 77: Hoare triple {204116#true} assume !(0 == ~cond); {204116#true} is VALID [2022-04-08 12:48:51,638 INFO L290 TraceCheckUtils]: 76: Hoare triple {204116#true} ~cond := #in~cond; {204116#true} is VALID [2022-04-08 12:48:51,638 INFO L272 TraceCheckUtils]: 75: Hoare triple {204348#(<= ~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)); {204116#true} is VALID [2022-04-08 12:48:51,638 INFO L290 TraceCheckUtils]: 74: Hoare triple {204348#(<= ~counter~0 8)} assume !!(#t~post7 < 20);havoc #t~post7; {204348#(<= ~counter~0 8)} is VALID [2022-04-08 12:48:51,640 INFO L290 TraceCheckUtils]: 73: Hoare triple {204323#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {204348#(<= ~counter~0 8)} is VALID [2022-04-08 12:48:51,640 INFO L290 TraceCheckUtils]: 72: Hoare triple {204323#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {204323#(<= ~counter~0 7)} is VALID [2022-04-08 12:48:51,641 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {204116#true} {204323#(<= ~counter~0 7)} #96#return; {204323#(<= ~counter~0 7)} is VALID [2022-04-08 12:48:51,641 INFO L290 TraceCheckUtils]: 70: Hoare triple {204116#true} assume true; {204116#true} is VALID [2022-04-08 12:48:51,641 INFO L290 TraceCheckUtils]: 69: Hoare triple {204116#true} assume !(0 == ~cond); {204116#true} is VALID [2022-04-08 12:48:51,641 INFO L290 TraceCheckUtils]: 68: Hoare triple {204116#true} ~cond := #in~cond; {204116#true} is VALID [2022-04-08 12:48:51,641 INFO L272 TraceCheckUtils]: 67: Hoare triple {204323#(<= ~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)); {204116#true} is VALID [2022-04-08 12:48:51,641 INFO L290 TraceCheckUtils]: 66: Hoare triple {204323#(<= ~counter~0 7)} assume !!(#t~post7 < 20);havoc #t~post7; {204323#(<= ~counter~0 7)} is VALID [2022-04-08 12:48:51,643 INFO L290 TraceCheckUtils]: 65: Hoare triple {204298#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {204323#(<= ~counter~0 7)} is VALID [2022-04-08 12:48:51,643 INFO L290 TraceCheckUtils]: 64: Hoare triple {204298#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {204298#(<= ~counter~0 6)} is VALID [2022-04-08 12:48:51,644 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {204116#true} {204298#(<= ~counter~0 6)} #96#return; {204298#(<= ~counter~0 6)} is VALID [2022-04-08 12:48:51,644 INFO L290 TraceCheckUtils]: 62: Hoare triple {204116#true} assume true; {204116#true} is VALID [2022-04-08 12:48:51,644 INFO L290 TraceCheckUtils]: 61: Hoare triple {204116#true} assume !(0 == ~cond); {204116#true} is VALID [2022-04-08 12:48:51,644 INFO L290 TraceCheckUtils]: 60: Hoare triple {204116#true} ~cond := #in~cond; {204116#true} is VALID [2022-04-08 12:48:51,644 INFO L272 TraceCheckUtils]: 59: Hoare triple {204298#(<= ~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)); {204116#true} is VALID [2022-04-08 12:48:51,644 INFO L290 TraceCheckUtils]: 58: Hoare triple {204298#(<= ~counter~0 6)} assume !!(#t~post7 < 20);havoc #t~post7; {204298#(<= ~counter~0 6)} is VALID [2022-04-08 12:48:51,646 INFO L290 TraceCheckUtils]: 57: Hoare triple {204273#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {204298#(<= ~counter~0 6)} is VALID [2022-04-08 12:48:51,646 INFO L290 TraceCheckUtils]: 56: Hoare triple {204273#(<= ~counter~0 5)} assume !!(0 != ~r~0); {204273#(<= ~counter~0 5)} is VALID [2022-04-08 12:48:51,646 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {204116#true} {204273#(<= ~counter~0 5)} #94#return; {204273#(<= ~counter~0 5)} is VALID [2022-04-08 12:48:51,647 INFO L290 TraceCheckUtils]: 54: Hoare triple {204116#true} assume true; {204116#true} is VALID [2022-04-08 12:48:51,647 INFO L290 TraceCheckUtils]: 53: Hoare triple {204116#true} assume !(0 == ~cond); {204116#true} is VALID [2022-04-08 12:48:51,647 INFO L290 TraceCheckUtils]: 52: Hoare triple {204116#true} ~cond := #in~cond; {204116#true} is VALID [2022-04-08 12:48:51,647 INFO L272 TraceCheckUtils]: 51: Hoare triple {204273#(<= ~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)); {204116#true} is VALID [2022-04-08 12:48:51,647 INFO L290 TraceCheckUtils]: 50: Hoare triple {204273#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {204273#(<= ~counter~0 5)} is VALID [2022-04-08 12:48:51,648 INFO L290 TraceCheckUtils]: 49: Hoare triple {204248#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {204273#(<= ~counter~0 5)} is VALID [2022-04-08 12:48:51,649 INFO L290 TraceCheckUtils]: 48: Hoare triple {204248#(<= ~counter~0 4)} assume !(~r~0 < 0); {204248#(<= ~counter~0 4)} is VALID [2022-04-08 12:48:51,649 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {204116#true} {204248#(<= ~counter~0 4)} #98#return; {204248#(<= ~counter~0 4)} is VALID [2022-04-08 12:48:51,649 INFO L290 TraceCheckUtils]: 46: Hoare triple {204116#true} assume true; {204116#true} is VALID [2022-04-08 12:48:51,649 INFO L290 TraceCheckUtils]: 45: Hoare triple {204116#true} assume !(0 == ~cond); {204116#true} is VALID [2022-04-08 12:48:51,649 INFO L290 TraceCheckUtils]: 44: Hoare triple {204116#true} ~cond := #in~cond; {204116#true} is VALID [2022-04-08 12:48:51,650 INFO L272 TraceCheckUtils]: 43: Hoare triple {204248#(<= ~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)); {204116#true} is VALID [2022-04-08 12:48:51,650 INFO L290 TraceCheckUtils]: 42: Hoare triple {204248#(<= ~counter~0 4)} assume !!(#t~post8 < 20);havoc #t~post8; {204248#(<= ~counter~0 4)} is VALID [2022-04-08 12:48:51,651 INFO L290 TraceCheckUtils]: 41: Hoare triple {204223#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {204248#(<= ~counter~0 4)} is VALID [2022-04-08 12:48:51,652 INFO L290 TraceCheckUtils]: 40: Hoare triple {204223#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {204223#(<= ~counter~0 3)} is VALID [2022-04-08 12:48:51,652 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {204116#true} {204223#(<= ~counter~0 3)} #98#return; {204223#(<= ~counter~0 3)} is VALID [2022-04-08 12:48:51,652 INFO L290 TraceCheckUtils]: 38: Hoare triple {204116#true} assume true; {204116#true} is VALID [2022-04-08 12:48:51,652 INFO L290 TraceCheckUtils]: 37: Hoare triple {204116#true} assume !(0 == ~cond); {204116#true} is VALID [2022-04-08 12:48:51,652 INFO L290 TraceCheckUtils]: 36: Hoare triple {204116#true} ~cond := #in~cond; {204116#true} is VALID [2022-04-08 12:48:51,653 INFO L272 TraceCheckUtils]: 35: Hoare triple {204223#(<= ~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)); {204116#true} is VALID [2022-04-08 12:48:51,653 INFO L290 TraceCheckUtils]: 34: Hoare triple {204223#(<= ~counter~0 3)} assume !!(#t~post8 < 20);havoc #t~post8; {204223#(<= ~counter~0 3)} is VALID [2022-04-08 12:48:51,654 INFO L290 TraceCheckUtils]: 33: Hoare triple {204198#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {204223#(<= ~counter~0 3)} is VALID [2022-04-08 12:48:51,655 INFO L290 TraceCheckUtils]: 32: Hoare triple {204198#(<= ~counter~0 2)} assume !(~r~0 > 0); {204198#(<= ~counter~0 2)} is VALID [2022-04-08 12:48:51,655 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {204116#true} {204198#(<= ~counter~0 2)} #96#return; {204198#(<= ~counter~0 2)} is VALID [2022-04-08 12:48:51,655 INFO L290 TraceCheckUtils]: 30: Hoare triple {204116#true} assume true; {204116#true} is VALID [2022-04-08 12:48:51,655 INFO L290 TraceCheckUtils]: 29: Hoare triple {204116#true} assume !(0 == ~cond); {204116#true} is VALID [2022-04-08 12:48:51,655 INFO L290 TraceCheckUtils]: 28: Hoare triple {204116#true} ~cond := #in~cond; {204116#true} is VALID [2022-04-08 12:48:51,655 INFO L272 TraceCheckUtils]: 27: Hoare triple {204198#(<= ~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)); {204116#true} is VALID [2022-04-08 12:48:51,656 INFO L290 TraceCheckUtils]: 26: Hoare triple {204198#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {204198#(<= ~counter~0 2)} is VALID [2022-04-08 12:48:51,658 INFO L290 TraceCheckUtils]: 25: Hoare triple {204173#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {204198#(<= ~counter~0 2)} is VALID [2022-04-08 12:48:51,658 INFO L290 TraceCheckUtils]: 24: Hoare triple {204173#(<= ~counter~0 1)} assume !!(0 != ~r~0); {204173#(<= ~counter~0 1)} is VALID [2022-04-08 12:48:51,658 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {204116#true} {204173#(<= ~counter~0 1)} #94#return; {204173#(<= ~counter~0 1)} is VALID [2022-04-08 12:48:51,658 INFO L290 TraceCheckUtils]: 22: Hoare triple {204116#true} assume true; {204116#true} is VALID [2022-04-08 12:48:51,658 INFO L290 TraceCheckUtils]: 21: Hoare triple {204116#true} assume !(0 == ~cond); {204116#true} is VALID [2022-04-08 12:48:51,658 INFO L290 TraceCheckUtils]: 20: Hoare triple {204116#true} ~cond := #in~cond; {204116#true} is VALID [2022-04-08 12:48:51,659 INFO L272 TraceCheckUtils]: 19: Hoare triple {204173#(<= ~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)); {204116#true} is VALID [2022-04-08 12:48:51,659 INFO L290 TraceCheckUtils]: 18: Hoare triple {204173#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {204173#(<= ~counter~0 1)} is VALID [2022-04-08 12:48:51,660 INFO L290 TraceCheckUtils]: 17: Hoare triple {204124#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {204173#(<= ~counter~0 1)} is VALID [2022-04-08 12:48:51,661 INFO L290 TraceCheckUtils]: 16: Hoare triple {204124#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {204124#(<= ~counter~0 0)} is VALID [2022-04-08 12:48:51,661 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {204116#true} {204124#(<= ~counter~0 0)} #92#return; {204124#(<= ~counter~0 0)} is VALID [2022-04-08 12:48:51,661 INFO L290 TraceCheckUtils]: 14: Hoare triple {204116#true} assume true; {204116#true} is VALID [2022-04-08 12:48:51,661 INFO L290 TraceCheckUtils]: 13: Hoare triple {204116#true} assume !(0 == ~cond); {204116#true} is VALID [2022-04-08 12:48:51,661 INFO L290 TraceCheckUtils]: 12: Hoare triple {204116#true} ~cond := #in~cond; {204116#true} is VALID [2022-04-08 12:48:51,661 INFO L272 TraceCheckUtils]: 11: Hoare triple {204124#(<= ~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)); {204116#true} is VALID [2022-04-08 12:48:51,662 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {204116#true} {204124#(<= ~counter~0 0)} #90#return; {204124#(<= ~counter~0 0)} is VALID [2022-04-08 12:48:51,662 INFO L290 TraceCheckUtils]: 9: Hoare triple {204116#true} assume true; {204116#true} is VALID [2022-04-08 12:48:51,662 INFO L290 TraceCheckUtils]: 8: Hoare triple {204116#true} assume !(0 == ~cond); {204116#true} is VALID [2022-04-08 12:48:51,662 INFO L290 TraceCheckUtils]: 7: Hoare triple {204116#true} ~cond := #in~cond; {204116#true} is VALID [2022-04-08 12:48:51,662 INFO L272 TraceCheckUtils]: 6: Hoare triple {204124#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {204116#true} is VALID [2022-04-08 12:48:51,662 INFO L290 TraceCheckUtils]: 5: Hoare triple {204124#(<= ~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; {204124#(<= ~counter~0 0)} is VALID [2022-04-08 12:48:51,663 INFO L272 TraceCheckUtils]: 4: Hoare triple {204124#(<= ~counter~0 0)} call #t~ret9 := main(); {204124#(<= ~counter~0 0)} is VALID [2022-04-08 12:48:51,663 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {204124#(<= ~counter~0 0)} {204116#true} #102#return; {204124#(<= ~counter~0 0)} is VALID [2022-04-08 12:48:51,663 INFO L290 TraceCheckUtils]: 2: Hoare triple {204124#(<= ~counter~0 0)} assume true; {204124#(<= ~counter~0 0)} is VALID [2022-04-08 12:48:51,664 INFO L290 TraceCheckUtils]: 1: Hoare triple {204116#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; {204124#(<= ~counter~0 0)} is VALID [2022-04-08 12:48:51,664 INFO L272 TraceCheckUtils]: 0: Hoare triple {204116#true} call ULTIMATE.init(); {204116#true} is VALID [2022-04-08 12:48:51,664 INFO L134 CoverageAnalysis]: Checked inductivity of 984 backedges. 38 proven. 258 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2022-04-08 12:48:51,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:48:51,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586188187] [2022-04-08 12:48:51,664 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:48:51,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844878578] [2022-04-08 12:48:51,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844878578] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:48:51,664 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:48:51,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2022-04-08 12:48:51,665 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:48:51,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [81839394] [2022-04-08 12:48:51,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [81839394] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:48:51,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:48:51,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-08 12:48:51,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385525637] [2022-04-08 12:48:51,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:48:51,665 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.478260869565218) internal successors, (126), 22 states have internal predecessors, (126), 22 states have call successors, (24), 22 states have call predecessors, (24), 20 states have return successors, (22), 20 states have call predecessors, (22), 21 states have call successors, (22) Word has length 175 [2022-04-08 12:48:51,665 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:48:51,666 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 5.478260869565218) internal successors, (126), 22 states have internal predecessors, (126), 22 states have call successors, (24), 22 states have call predecessors, (24), 20 states have return successors, (22), 20 states have call predecessors, (22), 21 states have call successors, (22) [2022-04-08 12:48:51,932 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:48:51,933 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-08 12:48:51,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:48:51,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-08 12:48:51,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=273, Unknown=0, NotChecked=0, Total=506 [2022-04-08 12:48:51,933 INFO L87 Difference]: Start difference. First operand 963 states and 1277 transitions. Second operand has 23 states, 23 states have (on average 5.478260869565218) internal successors, (126), 22 states have internal predecessors, (126), 22 states have call successors, (24), 22 states have call predecessors, (24), 20 states have return successors, (22), 20 states have call predecessors, (22), 21 states have call successors, (22) [2022-04-08 12:48:59,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:48:59,122 INFO L93 Difference]: Finished difference Result 1014 states and 1347 transitions. [2022-04-08 12:48:59,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-08 12:48:59,122 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.478260869565218) internal successors, (126), 22 states have internal predecessors, (126), 22 states have call successors, (24), 22 states have call predecessors, (24), 20 states have return successors, (22), 20 states have call predecessors, (22), 21 states have call successors, (22) Word has length 175 [2022-04-08 12:48:59,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:48:59,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 5.478260869565218) internal successors, (126), 22 states have internal predecessors, (126), 22 states have call successors, (24), 22 states have call predecessors, (24), 20 states have return successors, (22), 20 states have call predecessors, (22), 21 states have call successors, (22) [2022-04-08 12:48:59,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 394 transitions. [2022-04-08 12:48:59,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 5.478260869565218) internal successors, (126), 22 states have internal predecessors, (126), 22 states have call successors, (24), 22 states have call predecessors, (24), 20 states have return successors, (22), 20 states have call predecessors, (22), 21 states have call successors, (22) [2022-04-08 12:48:59,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 394 transitions. [2022-04-08 12:48:59,127 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 394 transitions. [2022-04-08 12:48:59,699 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 394 edges. 394 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:48:59,741 INFO L225 Difference]: With dead ends: 1014 [2022-04-08 12:48:59,742 INFO L226 Difference]: Without dead ends: 1009 [2022-04-08 12:48:59,742 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 327 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=540, Invalid=942, Unknown=0, NotChecked=0, Total=1482 [2022-04-08 12:48:59,742 INFO L913 BasicCegarLoop]: 87 mSDtfsCounter, 345 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-08 12:48:59,742 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [345 Valid, 410 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-08 12:48:59,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2022-04-08 12:49:03,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 987. [2022-04-08 12:49:03,615 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:49:03,616 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1009 states. Second operand has 987 states, 735 states have (on average 1.1714285714285715) internal successors, (861), 752 states have internal predecessors, (861), 228 states have call successors, (228), 25 states have call predecessors, (228), 23 states have return successors, (226), 209 states have call predecessors, (226), 226 states have call successors, (226) [2022-04-08 12:49:03,617 INFO L74 IsIncluded]: Start isIncluded. First operand 1009 states. Second operand has 987 states, 735 states have (on average 1.1714285714285715) internal successors, (861), 752 states have internal predecessors, (861), 228 states have call successors, (228), 25 states have call predecessors, (228), 23 states have return successors, (226), 209 states have call predecessors, (226), 226 states have call successors, (226) [2022-04-08 12:49:03,617 INFO L87 Difference]: Start difference. First operand 1009 states. Second operand has 987 states, 735 states have (on average 1.1714285714285715) internal successors, (861), 752 states have internal predecessors, (861), 228 states have call successors, (228), 25 states have call predecessors, (228), 23 states have return successors, (226), 209 states have call predecessors, (226), 226 states have call successors, (226)