/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_unwindbound100.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 05:55:37,636 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 05:55:37,638 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 05:55:37,695 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 05:55:37,696 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 05:55:37,696 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 05:55:37,699 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 05:55:37,701 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 05:55:37,702 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 05:55:37,705 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 05:55:37,706 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 05:55:37,707 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 05:55:37,707 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 05:55:37,709 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 05:55:37,709 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 05:55:37,711 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 05:55:37,712 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 05:55:37,712 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 05:55:37,714 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 05:55:37,718 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 05:55:37,719 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 05:55:37,720 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 05:55:37,720 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 05:55:37,721 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 05:55:37,722 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 05:55:37,725 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 05:55:37,725 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 05:55:37,725 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 05:55:37,726 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 05:55:37,726 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 05:55:37,726 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 05:55:37,727 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 05:55:37,727 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 05:55:37,727 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 05:55:37,728 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 05:55:37,729 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 05:55:37,729 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 05:55:37,729 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 05:55:37,729 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 05:55:37,729 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 05:55:37,730 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 05:55:37,731 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 05:55:37,731 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 05:55:37,741 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 05:55:37,741 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 05:55:37,742 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 05:55:37,742 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 05:55:37,742 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 05:55:37,742 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 05:55:37,742 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 05:55:37,742 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 05:55:37,742 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 05:55:37,743 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 05:55:37,743 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 05:55:37,743 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 05:55:37,743 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 05:55:37,743 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 05:55:37,743 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 05:55:37,743 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 05:55:37,744 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 05:55:37,744 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 05:55:37,744 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 05:55:37,744 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 05:55:37,744 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 05:55:37,744 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 05:55:37,744 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 05:55:37,744 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 05:55:37,744 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 05:55:37,744 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 05:55:37,947 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 05:55:37,968 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 05:55:37,969 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 05:55:37,970 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 05:55:37,970 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 05:55:37,971 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_unwindbound100.c [2022-04-28 05:55:38,009 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/619db2820/fac3c1a2f55e4745971d79ac4e4fb36d/FLAGff466d52c [2022-04-28 05:55:38,371 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 05:55:38,371 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_unwindbound100.c [2022-04-28 05:55:38,379 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/619db2820/fac3c1a2f55e4745971d79ac4e4fb36d/FLAGff466d52c [2022-04-28 05:55:38,392 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/619db2820/fac3c1a2f55e4745971d79ac4e4fb36d [2022-04-28 05:55:38,393 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 05:55:38,395 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 05:55:38,397 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 05:55:38,397 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 05:55:38,399 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 05:55:38,400 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 05:55:38" (1/1) ... [2022-04-28 05:55:38,401 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f342c51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:55:38, skipping insertion in model container [2022-04-28 05:55:38,401 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 05:55:38" (1/1) ... [2022-04-28 05:55:38,406 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 05:55:38,416 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 05:55:38,552 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_unwindbound100.c[535,548] [2022-04-28 05:55:38,588 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 05:55:38,594 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 05:55:38,607 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_unwindbound100.c[535,548] [2022-04-28 05:55:38,631 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 05:55:38,641 INFO L208 MainTranslator]: Completed translation [2022-04-28 05:55:38,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:55:38 WrapperNode [2022-04-28 05:55:38,642 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 05:55:38,649 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 05:55:38,649 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 05:55:38,649 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 05:55:38,657 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:55:38" (1/1) ... [2022-04-28 05:55:38,657 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:55:38" (1/1) ... [2022-04-28 05:55:38,668 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:55:38" (1/1) ... [2022-04-28 05:55:38,668 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:55:38" (1/1) ... [2022-04-28 05:55:38,681 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:55:38" (1/1) ... [2022-04-28 05:55:38,684 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:55:38" (1/1) ... [2022-04-28 05:55:38,685 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:55:38" (1/1) ... [2022-04-28 05:55:38,686 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 05:55:38,687 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 05:55:38,687 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 05:55:38,687 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 05:55:38,689 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:55:38" (1/1) ... [2022-04-28 05:55:38,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 05:55:38,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:55:38,736 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 05:55:38,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 05:55:38,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 05:55:38,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 05:55:38,782 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 05:55:38,782 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 05:55:38,783 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 05:55:38,783 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 05:55:38,783 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 05:55:38,783 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 05:55:38,784 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 05:55:38,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 05:55:38,784 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 05:55:38,785 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 05:55:38,785 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 05:55:38,785 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 05:55:38,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 05:55:38,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 05:55:38,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 05:55:38,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 05:55:38,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 05:55:38,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 05:55:38,844 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 05:55:38,845 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 05:55:39,051 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 05:55:39,057 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 05:55:39,057 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-28 05:55:39,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 05:55:39 BoogieIcfgContainer [2022-04-28 05:55:39,058 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 05:55:39,060 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 05:55:39,060 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 05:55:39,062 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 05:55:39,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 05:55:38" (1/3) ... [2022-04-28 05:55:39,063 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59f14063 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 05:55:39, skipping insertion in model container [2022-04-28 05:55:39,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:55:38" (2/3) ... [2022-04-28 05:55:39,063 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59f14063 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 05:55:39, skipping insertion in model container [2022-04-28 05:55:39,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 05:55:39" (3/3) ... [2022-04-28 05:55:39,065 INFO L111 eAbstractionObserver]: Analyzing ICFG fermat1-ll_unwindbound100.c [2022-04-28 05:55:39,076 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 05:55:39,077 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 05:55:39,120 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 05:55:39,126 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@53674b53, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@586c7e2e [2022-04-28 05:55:39,126 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 05:55:39,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-28 05:55:39,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 05:55:39,138 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:55:39,138 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:55:39,139 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:55:39,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:55:39,144 INFO L85 PathProgramCache]: Analyzing trace with hash 928708300, now seen corresponding path program 1 times [2022-04-28 05:55:39,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:55:39,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1725264227] [2022-04-28 05:55:39,158 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:55:39,159 INFO L85 PathProgramCache]: Analyzing trace with hash 928708300, now seen corresponding path program 2 times [2022-04-28 05:55:39,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:55:39,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227641898] [2022-04-28 05:55:39,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:55:39,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:55:39,252 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:55:39,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [861789416] [2022-04-28 05:55:39,252 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:55:39,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:55:39,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:55:39,254 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:55:39,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 05:55:39,325 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 05:55:39,325 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:55:39,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 1 conjunts are in the unsatisfiable core [2022-04-28 05:55:39,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:55:39,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:55:39,434 INFO L272 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {40#true} is VALID [2022-04-28 05:55:39,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {40#true} is VALID [2022-04-28 05:55:39,435 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-28 05:55:39,435 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #102#return; {40#true} is VALID [2022-04-28 05:55:39,436 INFO L272 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret9 := main(); {40#true} is VALID [2022-04-28 05:55:39,436 INFO L290 TraceCheckUtils]: 5: Hoare triple {40#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {40#true} is VALID [2022-04-28 05:55:39,436 INFO L272 TraceCheckUtils]: 6: Hoare triple {40#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {40#true} is VALID [2022-04-28 05:55:39,436 INFO L290 TraceCheckUtils]: 7: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-28 05:55:39,437 INFO L290 TraceCheckUtils]: 8: Hoare triple {40#true} assume 0 == ~cond;assume false; {40#true} is VALID [2022-04-28 05:55:39,437 INFO L290 TraceCheckUtils]: 9: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-28 05:55:39,437 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {40#true} {40#true} #90#return; {40#true} is VALID [2022-04-28 05:55:39,437 INFO L272 TraceCheckUtils]: 11: Hoare triple {40#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {40#true} is VALID [2022-04-28 05:55:39,438 INFO L290 TraceCheckUtils]: 12: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-28 05:55:39,438 INFO L290 TraceCheckUtils]: 13: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-28 05:55:39,439 INFO L290 TraceCheckUtils]: 14: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-28 05:55:39,439 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {41#false} {40#true} #92#return; {41#false} is VALID [2022-04-28 05:55:39,439 INFO L290 TraceCheckUtils]: 16: Hoare triple {41#false} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {41#false} is VALID [2022-04-28 05:55:39,439 INFO L290 TraceCheckUtils]: 17: Hoare triple {41#false} assume !true; {41#false} is VALID [2022-04-28 05:55:39,440 INFO L272 TraceCheckUtils]: 18: Hoare triple {41#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {41#false} is VALID [2022-04-28 05:55:39,440 INFO L290 TraceCheckUtils]: 19: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2022-04-28 05:55:39,441 INFO L290 TraceCheckUtils]: 20: Hoare triple {41#false} assume 0 == ~cond; {41#false} is VALID [2022-04-28 05:55:39,441 INFO L290 TraceCheckUtils]: 21: Hoare triple {41#false} assume !false; {41#false} is VALID [2022-04-28 05:55:39,442 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 05:55:39,442 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 05:55:39,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:55:39,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227641898] [2022-04-28 05:55:39,442 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:55:39,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861789416] [2022-04-28 05:55:39,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [861789416] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:55:39,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:55:39,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-28 05:55:39,447 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:55:39,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1725264227] [2022-04-28 05:55:39,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1725264227] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:55:39,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:55:39,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-28 05:55:39,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365591295] [2022-04-28 05:55:39,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:55:39,453 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-28 05:55:39,454 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:55:39,456 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 05:55:39,479 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:55:39,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-28 05:55:39,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:55:39,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-28 05:55:39,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-28 05:55:39,499 INFO L87 Difference]: Start difference. First operand has 37 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 24 states have internal predecessors, (35), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 05:55:39,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:55:39,580 INFO L93 Difference]: Finished difference Result 67 states and 100 transitions. [2022-04-28 05:55:39,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-28 05:55:39,581 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-28 05:55:39,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:55:39,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 05:55:39,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 100 transitions. [2022-04-28 05:55:39,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 05:55:39,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 100 transitions. [2022-04-28 05:55:39,595 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2 states and 100 transitions. [2022-04-28 05:55:39,708 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:55:39,717 INFO L225 Difference]: With dead ends: 67 [2022-04-28 05:55:39,717 INFO L226 Difference]: Without dead ends: 32 [2022-04-28 05:55:39,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-28 05:55:39,722 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 05:55:39,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 05:55:39,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-28 05:55:39,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-28 05:55:39,749 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:55:39,750 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 05:55:39,751 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 05:55:39,752 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 05:55:39,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:55:39,756 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-28 05:55:39,757 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-28 05:55:39,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:55:39,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:55:39,757 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 32 states. [2022-04-28 05:55:39,758 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 32 states. [2022-04-28 05:55:39,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:55:39,760 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-28 05:55:39,760 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-28 05:55:39,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:55:39,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:55:39,761 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:55:39,761 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:55:39,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 05:55:39,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-04-28 05:55:39,763 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 22 [2022-04-28 05:55:39,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:55:39,764 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-04-28 05:55:39,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 05:55:39,767 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 41 transitions. [2022-04-28 05:55:39,797 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:55:39,797 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-28 05:55:39,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 05:55:39,798 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:55:39,798 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:55:39,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 05:55:40,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-04-28 05:55:40,008 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:55:40,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:55:40,008 INFO L85 PathProgramCache]: Analyzing trace with hash -155606603, now seen corresponding path program 1 times [2022-04-28 05:55:40,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:55:40,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [121557637] [2022-04-28 05:55:40,009 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:55:40,009 INFO L85 PathProgramCache]: Analyzing trace with hash -155606603, now seen corresponding path program 2 times [2022-04-28 05:55:40,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:55:40,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956150253] [2022-04-28 05:55:40,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:55:40,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:55:40,025 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:55:40,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [93727688] [2022-04-28 05:55:40,025 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:55:40,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:55:40,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:55:40,029 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:55:40,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 05:55:40,074 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 05:55:40,074 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:55:40,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 05:55:40,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:55:40,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:55:40,300 INFO L272 TraceCheckUtils]: 0: Hoare triple {369#true} call ULTIMATE.init(); {369#true} is VALID [2022-04-28 05:55:40,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {369#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {377#(<= ~counter~0 0)} is VALID [2022-04-28 05:55:40,301 INFO L290 TraceCheckUtils]: 2: Hoare triple {377#(<= ~counter~0 0)} assume true; {377#(<= ~counter~0 0)} is VALID [2022-04-28 05:55:40,302 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {377#(<= ~counter~0 0)} {369#true} #102#return; {377#(<= ~counter~0 0)} is VALID [2022-04-28 05:55:40,302 INFO L272 TraceCheckUtils]: 4: Hoare triple {377#(<= ~counter~0 0)} call #t~ret9 := main(); {377#(<= ~counter~0 0)} is VALID [2022-04-28 05:55:40,302 INFO L290 TraceCheckUtils]: 5: Hoare triple {377#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {377#(<= ~counter~0 0)} is VALID [2022-04-28 05:55:40,303 INFO L272 TraceCheckUtils]: 6: Hoare triple {377#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {377#(<= ~counter~0 0)} is VALID [2022-04-28 05:55:40,303 INFO L290 TraceCheckUtils]: 7: Hoare triple {377#(<= ~counter~0 0)} ~cond := #in~cond; {377#(<= ~counter~0 0)} is VALID [2022-04-28 05:55:40,304 INFO L290 TraceCheckUtils]: 8: Hoare triple {377#(<= ~counter~0 0)} assume !(0 == ~cond); {377#(<= ~counter~0 0)} is VALID [2022-04-28 05:55:40,304 INFO L290 TraceCheckUtils]: 9: Hoare triple {377#(<= ~counter~0 0)} assume true; {377#(<= ~counter~0 0)} is VALID [2022-04-28 05:55:40,305 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {377#(<= ~counter~0 0)} {377#(<= ~counter~0 0)} #90#return; {377#(<= ~counter~0 0)} is VALID [2022-04-28 05:55:40,305 INFO L272 TraceCheckUtils]: 11: Hoare triple {377#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {377#(<= ~counter~0 0)} is VALID [2022-04-28 05:55:40,306 INFO L290 TraceCheckUtils]: 12: Hoare triple {377#(<= ~counter~0 0)} ~cond := #in~cond; {377#(<= ~counter~0 0)} is VALID [2022-04-28 05:55:40,307 INFO L290 TraceCheckUtils]: 13: Hoare triple {377#(<= ~counter~0 0)} assume !(0 == ~cond); {377#(<= ~counter~0 0)} is VALID [2022-04-28 05:55:40,307 INFO L290 TraceCheckUtils]: 14: Hoare triple {377#(<= ~counter~0 0)} assume true; {377#(<= ~counter~0 0)} is VALID [2022-04-28 05:55:40,308 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {377#(<= ~counter~0 0)} {377#(<= ~counter~0 0)} #92#return; {377#(<= ~counter~0 0)} is VALID [2022-04-28 05:55:40,309 INFO L290 TraceCheckUtils]: 16: Hoare triple {377#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {377#(<= ~counter~0 0)} is VALID [2022-04-28 05:55:40,309 INFO L290 TraceCheckUtils]: 17: Hoare triple {377#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {426#(<= |main_#t~post6| 0)} is VALID [2022-04-28 05:55:40,310 INFO L290 TraceCheckUtils]: 18: Hoare triple {426#(<= |main_#t~post6| 0)} assume !(#t~post6 < 100);havoc #t~post6; {370#false} is VALID [2022-04-28 05:55:40,310 INFO L272 TraceCheckUtils]: 19: Hoare triple {370#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {370#false} is VALID [2022-04-28 05:55:40,311 INFO L290 TraceCheckUtils]: 20: Hoare triple {370#false} ~cond := #in~cond; {370#false} is VALID [2022-04-28 05:55:40,311 INFO L290 TraceCheckUtils]: 21: Hoare triple {370#false} assume 0 == ~cond; {370#false} is VALID [2022-04-28 05:55:40,312 INFO L290 TraceCheckUtils]: 22: Hoare triple {370#false} assume !false; {370#false} is VALID [2022-04-28 05:55:40,312 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:55:40,312 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 05:55:40,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:55:40,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956150253] [2022-04-28 05:55:40,313 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:55:40,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [93727688] [2022-04-28 05:55:40,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [93727688] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:55:40,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:55:40,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 05:55:40,314 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:55:40,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [121557637] [2022-04-28 05:55:40,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [121557637] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:55:40,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:55:40,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 05:55:40,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711757562] [2022-04-28 05:55:40,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:55:40,317 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-28 05:55:40,318 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:55:40,318 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 05:55:40,334 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:55:40,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 05:55:40,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:55:40,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 05:55:40,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 05:55:40,335 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 05:55:40,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:55:40,417 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2022-04-28 05:55:40,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 05:55:40,417 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-28 05:55:40,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:55:40,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 05:55:40,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-04-28 05:55:40,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 05:55:40,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-04-28 05:55:40,422 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 50 transitions. [2022-04-28 05:55:40,456 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:55:40,457 INFO L225 Difference]: With dead ends: 41 [2022-04-28 05:55:40,458 INFO L226 Difference]: Without dead ends: 34 [2022-04-28 05:55:40,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 05:55:40,459 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 05:55:40,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 05:55:40,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-28 05:55:40,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-28 05:55:40,473 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:55:40,474 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 05:55:40,474 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 05:55:40,474 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 05:55:40,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:55:40,476 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-28 05:55:40,476 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-28 05:55:40,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:55:40,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:55:40,477 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 34 states. [2022-04-28 05:55:40,478 INFO L87 Difference]: Start difference. First operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 34 states. [2022-04-28 05:55:40,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:55:40,479 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-28 05:55:40,479 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-28 05:55:40,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:55:40,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:55:40,480 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:55:40,480 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:55:40,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 05:55:40,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2022-04-28 05:55:40,482 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 23 [2022-04-28 05:55:40,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:55:40,483 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-04-28 05:55:40,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 05:55:40,483 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 43 transitions. [2022-04-28 05:55:40,517 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:55:40,518 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-28 05:55:40,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 05:55:40,519 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:55:40,519 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:55:40,541 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-28 05:55:40,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-04-28 05:55:40,742 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:55:40,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:55:40,742 INFO L85 PathProgramCache]: Analyzing trace with hash -153938307, now seen corresponding path program 1 times [2022-04-28 05:55:40,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:55:40,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [625937312] [2022-04-28 05:55:40,743 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:55:40,743 INFO L85 PathProgramCache]: Analyzing trace with hash -153938307, now seen corresponding path program 2 times [2022-04-28 05:55:40,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:55:40,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853969837] [2022-04-28 05:55:40,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:55:40,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:55:40,757 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:55:40,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [463657639] [2022-04-28 05:55:40,758 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:55:40,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:55:40,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:55:40,759 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:55:40,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 05:55:40,795 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 05:55:40,795 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:55:40,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 05:55:40,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:55:40,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:55:41,059 INFO L272 TraceCheckUtils]: 0: Hoare triple {659#true} call ULTIMATE.init(); {659#true} is VALID [2022-04-28 05:55:41,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {659#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {659#true} is VALID [2022-04-28 05:55:41,059 INFO L290 TraceCheckUtils]: 2: Hoare triple {659#true} assume true; {659#true} is VALID [2022-04-28 05:55:41,059 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {659#true} {659#true} #102#return; {659#true} is VALID [2022-04-28 05:55:41,059 INFO L272 TraceCheckUtils]: 4: Hoare triple {659#true} call #t~ret9 := main(); {659#true} is VALID [2022-04-28 05:55:41,060 INFO L290 TraceCheckUtils]: 5: Hoare triple {659#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {659#true} is VALID [2022-04-28 05:55:41,060 INFO L272 TraceCheckUtils]: 6: Hoare triple {659#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {659#true} is VALID [2022-04-28 05:55:41,060 INFO L290 TraceCheckUtils]: 7: Hoare triple {659#true} ~cond := #in~cond; {659#true} is VALID [2022-04-28 05:55:41,060 INFO L290 TraceCheckUtils]: 8: Hoare triple {659#true} assume !(0 == ~cond); {659#true} is VALID [2022-04-28 05:55:41,060 INFO L290 TraceCheckUtils]: 9: Hoare triple {659#true} assume true; {659#true} is VALID [2022-04-28 05:55:41,060 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {659#true} {659#true} #90#return; {659#true} is VALID [2022-04-28 05:55:41,060 INFO L272 TraceCheckUtils]: 11: Hoare triple {659#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {659#true} is VALID [2022-04-28 05:55:41,061 INFO L290 TraceCheckUtils]: 12: Hoare triple {659#true} ~cond := #in~cond; {659#true} is VALID [2022-04-28 05:55:41,061 INFO L290 TraceCheckUtils]: 13: Hoare triple {659#true} assume !(0 == ~cond); {659#true} is VALID [2022-04-28 05:55:41,061 INFO L290 TraceCheckUtils]: 14: Hoare triple {659#true} assume true; {659#true} is VALID [2022-04-28 05:55:41,064 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {659#true} {659#true} #92#return; {659#true} is VALID [2022-04-28 05:55:42,797 INFO L290 TraceCheckUtils]: 16: Hoare triple {659#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {712#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} is VALID [2022-04-28 05:55:42,798 INFO L290 TraceCheckUtils]: 17: Hoare triple {712#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {712#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} is VALID [2022-04-28 05:55:42,799 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 < 100);havoc #t~post6; {712#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} is VALID [2022-04-28 05:55:43,023 INFO L272 TraceCheckUtils]: 19: Hoare triple {712#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {722#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:55:43,024 INFO L290 TraceCheckUtils]: 20: Hoare triple {722#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {726#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:55:43,024 INFO L290 TraceCheckUtils]: 21: Hoare triple {726#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {660#false} is VALID [2022-04-28 05:55:43,025 INFO L290 TraceCheckUtils]: 22: Hoare triple {660#false} assume !false; {660#false} is VALID [2022-04-28 05:55:43,025 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:55:43,025 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 05:55:43,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:55:43,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853969837] [2022-04-28 05:55:43,025 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:55:43,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463657639] [2022-04-28 05:55:43,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [463657639] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:55:43,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:55:43,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 05:55:43,026 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:55:43,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [625937312] [2022-04-28 05:55:43,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [625937312] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:55:43,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:55:43,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 05:55:43,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980173386] [2022-04-28 05:55:43,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:55:43,027 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-28 05:55:43,027 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:55:43,027 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 05:55:45,633 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 19 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 05:55:45,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 05:55:45,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:55:45,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 05:55:45,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 05:55:45,634 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 05:55:48,939 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 05:55:50,622 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 05:55:54,097 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 05:55:56,154 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 05:55:56,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:55:56,192 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2022-04-28 05:55:56,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 05:55:56,192 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-28 05:55:56,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:55:56,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 05:55:56,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-04-28 05:55:56,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 05:55:56,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-04-28 05:55:56,195 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 68 transitions. [2022-04-28 05:56:00,201 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 67 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 05:56:00,203 INFO L225 Difference]: With dead ends: 53 [2022-04-28 05:56:00,203 INFO L226 Difference]: Without dead ends: 51 [2022-04-28 05:56:00,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 05:56:00,204 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 16 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2022-04-28 05:56:00,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 116 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 1 Unknown, 0 Unchecked, 8.2s Time] [2022-04-28 05:56:00,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-28 05:56:00,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-04-28 05:56:00,236 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:56:00,236 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 50 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 05:56:00,236 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 50 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 05:56:00,237 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 50 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 05:56:00,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:00,239 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2022-04-28 05:56:00,239 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2022-04-28 05:56:00,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:56:00,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:56:00,240 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 51 states. [2022-04-28 05:56:00,240 INFO L87 Difference]: Start difference. First operand has 50 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 51 states. [2022-04-28 05:56:00,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:00,242 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2022-04-28 05:56:00,242 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2022-04-28 05:56:00,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:56:00,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:56:00,243 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:56:00,243 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:56:00,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 05:56:00,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 67 transitions. [2022-04-28 05:56:00,245 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 67 transitions. Word has length 23 [2022-04-28 05:56:00,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:56:00,245 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 67 transitions. [2022-04-28 05:56:00,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 05:56:00,245 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 67 transitions. [2022-04-28 05:56:05,634 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:56:05,634 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 67 transitions. [2022-04-28 05:56:05,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 05:56:05,636 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:56:05,637 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:56:05,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 05:56:05,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:56:05,837 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:56:05,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:56:05,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1676885497, now seen corresponding path program 1 times [2022-04-28 05:56:05,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:05,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [8803120] [2022-04-28 05:56:05,838 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:56:05,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1676885497, now seen corresponding path program 2 times [2022-04-28 05:56:05,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:56:05,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532922241] [2022-04-28 05:56:05,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:56:05,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:56:05,849 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:56:05,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [693641891] [2022-04-28 05:56:05,849 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:56:05,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:56:05,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:56:05,859 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:56:05,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 05:56:05,902 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:56:05,902 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:56:05,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 05:56:05,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:56:05,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:56:06,093 INFO L272 TraceCheckUtils]: 0: Hoare triple {1042#true} call ULTIMATE.init(); {1042#true} is VALID [2022-04-28 05:56:06,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {1042#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1042#true} is VALID [2022-04-28 05:56:06,093 INFO L290 TraceCheckUtils]: 2: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-28 05:56:06,094 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1042#true} {1042#true} #102#return; {1042#true} is VALID [2022-04-28 05:56:06,094 INFO L272 TraceCheckUtils]: 4: Hoare triple {1042#true} call #t~ret9 := main(); {1042#true} is VALID [2022-04-28 05:56:06,094 INFO L290 TraceCheckUtils]: 5: Hoare triple {1042#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {1042#true} is VALID [2022-04-28 05:56:06,094 INFO L272 TraceCheckUtils]: 6: Hoare triple {1042#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1042#true} is VALID [2022-04-28 05:56:06,094 INFO L290 TraceCheckUtils]: 7: Hoare triple {1042#true} ~cond := #in~cond; {1042#true} is VALID [2022-04-28 05:56:06,094 INFO L290 TraceCheckUtils]: 8: Hoare triple {1042#true} assume !(0 == ~cond); {1042#true} is VALID [2022-04-28 05:56:06,094 INFO L290 TraceCheckUtils]: 9: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-28 05:56:06,095 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1042#true} {1042#true} #90#return; {1042#true} is VALID [2022-04-28 05:56:06,095 INFO L272 TraceCheckUtils]: 11: Hoare triple {1042#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {1042#true} is VALID [2022-04-28 05:56:06,095 INFO L290 TraceCheckUtils]: 12: Hoare triple {1042#true} ~cond := #in~cond; {1042#true} is VALID [2022-04-28 05:56:06,095 INFO L290 TraceCheckUtils]: 13: Hoare triple {1042#true} assume !(0 == ~cond); {1042#true} is VALID [2022-04-28 05:56:06,095 INFO L290 TraceCheckUtils]: 14: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-28 05:56:06,095 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1042#true} {1042#true} #92#return; {1042#true} is VALID [2022-04-28 05:56:06,095 INFO L290 TraceCheckUtils]: 16: Hoare triple {1042#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1042#true} is VALID [2022-04-28 05:56:06,095 INFO L290 TraceCheckUtils]: 17: Hoare triple {1042#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1042#true} is VALID [2022-04-28 05:56:06,096 INFO L290 TraceCheckUtils]: 18: Hoare triple {1042#true} assume !!(#t~post6 < 100);havoc #t~post6; {1042#true} is VALID [2022-04-28 05:56:06,096 INFO L272 TraceCheckUtils]: 19: Hoare triple {1042#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1042#true} is VALID [2022-04-28 05:56:06,097 INFO L290 TraceCheckUtils]: 20: Hoare triple {1042#true} ~cond := #in~cond; {1107#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:56:06,098 INFO L290 TraceCheckUtils]: 21: Hoare triple {1107#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1111#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:56:06,098 INFO L290 TraceCheckUtils]: 22: Hoare triple {1111#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1111#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:56:06,099 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1111#(not (= |__VERIFIER_assert_#in~cond| 0))} {1042#true} #94#return; {1118#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4) (* main_~r~0 4)))} is VALID [2022-04-28 05:56:06,100 INFO L290 TraceCheckUtils]: 24: Hoare triple {1118#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4) (* main_~r~0 4)))} assume !(0 != ~r~0); {1122#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} is VALID [2022-04-28 05:56:06,100 INFO L272 TraceCheckUtils]: 25: Hoare triple {1122#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1126#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:56:06,101 INFO L290 TraceCheckUtils]: 26: Hoare triple {1126#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1130#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:56:06,101 INFO L290 TraceCheckUtils]: 27: Hoare triple {1130#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1043#false} is VALID [2022-04-28 05:56:06,101 INFO L290 TraceCheckUtils]: 28: Hoare triple {1043#false} assume !false; {1043#false} is VALID [2022-04-28 05:56:06,102 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:56:06,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:56:06,522 INFO L290 TraceCheckUtils]: 28: Hoare triple {1043#false} assume !false; {1043#false} is VALID [2022-04-28 05:56:06,523 INFO L290 TraceCheckUtils]: 27: Hoare triple {1130#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1043#false} is VALID [2022-04-28 05:56:06,523 INFO L290 TraceCheckUtils]: 26: Hoare triple {1126#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1130#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:56:06,524 INFO L272 TraceCheckUtils]: 25: Hoare triple {1122#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1126#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:56:06,525 INFO L290 TraceCheckUtils]: 24: Hoare triple {1149#(or (not (= main_~r~0 0)) (= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4))))} assume !(0 != ~r~0); {1122#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} is VALID [2022-04-28 05:56:06,525 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1111#(not (= |__VERIFIER_assert_#in~cond| 0))} {1042#true} #94#return; {1149#(or (not (= main_~r~0 0)) (= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4))))} is VALID [2022-04-28 05:56:06,526 INFO L290 TraceCheckUtils]: 22: Hoare triple {1111#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1111#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:56:06,526 INFO L290 TraceCheckUtils]: 21: Hoare triple {1162#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1111#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:56:06,527 INFO L290 TraceCheckUtils]: 20: Hoare triple {1042#true} ~cond := #in~cond; {1162#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 05:56:06,527 INFO L272 TraceCheckUtils]: 19: Hoare triple {1042#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1042#true} is VALID [2022-04-28 05:56:06,527 INFO L290 TraceCheckUtils]: 18: Hoare triple {1042#true} assume !!(#t~post6 < 100);havoc #t~post6; {1042#true} is VALID [2022-04-28 05:56:06,527 INFO L290 TraceCheckUtils]: 17: Hoare triple {1042#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1042#true} is VALID [2022-04-28 05:56:06,527 INFO L290 TraceCheckUtils]: 16: Hoare triple {1042#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1042#true} is VALID [2022-04-28 05:56:06,527 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1042#true} {1042#true} #92#return; {1042#true} is VALID [2022-04-28 05:56:06,528 INFO L290 TraceCheckUtils]: 14: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-28 05:56:06,528 INFO L290 TraceCheckUtils]: 13: Hoare triple {1042#true} assume !(0 == ~cond); {1042#true} is VALID [2022-04-28 05:56:06,528 INFO L290 TraceCheckUtils]: 12: Hoare triple {1042#true} ~cond := #in~cond; {1042#true} is VALID [2022-04-28 05:56:06,528 INFO L272 TraceCheckUtils]: 11: Hoare triple {1042#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {1042#true} is VALID [2022-04-28 05:56:06,528 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1042#true} {1042#true} #90#return; {1042#true} is VALID [2022-04-28 05:56:06,528 INFO L290 TraceCheckUtils]: 9: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-28 05:56:06,528 INFO L290 TraceCheckUtils]: 8: Hoare triple {1042#true} assume !(0 == ~cond); {1042#true} is VALID [2022-04-28 05:56:06,528 INFO L290 TraceCheckUtils]: 7: Hoare triple {1042#true} ~cond := #in~cond; {1042#true} is VALID [2022-04-28 05:56:06,529 INFO L272 TraceCheckUtils]: 6: Hoare triple {1042#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1042#true} is VALID [2022-04-28 05:56:06,529 INFO L290 TraceCheckUtils]: 5: Hoare triple {1042#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {1042#true} is VALID [2022-04-28 05:56:06,529 INFO L272 TraceCheckUtils]: 4: Hoare triple {1042#true} call #t~ret9 := main(); {1042#true} is VALID [2022-04-28 05:56:06,529 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1042#true} {1042#true} #102#return; {1042#true} is VALID [2022-04-28 05:56:06,529 INFO L290 TraceCheckUtils]: 2: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-28 05:56:06,529 INFO L290 TraceCheckUtils]: 1: Hoare triple {1042#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1042#true} is VALID [2022-04-28 05:56:06,529 INFO L272 TraceCheckUtils]: 0: Hoare triple {1042#true} call ULTIMATE.init(); {1042#true} is VALID [2022-04-28 05:56:06,530 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:56:06,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:56:06,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532922241] [2022-04-28 05:56:06,530 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:56:06,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693641891] [2022-04-28 05:56:06,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693641891] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:56:06,530 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:56:06,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-28 05:56:06,530 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:56:06,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [8803120] [2022-04-28 05:56:06,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [8803120] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:56:06,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:56:06,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 05:56:06,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965847500] [2022-04-28 05:56:06,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:56:06,531 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29 [2022-04-28 05:56:06,531 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:56:06,532 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 05:56:06,552 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:56:06,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 05:56:06,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:06,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 05:56:06,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-28 05:56:06,553 INFO L87 Difference]: Start difference. First operand 50 states and 67 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 05:56:06,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:06,917 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2022-04-28 05:56:06,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 05:56:06,917 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29 [2022-04-28 05:56:06,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:56:06,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 05:56:06,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-28 05:56:06,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 05:56:06,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-28 05:56:06,920 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 47 transitions. [2022-04-28 05:56:06,957 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:56:06,958 INFO L225 Difference]: With dead ends: 57 [2022-04-28 05:56:06,958 INFO L226 Difference]: Without dead ends: 52 [2022-04-28 05:56:06,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-28 05:56:06,959 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 25 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 05:56:06,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 135 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 05:56:06,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-28 05:56:06,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 36. [2022-04-28 05:56:06,975 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:56:06,976 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 05:56:06,976 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 05:56:06,976 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 05:56:06,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:06,978 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-28 05:56:06,978 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-28 05:56:06,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:56:06,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:56:06,979 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 52 states. [2022-04-28 05:56:06,979 INFO L87 Difference]: Start difference. First operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 52 states. [2022-04-28 05:56:06,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:06,980 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-28 05:56:06,981 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-28 05:56:06,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:56:06,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:56:06,981 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:56:06,981 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:56:06,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 05:56:06,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2022-04-28 05:56:06,982 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 29 [2022-04-28 05:56:06,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:56:06,983 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2022-04-28 05:56:06,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 05:56:06,983 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 43 transitions. [2022-04-28 05:56:08,223 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:56:08,223 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-04-28 05:56:08,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 05:56:08,224 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:56:08,224 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:56:08,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-28 05:56:08,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:56:08,435 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:56:08,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:56:08,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1154059858, now seen corresponding path program 1 times [2022-04-28 05:56:08,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:08,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1141759142] [2022-04-28 05:56:08,436 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:56:08,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1154059858, now seen corresponding path program 2 times [2022-04-28 05:56:08,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:56:08,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227400235] [2022-04-28 05:56:08,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:56:08,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:56:08,447 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:56:08,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1426338105] [2022-04-28 05:56:08,447 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:56:08,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:56:08,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:56:08,448 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:56:08,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-28 05:56:08,632 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:56:08,632 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:56:08,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 05:56:08,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:56:08,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:56:08,829 INFO L272 TraceCheckUtils]: 0: Hoare triple {1521#true} call ULTIMATE.init(); {1521#true} is VALID [2022-04-28 05:56:08,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {1521#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1529#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:08,831 INFO L290 TraceCheckUtils]: 2: Hoare triple {1529#(<= ~counter~0 0)} assume true; {1529#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:08,832 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1529#(<= ~counter~0 0)} {1521#true} #102#return; {1529#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:08,832 INFO L272 TraceCheckUtils]: 4: Hoare triple {1529#(<= ~counter~0 0)} call #t~ret9 := main(); {1529#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:08,832 INFO L290 TraceCheckUtils]: 5: Hoare triple {1529#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {1529#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:08,833 INFO L272 TraceCheckUtils]: 6: Hoare triple {1529#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1529#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:08,833 INFO L290 TraceCheckUtils]: 7: Hoare triple {1529#(<= ~counter~0 0)} ~cond := #in~cond; {1529#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:08,834 INFO L290 TraceCheckUtils]: 8: Hoare triple {1529#(<= ~counter~0 0)} assume !(0 == ~cond); {1529#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:08,834 INFO L290 TraceCheckUtils]: 9: Hoare triple {1529#(<= ~counter~0 0)} assume true; {1529#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:08,835 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1529#(<= ~counter~0 0)} {1529#(<= ~counter~0 0)} #90#return; {1529#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:08,835 INFO L272 TraceCheckUtils]: 11: Hoare triple {1529#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {1529#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:08,836 INFO L290 TraceCheckUtils]: 12: Hoare triple {1529#(<= ~counter~0 0)} ~cond := #in~cond; {1529#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:08,836 INFO L290 TraceCheckUtils]: 13: Hoare triple {1529#(<= ~counter~0 0)} assume !(0 == ~cond); {1529#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:08,836 INFO L290 TraceCheckUtils]: 14: Hoare triple {1529#(<= ~counter~0 0)} assume true; {1529#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:08,837 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1529#(<= ~counter~0 0)} {1529#(<= ~counter~0 0)} #92#return; {1529#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:08,837 INFO L290 TraceCheckUtils]: 16: Hoare triple {1529#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1529#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:08,838 INFO L290 TraceCheckUtils]: 17: Hoare triple {1529#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1578#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:08,838 INFO L290 TraceCheckUtils]: 18: Hoare triple {1578#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {1578#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:08,839 INFO L272 TraceCheckUtils]: 19: Hoare triple {1578#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1578#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:08,840 INFO L290 TraceCheckUtils]: 20: Hoare triple {1578#(<= ~counter~0 1)} ~cond := #in~cond; {1578#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:08,840 INFO L290 TraceCheckUtils]: 21: Hoare triple {1578#(<= ~counter~0 1)} assume !(0 == ~cond); {1578#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:08,841 INFO L290 TraceCheckUtils]: 22: Hoare triple {1578#(<= ~counter~0 1)} assume true; {1578#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:08,841 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1578#(<= ~counter~0 1)} {1578#(<= ~counter~0 1)} #94#return; {1578#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:08,842 INFO L290 TraceCheckUtils]: 24: Hoare triple {1578#(<= ~counter~0 1)} assume !!(0 != ~r~0); {1578#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:08,843 INFO L290 TraceCheckUtils]: 25: Hoare triple {1578#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1603#(<= |main_#t~post7| 1)} is VALID [2022-04-28 05:56:08,843 INFO L290 TraceCheckUtils]: 26: Hoare triple {1603#(<= |main_#t~post7| 1)} assume !(#t~post7 < 100);havoc #t~post7; {1522#false} is VALID [2022-04-28 05:56:08,843 INFO L290 TraceCheckUtils]: 27: Hoare triple {1522#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {1522#false} is VALID [2022-04-28 05:56:08,844 INFO L290 TraceCheckUtils]: 28: Hoare triple {1522#false} assume !(#t~post8 < 100);havoc #t~post8; {1522#false} is VALID [2022-04-28 05:56:08,844 INFO L290 TraceCheckUtils]: 29: Hoare triple {1522#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1522#false} is VALID [2022-04-28 05:56:08,844 INFO L290 TraceCheckUtils]: 30: Hoare triple {1522#false} assume !(#t~post6 < 100);havoc #t~post6; {1522#false} is VALID [2022-04-28 05:56:08,844 INFO L272 TraceCheckUtils]: 31: Hoare triple {1522#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1522#false} is VALID [2022-04-28 05:56:08,844 INFO L290 TraceCheckUtils]: 32: Hoare triple {1522#false} ~cond := #in~cond; {1522#false} is VALID [2022-04-28 05:56:08,845 INFO L290 TraceCheckUtils]: 33: Hoare triple {1522#false} assume 0 == ~cond; {1522#false} is VALID [2022-04-28 05:56:08,845 INFO L290 TraceCheckUtils]: 34: Hoare triple {1522#false} assume !false; {1522#false} is VALID [2022-04-28 05:56:08,845 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:56:08,845 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 05:56:08,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:56:08,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227400235] [2022-04-28 05:56:08,846 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:56:08,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426338105] [2022-04-28 05:56:08,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426338105] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:56:08,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:56:08,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 05:56:08,846 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:56:08,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1141759142] [2022-04-28 05:56:08,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1141759142] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:56:08,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:56:08,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 05:56:08,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572853371] [2022-04-28 05:56:08,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:56:08,847 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 35 [2022-04-28 05:56:08,848 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:56:08,848 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 05:56:08,881 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:56:08,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 05:56:08,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:08,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 05:56:08,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 05:56:08,883 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 05:56:09,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:09,032 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2022-04-28 05:56:09,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 05:56:09,033 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 35 [2022-04-28 05:56:09,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:56:09,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 05:56:09,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-04-28 05:56:09,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 05:56:09,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-04-28 05:56:09,036 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 77 transitions. [2022-04-28 05:56:09,098 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:56:09,099 INFO L225 Difference]: With dead ends: 65 [2022-04-28 05:56:09,099 INFO L226 Difference]: Without dead ends: 44 [2022-04-28 05:56:09,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 05:56:09,100 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 6 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 05:56:09,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 103 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 05:56:09,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-28 05:56:09,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-28 05:56:09,128 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:56:09,128 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 05:56:09,129 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 05:56:09,129 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 05:56:09,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:09,130 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-04-28 05:56:09,130 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-04-28 05:56:09,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:56:09,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:56:09,131 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 44 states. [2022-04-28 05:56:09,131 INFO L87 Difference]: Start difference. First operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 44 states. [2022-04-28 05:56:09,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:09,133 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-04-28 05:56:09,133 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-04-28 05:56:09,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:56:09,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:56:09,133 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:56:09,133 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:56:09,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 05:56:09,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2022-04-28 05:56:09,135 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 35 [2022-04-28 05:56:09,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:56:09,135 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2022-04-28 05:56:09,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 05:56:09,136 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 51 transitions. [2022-04-28 05:56:10,859 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:56:10,859 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-04-28 05:56:10,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 05:56:10,860 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:56:10,860 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:56:10,864 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-28 05:56:11,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:56:11,064 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:56:11,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:56:11,065 INFO L85 PathProgramCache]: Analyzing trace with hash -174895632, now seen corresponding path program 1 times [2022-04-28 05:56:11,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:11,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [53229386] [2022-04-28 05:56:11,065 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:56:11,065 INFO L85 PathProgramCache]: Analyzing trace with hash -174895632, now seen corresponding path program 2 times [2022-04-28 05:56:11,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:56:11,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546480833] [2022-04-28 05:56:11,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:56:11,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:56:11,079 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:56:11,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [767734291] [2022-04-28 05:56:11,079 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:56:11,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:56:11,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:56:11,080 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:56:11,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-28 05:56:11,115 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:56:11,116 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:56:11,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 05:56:11,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:56:11,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:56:11,318 INFO L272 TraceCheckUtils]: 0: Hoare triple {1936#true} call ULTIMATE.init(); {1936#true} is VALID [2022-04-28 05:56:11,319 INFO L290 TraceCheckUtils]: 1: Hoare triple {1936#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1944#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:11,319 INFO L290 TraceCheckUtils]: 2: Hoare triple {1944#(<= ~counter~0 0)} assume true; {1944#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:11,320 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1944#(<= ~counter~0 0)} {1936#true} #102#return; {1944#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:11,320 INFO L272 TraceCheckUtils]: 4: Hoare triple {1944#(<= ~counter~0 0)} call #t~ret9 := main(); {1944#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:11,320 INFO L290 TraceCheckUtils]: 5: Hoare triple {1944#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {1944#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:11,321 INFO L272 TraceCheckUtils]: 6: Hoare triple {1944#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1944#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:11,321 INFO L290 TraceCheckUtils]: 7: Hoare triple {1944#(<= ~counter~0 0)} ~cond := #in~cond; {1944#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:11,322 INFO L290 TraceCheckUtils]: 8: Hoare triple {1944#(<= ~counter~0 0)} assume !(0 == ~cond); {1944#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:11,322 INFO L290 TraceCheckUtils]: 9: Hoare triple {1944#(<= ~counter~0 0)} assume true; {1944#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:11,323 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1944#(<= ~counter~0 0)} {1944#(<= ~counter~0 0)} #90#return; {1944#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:11,323 INFO L272 TraceCheckUtils]: 11: Hoare triple {1944#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {1944#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:11,324 INFO L290 TraceCheckUtils]: 12: Hoare triple {1944#(<= ~counter~0 0)} ~cond := #in~cond; {1944#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:11,324 INFO L290 TraceCheckUtils]: 13: Hoare triple {1944#(<= ~counter~0 0)} assume !(0 == ~cond); {1944#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:11,324 INFO L290 TraceCheckUtils]: 14: Hoare triple {1944#(<= ~counter~0 0)} assume true; {1944#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:11,325 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1944#(<= ~counter~0 0)} {1944#(<= ~counter~0 0)} #92#return; {1944#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:11,325 INFO L290 TraceCheckUtils]: 16: Hoare triple {1944#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1944#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:11,326 INFO L290 TraceCheckUtils]: 17: Hoare triple {1944#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1993#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:11,326 INFO L290 TraceCheckUtils]: 18: Hoare triple {1993#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {1993#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:11,330 INFO L272 TraceCheckUtils]: 19: Hoare triple {1993#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1993#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:11,331 INFO L290 TraceCheckUtils]: 20: Hoare triple {1993#(<= ~counter~0 1)} ~cond := #in~cond; {1993#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:11,332 INFO L290 TraceCheckUtils]: 21: Hoare triple {1993#(<= ~counter~0 1)} assume !(0 == ~cond); {1993#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:11,332 INFO L290 TraceCheckUtils]: 22: Hoare triple {1993#(<= ~counter~0 1)} assume true; {1993#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:11,333 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1993#(<= ~counter~0 1)} {1993#(<= ~counter~0 1)} #94#return; {1993#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:11,335 INFO L290 TraceCheckUtils]: 24: Hoare triple {1993#(<= ~counter~0 1)} assume !!(0 != ~r~0); {1993#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:11,335 INFO L290 TraceCheckUtils]: 25: Hoare triple {1993#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2018#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:11,336 INFO L290 TraceCheckUtils]: 26: Hoare triple {2018#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {2018#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:11,336 INFO L272 TraceCheckUtils]: 27: Hoare triple {2018#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2018#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:11,336 INFO L290 TraceCheckUtils]: 28: Hoare triple {2018#(<= ~counter~0 2)} ~cond := #in~cond; {2018#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:11,337 INFO L290 TraceCheckUtils]: 29: Hoare triple {2018#(<= ~counter~0 2)} assume !(0 == ~cond); {2018#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:11,337 INFO L290 TraceCheckUtils]: 30: Hoare triple {2018#(<= ~counter~0 2)} assume true; {2018#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:11,338 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2018#(<= ~counter~0 2)} {2018#(<= ~counter~0 2)} #96#return; {2018#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:11,338 INFO L290 TraceCheckUtils]: 32: Hoare triple {2018#(<= ~counter~0 2)} assume !(~r~0 > 0); {2018#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:11,338 INFO L290 TraceCheckUtils]: 33: Hoare triple {2018#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {2043#(<= |main_#t~post8| 2)} is VALID [2022-04-28 05:56:11,339 INFO L290 TraceCheckUtils]: 34: Hoare triple {2043#(<= |main_#t~post8| 2)} assume !(#t~post8 < 100);havoc #t~post8; {1937#false} is VALID [2022-04-28 05:56:11,339 INFO L290 TraceCheckUtils]: 35: Hoare triple {1937#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1937#false} is VALID [2022-04-28 05:56:11,339 INFO L290 TraceCheckUtils]: 36: Hoare triple {1937#false} assume !(#t~post6 < 100);havoc #t~post6; {1937#false} is VALID [2022-04-28 05:56:11,339 INFO L272 TraceCheckUtils]: 37: Hoare triple {1937#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1937#false} is VALID [2022-04-28 05:56:11,339 INFO L290 TraceCheckUtils]: 38: Hoare triple {1937#false} ~cond := #in~cond; {1937#false} is VALID [2022-04-28 05:56:11,339 INFO L290 TraceCheckUtils]: 39: Hoare triple {1937#false} assume 0 == ~cond; {1937#false} is VALID [2022-04-28 05:56:11,339 INFO L290 TraceCheckUtils]: 40: Hoare triple {1937#false} assume !false; {1937#false} is VALID [2022-04-28 05:56:11,339 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:56:11,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:56:11,560 INFO L290 TraceCheckUtils]: 40: Hoare triple {1937#false} assume !false; {1937#false} is VALID [2022-04-28 05:56:11,560 INFO L290 TraceCheckUtils]: 39: Hoare triple {1937#false} assume 0 == ~cond; {1937#false} is VALID [2022-04-28 05:56:11,560 INFO L290 TraceCheckUtils]: 38: Hoare triple {1937#false} ~cond := #in~cond; {1937#false} is VALID [2022-04-28 05:56:11,560 INFO L272 TraceCheckUtils]: 37: Hoare triple {1937#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1937#false} is VALID [2022-04-28 05:56:11,560 INFO L290 TraceCheckUtils]: 36: Hoare triple {1937#false} assume !(#t~post6 < 100);havoc #t~post6; {1937#false} is VALID [2022-04-28 05:56:11,560 INFO L290 TraceCheckUtils]: 35: Hoare triple {1937#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1937#false} is VALID [2022-04-28 05:56:11,561 INFO L290 TraceCheckUtils]: 34: Hoare triple {2083#(< |main_#t~post8| 100)} assume !(#t~post8 < 100);havoc #t~post8; {1937#false} is VALID [2022-04-28 05:56:11,561 INFO L290 TraceCheckUtils]: 33: Hoare triple {2087#(< ~counter~0 100)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {2083#(< |main_#t~post8| 100)} is VALID [2022-04-28 05:56:11,561 INFO L290 TraceCheckUtils]: 32: Hoare triple {2087#(< ~counter~0 100)} assume !(~r~0 > 0); {2087#(< ~counter~0 100)} is VALID [2022-04-28 05:56:11,562 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1936#true} {2087#(< ~counter~0 100)} #96#return; {2087#(< ~counter~0 100)} is VALID [2022-04-28 05:56:11,562 INFO L290 TraceCheckUtils]: 30: Hoare triple {1936#true} assume true; {1936#true} is VALID [2022-04-28 05:56:11,562 INFO L290 TraceCheckUtils]: 29: Hoare triple {1936#true} assume !(0 == ~cond); {1936#true} is VALID [2022-04-28 05:56:11,562 INFO L290 TraceCheckUtils]: 28: Hoare triple {1936#true} ~cond := #in~cond; {1936#true} is VALID [2022-04-28 05:56:11,563 INFO L272 TraceCheckUtils]: 27: Hoare triple {2087#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1936#true} is VALID [2022-04-28 05:56:11,563 INFO L290 TraceCheckUtils]: 26: Hoare triple {2087#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {2087#(< ~counter~0 100)} is VALID [2022-04-28 05:56:11,563 INFO L290 TraceCheckUtils]: 25: Hoare triple {2112#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2087#(< ~counter~0 100)} is VALID [2022-04-28 05:56:11,564 INFO L290 TraceCheckUtils]: 24: Hoare triple {2112#(< ~counter~0 99)} assume !!(0 != ~r~0); {2112#(< ~counter~0 99)} is VALID [2022-04-28 05:56:11,564 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1936#true} {2112#(< ~counter~0 99)} #94#return; {2112#(< ~counter~0 99)} is VALID [2022-04-28 05:56:11,564 INFO L290 TraceCheckUtils]: 22: Hoare triple {1936#true} assume true; {1936#true} is VALID [2022-04-28 05:56:11,566 INFO L290 TraceCheckUtils]: 21: Hoare triple {1936#true} assume !(0 == ~cond); {1936#true} is VALID [2022-04-28 05:56:11,566 INFO L290 TraceCheckUtils]: 20: Hoare triple {1936#true} ~cond := #in~cond; {1936#true} is VALID [2022-04-28 05:56:11,566 INFO L272 TraceCheckUtils]: 19: Hoare triple {2112#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1936#true} is VALID [2022-04-28 05:56:11,567 INFO L290 TraceCheckUtils]: 18: Hoare triple {2112#(< ~counter~0 99)} assume !!(#t~post6 < 100);havoc #t~post6; {2112#(< ~counter~0 99)} is VALID [2022-04-28 05:56:11,567 INFO L290 TraceCheckUtils]: 17: Hoare triple {2137#(< ~counter~0 98)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2112#(< ~counter~0 99)} is VALID [2022-04-28 05:56:11,567 INFO L290 TraceCheckUtils]: 16: Hoare triple {2137#(< ~counter~0 98)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {2137#(< ~counter~0 98)} is VALID [2022-04-28 05:56:11,568 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1936#true} {2137#(< ~counter~0 98)} #92#return; {2137#(< ~counter~0 98)} is VALID [2022-04-28 05:56:11,568 INFO L290 TraceCheckUtils]: 14: Hoare triple {1936#true} assume true; {1936#true} is VALID [2022-04-28 05:56:11,568 INFO L290 TraceCheckUtils]: 13: Hoare triple {1936#true} assume !(0 == ~cond); {1936#true} is VALID [2022-04-28 05:56:11,568 INFO L290 TraceCheckUtils]: 12: Hoare triple {1936#true} ~cond := #in~cond; {1936#true} is VALID [2022-04-28 05:56:11,568 INFO L272 TraceCheckUtils]: 11: Hoare triple {2137#(< ~counter~0 98)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {1936#true} is VALID [2022-04-28 05:56:11,569 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1936#true} {2137#(< ~counter~0 98)} #90#return; {2137#(< ~counter~0 98)} is VALID [2022-04-28 05:56:11,569 INFO L290 TraceCheckUtils]: 9: Hoare triple {1936#true} assume true; {1936#true} is VALID [2022-04-28 05:56:11,569 INFO L290 TraceCheckUtils]: 8: Hoare triple {1936#true} assume !(0 == ~cond); {1936#true} is VALID [2022-04-28 05:56:11,569 INFO L290 TraceCheckUtils]: 7: Hoare triple {1936#true} ~cond := #in~cond; {1936#true} is VALID [2022-04-28 05:56:11,569 INFO L272 TraceCheckUtils]: 6: Hoare triple {2137#(< ~counter~0 98)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1936#true} is VALID [2022-04-28 05:56:11,569 INFO L290 TraceCheckUtils]: 5: Hoare triple {2137#(< ~counter~0 98)} 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 98)} is VALID [2022-04-28 05:56:11,570 INFO L272 TraceCheckUtils]: 4: Hoare triple {2137#(< ~counter~0 98)} call #t~ret9 := main(); {2137#(< ~counter~0 98)} is VALID [2022-04-28 05:56:11,570 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2137#(< ~counter~0 98)} {1936#true} #102#return; {2137#(< ~counter~0 98)} is VALID [2022-04-28 05:56:11,570 INFO L290 TraceCheckUtils]: 2: Hoare triple {2137#(< ~counter~0 98)} assume true; {2137#(< ~counter~0 98)} is VALID [2022-04-28 05:56:11,571 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 98)} is VALID [2022-04-28 05:56:11,571 INFO L272 TraceCheckUtils]: 0: Hoare triple {1936#true} call ULTIMATE.init(); {1936#true} is VALID [2022-04-28 05:56:11,571 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-28 05:56:11,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:56:11,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546480833] [2022-04-28 05:56:11,571 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:56:11,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767734291] [2022-04-28 05:56:11,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [767734291] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 05:56:11,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 05:56:11,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2022-04-28 05:56:11,572 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:56:11,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [53229386] [2022-04-28 05:56:11,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [53229386] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:56:11,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:56:11,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 05:56:11,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493031664] [2022-04-28 05:56:11,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:56:11,573 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 41 [2022-04-28 05:56:11,573 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:56:11,573 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 05:56:11,596 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:56:11,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 05:56:11,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:11,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 05:56:11,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-28 05:56:11,597 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 05:56:11,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:11,758 INFO L93 Difference]: Finished difference Result 74 states and 89 transitions. [2022-04-28 05:56:11,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 05:56:11,758 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 41 [2022-04-28 05:56:11,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:56:11,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 05:56:11,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2022-04-28 05:56:11,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 05:56:11,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2022-04-28 05:56:11,761 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 87 transitions. [2022-04-28 05:56:11,818 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:56:11,819 INFO L225 Difference]: With dead ends: 74 [2022-04-28 05:56:11,819 INFO L226 Difference]: Without dead ends: 53 [2022-04-28 05:56:11,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-28 05:56:11,820 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 22 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 05:56:11,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 125 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 05:56:11,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-28 05:56:11,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2022-04-28 05:56:11,859 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:56:11,860 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 52 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 05:56:11,860 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 52 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 05:56:11,860 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 52 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 05:56:11,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:11,862 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-04-28 05:56:11,862 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2022-04-28 05:56:11,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:56:11,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:56:11,862 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 53 states. [2022-04-28 05:56:11,862 INFO L87 Difference]: Start difference. First operand has 52 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 53 states. [2022-04-28 05:56:11,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:11,864 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-04-28 05:56:11,864 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2022-04-28 05:56:11,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:56:11,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:56:11,864 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:56:11,864 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:56:11,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 05:56:11,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2022-04-28 05:56:11,865 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 41 [2022-04-28 05:56:11,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:56:11,866 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2022-04-28 05:56:11,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 05:56:11,866 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 60 transitions. [2022-04-28 05:56:12,374 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:56:12,375 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2022-04-28 05:56:12,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-28 05:56:12,375 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:56:12,375 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:56:12,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-28 05:56:12,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:56:12,576 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:56:12,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:56:12,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1292932747, now seen corresponding path program 1 times [2022-04-28 05:56:12,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:12,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2038360577] [2022-04-28 05:56:12,577 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:56:12,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1292932747, now seen corresponding path program 2 times [2022-04-28 05:56:12,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:56:12,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359117271] [2022-04-28 05:56:12,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:56:12,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:56:12,588 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:56:12,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [619893689] [2022-04-28 05:56:12,589 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:56:12,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:56:12,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:56:12,590 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:56:12,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-28 05:56:12,626 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:56:12,626 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:56:12,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 05:56:12,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:56:12,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:56:12,850 INFO L272 TraceCheckUtils]: 0: Hoare triple {2549#true} call ULTIMATE.init(); {2549#true} is VALID [2022-04-28 05:56:12,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {2549#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2557#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:12,856 INFO L290 TraceCheckUtils]: 2: Hoare triple {2557#(<= ~counter~0 0)} assume true; {2557#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:12,856 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2557#(<= ~counter~0 0)} {2549#true} #102#return; {2557#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:12,857 INFO L272 TraceCheckUtils]: 4: Hoare triple {2557#(<= ~counter~0 0)} call #t~ret9 := main(); {2557#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:12,859 INFO L290 TraceCheckUtils]: 5: Hoare triple {2557#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {2557#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:12,859 INFO L272 TraceCheckUtils]: 6: Hoare triple {2557#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {2557#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:12,860 INFO L290 TraceCheckUtils]: 7: Hoare triple {2557#(<= ~counter~0 0)} ~cond := #in~cond; {2557#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:12,860 INFO L290 TraceCheckUtils]: 8: Hoare triple {2557#(<= ~counter~0 0)} assume !(0 == ~cond); {2557#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:12,860 INFO L290 TraceCheckUtils]: 9: Hoare triple {2557#(<= ~counter~0 0)} assume true; {2557#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:12,861 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2557#(<= ~counter~0 0)} {2557#(<= ~counter~0 0)} #90#return; {2557#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:12,862 INFO L272 TraceCheckUtils]: 11: Hoare triple {2557#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {2557#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:12,865 INFO L290 TraceCheckUtils]: 12: Hoare triple {2557#(<= ~counter~0 0)} ~cond := #in~cond; {2557#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:12,865 INFO L290 TraceCheckUtils]: 13: Hoare triple {2557#(<= ~counter~0 0)} assume !(0 == ~cond); {2557#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:12,866 INFO L290 TraceCheckUtils]: 14: Hoare triple {2557#(<= ~counter~0 0)} assume true; {2557#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:12,866 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2557#(<= ~counter~0 0)} {2557#(<= ~counter~0 0)} #92#return; {2557#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:12,867 INFO L290 TraceCheckUtils]: 16: Hoare triple {2557#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {2557#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:12,867 INFO L290 TraceCheckUtils]: 17: Hoare triple {2557#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2606#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:12,867 INFO L290 TraceCheckUtils]: 18: Hoare triple {2606#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {2606#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:12,868 INFO L272 TraceCheckUtils]: 19: Hoare triple {2606#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2606#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:12,868 INFO L290 TraceCheckUtils]: 20: Hoare triple {2606#(<= ~counter~0 1)} ~cond := #in~cond; {2606#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:12,869 INFO L290 TraceCheckUtils]: 21: Hoare triple {2606#(<= ~counter~0 1)} assume !(0 == ~cond); {2606#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:12,869 INFO L290 TraceCheckUtils]: 22: Hoare triple {2606#(<= ~counter~0 1)} assume true; {2606#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:12,870 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2606#(<= ~counter~0 1)} {2606#(<= ~counter~0 1)} #94#return; {2606#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:12,870 INFO L290 TraceCheckUtils]: 24: Hoare triple {2606#(<= ~counter~0 1)} assume !!(0 != ~r~0); {2606#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:12,870 INFO L290 TraceCheckUtils]: 25: Hoare triple {2606#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2631#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:12,871 INFO L290 TraceCheckUtils]: 26: Hoare triple {2631#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {2631#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:12,871 INFO L272 TraceCheckUtils]: 27: Hoare triple {2631#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2631#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:12,872 INFO L290 TraceCheckUtils]: 28: Hoare triple {2631#(<= ~counter~0 2)} ~cond := #in~cond; {2631#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:12,872 INFO L290 TraceCheckUtils]: 29: Hoare triple {2631#(<= ~counter~0 2)} assume !(0 == ~cond); {2631#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:12,872 INFO L290 TraceCheckUtils]: 30: Hoare triple {2631#(<= ~counter~0 2)} assume true; {2631#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:12,873 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2631#(<= ~counter~0 2)} {2631#(<= ~counter~0 2)} #96#return; {2631#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:12,873 INFO L290 TraceCheckUtils]: 32: Hoare triple {2631#(<= ~counter~0 2)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2631#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:12,873 INFO L290 TraceCheckUtils]: 33: Hoare triple {2631#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2656#(<= |main_#t~post7| 2)} is VALID [2022-04-28 05:56:12,874 INFO L290 TraceCheckUtils]: 34: Hoare triple {2656#(<= |main_#t~post7| 2)} assume !(#t~post7 < 100);havoc #t~post7; {2550#false} is VALID [2022-04-28 05:56:12,874 INFO L290 TraceCheckUtils]: 35: Hoare triple {2550#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {2550#false} is VALID [2022-04-28 05:56:12,875 INFO L290 TraceCheckUtils]: 36: Hoare triple {2550#false} assume !(#t~post8 < 100);havoc #t~post8; {2550#false} is VALID [2022-04-28 05:56:12,875 INFO L290 TraceCheckUtils]: 37: Hoare triple {2550#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2550#false} is VALID [2022-04-28 05:56:12,875 INFO L290 TraceCheckUtils]: 38: Hoare triple {2550#false} assume !(#t~post6 < 100);havoc #t~post6; {2550#false} is VALID [2022-04-28 05:56:12,875 INFO L272 TraceCheckUtils]: 39: Hoare triple {2550#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2550#false} is VALID [2022-04-28 05:56:12,875 INFO L290 TraceCheckUtils]: 40: Hoare triple {2550#false} ~cond := #in~cond; {2550#false} is VALID [2022-04-28 05:56:12,875 INFO L290 TraceCheckUtils]: 41: Hoare triple {2550#false} assume 0 == ~cond; {2550#false} is VALID [2022-04-28 05:56:12,875 INFO L290 TraceCheckUtils]: 42: Hoare triple {2550#false} assume !false; {2550#false} is VALID [2022-04-28 05:56:12,877 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:56:12,877 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:56:13,072 INFO L290 TraceCheckUtils]: 42: Hoare triple {2550#false} assume !false; {2550#false} is VALID [2022-04-28 05:56:13,072 INFO L290 TraceCheckUtils]: 41: Hoare triple {2550#false} assume 0 == ~cond; {2550#false} is VALID [2022-04-28 05:56:13,073 INFO L290 TraceCheckUtils]: 40: Hoare triple {2550#false} ~cond := #in~cond; {2550#false} is VALID [2022-04-28 05:56:13,073 INFO L272 TraceCheckUtils]: 39: Hoare triple {2550#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2550#false} is VALID [2022-04-28 05:56:13,073 INFO L290 TraceCheckUtils]: 38: Hoare triple {2550#false} assume !(#t~post6 < 100);havoc #t~post6; {2550#false} is VALID [2022-04-28 05:56:13,073 INFO L290 TraceCheckUtils]: 37: Hoare triple {2550#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2550#false} is VALID [2022-04-28 05:56:13,073 INFO L290 TraceCheckUtils]: 36: Hoare triple {2550#false} assume !(#t~post8 < 100);havoc #t~post8; {2550#false} is VALID [2022-04-28 05:56:13,073 INFO L290 TraceCheckUtils]: 35: Hoare triple {2550#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {2550#false} is VALID [2022-04-28 05:56:13,073 INFO L290 TraceCheckUtils]: 34: Hoare triple {2708#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {2550#false} is VALID [2022-04-28 05:56:13,074 INFO L290 TraceCheckUtils]: 33: Hoare triple {2712#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2708#(< |main_#t~post7| 100)} is VALID [2022-04-28 05:56:13,074 INFO L290 TraceCheckUtils]: 32: Hoare triple {2712#(< ~counter~0 100)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2712#(< ~counter~0 100)} is VALID [2022-04-28 05:56:13,075 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2549#true} {2712#(< ~counter~0 100)} #96#return; {2712#(< ~counter~0 100)} is VALID [2022-04-28 05:56:13,075 INFO L290 TraceCheckUtils]: 30: Hoare triple {2549#true} assume true; {2549#true} is VALID [2022-04-28 05:56:13,075 INFO L290 TraceCheckUtils]: 29: Hoare triple {2549#true} assume !(0 == ~cond); {2549#true} is VALID [2022-04-28 05:56:13,075 INFO L290 TraceCheckUtils]: 28: Hoare triple {2549#true} ~cond := #in~cond; {2549#true} is VALID [2022-04-28 05:56:13,075 INFO L272 TraceCheckUtils]: 27: Hoare triple {2712#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2549#true} is VALID [2022-04-28 05:56:13,075 INFO L290 TraceCheckUtils]: 26: Hoare triple {2712#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {2712#(< ~counter~0 100)} is VALID [2022-04-28 05:56:13,076 INFO L290 TraceCheckUtils]: 25: Hoare triple {2737#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2712#(< ~counter~0 100)} is VALID [2022-04-28 05:56:13,076 INFO L290 TraceCheckUtils]: 24: Hoare triple {2737#(< ~counter~0 99)} assume !!(0 != ~r~0); {2737#(< ~counter~0 99)} is VALID [2022-04-28 05:56:13,077 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2549#true} {2737#(< ~counter~0 99)} #94#return; {2737#(< ~counter~0 99)} is VALID [2022-04-28 05:56:13,077 INFO L290 TraceCheckUtils]: 22: Hoare triple {2549#true} assume true; {2549#true} is VALID [2022-04-28 05:56:13,077 INFO L290 TraceCheckUtils]: 21: Hoare triple {2549#true} assume !(0 == ~cond); {2549#true} is VALID [2022-04-28 05:56:13,077 INFO L290 TraceCheckUtils]: 20: Hoare triple {2549#true} ~cond := #in~cond; {2549#true} is VALID [2022-04-28 05:56:13,077 INFO L272 TraceCheckUtils]: 19: Hoare triple {2737#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2549#true} is VALID [2022-04-28 05:56:13,077 INFO L290 TraceCheckUtils]: 18: Hoare triple {2737#(< ~counter~0 99)} assume !!(#t~post6 < 100);havoc #t~post6; {2737#(< ~counter~0 99)} is VALID [2022-04-28 05:56:13,078 INFO L290 TraceCheckUtils]: 17: Hoare triple {2762#(< ~counter~0 98)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2737#(< ~counter~0 99)} is VALID [2022-04-28 05:56:13,078 INFO L290 TraceCheckUtils]: 16: Hoare triple {2762#(< ~counter~0 98)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {2762#(< ~counter~0 98)} is VALID [2022-04-28 05:56:13,079 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2549#true} {2762#(< ~counter~0 98)} #92#return; {2762#(< ~counter~0 98)} is VALID [2022-04-28 05:56:13,079 INFO L290 TraceCheckUtils]: 14: Hoare triple {2549#true} assume true; {2549#true} is VALID [2022-04-28 05:56:13,079 INFO L290 TraceCheckUtils]: 13: Hoare triple {2549#true} assume !(0 == ~cond); {2549#true} is VALID [2022-04-28 05:56:13,079 INFO L290 TraceCheckUtils]: 12: Hoare triple {2549#true} ~cond := #in~cond; {2549#true} is VALID [2022-04-28 05:56:13,079 INFO L272 TraceCheckUtils]: 11: Hoare triple {2762#(< ~counter~0 98)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {2549#true} is VALID [2022-04-28 05:56:13,080 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2549#true} {2762#(< ~counter~0 98)} #90#return; {2762#(< ~counter~0 98)} is VALID [2022-04-28 05:56:13,080 INFO L290 TraceCheckUtils]: 9: Hoare triple {2549#true} assume true; {2549#true} is VALID [2022-04-28 05:56:13,080 INFO L290 TraceCheckUtils]: 8: Hoare triple {2549#true} assume !(0 == ~cond); {2549#true} is VALID [2022-04-28 05:56:13,080 INFO L290 TraceCheckUtils]: 7: Hoare triple {2549#true} ~cond := #in~cond; {2549#true} is VALID [2022-04-28 05:56:13,080 INFO L272 TraceCheckUtils]: 6: Hoare triple {2762#(< ~counter~0 98)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {2549#true} is VALID [2022-04-28 05:56:13,081 INFO L290 TraceCheckUtils]: 5: Hoare triple {2762#(< ~counter~0 98)} 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 98)} is VALID [2022-04-28 05:56:13,081 INFO L272 TraceCheckUtils]: 4: Hoare triple {2762#(< ~counter~0 98)} call #t~ret9 := main(); {2762#(< ~counter~0 98)} is VALID [2022-04-28 05:56:13,081 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2762#(< ~counter~0 98)} {2549#true} #102#return; {2762#(< ~counter~0 98)} is VALID [2022-04-28 05:56:13,082 INFO L290 TraceCheckUtils]: 2: Hoare triple {2762#(< ~counter~0 98)} assume true; {2762#(< ~counter~0 98)} is VALID [2022-04-28 05:56:13,082 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 98)} is VALID [2022-04-28 05:56:13,082 INFO L272 TraceCheckUtils]: 0: Hoare triple {2549#true} call ULTIMATE.init(); {2549#true} is VALID [2022-04-28 05:56:13,082 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-28 05:56:13,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:56:13,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359117271] [2022-04-28 05:56:13,083 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:56:13,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619893689] [2022-04-28 05:56:13,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [619893689] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:56:13,083 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:56:13,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-28 05:56:13,083 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:56:13,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2038360577] [2022-04-28 05:56:13,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2038360577] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:56:13,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:56:13,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 05:56:13,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130326531] [2022-04-28 05:56:13,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:56:13,084 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 43 [2022-04-28 05:56:13,084 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:56:13,084 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 05:56:13,110 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:56:13,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 05:56:13,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:13,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 05:56:13,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-28 05:56:13,111 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 05:56:13,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:13,282 INFO L93 Difference]: Finished difference Result 75 states and 90 transitions. [2022-04-28 05:56:13,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 05:56:13,283 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 43 [2022-04-28 05:56:13,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:56:13,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 05:56:13,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2022-04-28 05:56:13,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 05:56:13,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2022-04-28 05:56:13,285 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 87 transitions. [2022-04-28 05:56:13,350 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:56:13,351 INFO L225 Difference]: With dead ends: 75 [2022-04-28 05:56:13,351 INFO L226 Difference]: Without dead ends: 54 [2022-04-28 05:56:13,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-04-28 05:56:13,352 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 9 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 05:56:13,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 141 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 05:56:13,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-28 05:56:13,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-28 05:56:13,403 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:56:13,403 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 54 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 05:56:13,404 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 54 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 05:56:13,404 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 54 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 05:56:13,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:13,405 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2022-04-28 05:56:13,405 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2022-04-28 05:56:13,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:56:13,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:56:13,406 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 54 states. [2022-04-28 05:56:13,406 INFO L87 Difference]: Start difference. First operand has 54 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 54 states. [2022-04-28 05:56:13,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:13,407 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2022-04-28 05:56:13,407 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2022-04-28 05:56:13,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:56:13,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:56:13,407 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:56:13,407 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:56:13,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 05:56:13,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2022-04-28 05:56:13,409 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 43 [2022-04-28 05:56:13,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:56:13,409 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2022-04-28 05:56:13,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 05:56:13,409 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 62 transitions. [2022-04-28 05:56:15,476 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 61 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 05:56:15,476 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2022-04-28 05:56:15,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-28 05:56:15,476 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:56:15,476 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:56:15,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-28 05:56:15,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:56:15,677 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:56:15,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:56:15,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1407897436, now seen corresponding path program 1 times [2022-04-28 05:56:15,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:15,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [830414157] [2022-04-28 05:56:15,678 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:56:15,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1407897436, now seen corresponding path program 2 times [2022-04-28 05:56:15,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:56:15,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416938682] [2022-04-28 05:56:15,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:56:15,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:56:15,689 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:56:15,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [161171440] [2022-04-28 05:56:15,689 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:56:15,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:56:15,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:56:15,707 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:56:15,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-28 05:56:15,745 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:56:15,746 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:56:15,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-28 05:56:15,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:56:15,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:56:15,877 INFO L272 TraceCheckUtils]: 0: Hoare triple {3184#true} call ULTIMATE.init(); {3184#true} is VALID [2022-04-28 05:56:15,878 INFO L290 TraceCheckUtils]: 1: Hoare triple {3184#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3184#true} is VALID [2022-04-28 05:56:15,878 INFO L290 TraceCheckUtils]: 2: Hoare triple {3184#true} assume true; {3184#true} is VALID [2022-04-28 05:56:15,878 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3184#true} {3184#true} #102#return; {3184#true} is VALID [2022-04-28 05:56:15,878 INFO L272 TraceCheckUtils]: 4: Hoare triple {3184#true} call #t~ret9 := main(); {3184#true} is VALID [2022-04-28 05:56:15,878 INFO L290 TraceCheckUtils]: 5: Hoare triple {3184#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {3184#true} is VALID [2022-04-28 05:56:15,878 INFO L272 TraceCheckUtils]: 6: Hoare triple {3184#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {3184#true} is VALID [2022-04-28 05:56:15,878 INFO L290 TraceCheckUtils]: 7: Hoare triple {3184#true} ~cond := #in~cond; {3184#true} is VALID [2022-04-28 05:56:15,878 INFO L290 TraceCheckUtils]: 8: Hoare triple {3184#true} assume !(0 == ~cond); {3184#true} is VALID [2022-04-28 05:56:15,878 INFO L290 TraceCheckUtils]: 9: Hoare triple {3184#true} assume true; {3184#true} is VALID [2022-04-28 05:56:15,879 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3184#true} {3184#true} #90#return; {3184#true} is VALID [2022-04-28 05:56:15,879 INFO L272 TraceCheckUtils]: 11: Hoare triple {3184#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {3184#true} is VALID [2022-04-28 05:56:15,879 INFO L290 TraceCheckUtils]: 12: Hoare triple {3184#true} ~cond := #in~cond; {3184#true} is VALID [2022-04-28 05:56:15,879 INFO L290 TraceCheckUtils]: 13: Hoare triple {3184#true} assume !(0 == ~cond); {3184#true} is VALID [2022-04-28 05:56:15,879 INFO L290 TraceCheckUtils]: 14: Hoare triple {3184#true} assume true; {3184#true} is VALID [2022-04-28 05:56:15,879 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3184#true} {3184#true} #92#return; {3184#true} is VALID [2022-04-28 05:56:15,879 INFO L290 TraceCheckUtils]: 16: Hoare triple {3184#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {3184#true} is VALID [2022-04-28 05:56:15,879 INFO L290 TraceCheckUtils]: 17: Hoare triple {3184#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3184#true} is VALID [2022-04-28 05:56:15,879 INFO L290 TraceCheckUtils]: 18: Hoare triple {3184#true} assume !!(#t~post6 < 100);havoc #t~post6; {3184#true} is VALID [2022-04-28 05:56:15,879 INFO L272 TraceCheckUtils]: 19: Hoare triple {3184#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3184#true} is VALID [2022-04-28 05:56:15,879 INFO L290 TraceCheckUtils]: 20: Hoare triple {3184#true} ~cond := #in~cond; {3184#true} is VALID [2022-04-28 05:56:15,879 INFO L290 TraceCheckUtils]: 21: Hoare triple {3184#true} assume !(0 == ~cond); {3184#true} is VALID [2022-04-28 05:56:15,879 INFO L290 TraceCheckUtils]: 22: Hoare triple {3184#true} assume true; {3184#true} is VALID [2022-04-28 05:56:15,880 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3184#true} {3184#true} #94#return; {3184#true} is VALID [2022-04-28 05:56:15,880 INFO L290 TraceCheckUtils]: 24: Hoare triple {3184#true} assume !!(0 != ~r~0); {3261#(not (= main_~r~0 0))} is VALID [2022-04-28 05:56:15,880 INFO L290 TraceCheckUtils]: 25: Hoare triple {3261#(not (= main_~r~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3261#(not (= main_~r~0 0))} is VALID [2022-04-28 05:56:15,880 INFO L290 TraceCheckUtils]: 26: Hoare triple {3261#(not (= main_~r~0 0))} assume !!(#t~post7 < 100);havoc #t~post7; {3261#(not (= main_~r~0 0))} is VALID [2022-04-28 05:56:15,881 INFO L272 TraceCheckUtils]: 27: Hoare triple {3261#(not (= main_~r~0 0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3184#true} is VALID [2022-04-28 05:56:15,881 INFO L290 TraceCheckUtils]: 28: Hoare triple {3184#true} ~cond := #in~cond; {3184#true} is VALID [2022-04-28 05:56:15,881 INFO L290 TraceCheckUtils]: 29: Hoare triple {3184#true} assume !(0 == ~cond); {3184#true} is VALID [2022-04-28 05:56:15,881 INFO L290 TraceCheckUtils]: 30: Hoare triple {3184#true} assume true; {3184#true} is VALID [2022-04-28 05:56:15,881 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3184#true} {3261#(not (= main_~r~0 0))} #96#return; {3261#(not (= main_~r~0 0))} is VALID [2022-04-28 05:56:15,882 INFO L290 TraceCheckUtils]: 32: Hoare triple {3261#(not (= main_~r~0 0))} assume !(~r~0 > 0); {3286#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-28 05:56:15,882 INFO L290 TraceCheckUtils]: 33: Hoare triple {3286#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {3286#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-28 05:56:15,883 INFO L290 TraceCheckUtils]: 34: Hoare triple {3286#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} assume !!(#t~post8 < 100);havoc #t~post8; {3286#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-28 05:56:15,883 INFO L272 TraceCheckUtils]: 35: Hoare triple {3286#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3184#true} is VALID [2022-04-28 05:56:15,883 INFO L290 TraceCheckUtils]: 36: Hoare triple {3184#true} ~cond := #in~cond; {3184#true} is VALID [2022-04-28 05:56:15,883 INFO L290 TraceCheckUtils]: 37: Hoare triple {3184#true} assume !(0 == ~cond); {3184#true} is VALID [2022-04-28 05:56:15,883 INFO L290 TraceCheckUtils]: 38: Hoare triple {3184#true} assume true; {3184#true} is VALID [2022-04-28 05:56:15,884 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3184#true} {3286#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} #98#return; {3286#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-28 05:56:15,884 INFO L290 TraceCheckUtils]: 40: Hoare triple {3286#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} assume !(~r~0 < 0); {3185#false} is VALID [2022-04-28 05:56:15,884 INFO L290 TraceCheckUtils]: 41: Hoare triple {3185#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3185#false} is VALID [2022-04-28 05:56:15,884 INFO L290 TraceCheckUtils]: 42: Hoare triple {3185#false} assume !(#t~post6 < 100);havoc #t~post6; {3185#false} is VALID [2022-04-28 05:56:15,884 INFO L272 TraceCheckUtils]: 43: Hoare triple {3185#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3185#false} is VALID [2022-04-28 05:56:15,885 INFO L290 TraceCheckUtils]: 44: Hoare triple {3185#false} ~cond := #in~cond; {3185#false} is VALID [2022-04-28 05:56:15,885 INFO L290 TraceCheckUtils]: 45: Hoare triple {3185#false} assume 0 == ~cond; {3185#false} is VALID [2022-04-28 05:56:15,885 INFO L290 TraceCheckUtils]: 46: Hoare triple {3185#false} assume !false; {3185#false} is VALID [2022-04-28 05:56:15,885 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 05:56:15,885 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 05:56:15,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:56:15,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416938682] [2022-04-28 05:56:15,885 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:56:15,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161171440] [2022-04-28 05:56:15,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [161171440] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:56:15,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:56:15,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 05:56:15,886 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:56:15,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [830414157] [2022-04-28 05:56:15,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [830414157] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:56:15,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:56:15,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 05:56:15,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797650031] [2022-04-28 05:56:15,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:56:15,886 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 47 [2022-04-28 05:56:15,887 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:56:15,887 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-28 05:56:15,912 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:56:15,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 05:56:15,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:15,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 05:56:15,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-28 05:56:15,913 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-28 05:56:16,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:16,072 INFO L93 Difference]: Finished difference Result 101 states and 131 transitions. [2022-04-28 05:56:16,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 05:56:16,072 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 47 [2022-04-28 05:56:16,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:56:16,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-28 05:56:16,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-04-28 05:56:16,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-28 05:56:16,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-04-28 05:56:16,076 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 108 transitions. [2022-04-28 05:56:16,152 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:56:16,153 INFO L225 Difference]: With dead ends: 101 [2022-04-28 05:56:16,153 INFO L226 Difference]: Without dead ends: 80 [2022-04-28 05:56:16,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-28 05:56:16,154 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 19 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 05:56:16,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 101 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 05:56:16,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-04-28 05:56:16,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 70. [2022-04-28 05:56:16,218 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:56:16,218 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand has 70 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 14 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 05:56:16,219 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand has 70 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 14 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 05:56:16,219 INFO L87 Difference]: Start difference. First operand 80 states. Second operand has 70 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 14 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 05:56:16,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:16,221 INFO L93 Difference]: Finished difference Result 80 states and 102 transitions. [2022-04-28 05:56:16,221 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 102 transitions. [2022-04-28 05:56:16,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:56:16,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:56:16,222 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 14 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 80 states. [2022-04-28 05:56:16,222 INFO L87 Difference]: Start difference. First operand has 70 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 14 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 80 states. [2022-04-28 05:56:16,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:16,224 INFO L93 Difference]: Finished difference Result 80 states and 102 transitions. [2022-04-28 05:56:16,224 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 102 transitions. [2022-04-28 05:56:16,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:56:16,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:56:16,224 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:56:16,224 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:56:16,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 14 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 05:56:16,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 87 transitions. [2022-04-28 05:56:16,226 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 87 transitions. Word has length 47 [2022-04-28 05:56:16,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:56:16,226 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 87 transitions. [2022-04-28 05:56:16,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-28 05:56:16,226 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 87 transitions. [2022-04-28 05:56:18,327 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 86 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 05:56:18,327 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 87 transitions. [2022-04-28 05:56:18,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-28 05:56:18,327 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:56:18,327 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:56:18,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-28 05:56:18,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-04-28 05:56:18,531 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:56:18,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:56:18,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1915058849, now seen corresponding path program 1 times [2022-04-28 05:56:18,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:18,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [617025712] [2022-04-28 05:56:18,532 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:56:18,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1915058849, now seen corresponding path program 2 times [2022-04-28 05:56:18,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:56:18,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289246681] [2022-04-28 05:56:18,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:56:18,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:56:18,544 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:56:18,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1910934999] [2022-04-28 05:56:18,544 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:56:18,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:56:18,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:56:18,545 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:56:18,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-28 05:56:18,596 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:56:18,596 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:56:18,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 05:56:18,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:56:18,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:56:18,849 INFO L272 TraceCheckUtils]: 0: Hoare triple {3830#true} call ULTIMATE.init(); {3830#true} is VALID [2022-04-28 05:56:18,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {3830#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3838#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:18,850 INFO L290 TraceCheckUtils]: 2: Hoare triple {3838#(<= ~counter~0 0)} assume true; {3838#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:18,851 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3838#(<= ~counter~0 0)} {3830#true} #102#return; {3838#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:18,851 INFO L272 TraceCheckUtils]: 4: Hoare triple {3838#(<= ~counter~0 0)} call #t~ret9 := main(); {3838#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:18,852 INFO L290 TraceCheckUtils]: 5: Hoare triple {3838#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {3838#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:18,853 INFO L272 TraceCheckUtils]: 6: Hoare triple {3838#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {3838#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:18,854 INFO L290 TraceCheckUtils]: 7: Hoare triple {3838#(<= ~counter~0 0)} ~cond := #in~cond; {3838#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:18,854 INFO L290 TraceCheckUtils]: 8: Hoare triple {3838#(<= ~counter~0 0)} assume !(0 == ~cond); {3838#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:18,854 INFO L290 TraceCheckUtils]: 9: Hoare triple {3838#(<= ~counter~0 0)} assume true; {3838#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:18,855 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3838#(<= ~counter~0 0)} {3838#(<= ~counter~0 0)} #90#return; {3838#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:18,855 INFO L272 TraceCheckUtils]: 11: Hoare triple {3838#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {3838#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:18,855 INFO L290 TraceCheckUtils]: 12: Hoare triple {3838#(<= ~counter~0 0)} ~cond := #in~cond; {3838#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:18,856 INFO L290 TraceCheckUtils]: 13: Hoare triple {3838#(<= ~counter~0 0)} assume !(0 == ~cond); {3838#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:18,856 INFO L290 TraceCheckUtils]: 14: Hoare triple {3838#(<= ~counter~0 0)} assume true; {3838#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:18,856 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3838#(<= ~counter~0 0)} {3838#(<= ~counter~0 0)} #92#return; {3838#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:18,857 INFO L290 TraceCheckUtils]: 16: Hoare triple {3838#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {3838#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:18,857 INFO L290 TraceCheckUtils]: 17: Hoare triple {3838#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3887#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:18,857 INFO L290 TraceCheckUtils]: 18: Hoare triple {3887#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {3887#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:18,858 INFO L272 TraceCheckUtils]: 19: Hoare triple {3887#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3887#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:18,858 INFO L290 TraceCheckUtils]: 20: Hoare triple {3887#(<= ~counter~0 1)} ~cond := #in~cond; {3887#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:18,859 INFO L290 TraceCheckUtils]: 21: Hoare triple {3887#(<= ~counter~0 1)} assume !(0 == ~cond); {3887#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:18,859 INFO L290 TraceCheckUtils]: 22: Hoare triple {3887#(<= ~counter~0 1)} assume true; {3887#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:18,863 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3887#(<= ~counter~0 1)} {3887#(<= ~counter~0 1)} #94#return; {3887#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:18,863 INFO L290 TraceCheckUtils]: 24: Hoare triple {3887#(<= ~counter~0 1)} assume !!(0 != ~r~0); {3887#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:18,864 INFO L290 TraceCheckUtils]: 25: Hoare triple {3887#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3912#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:18,864 INFO L290 TraceCheckUtils]: 26: Hoare triple {3912#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {3912#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:18,865 INFO L272 TraceCheckUtils]: 27: Hoare triple {3912#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3912#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:18,865 INFO L290 TraceCheckUtils]: 28: Hoare triple {3912#(<= ~counter~0 2)} ~cond := #in~cond; {3912#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:18,865 INFO L290 TraceCheckUtils]: 29: Hoare triple {3912#(<= ~counter~0 2)} assume !(0 == ~cond); {3912#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:18,865 INFO L290 TraceCheckUtils]: 30: Hoare triple {3912#(<= ~counter~0 2)} assume true; {3912#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:18,866 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3912#(<= ~counter~0 2)} {3912#(<= ~counter~0 2)} #96#return; {3912#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:18,866 INFO L290 TraceCheckUtils]: 32: Hoare triple {3912#(<= ~counter~0 2)} assume !(~r~0 > 0); {3912#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:18,867 INFO L290 TraceCheckUtils]: 33: Hoare triple {3912#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {3937#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:18,867 INFO L290 TraceCheckUtils]: 34: Hoare triple {3937#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {3937#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:18,868 INFO L272 TraceCheckUtils]: 35: Hoare triple {3937#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3937#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:18,868 INFO L290 TraceCheckUtils]: 36: Hoare triple {3937#(<= ~counter~0 3)} ~cond := #in~cond; {3937#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:18,868 INFO L290 TraceCheckUtils]: 37: Hoare triple {3937#(<= ~counter~0 3)} assume !(0 == ~cond); {3937#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:18,868 INFO L290 TraceCheckUtils]: 38: Hoare triple {3937#(<= ~counter~0 3)} assume true; {3937#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:18,869 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3937#(<= ~counter~0 3)} {3937#(<= ~counter~0 3)} #98#return; {3937#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:18,869 INFO L290 TraceCheckUtils]: 40: Hoare triple {3937#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {3937#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:18,870 INFO L290 TraceCheckUtils]: 41: Hoare triple {3937#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {3962#(<= |main_#t~post8| 3)} is VALID [2022-04-28 05:56:18,870 INFO L290 TraceCheckUtils]: 42: Hoare triple {3962#(<= |main_#t~post8| 3)} assume !(#t~post8 < 100);havoc #t~post8; {3831#false} is VALID [2022-04-28 05:56:18,870 INFO L290 TraceCheckUtils]: 43: Hoare triple {3831#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3831#false} is VALID [2022-04-28 05:56:18,870 INFO L290 TraceCheckUtils]: 44: Hoare triple {3831#false} assume !(#t~post6 < 100);havoc #t~post6; {3831#false} is VALID [2022-04-28 05:56:18,870 INFO L272 TraceCheckUtils]: 45: Hoare triple {3831#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3831#false} is VALID [2022-04-28 05:56:18,870 INFO L290 TraceCheckUtils]: 46: Hoare triple {3831#false} ~cond := #in~cond; {3831#false} is VALID [2022-04-28 05:56:18,870 INFO L290 TraceCheckUtils]: 47: Hoare triple {3831#false} assume 0 == ~cond; {3831#false} is VALID [2022-04-28 05:56:18,871 INFO L290 TraceCheckUtils]: 48: Hoare triple {3831#false} assume !false; {3831#false} is VALID [2022-04-28 05:56:18,871 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:56:18,871 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:56:19,106 INFO L290 TraceCheckUtils]: 48: Hoare triple {3831#false} assume !false; {3831#false} is VALID [2022-04-28 05:56:19,106 INFO L290 TraceCheckUtils]: 47: Hoare triple {3831#false} assume 0 == ~cond; {3831#false} is VALID [2022-04-28 05:56:19,106 INFO L290 TraceCheckUtils]: 46: Hoare triple {3831#false} ~cond := #in~cond; {3831#false} is VALID [2022-04-28 05:56:19,106 INFO L272 TraceCheckUtils]: 45: Hoare triple {3831#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3831#false} is VALID [2022-04-28 05:56:19,106 INFO L290 TraceCheckUtils]: 44: Hoare triple {3831#false} assume !(#t~post6 < 100);havoc #t~post6; {3831#false} is VALID [2022-04-28 05:56:19,106 INFO L290 TraceCheckUtils]: 43: Hoare triple {3831#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3831#false} is VALID [2022-04-28 05:56:19,107 INFO L290 TraceCheckUtils]: 42: Hoare triple {4002#(< |main_#t~post8| 100)} assume !(#t~post8 < 100);havoc #t~post8; {3831#false} is VALID [2022-04-28 05:56:19,107 INFO L290 TraceCheckUtils]: 41: Hoare triple {4006#(< ~counter~0 100)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4002#(< |main_#t~post8| 100)} is VALID [2022-04-28 05:56:19,107 INFO L290 TraceCheckUtils]: 40: Hoare triple {4006#(< ~counter~0 100)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {4006#(< ~counter~0 100)} is VALID [2022-04-28 05:56:19,108 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3830#true} {4006#(< ~counter~0 100)} #98#return; {4006#(< ~counter~0 100)} is VALID [2022-04-28 05:56:19,109 INFO L290 TraceCheckUtils]: 38: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-28 05:56:19,109 INFO L290 TraceCheckUtils]: 37: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-28 05:56:19,109 INFO L290 TraceCheckUtils]: 36: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-28 05:56:19,109 INFO L272 TraceCheckUtils]: 35: Hoare triple {4006#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3830#true} is VALID [2022-04-28 05:56:19,109 INFO L290 TraceCheckUtils]: 34: Hoare triple {4006#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {4006#(< ~counter~0 100)} is VALID [2022-04-28 05:56:19,110 INFO L290 TraceCheckUtils]: 33: Hoare triple {4031#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4006#(< ~counter~0 100)} is VALID [2022-04-28 05:56:19,110 INFO L290 TraceCheckUtils]: 32: Hoare triple {4031#(< ~counter~0 99)} assume !(~r~0 > 0); {4031#(< ~counter~0 99)} is VALID [2022-04-28 05:56:19,110 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3830#true} {4031#(< ~counter~0 99)} #96#return; {4031#(< ~counter~0 99)} is VALID [2022-04-28 05:56:19,111 INFO L290 TraceCheckUtils]: 30: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-28 05:56:19,111 INFO L290 TraceCheckUtils]: 29: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-28 05:56:19,111 INFO L290 TraceCheckUtils]: 28: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-28 05:56:19,111 INFO L272 TraceCheckUtils]: 27: Hoare triple {4031#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3830#true} is VALID [2022-04-28 05:56:19,111 INFO L290 TraceCheckUtils]: 26: Hoare triple {4031#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {4031#(< ~counter~0 99)} is VALID [2022-04-28 05:56:19,111 INFO L290 TraceCheckUtils]: 25: Hoare triple {4056#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4031#(< ~counter~0 99)} is VALID [2022-04-28 05:56:19,112 INFO L290 TraceCheckUtils]: 24: Hoare triple {4056#(< ~counter~0 98)} assume !!(0 != ~r~0); {4056#(< ~counter~0 98)} is VALID [2022-04-28 05:56:19,112 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3830#true} {4056#(< ~counter~0 98)} #94#return; {4056#(< ~counter~0 98)} is VALID [2022-04-28 05:56:19,112 INFO L290 TraceCheckUtils]: 22: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-28 05:56:19,113 INFO L290 TraceCheckUtils]: 21: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-28 05:56:19,113 INFO L290 TraceCheckUtils]: 20: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-28 05:56:19,113 INFO L272 TraceCheckUtils]: 19: Hoare triple {4056#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3830#true} is VALID [2022-04-28 05:56:19,113 INFO L290 TraceCheckUtils]: 18: Hoare triple {4056#(< ~counter~0 98)} assume !!(#t~post6 < 100);havoc #t~post6; {4056#(< ~counter~0 98)} is VALID [2022-04-28 05:56:19,113 INFO L290 TraceCheckUtils]: 17: Hoare triple {4081#(< ~counter~0 97)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4056#(< ~counter~0 98)} is VALID [2022-04-28 05:56:19,114 INFO L290 TraceCheckUtils]: 16: Hoare triple {4081#(< ~counter~0 97)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {4081#(< ~counter~0 97)} is VALID [2022-04-28 05:56:19,114 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3830#true} {4081#(< ~counter~0 97)} #92#return; {4081#(< ~counter~0 97)} is VALID [2022-04-28 05:56:19,114 INFO L290 TraceCheckUtils]: 14: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-28 05:56:19,114 INFO L290 TraceCheckUtils]: 13: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-28 05:56:19,114 INFO L290 TraceCheckUtils]: 12: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-28 05:56:19,114 INFO L272 TraceCheckUtils]: 11: Hoare triple {4081#(< ~counter~0 97)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {3830#true} is VALID [2022-04-28 05:56:19,115 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3830#true} {4081#(< ~counter~0 97)} #90#return; {4081#(< ~counter~0 97)} is VALID [2022-04-28 05:56:19,115 INFO L290 TraceCheckUtils]: 9: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-28 05:56:19,115 INFO L290 TraceCheckUtils]: 8: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-28 05:56:19,116 INFO L290 TraceCheckUtils]: 7: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-28 05:56:19,116 INFO L272 TraceCheckUtils]: 6: Hoare triple {4081#(< ~counter~0 97)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {3830#true} is VALID [2022-04-28 05:56:19,117 INFO L290 TraceCheckUtils]: 5: Hoare triple {4081#(< ~counter~0 97)} 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 97)} is VALID [2022-04-28 05:56:19,117 INFO L272 TraceCheckUtils]: 4: Hoare triple {4081#(< ~counter~0 97)} call #t~ret9 := main(); {4081#(< ~counter~0 97)} is VALID [2022-04-28 05:56:19,117 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4081#(< ~counter~0 97)} {3830#true} #102#return; {4081#(< ~counter~0 97)} is VALID [2022-04-28 05:56:19,118 INFO L290 TraceCheckUtils]: 2: Hoare triple {4081#(< ~counter~0 97)} assume true; {4081#(< ~counter~0 97)} is VALID [2022-04-28 05:56:19,118 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 97)} is VALID [2022-04-28 05:56:19,118 INFO L272 TraceCheckUtils]: 0: Hoare triple {3830#true} call ULTIMATE.init(); {3830#true} is VALID [2022-04-28 05:56:19,118 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 05:56:19,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:56:19,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289246681] [2022-04-28 05:56:19,119 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:56:19,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910934999] [2022-04-28 05:56:19,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1910934999] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:56:19,119 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:56:19,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-28 05:56:19,121 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:56:19,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [617025712] [2022-04-28 05:56:19,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [617025712] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:56:19,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:56:19,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 05:56:19,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67462221] [2022-04-28 05:56:19,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:56:19,122 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 49 [2022-04-28 05:56:19,122 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:56:19,122 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 05:56:19,153 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:56:19,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 05:56:19,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:19,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 05:56:19,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-28 05:56:19,154 INFO L87 Difference]: Start difference. First operand 70 states and 87 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 05:56:19,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:19,375 INFO L93 Difference]: Finished difference Result 118 states and 153 transitions. [2022-04-28 05:56:19,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 05:56:19,376 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 49 [2022-04-28 05:56:19,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:56:19,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 05:56:19,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2022-04-28 05:56:19,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 05:56:19,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2022-04-28 05:56:19,380 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 101 transitions. [2022-04-28 05:56:19,458 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:56:19,459 INFO L225 Difference]: With dead ends: 118 [2022-04-28 05:56:19,459 INFO L226 Difference]: Without dead ends: 81 [2022-04-28 05:56:19,460 INFO L412 NwaCegarLoop]: 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-28 05:56:19,460 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 19 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 05:56:19,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 135 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 05:56:19,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-28 05:56:19,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2022-04-28 05:56:19,542 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:56:19,542 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 80 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 57 states have internal predecessors, (69), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 05:56:19,548 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 80 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 57 states have internal predecessors, (69), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 05:56:19,548 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 80 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 57 states have internal predecessors, (69), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 05:56:19,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:19,550 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2022-04-28 05:56:19,550 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2022-04-28 05:56:19,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:56:19,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:56:19,551 INFO L74 IsIncluded]: Start isIncluded. First operand has 80 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 57 states have internal predecessors, (69), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 81 states. [2022-04-28 05:56:19,551 INFO L87 Difference]: Start difference. First operand has 80 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 57 states have internal predecessors, (69), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 81 states. [2022-04-28 05:56:19,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:19,553 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2022-04-28 05:56:19,553 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2022-04-28 05:56:19,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:56:19,553 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:56:19,553 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:56:19,553 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:56:19,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 57 states have internal predecessors, (69), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 05:56:19,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 99 transitions. [2022-04-28 05:56:19,555 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 99 transitions. Word has length 49 [2022-04-28 05:56:19,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:56:19,555 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 99 transitions. [2022-04-28 05:56:19,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 05:56:19,555 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 80 states and 99 transitions. [2022-04-28 05:56:21,674 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 98 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 05:56:21,674 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 99 transitions. [2022-04-28 05:56:21,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-28 05:56:21,675 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:56:21,675 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:56:21,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-04-28 05:56:21,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:56:21,875 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:56:21,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:56:21,876 INFO L85 PathProgramCache]: Analyzing trace with hash -60460648, now seen corresponding path program 3 times [2022-04-28 05:56:21,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:21,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1320852393] [2022-04-28 05:56:21,876 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:56:21,876 INFO L85 PathProgramCache]: Analyzing trace with hash -60460648, now seen corresponding path program 4 times [2022-04-28 05:56:21,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:56:21,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112864262] [2022-04-28 05:56:21,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:56:21,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:56:21,886 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:56:21,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1157159866] [2022-04-28 05:56:21,887 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 05:56:21,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:56:21,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:56:21,888 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:56:21,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-28 05:56:21,950 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 05:56:21,950 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:56:21,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 05:56:21,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:56:21,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:56:22,190 INFO L272 TraceCheckUtils]: 0: Hoare triple {4695#true} call ULTIMATE.init(); {4695#true} is VALID [2022-04-28 05:56:22,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {4695#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4703#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:22,191 INFO L290 TraceCheckUtils]: 2: Hoare triple {4703#(<= ~counter~0 0)} assume true; {4703#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:22,191 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4703#(<= ~counter~0 0)} {4695#true} #102#return; {4703#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:22,192 INFO L272 TraceCheckUtils]: 4: Hoare triple {4703#(<= ~counter~0 0)} call #t~ret9 := main(); {4703#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:22,192 INFO L290 TraceCheckUtils]: 5: Hoare triple {4703#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {4703#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:22,192 INFO L272 TraceCheckUtils]: 6: Hoare triple {4703#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {4703#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:22,193 INFO L290 TraceCheckUtils]: 7: Hoare triple {4703#(<= ~counter~0 0)} ~cond := #in~cond; {4703#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:22,193 INFO L290 TraceCheckUtils]: 8: Hoare triple {4703#(<= ~counter~0 0)} assume !(0 == ~cond); {4703#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:22,193 INFO L290 TraceCheckUtils]: 9: Hoare triple {4703#(<= ~counter~0 0)} assume true; {4703#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:22,194 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4703#(<= ~counter~0 0)} {4703#(<= ~counter~0 0)} #90#return; {4703#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:22,194 INFO L272 TraceCheckUtils]: 11: Hoare triple {4703#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {4703#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:22,194 INFO L290 TraceCheckUtils]: 12: Hoare triple {4703#(<= ~counter~0 0)} ~cond := #in~cond; {4703#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:22,195 INFO L290 TraceCheckUtils]: 13: Hoare triple {4703#(<= ~counter~0 0)} assume !(0 == ~cond); {4703#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:22,195 INFO L290 TraceCheckUtils]: 14: Hoare triple {4703#(<= ~counter~0 0)} assume true; {4703#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:22,195 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4703#(<= ~counter~0 0)} {4703#(<= ~counter~0 0)} #92#return; {4703#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:22,196 INFO L290 TraceCheckUtils]: 16: Hoare triple {4703#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {4703#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:22,196 INFO L290 TraceCheckUtils]: 17: Hoare triple {4703#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4752#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:22,196 INFO L290 TraceCheckUtils]: 18: Hoare triple {4752#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {4752#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:22,197 INFO L272 TraceCheckUtils]: 19: Hoare triple {4752#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4752#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:22,197 INFO L290 TraceCheckUtils]: 20: Hoare triple {4752#(<= ~counter~0 1)} ~cond := #in~cond; {4752#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:22,197 INFO L290 TraceCheckUtils]: 21: Hoare triple {4752#(<= ~counter~0 1)} assume !(0 == ~cond); {4752#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:22,198 INFO L290 TraceCheckUtils]: 22: Hoare triple {4752#(<= ~counter~0 1)} assume true; {4752#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:22,198 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4752#(<= ~counter~0 1)} {4752#(<= ~counter~0 1)} #94#return; {4752#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:22,198 INFO L290 TraceCheckUtils]: 24: Hoare triple {4752#(<= ~counter~0 1)} assume !!(0 != ~r~0); {4752#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:22,199 INFO L290 TraceCheckUtils]: 25: Hoare triple {4752#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4777#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:22,199 INFO L290 TraceCheckUtils]: 26: Hoare triple {4777#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {4777#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:22,200 INFO L272 TraceCheckUtils]: 27: Hoare triple {4777#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4777#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:22,200 INFO L290 TraceCheckUtils]: 28: Hoare triple {4777#(<= ~counter~0 2)} ~cond := #in~cond; {4777#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:22,200 INFO L290 TraceCheckUtils]: 29: Hoare triple {4777#(<= ~counter~0 2)} assume !(0 == ~cond); {4777#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:22,202 INFO L290 TraceCheckUtils]: 30: Hoare triple {4777#(<= ~counter~0 2)} assume true; {4777#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:22,202 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4777#(<= ~counter~0 2)} {4777#(<= ~counter~0 2)} #96#return; {4777#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:22,203 INFO L290 TraceCheckUtils]: 32: Hoare triple {4777#(<= ~counter~0 2)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4777#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:22,203 INFO L290 TraceCheckUtils]: 33: Hoare triple {4777#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4802#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:22,203 INFO L290 TraceCheckUtils]: 34: Hoare triple {4802#(<= ~counter~0 3)} assume !!(#t~post7 < 100);havoc #t~post7; {4802#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:22,204 INFO L272 TraceCheckUtils]: 35: Hoare triple {4802#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4802#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:22,204 INFO L290 TraceCheckUtils]: 36: Hoare triple {4802#(<= ~counter~0 3)} ~cond := #in~cond; {4802#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:22,204 INFO L290 TraceCheckUtils]: 37: Hoare triple {4802#(<= ~counter~0 3)} assume !(0 == ~cond); {4802#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:22,205 INFO L290 TraceCheckUtils]: 38: Hoare triple {4802#(<= ~counter~0 3)} assume true; {4802#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:22,205 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4802#(<= ~counter~0 3)} {4802#(<= ~counter~0 3)} #96#return; {4802#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:22,206 INFO L290 TraceCheckUtils]: 40: Hoare triple {4802#(<= ~counter~0 3)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4802#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:22,206 INFO L290 TraceCheckUtils]: 41: Hoare triple {4802#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4827#(<= |main_#t~post7| 3)} is VALID [2022-04-28 05:56:22,206 INFO L290 TraceCheckUtils]: 42: Hoare triple {4827#(<= |main_#t~post7| 3)} assume !(#t~post7 < 100);havoc #t~post7; {4696#false} is VALID [2022-04-28 05:56:22,206 INFO L290 TraceCheckUtils]: 43: Hoare triple {4696#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4696#false} is VALID [2022-04-28 05:56:22,207 INFO L290 TraceCheckUtils]: 44: Hoare triple {4696#false} assume !(#t~post8 < 100);havoc #t~post8; {4696#false} is VALID [2022-04-28 05:56:22,207 INFO L290 TraceCheckUtils]: 45: Hoare triple {4696#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4696#false} is VALID [2022-04-28 05:56:22,207 INFO L290 TraceCheckUtils]: 46: Hoare triple {4696#false} assume !(#t~post6 < 100);havoc #t~post6; {4696#false} is VALID [2022-04-28 05:56:22,207 INFO L272 TraceCheckUtils]: 47: Hoare triple {4696#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4696#false} is VALID [2022-04-28 05:56:22,207 INFO L290 TraceCheckUtils]: 48: Hoare triple {4696#false} ~cond := #in~cond; {4696#false} is VALID [2022-04-28 05:56:22,207 INFO L290 TraceCheckUtils]: 49: Hoare triple {4696#false} assume 0 == ~cond; {4696#false} is VALID [2022-04-28 05:56:22,207 INFO L290 TraceCheckUtils]: 50: Hoare triple {4696#false} assume !false; {4696#false} is VALID [2022-04-28 05:56:22,207 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:56:22,207 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:56:22,463 INFO L290 TraceCheckUtils]: 50: Hoare triple {4696#false} assume !false; {4696#false} is VALID [2022-04-28 05:56:22,463 INFO L290 TraceCheckUtils]: 49: Hoare triple {4696#false} assume 0 == ~cond; {4696#false} is VALID [2022-04-28 05:56:22,463 INFO L290 TraceCheckUtils]: 48: Hoare triple {4696#false} ~cond := #in~cond; {4696#false} is VALID [2022-04-28 05:56:22,463 INFO L272 TraceCheckUtils]: 47: Hoare triple {4696#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4696#false} is VALID [2022-04-28 05:56:22,463 INFO L290 TraceCheckUtils]: 46: Hoare triple {4696#false} assume !(#t~post6 < 100);havoc #t~post6; {4696#false} is VALID [2022-04-28 05:56:22,463 INFO L290 TraceCheckUtils]: 45: Hoare triple {4696#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4696#false} is VALID [2022-04-28 05:56:22,463 INFO L290 TraceCheckUtils]: 44: Hoare triple {4696#false} assume !(#t~post8 < 100);havoc #t~post8; {4696#false} is VALID [2022-04-28 05:56:22,463 INFO L290 TraceCheckUtils]: 43: Hoare triple {4696#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4696#false} is VALID [2022-04-28 05:56:22,464 INFO L290 TraceCheckUtils]: 42: Hoare triple {4879#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {4696#false} is VALID [2022-04-28 05:56:22,464 INFO L290 TraceCheckUtils]: 41: Hoare triple {4883#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4879#(< |main_#t~post7| 100)} is VALID [2022-04-28 05:56:22,464 INFO L290 TraceCheckUtils]: 40: Hoare triple {4883#(< ~counter~0 100)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4883#(< ~counter~0 100)} is VALID [2022-04-28 05:56:22,465 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4695#true} {4883#(< ~counter~0 100)} #96#return; {4883#(< ~counter~0 100)} is VALID [2022-04-28 05:56:22,465 INFO L290 TraceCheckUtils]: 38: Hoare triple {4695#true} assume true; {4695#true} is VALID [2022-04-28 05:56:22,465 INFO L290 TraceCheckUtils]: 37: Hoare triple {4695#true} assume !(0 == ~cond); {4695#true} is VALID [2022-04-28 05:56:22,465 INFO L290 TraceCheckUtils]: 36: Hoare triple {4695#true} ~cond := #in~cond; {4695#true} is VALID [2022-04-28 05:56:22,465 INFO L272 TraceCheckUtils]: 35: Hoare triple {4883#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4695#true} is VALID [2022-04-28 05:56:22,465 INFO L290 TraceCheckUtils]: 34: Hoare triple {4883#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {4883#(< ~counter~0 100)} is VALID [2022-04-28 05:56:22,466 INFO L290 TraceCheckUtils]: 33: Hoare triple {4908#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4883#(< ~counter~0 100)} is VALID [2022-04-28 05:56:22,466 INFO L290 TraceCheckUtils]: 32: Hoare triple {4908#(< ~counter~0 99)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4908#(< ~counter~0 99)} is VALID [2022-04-28 05:56:22,467 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4695#true} {4908#(< ~counter~0 99)} #96#return; {4908#(< ~counter~0 99)} is VALID [2022-04-28 05:56:22,467 INFO L290 TraceCheckUtils]: 30: Hoare triple {4695#true} assume true; {4695#true} is VALID [2022-04-28 05:56:22,467 INFO L290 TraceCheckUtils]: 29: Hoare triple {4695#true} assume !(0 == ~cond); {4695#true} is VALID [2022-04-28 05:56:22,467 INFO L290 TraceCheckUtils]: 28: Hoare triple {4695#true} ~cond := #in~cond; {4695#true} is VALID [2022-04-28 05:56:22,467 INFO L272 TraceCheckUtils]: 27: Hoare triple {4908#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4695#true} is VALID [2022-04-28 05:56:22,468 INFO L290 TraceCheckUtils]: 26: Hoare triple {4908#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {4908#(< ~counter~0 99)} is VALID [2022-04-28 05:56:22,468 INFO L290 TraceCheckUtils]: 25: Hoare triple {4933#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4908#(< ~counter~0 99)} is VALID [2022-04-28 05:56:22,469 INFO L290 TraceCheckUtils]: 24: Hoare triple {4933#(< ~counter~0 98)} assume !!(0 != ~r~0); {4933#(< ~counter~0 98)} is VALID [2022-04-28 05:56:22,471 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4695#true} {4933#(< ~counter~0 98)} #94#return; {4933#(< ~counter~0 98)} is VALID [2022-04-28 05:56:22,471 INFO L290 TraceCheckUtils]: 22: Hoare triple {4695#true} assume true; {4695#true} is VALID [2022-04-28 05:56:22,471 INFO L290 TraceCheckUtils]: 21: Hoare triple {4695#true} assume !(0 == ~cond); {4695#true} is VALID [2022-04-28 05:56:22,471 INFO L290 TraceCheckUtils]: 20: Hoare triple {4695#true} ~cond := #in~cond; {4695#true} is VALID [2022-04-28 05:56:22,471 INFO L272 TraceCheckUtils]: 19: Hoare triple {4933#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4695#true} is VALID [2022-04-28 05:56:22,471 INFO L290 TraceCheckUtils]: 18: Hoare triple {4933#(< ~counter~0 98)} assume !!(#t~post6 < 100);havoc #t~post6; {4933#(< ~counter~0 98)} is VALID [2022-04-28 05:56:22,472 INFO L290 TraceCheckUtils]: 17: Hoare triple {4958#(< ~counter~0 97)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4933#(< ~counter~0 98)} is VALID [2022-04-28 05:56:22,472 INFO L290 TraceCheckUtils]: 16: Hoare triple {4958#(< ~counter~0 97)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {4958#(< ~counter~0 97)} is VALID [2022-04-28 05:56:22,472 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4695#true} {4958#(< ~counter~0 97)} #92#return; {4958#(< ~counter~0 97)} is VALID [2022-04-28 05:56:22,472 INFO L290 TraceCheckUtils]: 14: Hoare triple {4695#true} assume true; {4695#true} is VALID [2022-04-28 05:56:22,472 INFO L290 TraceCheckUtils]: 13: Hoare triple {4695#true} assume !(0 == ~cond); {4695#true} is VALID [2022-04-28 05:56:22,472 INFO L290 TraceCheckUtils]: 12: Hoare triple {4695#true} ~cond := #in~cond; {4695#true} is VALID [2022-04-28 05:56:22,473 INFO L272 TraceCheckUtils]: 11: Hoare triple {4958#(< ~counter~0 97)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {4695#true} is VALID [2022-04-28 05:56:22,473 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4695#true} {4958#(< ~counter~0 97)} #90#return; {4958#(< ~counter~0 97)} is VALID [2022-04-28 05:56:22,473 INFO L290 TraceCheckUtils]: 9: Hoare triple {4695#true} assume true; {4695#true} is VALID [2022-04-28 05:56:22,473 INFO L290 TraceCheckUtils]: 8: Hoare triple {4695#true} assume !(0 == ~cond); {4695#true} is VALID [2022-04-28 05:56:22,473 INFO L290 TraceCheckUtils]: 7: Hoare triple {4695#true} ~cond := #in~cond; {4695#true} is VALID [2022-04-28 05:56:22,473 INFO L272 TraceCheckUtils]: 6: Hoare triple {4958#(< ~counter~0 97)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {4695#true} is VALID [2022-04-28 05:56:22,474 INFO L290 TraceCheckUtils]: 5: Hoare triple {4958#(< ~counter~0 97)} 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 97)} is VALID [2022-04-28 05:56:22,474 INFO L272 TraceCheckUtils]: 4: Hoare triple {4958#(< ~counter~0 97)} call #t~ret9 := main(); {4958#(< ~counter~0 97)} is VALID [2022-04-28 05:56:22,474 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4958#(< ~counter~0 97)} {4695#true} #102#return; {4958#(< ~counter~0 97)} is VALID [2022-04-28 05:56:22,474 INFO L290 TraceCheckUtils]: 2: Hoare triple {4958#(< ~counter~0 97)} assume true; {4958#(< ~counter~0 97)} is VALID [2022-04-28 05:56:22,475 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 97)} is VALID [2022-04-28 05:56:22,475 INFO L272 TraceCheckUtils]: 0: Hoare triple {4695#true} call ULTIMATE.init(); {4695#true} is VALID [2022-04-28 05:56:22,475 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 05:56:22,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:56:22,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112864262] [2022-04-28 05:56:22,475 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:56:22,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1157159866] [2022-04-28 05:56:22,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1157159866] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:56:22,476 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:56:22,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-28 05:56:22,476 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:56:22,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1320852393] [2022-04-28 05:56:22,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1320852393] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:56:22,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:56:22,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 05:56:22,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825068192] [2022-04-28 05:56:22,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:56:22,477 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 51 [2022-04-28 05:56:22,477 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:56:22,477 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 05:56:22,506 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:56:22,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 05:56:22,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:22,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 05:56:22,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-28 05:56:22,507 INFO L87 Difference]: Start difference. First operand 80 states and 99 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 05:56:22,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:22,728 INFO L93 Difference]: Finished difference Result 119 states and 154 transitions. [2022-04-28 05:56:22,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 05:56:22,728 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 51 [2022-04-28 05:56:22,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:56:22,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 05:56:22,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2022-04-28 05:56:22,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 05:56:22,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2022-04-28 05:56:22,731 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 101 transitions. [2022-04-28 05:56:22,809 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:56:22,810 INFO L225 Difference]: With dead ends: 119 [2022-04-28 05:56:22,810 INFO L226 Difference]: Without dead ends: 82 [2022-04-28 05:56:22,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2022-04-28 05:56:22,811 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 17 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 05:56:22,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 135 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 05:56:22,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-28 05:56:22,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-04-28 05:56:22,895 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:56:22,896 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 82 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 05:56:22,897 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 82 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 05:56:22,897 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 82 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 05:56:22,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:22,899 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2022-04-28 05:56:22,899 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2022-04-28 05:56:22,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:56:22,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:56:22,899 INFO L74 IsIncluded]: Start isIncluded. First operand has 82 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 82 states. [2022-04-28 05:56:22,899 INFO L87 Difference]: Start difference. First operand has 82 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 82 states. [2022-04-28 05:56:22,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:22,902 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2022-04-28 05:56:22,902 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2022-04-28 05:56:22,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:56:22,902 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:56:22,902 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:56:22,902 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:56:22,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 05:56:22,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 101 transitions. [2022-04-28 05:56:22,904 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 101 transitions. Word has length 51 [2022-04-28 05:56:22,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:56:22,904 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 101 transitions. [2022-04-28 05:56:22,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 05:56:22,904 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 82 states and 101 transitions. [2022-04-28 05:56:25,050 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 100 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 05:56:25,050 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2022-04-28 05:56:25,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-28 05:56:25,051 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:56:25,051 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:56:25,067 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-28 05:56:25,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-28 05:56:25,252 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:56:25,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:56:25,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1067781299, now seen corresponding path program 1 times [2022-04-28 05:56:25,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:25,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [359788210] [2022-04-28 05:56:25,253 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:56:25,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1067781299, now seen corresponding path program 2 times [2022-04-28 05:56:25,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:56:25,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360334579] [2022-04-28 05:56:25,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:56:25,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:56:25,264 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:56:25,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [639670027] [2022-04-28 05:56:25,264 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:56:25,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:56:25,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:56:25,265 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:56:25,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-28 05:56:25,312 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:56:25,312 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:56:25,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 05:56:25,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:56:25,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:56:25,570 INFO L272 TraceCheckUtils]: 0: Hoare triple {5582#true} call ULTIMATE.init(); {5582#true} is VALID [2022-04-28 05:56:25,570 INFO L290 TraceCheckUtils]: 1: Hoare triple {5582#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5590#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:25,570 INFO L290 TraceCheckUtils]: 2: Hoare triple {5590#(<= ~counter~0 0)} assume true; {5590#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:25,571 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5590#(<= ~counter~0 0)} {5582#true} #102#return; {5590#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:25,571 INFO L272 TraceCheckUtils]: 4: Hoare triple {5590#(<= ~counter~0 0)} call #t~ret9 := main(); {5590#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:25,571 INFO L290 TraceCheckUtils]: 5: Hoare triple {5590#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {5590#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:25,572 INFO L272 TraceCheckUtils]: 6: Hoare triple {5590#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {5590#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:25,572 INFO L290 TraceCheckUtils]: 7: Hoare triple {5590#(<= ~counter~0 0)} ~cond := #in~cond; {5590#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:25,572 INFO L290 TraceCheckUtils]: 8: Hoare triple {5590#(<= ~counter~0 0)} assume !(0 == ~cond); {5590#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:25,573 INFO L290 TraceCheckUtils]: 9: Hoare triple {5590#(<= ~counter~0 0)} assume true; {5590#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:25,573 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5590#(<= ~counter~0 0)} {5590#(<= ~counter~0 0)} #90#return; {5590#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:25,573 INFO L272 TraceCheckUtils]: 11: Hoare triple {5590#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {5590#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:25,574 INFO L290 TraceCheckUtils]: 12: Hoare triple {5590#(<= ~counter~0 0)} ~cond := #in~cond; {5590#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:25,574 INFO L290 TraceCheckUtils]: 13: Hoare triple {5590#(<= ~counter~0 0)} assume !(0 == ~cond); {5590#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:25,574 INFO L290 TraceCheckUtils]: 14: Hoare triple {5590#(<= ~counter~0 0)} assume true; {5590#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:25,574 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5590#(<= ~counter~0 0)} {5590#(<= ~counter~0 0)} #92#return; {5590#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:25,575 INFO L290 TraceCheckUtils]: 16: Hoare triple {5590#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {5590#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:25,575 INFO L290 TraceCheckUtils]: 17: Hoare triple {5590#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5639#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:25,576 INFO L290 TraceCheckUtils]: 18: Hoare triple {5639#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {5639#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:25,576 INFO L272 TraceCheckUtils]: 19: Hoare triple {5639#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {5639#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:25,576 INFO L290 TraceCheckUtils]: 20: Hoare triple {5639#(<= ~counter~0 1)} ~cond := #in~cond; {5639#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:25,577 INFO L290 TraceCheckUtils]: 21: Hoare triple {5639#(<= ~counter~0 1)} assume !(0 == ~cond); {5639#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:25,577 INFO L290 TraceCheckUtils]: 22: Hoare triple {5639#(<= ~counter~0 1)} assume true; {5639#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:25,577 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5639#(<= ~counter~0 1)} {5639#(<= ~counter~0 1)} #94#return; {5639#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:25,578 INFO L290 TraceCheckUtils]: 24: Hoare triple {5639#(<= ~counter~0 1)} assume !!(0 != ~r~0); {5639#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:25,578 INFO L290 TraceCheckUtils]: 25: Hoare triple {5639#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5664#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:25,578 INFO L290 TraceCheckUtils]: 26: Hoare triple {5664#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {5664#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:25,579 INFO L272 TraceCheckUtils]: 27: Hoare triple {5664#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {5664#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:25,579 INFO L290 TraceCheckUtils]: 28: Hoare triple {5664#(<= ~counter~0 2)} ~cond := #in~cond; {5664#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:25,579 INFO L290 TraceCheckUtils]: 29: Hoare triple {5664#(<= ~counter~0 2)} assume !(0 == ~cond); {5664#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:25,580 INFO L290 TraceCheckUtils]: 30: Hoare triple {5664#(<= ~counter~0 2)} assume true; {5664#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:25,580 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {5664#(<= ~counter~0 2)} {5664#(<= ~counter~0 2)} #96#return; {5664#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:25,580 INFO L290 TraceCheckUtils]: 32: Hoare triple {5664#(<= ~counter~0 2)} assume !(~r~0 > 0); {5664#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:25,581 INFO L290 TraceCheckUtils]: 33: Hoare triple {5664#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {5689#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:25,581 INFO L290 TraceCheckUtils]: 34: Hoare triple {5689#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {5689#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:25,581 INFO L272 TraceCheckUtils]: 35: Hoare triple {5689#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {5689#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:25,582 INFO L290 TraceCheckUtils]: 36: Hoare triple {5689#(<= ~counter~0 3)} ~cond := #in~cond; {5689#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:25,582 INFO L290 TraceCheckUtils]: 37: Hoare triple {5689#(<= ~counter~0 3)} assume !(0 == ~cond); {5689#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:25,582 INFO L290 TraceCheckUtils]: 38: Hoare triple {5689#(<= ~counter~0 3)} assume true; {5689#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:25,583 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {5689#(<= ~counter~0 3)} {5689#(<= ~counter~0 3)} #98#return; {5689#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:25,584 INFO L290 TraceCheckUtils]: 40: Hoare triple {5689#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {5689#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:25,584 INFO L290 TraceCheckUtils]: 41: Hoare triple {5689#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {5714#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:25,584 INFO L290 TraceCheckUtils]: 42: Hoare triple {5714#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {5714#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:25,585 INFO L272 TraceCheckUtils]: 43: Hoare triple {5714#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {5714#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:25,585 INFO L290 TraceCheckUtils]: 44: Hoare triple {5714#(<= ~counter~0 4)} ~cond := #in~cond; {5714#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:25,585 INFO L290 TraceCheckUtils]: 45: Hoare triple {5714#(<= ~counter~0 4)} assume !(0 == ~cond); {5714#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:25,585 INFO L290 TraceCheckUtils]: 46: Hoare triple {5714#(<= ~counter~0 4)} assume true; {5714#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:25,586 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {5714#(<= ~counter~0 4)} {5714#(<= ~counter~0 4)} #98#return; {5714#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:25,586 INFO L290 TraceCheckUtils]: 48: Hoare triple {5714#(<= ~counter~0 4)} assume !(~r~0 < 0); {5714#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:25,587 INFO L290 TraceCheckUtils]: 49: Hoare triple {5714#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5739#(<= |main_#t~post6| 4)} is VALID [2022-04-28 05:56:25,587 INFO L290 TraceCheckUtils]: 50: Hoare triple {5739#(<= |main_#t~post6| 4)} assume !(#t~post6 < 100);havoc #t~post6; {5583#false} is VALID [2022-04-28 05:56:25,587 INFO L272 TraceCheckUtils]: 51: Hoare triple {5583#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {5583#false} is VALID [2022-04-28 05:56:25,587 INFO L290 TraceCheckUtils]: 52: Hoare triple {5583#false} ~cond := #in~cond; {5583#false} is VALID [2022-04-28 05:56:25,587 INFO L290 TraceCheckUtils]: 53: Hoare triple {5583#false} assume 0 == ~cond; {5583#false} is VALID [2022-04-28 05:56:25,587 INFO L290 TraceCheckUtils]: 54: Hoare triple {5583#false} assume !false; {5583#false} is VALID [2022-04-28 05:56:25,587 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:56:25,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:56:25,842 INFO L290 TraceCheckUtils]: 54: Hoare triple {5583#false} assume !false; {5583#false} is VALID [2022-04-28 05:56:25,842 INFO L290 TraceCheckUtils]: 53: Hoare triple {5583#false} assume 0 == ~cond; {5583#false} is VALID [2022-04-28 05:56:25,842 INFO L290 TraceCheckUtils]: 52: Hoare triple {5583#false} ~cond := #in~cond; {5583#false} is VALID [2022-04-28 05:56:25,842 INFO L272 TraceCheckUtils]: 51: Hoare triple {5583#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {5583#false} is VALID [2022-04-28 05:56:25,842 INFO L290 TraceCheckUtils]: 50: Hoare triple {5767#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {5583#false} is VALID [2022-04-28 05:56:25,843 INFO L290 TraceCheckUtils]: 49: Hoare triple {5771#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5767#(< |main_#t~post6| 100)} is VALID [2022-04-28 05:56:25,843 INFO L290 TraceCheckUtils]: 48: Hoare triple {5771#(< ~counter~0 100)} assume !(~r~0 < 0); {5771#(< ~counter~0 100)} is VALID [2022-04-28 05:56:25,844 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {5582#true} {5771#(< ~counter~0 100)} #98#return; {5771#(< ~counter~0 100)} is VALID [2022-04-28 05:56:25,844 INFO L290 TraceCheckUtils]: 46: Hoare triple {5582#true} assume true; {5582#true} is VALID [2022-04-28 05:56:25,844 INFO L290 TraceCheckUtils]: 45: Hoare triple {5582#true} assume !(0 == ~cond); {5582#true} is VALID [2022-04-28 05:56:25,844 INFO L290 TraceCheckUtils]: 44: Hoare triple {5582#true} ~cond := #in~cond; {5582#true} is VALID [2022-04-28 05:56:25,844 INFO L272 TraceCheckUtils]: 43: Hoare triple {5771#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {5582#true} is VALID [2022-04-28 05:56:25,845 INFO L290 TraceCheckUtils]: 42: Hoare triple {5771#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {5771#(< ~counter~0 100)} is VALID [2022-04-28 05:56:25,845 INFO L290 TraceCheckUtils]: 41: Hoare triple {5796#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {5771#(< ~counter~0 100)} is VALID [2022-04-28 05:56:25,845 INFO L290 TraceCheckUtils]: 40: Hoare triple {5796#(< ~counter~0 99)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {5796#(< ~counter~0 99)} is VALID [2022-04-28 05:56:25,846 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {5582#true} {5796#(< ~counter~0 99)} #98#return; {5796#(< ~counter~0 99)} is VALID [2022-04-28 05:56:25,846 INFO L290 TraceCheckUtils]: 38: Hoare triple {5582#true} assume true; {5582#true} is VALID [2022-04-28 05:56:25,846 INFO L290 TraceCheckUtils]: 37: Hoare triple {5582#true} assume !(0 == ~cond); {5582#true} is VALID [2022-04-28 05:56:25,846 INFO L290 TraceCheckUtils]: 36: Hoare triple {5582#true} ~cond := #in~cond; {5582#true} is VALID [2022-04-28 05:56:25,846 INFO L272 TraceCheckUtils]: 35: Hoare triple {5796#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {5582#true} is VALID [2022-04-28 05:56:25,846 INFO L290 TraceCheckUtils]: 34: Hoare triple {5796#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {5796#(< ~counter~0 99)} is VALID [2022-04-28 05:56:25,847 INFO L290 TraceCheckUtils]: 33: Hoare triple {5821#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {5796#(< ~counter~0 99)} is VALID [2022-04-28 05:56:25,847 INFO L290 TraceCheckUtils]: 32: Hoare triple {5821#(< ~counter~0 98)} assume !(~r~0 > 0); {5821#(< ~counter~0 98)} is VALID [2022-04-28 05:56:25,848 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {5582#true} {5821#(< ~counter~0 98)} #96#return; {5821#(< ~counter~0 98)} is VALID [2022-04-28 05:56:25,848 INFO L290 TraceCheckUtils]: 30: Hoare triple {5582#true} assume true; {5582#true} is VALID [2022-04-28 05:56:25,848 INFO L290 TraceCheckUtils]: 29: Hoare triple {5582#true} assume !(0 == ~cond); {5582#true} is VALID [2022-04-28 05:56:25,848 INFO L290 TraceCheckUtils]: 28: Hoare triple {5582#true} ~cond := #in~cond; {5582#true} is VALID [2022-04-28 05:56:25,848 INFO L272 TraceCheckUtils]: 27: Hoare triple {5821#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {5582#true} is VALID [2022-04-28 05:56:25,848 INFO L290 TraceCheckUtils]: 26: Hoare triple {5821#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {5821#(< ~counter~0 98)} is VALID [2022-04-28 05:56:25,849 INFO L290 TraceCheckUtils]: 25: Hoare triple {5846#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5821#(< ~counter~0 98)} is VALID [2022-04-28 05:56:25,849 INFO L290 TraceCheckUtils]: 24: Hoare triple {5846#(< ~counter~0 97)} assume !!(0 != ~r~0); {5846#(< ~counter~0 97)} is VALID [2022-04-28 05:56:25,849 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5582#true} {5846#(< ~counter~0 97)} #94#return; {5846#(< ~counter~0 97)} is VALID [2022-04-28 05:56:25,849 INFO L290 TraceCheckUtils]: 22: Hoare triple {5582#true} assume true; {5582#true} is VALID [2022-04-28 05:56:25,849 INFO L290 TraceCheckUtils]: 21: Hoare triple {5582#true} assume !(0 == ~cond); {5582#true} is VALID [2022-04-28 05:56:25,850 INFO L290 TraceCheckUtils]: 20: Hoare triple {5582#true} ~cond := #in~cond; {5582#true} is VALID [2022-04-28 05:56:25,850 INFO L272 TraceCheckUtils]: 19: Hoare triple {5846#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {5582#true} is VALID [2022-04-28 05:56:25,850 INFO L290 TraceCheckUtils]: 18: Hoare triple {5846#(< ~counter~0 97)} assume !!(#t~post6 < 100);havoc #t~post6; {5846#(< ~counter~0 97)} is VALID [2022-04-28 05:56:25,850 INFO L290 TraceCheckUtils]: 17: Hoare triple {5871#(< ~counter~0 96)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5846#(< ~counter~0 97)} is VALID [2022-04-28 05:56:25,851 INFO L290 TraceCheckUtils]: 16: Hoare triple {5871#(< ~counter~0 96)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {5871#(< ~counter~0 96)} is VALID [2022-04-28 05:56:25,851 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5582#true} {5871#(< ~counter~0 96)} #92#return; {5871#(< ~counter~0 96)} is VALID [2022-04-28 05:56:25,851 INFO L290 TraceCheckUtils]: 14: Hoare triple {5582#true} assume true; {5582#true} is VALID [2022-04-28 05:56:25,851 INFO L290 TraceCheckUtils]: 13: Hoare triple {5582#true} assume !(0 == ~cond); {5582#true} is VALID [2022-04-28 05:56:25,851 INFO L290 TraceCheckUtils]: 12: Hoare triple {5582#true} ~cond := #in~cond; {5582#true} is VALID [2022-04-28 05:56:25,851 INFO L272 TraceCheckUtils]: 11: Hoare triple {5871#(< ~counter~0 96)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {5582#true} is VALID [2022-04-28 05:56:25,852 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5582#true} {5871#(< ~counter~0 96)} #90#return; {5871#(< ~counter~0 96)} is VALID [2022-04-28 05:56:25,852 INFO L290 TraceCheckUtils]: 9: Hoare triple {5582#true} assume true; {5582#true} is VALID [2022-04-28 05:56:25,852 INFO L290 TraceCheckUtils]: 8: Hoare triple {5582#true} assume !(0 == ~cond); {5582#true} is VALID [2022-04-28 05:56:25,852 INFO L290 TraceCheckUtils]: 7: Hoare triple {5582#true} ~cond := #in~cond; {5582#true} is VALID [2022-04-28 05:56:25,852 INFO L272 TraceCheckUtils]: 6: Hoare triple {5871#(< ~counter~0 96)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {5582#true} is VALID [2022-04-28 05:56:25,852 INFO L290 TraceCheckUtils]: 5: Hoare triple {5871#(< ~counter~0 96)} 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 96)} is VALID [2022-04-28 05:56:25,852 INFO L272 TraceCheckUtils]: 4: Hoare triple {5871#(< ~counter~0 96)} call #t~ret9 := main(); {5871#(< ~counter~0 96)} is VALID [2022-04-28 05:56:25,853 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5871#(< ~counter~0 96)} {5582#true} #102#return; {5871#(< ~counter~0 96)} is VALID [2022-04-28 05:56:25,853 INFO L290 TraceCheckUtils]: 2: Hoare triple {5871#(< ~counter~0 96)} assume true; {5871#(< ~counter~0 96)} is VALID [2022-04-28 05:56:25,854 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 96)} is VALID [2022-04-28 05:56:25,854 INFO L272 TraceCheckUtils]: 0: Hoare triple {5582#true} call ULTIMATE.init(); {5582#true} is VALID [2022-04-28 05:56:25,854 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 05:56:25,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:56:25,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360334579] [2022-04-28 05:56:25,854 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:56:25,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639670027] [2022-04-28 05:56:25,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [639670027] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:56:25,854 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:56:25,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-28 05:56:25,854 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:56:25,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [359788210] [2022-04-28 05:56:25,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [359788210] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:56:25,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:56:25,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 05:56:25,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763488650] [2022-04-28 05:56:25,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:56:25,855 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 55 [2022-04-28 05:56:25,855 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:56:25,855 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 05:56:25,894 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:56:25,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 05:56:25,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:25,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 05:56:25,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 05:56:25,895 INFO L87 Difference]: Start difference. First operand 82 states and 101 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 05:56:26,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:26,168 INFO L93 Difference]: Finished difference Result 99 states and 121 transitions. [2022-04-28 05:56:26,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 05:56:26,168 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 55 [2022-04-28 05:56:26,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:56:26,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 05:56:26,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-28 05:56:26,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 05:56:26,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-28 05:56:26,170 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 95 transitions. [2022-04-28 05:56:26,228 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:56:26,229 INFO L225 Difference]: With dead ends: 99 [2022-04-28 05:56:26,229 INFO L226 Difference]: Without dead ends: 94 [2022-04-28 05:56:26,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2022-04-28 05:56:26,230 INFO L413 NwaCegarLoop]: 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-28 05:56:26,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 149 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 05:56:26,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-28 05:56:26,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2022-04-28 05:56:26,309 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:56:26,309 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 91 states, 65 states have (on average 1.2) internal successors, (78), 66 states have internal predecessors, (78), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 05:56:26,309 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 91 states, 65 states have (on average 1.2) internal successors, (78), 66 states have internal predecessors, (78), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 05:56:26,310 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 91 states, 65 states have (on average 1.2) internal successors, (78), 66 states have internal predecessors, (78), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 05:56:26,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:26,311 INFO L93 Difference]: Finished difference Result 94 states and 116 transitions. [2022-04-28 05:56:26,311 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 116 transitions. [2022-04-28 05:56:26,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:56:26,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:56:26,312 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 65 states have (on average 1.2) internal successors, (78), 66 states have internal predecessors, (78), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 94 states. [2022-04-28 05:56:26,312 INFO L87 Difference]: Start difference. First operand has 91 states, 65 states have (on average 1.2) internal successors, (78), 66 states have internal predecessors, (78), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 94 states. [2022-04-28 05:56:26,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:26,313 INFO L93 Difference]: Finished difference Result 94 states and 116 transitions. [2022-04-28 05:56:26,313 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 116 transitions. [2022-04-28 05:56:26,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:56:26,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:56:26,314 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:56:26,314 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:56:26,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 65 states have (on average 1.2) internal successors, (78), 66 states have internal predecessors, (78), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 05:56:26,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 112 transitions. [2022-04-28 05:56:26,315 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 112 transitions. Word has length 55 [2022-04-28 05:56:26,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:56:26,316 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 112 transitions. [2022-04-28 05:56:26,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 05:56:26,316 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 112 transitions. [2022-04-28 05:56:27,671 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:56:27,672 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 112 transitions. [2022-04-28 05:56:27,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-28 05:56:27,672 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:56:27,673 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:56:27,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-28 05:56:27,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-28 05:56:27,875 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:56:27,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:56:27,876 INFO L85 PathProgramCache]: Analyzing trace with hash -2095290798, now seen corresponding path program 3 times [2022-04-28 05:56:27,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:27,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1890882405] [2022-04-28 05:56:27,876 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:56:27,877 INFO L85 PathProgramCache]: Analyzing trace with hash -2095290798, now seen corresponding path program 4 times [2022-04-28 05:56:27,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:56:27,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942893460] [2022-04-28 05:56:27,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:56:27,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:56:27,898 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:56:27,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1284845996] [2022-04-28 05:56:27,899 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 05:56:27,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:56:27,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:56:27,900 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:56:27,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-28 05:56:27,960 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 05:56:27,960 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:56:27,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 05:56:27,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:56:27,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:56:28,266 INFO L272 TraceCheckUtils]: 0: Hoare triple {6495#true} call ULTIMATE.init(); {6495#true} is VALID [2022-04-28 05:56:28,267 INFO L290 TraceCheckUtils]: 1: Hoare triple {6495#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6503#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:28,267 INFO L290 TraceCheckUtils]: 2: Hoare triple {6503#(<= ~counter~0 0)} assume true; {6503#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:28,268 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6503#(<= ~counter~0 0)} {6495#true} #102#return; {6503#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:28,268 INFO L272 TraceCheckUtils]: 4: Hoare triple {6503#(<= ~counter~0 0)} call #t~ret9 := main(); {6503#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:28,269 INFO L290 TraceCheckUtils]: 5: Hoare triple {6503#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {6503#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:28,269 INFO L272 TraceCheckUtils]: 6: Hoare triple {6503#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {6503#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:28,270 INFO L290 TraceCheckUtils]: 7: Hoare triple {6503#(<= ~counter~0 0)} ~cond := #in~cond; {6503#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:28,270 INFO L290 TraceCheckUtils]: 8: Hoare triple {6503#(<= ~counter~0 0)} assume !(0 == ~cond); {6503#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:28,270 INFO L290 TraceCheckUtils]: 9: Hoare triple {6503#(<= ~counter~0 0)} assume true; {6503#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:28,271 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6503#(<= ~counter~0 0)} {6503#(<= ~counter~0 0)} #90#return; {6503#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:28,271 INFO L272 TraceCheckUtils]: 11: Hoare triple {6503#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {6503#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:28,272 INFO L290 TraceCheckUtils]: 12: Hoare triple {6503#(<= ~counter~0 0)} ~cond := #in~cond; {6503#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:28,272 INFO L290 TraceCheckUtils]: 13: Hoare triple {6503#(<= ~counter~0 0)} assume !(0 == ~cond); {6503#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:28,272 INFO L290 TraceCheckUtils]: 14: Hoare triple {6503#(<= ~counter~0 0)} assume true; {6503#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:28,273 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6503#(<= ~counter~0 0)} {6503#(<= ~counter~0 0)} #92#return; {6503#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:28,273 INFO L290 TraceCheckUtils]: 16: Hoare triple {6503#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {6503#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:28,274 INFO L290 TraceCheckUtils]: 17: Hoare triple {6503#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6552#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:28,274 INFO L290 TraceCheckUtils]: 18: Hoare triple {6552#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {6552#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:28,274 INFO L272 TraceCheckUtils]: 19: Hoare triple {6552#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6552#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:28,275 INFO L290 TraceCheckUtils]: 20: Hoare triple {6552#(<= ~counter~0 1)} ~cond := #in~cond; {6552#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:28,275 INFO L290 TraceCheckUtils]: 21: Hoare triple {6552#(<= ~counter~0 1)} assume !(0 == ~cond); {6552#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:28,275 INFO L290 TraceCheckUtils]: 22: Hoare triple {6552#(<= ~counter~0 1)} assume true; {6552#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:28,276 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6552#(<= ~counter~0 1)} {6552#(<= ~counter~0 1)} #94#return; {6552#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:28,276 INFO L290 TraceCheckUtils]: 24: Hoare triple {6552#(<= ~counter~0 1)} assume !!(0 != ~r~0); {6552#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:28,277 INFO L290 TraceCheckUtils]: 25: Hoare triple {6552#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6577#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:28,277 INFO L290 TraceCheckUtils]: 26: Hoare triple {6577#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {6577#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:28,278 INFO L272 TraceCheckUtils]: 27: Hoare triple {6577#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6577#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:28,278 INFO L290 TraceCheckUtils]: 28: Hoare triple {6577#(<= ~counter~0 2)} ~cond := #in~cond; {6577#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:28,278 INFO L290 TraceCheckUtils]: 29: Hoare triple {6577#(<= ~counter~0 2)} assume !(0 == ~cond); {6577#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:28,279 INFO L290 TraceCheckUtils]: 30: Hoare triple {6577#(<= ~counter~0 2)} assume true; {6577#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:28,279 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6577#(<= ~counter~0 2)} {6577#(<= ~counter~0 2)} #96#return; {6577#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:28,280 INFO L290 TraceCheckUtils]: 32: Hoare triple {6577#(<= ~counter~0 2)} assume !(~r~0 > 0); {6577#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:28,280 INFO L290 TraceCheckUtils]: 33: Hoare triple {6577#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6602#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:28,281 INFO L290 TraceCheckUtils]: 34: Hoare triple {6602#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {6602#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:28,281 INFO L272 TraceCheckUtils]: 35: Hoare triple {6602#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6602#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:28,281 INFO L290 TraceCheckUtils]: 36: Hoare triple {6602#(<= ~counter~0 3)} ~cond := #in~cond; {6602#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:28,282 INFO L290 TraceCheckUtils]: 37: Hoare triple {6602#(<= ~counter~0 3)} assume !(0 == ~cond); {6602#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:28,282 INFO L290 TraceCheckUtils]: 38: Hoare triple {6602#(<= ~counter~0 3)} assume true; {6602#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:28,283 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {6602#(<= ~counter~0 3)} {6602#(<= ~counter~0 3)} #98#return; {6602#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:28,283 INFO L290 TraceCheckUtils]: 40: Hoare triple {6602#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {6602#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:28,284 INFO L290 TraceCheckUtils]: 41: Hoare triple {6602#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6627#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:28,284 INFO L290 TraceCheckUtils]: 42: Hoare triple {6627#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {6627#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:28,288 INFO L272 TraceCheckUtils]: 43: Hoare triple {6627#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6627#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:28,288 INFO L290 TraceCheckUtils]: 44: Hoare triple {6627#(<= ~counter~0 4)} ~cond := #in~cond; {6627#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:28,289 INFO L290 TraceCheckUtils]: 45: Hoare triple {6627#(<= ~counter~0 4)} assume !(0 == ~cond); {6627#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:28,289 INFO L290 TraceCheckUtils]: 46: Hoare triple {6627#(<= ~counter~0 4)} assume true; {6627#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:28,290 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6627#(<= ~counter~0 4)} {6627#(<= ~counter~0 4)} #98#return; {6627#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:28,290 INFO L290 TraceCheckUtils]: 48: Hoare triple {6627#(<= ~counter~0 4)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {6627#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:28,291 INFO L290 TraceCheckUtils]: 49: Hoare triple {6627#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6652#(<= |main_#t~post8| 4)} is VALID [2022-04-28 05:56:28,291 INFO L290 TraceCheckUtils]: 50: Hoare triple {6652#(<= |main_#t~post8| 4)} assume !(#t~post8 < 100);havoc #t~post8; {6496#false} is VALID [2022-04-28 05:56:28,292 INFO L290 TraceCheckUtils]: 51: Hoare triple {6496#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6496#false} is VALID [2022-04-28 05:56:28,292 INFO L290 TraceCheckUtils]: 52: Hoare triple {6496#false} assume !(#t~post6 < 100);havoc #t~post6; {6496#false} is VALID [2022-04-28 05:56:28,292 INFO L272 TraceCheckUtils]: 53: Hoare triple {6496#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6496#false} is VALID [2022-04-28 05:56:28,292 INFO L290 TraceCheckUtils]: 54: Hoare triple {6496#false} ~cond := #in~cond; {6496#false} is VALID [2022-04-28 05:56:28,292 INFO L290 TraceCheckUtils]: 55: Hoare triple {6496#false} assume 0 == ~cond; {6496#false} is VALID [2022-04-28 05:56:28,292 INFO L290 TraceCheckUtils]: 56: Hoare triple {6496#false} assume !false; {6496#false} is VALID [2022-04-28 05:56:28,292 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 10 proven. 32 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:56:28,292 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:56:28,589 INFO L290 TraceCheckUtils]: 56: Hoare triple {6496#false} assume !false; {6496#false} is VALID [2022-04-28 05:56:28,590 INFO L290 TraceCheckUtils]: 55: Hoare triple {6496#false} assume 0 == ~cond; {6496#false} is VALID [2022-04-28 05:56:28,590 INFO L290 TraceCheckUtils]: 54: Hoare triple {6496#false} ~cond := #in~cond; {6496#false} is VALID [2022-04-28 05:56:28,590 INFO L272 TraceCheckUtils]: 53: Hoare triple {6496#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6496#false} is VALID [2022-04-28 05:56:28,590 INFO L290 TraceCheckUtils]: 52: Hoare triple {6496#false} assume !(#t~post6 < 100);havoc #t~post6; {6496#false} is VALID [2022-04-28 05:56:28,590 INFO L290 TraceCheckUtils]: 51: Hoare triple {6496#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6496#false} is VALID [2022-04-28 05:56:28,590 INFO L290 TraceCheckUtils]: 50: Hoare triple {6692#(< |main_#t~post8| 100)} assume !(#t~post8 < 100);havoc #t~post8; {6496#false} is VALID [2022-04-28 05:56:28,591 INFO L290 TraceCheckUtils]: 49: Hoare triple {6696#(< ~counter~0 100)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6692#(< |main_#t~post8| 100)} is VALID [2022-04-28 05:56:28,591 INFO L290 TraceCheckUtils]: 48: Hoare triple {6696#(< ~counter~0 100)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {6696#(< ~counter~0 100)} is VALID [2022-04-28 05:56:28,592 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6495#true} {6696#(< ~counter~0 100)} #98#return; {6696#(< ~counter~0 100)} is VALID [2022-04-28 05:56:28,592 INFO L290 TraceCheckUtils]: 46: Hoare triple {6495#true} assume true; {6495#true} is VALID [2022-04-28 05:56:28,592 INFO L290 TraceCheckUtils]: 45: Hoare triple {6495#true} assume !(0 == ~cond); {6495#true} is VALID [2022-04-28 05:56:28,592 INFO L290 TraceCheckUtils]: 44: Hoare triple {6495#true} ~cond := #in~cond; {6495#true} is VALID [2022-04-28 05:56:28,592 INFO L272 TraceCheckUtils]: 43: Hoare triple {6696#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6495#true} is VALID [2022-04-28 05:56:28,592 INFO L290 TraceCheckUtils]: 42: Hoare triple {6696#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {6696#(< ~counter~0 100)} is VALID [2022-04-28 05:56:28,593 INFO L290 TraceCheckUtils]: 41: Hoare triple {6721#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6696#(< ~counter~0 100)} is VALID [2022-04-28 05:56:28,593 INFO L290 TraceCheckUtils]: 40: Hoare triple {6721#(< ~counter~0 99)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {6721#(< ~counter~0 99)} is VALID [2022-04-28 05:56:28,594 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {6495#true} {6721#(< ~counter~0 99)} #98#return; {6721#(< ~counter~0 99)} is VALID [2022-04-28 05:56:28,594 INFO L290 TraceCheckUtils]: 38: Hoare triple {6495#true} assume true; {6495#true} is VALID [2022-04-28 05:56:28,594 INFO L290 TraceCheckUtils]: 37: Hoare triple {6495#true} assume !(0 == ~cond); {6495#true} is VALID [2022-04-28 05:56:28,594 INFO L290 TraceCheckUtils]: 36: Hoare triple {6495#true} ~cond := #in~cond; {6495#true} is VALID [2022-04-28 05:56:28,594 INFO L272 TraceCheckUtils]: 35: Hoare triple {6721#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6495#true} is VALID [2022-04-28 05:56:28,619 INFO L290 TraceCheckUtils]: 34: Hoare triple {6721#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {6721#(< ~counter~0 99)} is VALID [2022-04-28 05:56:28,620 INFO L290 TraceCheckUtils]: 33: Hoare triple {6746#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6721#(< ~counter~0 99)} is VALID [2022-04-28 05:56:28,621 INFO L290 TraceCheckUtils]: 32: Hoare triple {6746#(< ~counter~0 98)} assume !(~r~0 > 0); {6746#(< ~counter~0 98)} is VALID [2022-04-28 05:56:28,621 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6495#true} {6746#(< ~counter~0 98)} #96#return; {6746#(< ~counter~0 98)} is VALID [2022-04-28 05:56:28,621 INFO L290 TraceCheckUtils]: 30: Hoare triple {6495#true} assume true; {6495#true} is VALID [2022-04-28 05:56:28,621 INFO L290 TraceCheckUtils]: 29: Hoare triple {6495#true} assume !(0 == ~cond); {6495#true} is VALID [2022-04-28 05:56:28,622 INFO L290 TraceCheckUtils]: 28: Hoare triple {6495#true} ~cond := #in~cond; {6495#true} is VALID [2022-04-28 05:56:28,622 INFO L272 TraceCheckUtils]: 27: Hoare triple {6746#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6495#true} is VALID [2022-04-28 05:56:28,624 INFO L290 TraceCheckUtils]: 26: Hoare triple {6746#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {6746#(< ~counter~0 98)} is VALID [2022-04-28 05:56:28,625 INFO L290 TraceCheckUtils]: 25: Hoare triple {6771#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6746#(< ~counter~0 98)} is VALID [2022-04-28 05:56:28,625 INFO L290 TraceCheckUtils]: 24: Hoare triple {6771#(< ~counter~0 97)} assume !!(0 != ~r~0); {6771#(< ~counter~0 97)} is VALID [2022-04-28 05:56:28,627 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6495#true} {6771#(< ~counter~0 97)} #94#return; {6771#(< ~counter~0 97)} is VALID [2022-04-28 05:56:28,627 INFO L290 TraceCheckUtils]: 22: Hoare triple {6495#true} assume true; {6495#true} is VALID [2022-04-28 05:56:28,627 INFO L290 TraceCheckUtils]: 21: Hoare triple {6495#true} assume !(0 == ~cond); {6495#true} is VALID [2022-04-28 05:56:28,627 INFO L290 TraceCheckUtils]: 20: Hoare triple {6495#true} ~cond := #in~cond; {6495#true} is VALID [2022-04-28 05:56:28,628 INFO L272 TraceCheckUtils]: 19: Hoare triple {6771#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6495#true} is VALID [2022-04-28 05:56:28,628 INFO L290 TraceCheckUtils]: 18: Hoare triple {6771#(< ~counter~0 97)} assume !!(#t~post6 < 100);havoc #t~post6; {6771#(< ~counter~0 97)} is VALID [2022-04-28 05:56:28,628 INFO L290 TraceCheckUtils]: 17: Hoare triple {6796#(< ~counter~0 96)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6771#(< ~counter~0 97)} is VALID [2022-04-28 05:56:28,629 INFO L290 TraceCheckUtils]: 16: Hoare triple {6796#(< ~counter~0 96)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {6796#(< ~counter~0 96)} is VALID [2022-04-28 05:56:28,629 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6495#true} {6796#(< ~counter~0 96)} #92#return; {6796#(< ~counter~0 96)} is VALID [2022-04-28 05:56:28,629 INFO L290 TraceCheckUtils]: 14: Hoare triple {6495#true} assume true; {6495#true} is VALID [2022-04-28 05:56:28,630 INFO L290 TraceCheckUtils]: 13: Hoare triple {6495#true} assume !(0 == ~cond); {6495#true} is VALID [2022-04-28 05:56:28,630 INFO L290 TraceCheckUtils]: 12: Hoare triple {6495#true} ~cond := #in~cond; {6495#true} is VALID [2022-04-28 05:56:28,630 INFO L272 TraceCheckUtils]: 11: Hoare triple {6796#(< ~counter~0 96)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {6495#true} is VALID [2022-04-28 05:56:28,630 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6495#true} {6796#(< ~counter~0 96)} #90#return; {6796#(< ~counter~0 96)} is VALID [2022-04-28 05:56:28,630 INFO L290 TraceCheckUtils]: 9: Hoare triple {6495#true} assume true; {6495#true} is VALID [2022-04-28 05:56:28,630 INFO L290 TraceCheckUtils]: 8: Hoare triple {6495#true} assume !(0 == ~cond); {6495#true} is VALID [2022-04-28 05:56:28,631 INFO L290 TraceCheckUtils]: 7: Hoare triple {6495#true} ~cond := #in~cond; {6495#true} is VALID [2022-04-28 05:56:28,631 INFO L272 TraceCheckUtils]: 6: Hoare triple {6796#(< ~counter~0 96)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {6495#true} is VALID [2022-04-28 05:56:28,631 INFO L290 TraceCheckUtils]: 5: Hoare triple {6796#(< ~counter~0 96)} 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 96)} is VALID [2022-04-28 05:56:28,631 INFO L272 TraceCheckUtils]: 4: Hoare triple {6796#(< ~counter~0 96)} call #t~ret9 := main(); {6796#(< ~counter~0 96)} is VALID [2022-04-28 05:56:28,632 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6796#(< ~counter~0 96)} {6495#true} #102#return; {6796#(< ~counter~0 96)} is VALID [2022-04-28 05:56:28,632 INFO L290 TraceCheckUtils]: 2: Hoare triple {6796#(< ~counter~0 96)} assume true; {6796#(< ~counter~0 96)} is VALID [2022-04-28 05:56:28,633 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 96)} is VALID [2022-04-28 05:56:28,633 INFO L272 TraceCheckUtils]: 0: Hoare triple {6495#true} call ULTIMATE.init(); {6495#true} is VALID [2022-04-28 05:56:28,633 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 05:56:28,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:56:28,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942893460] [2022-04-28 05:56:28,633 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:56:28,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284845996] [2022-04-28 05:56:28,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284845996] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:56:28,634 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:56:28,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-28 05:56:28,634 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:56:28,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1890882405] [2022-04-28 05:56:28,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1890882405] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:56:28,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:56:28,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 05:56:28,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207475909] [2022-04-28 05:56:28,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:56:28,635 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 57 [2022-04-28 05:56:28,635 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:56:28,635 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 05:56:28,676 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:56:28,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 05:56:28,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:28,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 05:56:28,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 05:56:28,677 INFO L87 Difference]: Start difference. First operand 91 states and 112 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 05:56:28,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:28,995 INFO L93 Difference]: Finished difference Result 132 states and 170 transitions. [2022-04-28 05:56:28,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 05:56:28,995 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 57 [2022-04-28 05:56:28,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:56:28,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 05:56:28,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2022-04-28 05:56:28,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 05:56:29,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2022-04-28 05:56:29,001 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 117 transitions. [2022-04-28 05:56:29,097 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:56:29,099 INFO L225 Difference]: With dead ends: 132 [2022-04-28 05:56:29,099 INFO L226 Difference]: Without dead ends: 95 [2022-04-28 05:56:29,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2022-04-28 05:56:29,100 INFO L413 NwaCegarLoop]: 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.1s IncrementalHoareTripleChecker+Time [2022-04-28 05:56:29,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 160 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 05:56:29,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-04-28 05:56:29,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2022-04-28 05:56:29,198 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:56:29,198 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand has 94 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 68 states have internal predecessors, (82), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 05:56:29,198 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand has 94 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 68 states have internal predecessors, (82), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 05:56:29,199 INFO L87 Difference]: Start difference. First operand 95 states. Second operand has 94 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 68 states have internal predecessors, (82), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 05:56:29,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:29,201 INFO L93 Difference]: Finished difference Result 95 states and 117 transitions. [2022-04-28 05:56:29,201 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 117 transitions. [2022-04-28 05:56:29,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:56:29,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:56:29,202 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 68 states have internal predecessors, (82), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 95 states. [2022-04-28 05:56:29,202 INFO L87 Difference]: Start difference. First operand has 94 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 68 states have internal predecessors, (82), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 95 states. [2022-04-28 05:56:29,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:29,204 INFO L93 Difference]: Finished difference Result 95 states and 117 transitions. [2022-04-28 05:56:29,204 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 117 transitions. [2022-04-28 05:56:29,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:56:29,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:56:29,204 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:56:29,204 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:56:29,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 68 states have internal predecessors, (82), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 05:56:29,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 116 transitions. [2022-04-28 05:56:29,207 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 116 transitions. Word has length 57 [2022-04-28 05:56:29,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:56:29,207 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 116 transitions. [2022-04-28 05:56:29,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 05:56:29,207 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 116 transitions. [2022-04-28 05:56:31,385 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 115 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 05:56:31,386 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 116 transitions. [2022-04-28 05:56:31,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-28 05:56:31,386 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:56:31,387 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:56:31,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-28 05:56:31,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-28 05:56:31,587 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:56:31,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:56:31,588 INFO L85 PathProgramCache]: Analyzing trace with hash -659642693, now seen corresponding path program 5 times [2022-04-28 05:56:31,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:31,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [81486537] [2022-04-28 05:56:31,588 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:56:31,588 INFO L85 PathProgramCache]: Analyzing trace with hash -659642693, now seen corresponding path program 6 times [2022-04-28 05:56:31,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:56:31,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301938931] [2022-04-28 05:56:31,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:56:31,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:56:31,600 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:56:31,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [432761884] [2022-04-28 05:56:31,601 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 05:56:31,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:56:31,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:56:31,602 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:56:31,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-28 05:56:31,713 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 05:56:31,713 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:56:31,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 05:56:31,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:56:31,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:56:32,007 INFO L272 TraceCheckUtils]: 0: Hoare triple {7496#true} call ULTIMATE.init(); {7496#true} is VALID [2022-04-28 05:56:32,008 INFO L290 TraceCheckUtils]: 1: Hoare triple {7496#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7504#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:32,008 INFO L290 TraceCheckUtils]: 2: Hoare triple {7504#(<= ~counter~0 0)} assume true; {7504#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:32,008 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7504#(<= ~counter~0 0)} {7496#true} #102#return; {7504#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:32,009 INFO L272 TraceCheckUtils]: 4: Hoare triple {7504#(<= ~counter~0 0)} call #t~ret9 := main(); {7504#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:32,009 INFO L290 TraceCheckUtils]: 5: Hoare triple {7504#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {7504#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:32,010 INFO L272 TraceCheckUtils]: 6: Hoare triple {7504#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {7504#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:32,010 INFO L290 TraceCheckUtils]: 7: Hoare triple {7504#(<= ~counter~0 0)} ~cond := #in~cond; {7504#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:32,010 INFO L290 TraceCheckUtils]: 8: Hoare triple {7504#(<= ~counter~0 0)} assume !(0 == ~cond); {7504#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:32,011 INFO L290 TraceCheckUtils]: 9: Hoare triple {7504#(<= ~counter~0 0)} assume true; {7504#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:32,011 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7504#(<= ~counter~0 0)} {7504#(<= ~counter~0 0)} #90#return; {7504#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:32,012 INFO L272 TraceCheckUtils]: 11: Hoare triple {7504#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {7504#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:32,012 INFO L290 TraceCheckUtils]: 12: Hoare triple {7504#(<= ~counter~0 0)} ~cond := #in~cond; {7504#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:32,013 INFO L290 TraceCheckUtils]: 13: Hoare triple {7504#(<= ~counter~0 0)} assume !(0 == ~cond); {7504#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:32,013 INFO L290 TraceCheckUtils]: 14: Hoare triple {7504#(<= ~counter~0 0)} assume true; {7504#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:32,014 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7504#(<= ~counter~0 0)} {7504#(<= ~counter~0 0)} #92#return; {7504#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:32,019 INFO L290 TraceCheckUtils]: 16: Hoare triple {7504#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {7504#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:32,019 INFO L290 TraceCheckUtils]: 17: Hoare triple {7504#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7553#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:32,020 INFO L290 TraceCheckUtils]: 18: Hoare triple {7553#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {7553#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:32,020 INFO L272 TraceCheckUtils]: 19: Hoare triple {7553#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7553#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:32,021 INFO L290 TraceCheckUtils]: 20: Hoare triple {7553#(<= ~counter~0 1)} ~cond := #in~cond; {7553#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:32,021 INFO L290 TraceCheckUtils]: 21: Hoare triple {7553#(<= ~counter~0 1)} assume !(0 == ~cond); {7553#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:32,021 INFO L290 TraceCheckUtils]: 22: Hoare triple {7553#(<= ~counter~0 1)} assume true; {7553#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:32,022 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7553#(<= ~counter~0 1)} {7553#(<= ~counter~0 1)} #94#return; {7553#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:32,022 INFO L290 TraceCheckUtils]: 24: Hoare triple {7553#(<= ~counter~0 1)} assume !!(0 != ~r~0); {7553#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:32,023 INFO L290 TraceCheckUtils]: 25: Hoare triple {7553#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7578#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:32,023 INFO L290 TraceCheckUtils]: 26: Hoare triple {7578#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {7578#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:32,024 INFO L272 TraceCheckUtils]: 27: Hoare triple {7578#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7578#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:32,024 INFO L290 TraceCheckUtils]: 28: Hoare triple {7578#(<= ~counter~0 2)} ~cond := #in~cond; {7578#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:32,024 INFO L290 TraceCheckUtils]: 29: Hoare triple {7578#(<= ~counter~0 2)} assume !(0 == ~cond); {7578#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:32,025 INFO L290 TraceCheckUtils]: 30: Hoare triple {7578#(<= ~counter~0 2)} assume true; {7578#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:32,025 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {7578#(<= ~counter~0 2)} {7578#(<= ~counter~0 2)} #96#return; {7578#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:32,026 INFO L290 TraceCheckUtils]: 32: Hoare triple {7578#(<= ~counter~0 2)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7578#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:32,026 INFO L290 TraceCheckUtils]: 33: Hoare triple {7578#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7603#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:32,026 INFO L290 TraceCheckUtils]: 34: Hoare triple {7603#(<= ~counter~0 3)} assume !!(#t~post7 < 100);havoc #t~post7; {7603#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:32,027 INFO L272 TraceCheckUtils]: 35: Hoare triple {7603#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7603#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:32,027 INFO L290 TraceCheckUtils]: 36: Hoare triple {7603#(<= ~counter~0 3)} ~cond := #in~cond; {7603#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:32,028 INFO L290 TraceCheckUtils]: 37: Hoare triple {7603#(<= ~counter~0 3)} assume !(0 == ~cond); {7603#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:32,028 INFO L290 TraceCheckUtils]: 38: Hoare triple {7603#(<= ~counter~0 3)} assume true; {7603#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:32,044 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {7603#(<= ~counter~0 3)} {7603#(<= ~counter~0 3)} #96#return; {7603#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:32,044 INFO L290 TraceCheckUtils]: 40: Hoare triple {7603#(<= ~counter~0 3)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7603#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:32,045 INFO L290 TraceCheckUtils]: 41: Hoare triple {7603#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7628#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:32,045 INFO L290 TraceCheckUtils]: 42: Hoare triple {7628#(<= ~counter~0 4)} assume !!(#t~post7 < 100);havoc #t~post7; {7628#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:32,046 INFO L272 TraceCheckUtils]: 43: Hoare triple {7628#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7628#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:32,047 INFO L290 TraceCheckUtils]: 44: Hoare triple {7628#(<= ~counter~0 4)} ~cond := #in~cond; {7628#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:32,047 INFO L290 TraceCheckUtils]: 45: Hoare triple {7628#(<= ~counter~0 4)} assume !(0 == ~cond); {7628#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:32,048 INFO L290 TraceCheckUtils]: 46: Hoare triple {7628#(<= ~counter~0 4)} assume true; {7628#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:32,048 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {7628#(<= ~counter~0 4)} {7628#(<= ~counter~0 4)} #96#return; {7628#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:32,049 INFO L290 TraceCheckUtils]: 48: Hoare triple {7628#(<= ~counter~0 4)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7628#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:32,049 INFO L290 TraceCheckUtils]: 49: Hoare triple {7628#(<= ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7653#(<= |main_#t~post7| 4)} is VALID [2022-04-28 05:56:32,050 INFO L290 TraceCheckUtils]: 50: Hoare triple {7653#(<= |main_#t~post7| 4)} assume !(#t~post7 < 100);havoc #t~post7; {7497#false} is VALID [2022-04-28 05:56:32,050 INFO L290 TraceCheckUtils]: 51: Hoare triple {7497#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {7497#false} is VALID [2022-04-28 05:56:32,050 INFO L290 TraceCheckUtils]: 52: Hoare triple {7497#false} assume !(#t~post8 < 100);havoc #t~post8; {7497#false} is VALID [2022-04-28 05:56:32,050 INFO L290 TraceCheckUtils]: 53: Hoare triple {7497#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7497#false} is VALID [2022-04-28 05:56:32,050 INFO L290 TraceCheckUtils]: 54: Hoare triple {7497#false} assume !(#t~post6 < 100);havoc #t~post6; {7497#false} is VALID [2022-04-28 05:56:32,050 INFO L272 TraceCheckUtils]: 55: Hoare triple {7497#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7497#false} is VALID [2022-04-28 05:56:32,050 INFO L290 TraceCheckUtils]: 56: Hoare triple {7497#false} ~cond := #in~cond; {7497#false} is VALID [2022-04-28 05:56:32,050 INFO L290 TraceCheckUtils]: 57: Hoare triple {7497#false} assume 0 == ~cond; {7497#false} is VALID [2022-04-28 05:56:32,050 INFO L290 TraceCheckUtils]: 58: Hoare triple {7497#false} assume !false; {7497#false} is VALID [2022-04-28 05:56:32,051 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 10 proven. 42 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:56:32,051 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:56:32,327 INFO L290 TraceCheckUtils]: 58: Hoare triple {7497#false} assume !false; {7497#false} is VALID [2022-04-28 05:56:32,327 INFO L290 TraceCheckUtils]: 57: Hoare triple {7497#false} assume 0 == ~cond; {7497#false} is VALID [2022-04-28 05:56:32,327 INFO L290 TraceCheckUtils]: 56: Hoare triple {7497#false} ~cond := #in~cond; {7497#false} is VALID [2022-04-28 05:56:32,327 INFO L272 TraceCheckUtils]: 55: Hoare triple {7497#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7497#false} is VALID [2022-04-28 05:56:32,327 INFO L290 TraceCheckUtils]: 54: Hoare triple {7497#false} assume !(#t~post6 < 100);havoc #t~post6; {7497#false} is VALID [2022-04-28 05:56:32,327 INFO L290 TraceCheckUtils]: 53: Hoare triple {7497#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7497#false} is VALID [2022-04-28 05:56:32,328 INFO L290 TraceCheckUtils]: 52: Hoare triple {7497#false} assume !(#t~post8 < 100);havoc #t~post8; {7497#false} is VALID [2022-04-28 05:56:32,328 INFO L290 TraceCheckUtils]: 51: Hoare triple {7497#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {7497#false} is VALID [2022-04-28 05:56:32,328 INFO L290 TraceCheckUtils]: 50: Hoare triple {7705#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {7497#false} is VALID [2022-04-28 05:56:32,328 INFO L290 TraceCheckUtils]: 49: Hoare triple {7709#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7705#(< |main_#t~post7| 100)} is VALID [2022-04-28 05:56:32,328 INFO L290 TraceCheckUtils]: 48: Hoare triple {7709#(< ~counter~0 100)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7709#(< ~counter~0 100)} is VALID [2022-04-28 05:56:32,329 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {7496#true} {7709#(< ~counter~0 100)} #96#return; {7709#(< ~counter~0 100)} is VALID [2022-04-28 05:56:32,329 INFO L290 TraceCheckUtils]: 46: Hoare triple {7496#true} assume true; {7496#true} is VALID [2022-04-28 05:56:32,329 INFO L290 TraceCheckUtils]: 45: Hoare triple {7496#true} assume !(0 == ~cond); {7496#true} is VALID [2022-04-28 05:56:32,329 INFO L290 TraceCheckUtils]: 44: Hoare triple {7496#true} ~cond := #in~cond; {7496#true} is VALID [2022-04-28 05:56:32,329 INFO L272 TraceCheckUtils]: 43: Hoare triple {7709#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7496#true} is VALID [2022-04-28 05:56:32,330 INFO L290 TraceCheckUtils]: 42: Hoare triple {7709#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {7709#(< ~counter~0 100)} is VALID [2022-04-28 05:56:32,330 INFO L290 TraceCheckUtils]: 41: Hoare triple {7734#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7709#(< ~counter~0 100)} is VALID [2022-04-28 05:56:32,330 INFO L290 TraceCheckUtils]: 40: Hoare triple {7734#(< ~counter~0 99)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7734#(< ~counter~0 99)} is VALID [2022-04-28 05:56:32,331 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {7496#true} {7734#(< ~counter~0 99)} #96#return; {7734#(< ~counter~0 99)} is VALID [2022-04-28 05:56:32,331 INFO L290 TraceCheckUtils]: 38: Hoare triple {7496#true} assume true; {7496#true} is VALID [2022-04-28 05:56:32,331 INFO L290 TraceCheckUtils]: 37: Hoare triple {7496#true} assume !(0 == ~cond); {7496#true} is VALID [2022-04-28 05:56:32,331 INFO L290 TraceCheckUtils]: 36: Hoare triple {7496#true} ~cond := #in~cond; {7496#true} is VALID [2022-04-28 05:56:32,331 INFO L272 TraceCheckUtils]: 35: Hoare triple {7734#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7496#true} is VALID [2022-04-28 05:56:32,331 INFO L290 TraceCheckUtils]: 34: Hoare triple {7734#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {7734#(< ~counter~0 99)} is VALID [2022-04-28 05:56:32,332 INFO L290 TraceCheckUtils]: 33: Hoare triple {7759#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7734#(< ~counter~0 99)} is VALID [2022-04-28 05:56:32,332 INFO L290 TraceCheckUtils]: 32: Hoare triple {7759#(< ~counter~0 98)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7759#(< ~counter~0 98)} is VALID [2022-04-28 05:56:32,333 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {7496#true} {7759#(< ~counter~0 98)} #96#return; {7759#(< ~counter~0 98)} is VALID [2022-04-28 05:56:32,333 INFO L290 TraceCheckUtils]: 30: Hoare triple {7496#true} assume true; {7496#true} is VALID [2022-04-28 05:56:32,333 INFO L290 TraceCheckUtils]: 29: Hoare triple {7496#true} assume !(0 == ~cond); {7496#true} is VALID [2022-04-28 05:56:32,333 INFO L290 TraceCheckUtils]: 28: Hoare triple {7496#true} ~cond := #in~cond; {7496#true} is VALID [2022-04-28 05:56:32,333 INFO L272 TraceCheckUtils]: 27: Hoare triple {7759#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7496#true} is VALID [2022-04-28 05:56:32,333 INFO L290 TraceCheckUtils]: 26: Hoare triple {7759#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {7759#(< ~counter~0 98)} is VALID [2022-04-28 05:56:32,334 INFO L290 TraceCheckUtils]: 25: Hoare triple {7784#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7759#(< ~counter~0 98)} is VALID [2022-04-28 05:56:32,334 INFO L290 TraceCheckUtils]: 24: Hoare triple {7784#(< ~counter~0 97)} assume !!(0 != ~r~0); {7784#(< ~counter~0 97)} is VALID [2022-04-28 05:56:32,334 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7496#true} {7784#(< ~counter~0 97)} #94#return; {7784#(< ~counter~0 97)} is VALID [2022-04-28 05:56:32,334 INFO L290 TraceCheckUtils]: 22: Hoare triple {7496#true} assume true; {7496#true} is VALID [2022-04-28 05:56:32,335 INFO L290 TraceCheckUtils]: 21: Hoare triple {7496#true} assume !(0 == ~cond); {7496#true} is VALID [2022-04-28 05:56:32,335 INFO L290 TraceCheckUtils]: 20: Hoare triple {7496#true} ~cond := #in~cond; {7496#true} is VALID [2022-04-28 05:56:32,335 INFO L272 TraceCheckUtils]: 19: Hoare triple {7784#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7496#true} is VALID [2022-04-28 05:56:32,335 INFO L290 TraceCheckUtils]: 18: Hoare triple {7784#(< ~counter~0 97)} assume !!(#t~post6 < 100);havoc #t~post6; {7784#(< ~counter~0 97)} is VALID [2022-04-28 05:56:32,335 INFO L290 TraceCheckUtils]: 17: Hoare triple {7809#(< ~counter~0 96)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7784#(< ~counter~0 97)} is VALID [2022-04-28 05:56:32,336 INFO L290 TraceCheckUtils]: 16: Hoare triple {7809#(< ~counter~0 96)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {7809#(< ~counter~0 96)} is VALID [2022-04-28 05:56:32,336 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7496#true} {7809#(< ~counter~0 96)} #92#return; {7809#(< ~counter~0 96)} is VALID [2022-04-28 05:56:32,336 INFO L290 TraceCheckUtils]: 14: Hoare triple {7496#true} assume true; {7496#true} is VALID [2022-04-28 05:56:32,336 INFO L290 TraceCheckUtils]: 13: Hoare triple {7496#true} assume !(0 == ~cond); {7496#true} is VALID [2022-04-28 05:56:32,336 INFO L290 TraceCheckUtils]: 12: Hoare triple {7496#true} ~cond := #in~cond; {7496#true} is VALID [2022-04-28 05:56:32,336 INFO L272 TraceCheckUtils]: 11: Hoare triple {7809#(< ~counter~0 96)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {7496#true} is VALID [2022-04-28 05:56:32,337 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7496#true} {7809#(< ~counter~0 96)} #90#return; {7809#(< ~counter~0 96)} is VALID [2022-04-28 05:56:32,337 INFO L290 TraceCheckUtils]: 9: Hoare triple {7496#true} assume true; {7496#true} is VALID [2022-04-28 05:56:32,337 INFO L290 TraceCheckUtils]: 8: Hoare triple {7496#true} assume !(0 == ~cond); {7496#true} is VALID [2022-04-28 05:56:32,337 INFO L290 TraceCheckUtils]: 7: Hoare triple {7496#true} ~cond := #in~cond; {7496#true} is VALID [2022-04-28 05:56:32,337 INFO L272 TraceCheckUtils]: 6: Hoare triple {7809#(< ~counter~0 96)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {7496#true} is VALID [2022-04-28 05:56:32,337 INFO L290 TraceCheckUtils]: 5: Hoare triple {7809#(< ~counter~0 96)} 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 96)} is VALID [2022-04-28 05:56:32,338 INFO L272 TraceCheckUtils]: 4: Hoare triple {7809#(< ~counter~0 96)} call #t~ret9 := main(); {7809#(< ~counter~0 96)} is VALID [2022-04-28 05:56:32,338 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7809#(< ~counter~0 96)} {7496#true} #102#return; {7809#(< ~counter~0 96)} is VALID [2022-04-28 05:56:32,338 INFO L290 TraceCheckUtils]: 2: Hoare triple {7809#(< ~counter~0 96)} assume true; {7809#(< ~counter~0 96)} is VALID [2022-04-28 05:56:32,339 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 96)} is VALID [2022-04-28 05:56:32,339 INFO L272 TraceCheckUtils]: 0: Hoare triple {7496#true} call ULTIMATE.init(); {7496#true} is VALID [2022-04-28 05:56:32,339 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 05:56:32,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:56:32,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301938931] [2022-04-28 05:56:32,339 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:56:32,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432761884] [2022-04-28 05:56:32,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [432761884] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:56:32,339 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:56:32,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-28 05:56:32,340 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:56:32,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [81486537] [2022-04-28 05:56:32,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [81486537] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:56:32,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:56:32,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 05:56:32,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745574357] [2022-04-28 05:56:32,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:56:32,340 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 59 [2022-04-28 05:56:32,341 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:56:32,341 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 05:56:32,376 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:56:32,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 05:56:32,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:32,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 05:56:32,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 05:56:32,376 INFO L87 Difference]: Start difference. First operand 94 states and 116 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 05:56:32,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:32,652 INFO L93 Difference]: Finished difference Result 133 states and 171 transitions. [2022-04-28 05:56:32,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 05:56:32,653 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 59 [2022-04-28 05:56:32,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:56:32,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 05:56:32,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 117 transitions. [2022-04-28 05:56:32,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 05:56:32,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 117 transitions. [2022-04-28 05:56:32,655 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 117 transitions. [2022-04-28 05:56:32,727 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:56:32,728 INFO L225 Difference]: With dead ends: 133 [2022-04-28 05:56:32,729 INFO L226 Difference]: Without dead ends: 96 [2022-04-28 05:56:32,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=165, Unknown=0, NotChecked=0, Total=272 [2022-04-28 05:56:32,729 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 35 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 05:56:32,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 146 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 05:56:32,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-28 05:56:32,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-04-28 05:56:32,809 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:56:32,809 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 96 states, 70 states have (on average 1.2) internal successors, (84), 70 states have internal predecessors, (84), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 05:56:32,809 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 96 states, 70 states have (on average 1.2) internal successors, (84), 70 states have internal predecessors, (84), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 05:56:32,809 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 96 states, 70 states have (on average 1.2) internal successors, (84), 70 states have internal predecessors, (84), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 05:56:32,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:32,811 INFO L93 Difference]: Finished difference Result 96 states and 118 transitions. [2022-04-28 05:56:32,811 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 118 transitions. [2022-04-28 05:56:32,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:56:32,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:56:32,811 INFO L74 IsIncluded]: Start isIncluded. First operand has 96 states, 70 states have (on average 1.2) internal successors, (84), 70 states have internal predecessors, (84), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 96 states. [2022-04-28 05:56:32,811 INFO L87 Difference]: Start difference. First operand has 96 states, 70 states have (on average 1.2) internal successors, (84), 70 states have internal predecessors, (84), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 96 states. [2022-04-28 05:56:32,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:32,813 INFO L93 Difference]: Finished difference Result 96 states and 118 transitions. [2022-04-28 05:56:32,813 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 118 transitions. [2022-04-28 05:56:32,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:56:32,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:56:32,813 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:56:32,813 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:56:32,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 70 states have (on average 1.2) internal successors, (84), 70 states have internal predecessors, (84), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 05:56:32,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 118 transitions. [2022-04-28 05:56:32,821 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 118 transitions. Word has length 59 [2022-04-28 05:56:32,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:56:32,821 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 118 transitions. [2022-04-28 05:56:32,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 05:56:32,821 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 96 states and 118 transitions. [2022-04-28 05:56:33,705 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:56:33,705 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 118 transitions. [2022-04-28 05:56:33,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-28 05:56:33,705 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:56:33,705 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:56:33,712 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-28 05:56:33,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-28 05:56:33,906 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:56:33,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:56:33,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1402694082, now seen corresponding path program 3 times [2022-04-28 05:56:33,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:33,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1052156049] [2022-04-28 05:56:33,907 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:56:33,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1402694082, now seen corresponding path program 4 times [2022-04-28 05:56:33,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:56:33,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005224613] [2022-04-28 05:56:33,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:56:33,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:56:33,917 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:56:33,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1759047855] [2022-04-28 05:56:33,917 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 05:56:33,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:56:33,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:56:33,918 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:56:33,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-28 05:56:33,972 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 05:56:33,972 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:56:33,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 05:56:33,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:56:33,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:56:34,248 INFO L272 TraceCheckUtils]: 0: Hoare triple {8519#true} call ULTIMATE.init(); {8519#true} is VALID [2022-04-28 05:56:34,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {8519#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {8527#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:34,249 INFO L290 TraceCheckUtils]: 2: Hoare triple {8527#(<= ~counter~0 0)} assume true; {8527#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:34,249 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8527#(<= ~counter~0 0)} {8519#true} #102#return; {8527#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:34,249 INFO L272 TraceCheckUtils]: 4: Hoare triple {8527#(<= ~counter~0 0)} call #t~ret9 := main(); {8527#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:34,250 INFO L290 TraceCheckUtils]: 5: Hoare triple {8527#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {8527#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:34,250 INFO L272 TraceCheckUtils]: 6: Hoare triple {8527#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {8527#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:34,250 INFO L290 TraceCheckUtils]: 7: Hoare triple {8527#(<= ~counter~0 0)} ~cond := #in~cond; {8527#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:34,251 INFO L290 TraceCheckUtils]: 8: Hoare triple {8527#(<= ~counter~0 0)} assume !(0 == ~cond); {8527#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:34,251 INFO L290 TraceCheckUtils]: 9: Hoare triple {8527#(<= ~counter~0 0)} assume true; {8527#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:34,251 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8527#(<= ~counter~0 0)} {8527#(<= ~counter~0 0)} #90#return; {8527#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:34,252 INFO L272 TraceCheckUtils]: 11: Hoare triple {8527#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {8527#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:34,252 INFO L290 TraceCheckUtils]: 12: Hoare triple {8527#(<= ~counter~0 0)} ~cond := #in~cond; {8527#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:34,252 INFO L290 TraceCheckUtils]: 13: Hoare triple {8527#(<= ~counter~0 0)} assume !(0 == ~cond); {8527#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:34,253 INFO L290 TraceCheckUtils]: 14: Hoare triple {8527#(<= ~counter~0 0)} assume true; {8527#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:34,253 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8527#(<= ~counter~0 0)} {8527#(<= ~counter~0 0)} #92#return; {8527#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:34,253 INFO L290 TraceCheckUtils]: 16: Hoare triple {8527#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {8527#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:34,254 INFO L290 TraceCheckUtils]: 17: Hoare triple {8527#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8576#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:34,254 INFO L290 TraceCheckUtils]: 18: Hoare triple {8576#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {8576#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:34,255 INFO L272 TraceCheckUtils]: 19: Hoare triple {8576#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8576#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:34,255 INFO L290 TraceCheckUtils]: 20: Hoare triple {8576#(<= ~counter~0 1)} ~cond := #in~cond; {8576#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:34,255 INFO L290 TraceCheckUtils]: 21: Hoare triple {8576#(<= ~counter~0 1)} assume !(0 == ~cond); {8576#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:34,256 INFO L290 TraceCheckUtils]: 22: Hoare triple {8576#(<= ~counter~0 1)} assume true; {8576#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:34,256 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8576#(<= ~counter~0 1)} {8576#(<= ~counter~0 1)} #94#return; {8576#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:34,256 INFO L290 TraceCheckUtils]: 24: Hoare triple {8576#(<= ~counter~0 1)} assume !!(0 != ~r~0); {8576#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:34,257 INFO L290 TraceCheckUtils]: 25: Hoare triple {8576#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8601#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:34,257 INFO L290 TraceCheckUtils]: 26: Hoare triple {8601#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {8601#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:34,258 INFO L272 TraceCheckUtils]: 27: Hoare triple {8601#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8601#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:34,258 INFO L290 TraceCheckUtils]: 28: Hoare triple {8601#(<= ~counter~0 2)} ~cond := #in~cond; {8601#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:34,258 INFO L290 TraceCheckUtils]: 29: Hoare triple {8601#(<= ~counter~0 2)} assume !(0 == ~cond); {8601#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:34,258 INFO L290 TraceCheckUtils]: 30: Hoare triple {8601#(<= ~counter~0 2)} assume true; {8601#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:34,259 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {8601#(<= ~counter~0 2)} {8601#(<= ~counter~0 2)} #96#return; {8601#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:34,259 INFO L290 TraceCheckUtils]: 32: Hoare triple {8601#(<= ~counter~0 2)} assume !(~r~0 > 0); {8601#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:34,260 INFO L290 TraceCheckUtils]: 33: Hoare triple {8601#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8626#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:34,260 INFO L290 TraceCheckUtils]: 34: Hoare triple {8626#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {8626#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:34,260 INFO L272 TraceCheckUtils]: 35: Hoare triple {8626#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8626#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:34,261 INFO L290 TraceCheckUtils]: 36: Hoare triple {8626#(<= ~counter~0 3)} ~cond := #in~cond; {8626#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:34,261 INFO L290 TraceCheckUtils]: 37: Hoare triple {8626#(<= ~counter~0 3)} assume !(0 == ~cond); {8626#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:34,261 INFO L290 TraceCheckUtils]: 38: Hoare triple {8626#(<= ~counter~0 3)} assume true; {8626#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:34,262 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {8626#(<= ~counter~0 3)} {8626#(<= ~counter~0 3)} #98#return; {8626#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:34,262 INFO L290 TraceCheckUtils]: 40: Hoare triple {8626#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {8626#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:34,263 INFO L290 TraceCheckUtils]: 41: Hoare triple {8626#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8651#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:34,263 INFO L290 TraceCheckUtils]: 42: Hoare triple {8651#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {8651#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:34,263 INFO L272 TraceCheckUtils]: 43: Hoare triple {8651#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8651#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:34,264 INFO L290 TraceCheckUtils]: 44: Hoare triple {8651#(<= ~counter~0 4)} ~cond := #in~cond; {8651#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:34,264 INFO L290 TraceCheckUtils]: 45: Hoare triple {8651#(<= ~counter~0 4)} assume !(0 == ~cond); {8651#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:34,264 INFO L290 TraceCheckUtils]: 46: Hoare triple {8651#(<= ~counter~0 4)} assume true; {8651#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:34,265 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {8651#(<= ~counter~0 4)} {8651#(<= ~counter~0 4)} #98#return; {8651#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:34,265 INFO L290 TraceCheckUtils]: 48: Hoare triple {8651#(<= ~counter~0 4)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {8651#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:34,265 INFO L290 TraceCheckUtils]: 49: Hoare triple {8651#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8676#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:34,266 INFO L290 TraceCheckUtils]: 50: Hoare triple {8676#(<= ~counter~0 5)} assume !!(#t~post8 < 100);havoc #t~post8; {8676#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:34,266 INFO L272 TraceCheckUtils]: 51: Hoare triple {8676#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8676#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:34,267 INFO L290 TraceCheckUtils]: 52: Hoare triple {8676#(<= ~counter~0 5)} ~cond := #in~cond; {8676#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:34,267 INFO L290 TraceCheckUtils]: 53: Hoare triple {8676#(<= ~counter~0 5)} assume !(0 == ~cond); {8676#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:34,267 INFO L290 TraceCheckUtils]: 54: Hoare triple {8676#(<= ~counter~0 5)} assume true; {8676#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:34,268 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {8676#(<= ~counter~0 5)} {8676#(<= ~counter~0 5)} #98#return; {8676#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:34,268 INFO L290 TraceCheckUtils]: 56: Hoare triple {8676#(<= ~counter~0 5)} assume !(~r~0 < 0); {8676#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:34,268 INFO L290 TraceCheckUtils]: 57: Hoare triple {8676#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8701#(<= |main_#t~post6| 5)} is VALID [2022-04-28 05:56:34,269 INFO L290 TraceCheckUtils]: 58: Hoare triple {8701#(<= |main_#t~post6| 5)} assume !(#t~post6 < 100);havoc #t~post6; {8520#false} is VALID [2022-04-28 05:56:34,269 INFO L272 TraceCheckUtils]: 59: Hoare triple {8520#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8520#false} is VALID [2022-04-28 05:56:34,269 INFO L290 TraceCheckUtils]: 60: Hoare triple {8520#false} ~cond := #in~cond; {8520#false} is VALID [2022-04-28 05:56:34,269 INFO L290 TraceCheckUtils]: 61: Hoare triple {8520#false} assume 0 == ~cond; {8520#false} is VALID [2022-04-28 05:56:34,269 INFO L290 TraceCheckUtils]: 62: Hoare triple {8520#false} assume !false; {8520#false} is VALID [2022-04-28 05:56:34,269 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 10 proven. 54 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:56:34,269 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:56:34,570 INFO L290 TraceCheckUtils]: 62: Hoare triple {8520#false} assume !false; {8520#false} is VALID [2022-04-28 05:56:34,570 INFO L290 TraceCheckUtils]: 61: Hoare triple {8520#false} assume 0 == ~cond; {8520#false} is VALID [2022-04-28 05:56:34,570 INFO L290 TraceCheckUtils]: 60: Hoare triple {8520#false} ~cond := #in~cond; {8520#false} is VALID [2022-04-28 05:56:34,570 INFO L272 TraceCheckUtils]: 59: Hoare triple {8520#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8520#false} is VALID [2022-04-28 05:56:34,570 INFO L290 TraceCheckUtils]: 58: Hoare triple {8729#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {8520#false} is VALID [2022-04-28 05:56:34,571 INFO L290 TraceCheckUtils]: 57: Hoare triple {8733#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8729#(< |main_#t~post6| 100)} is VALID [2022-04-28 05:56:34,571 INFO L290 TraceCheckUtils]: 56: Hoare triple {8733#(< ~counter~0 100)} assume !(~r~0 < 0); {8733#(< ~counter~0 100)} is VALID [2022-04-28 05:56:34,571 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {8519#true} {8733#(< ~counter~0 100)} #98#return; {8733#(< ~counter~0 100)} is VALID [2022-04-28 05:56:34,571 INFO L290 TraceCheckUtils]: 54: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-28 05:56:34,572 INFO L290 TraceCheckUtils]: 53: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-28 05:56:34,572 INFO L290 TraceCheckUtils]: 52: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-28 05:56:34,572 INFO L272 TraceCheckUtils]: 51: Hoare triple {8733#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8519#true} is VALID [2022-04-28 05:56:34,572 INFO L290 TraceCheckUtils]: 50: Hoare triple {8733#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {8733#(< ~counter~0 100)} is VALID [2022-04-28 05:56:34,572 INFO L290 TraceCheckUtils]: 49: Hoare triple {8758#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8733#(< ~counter~0 100)} is VALID [2022-04-28 05:56:34,573 INFO L290 TraceCheckUtils]: 48: Hoare triple {8758#(< ~counter~0 99)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {8758#(< ~counter~0 99)} is VALID [2022-04-28 05:56:34,573 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {8519#true} {8758#(< ~counter~0 99)} #98#return; {8758#(< ~counter~0 99)} is VALID [2022-04-28 05:56:34,573 INFO L290 TraceCheckUtils]: 46: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-28 05:56:34,573 INFO L290 TraceCheckUtils]: 45: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-28 05:56:34,573 INFO L290 TraceCheckUtils]: 44: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-28 05:56:34,574 INFO L272 TraceCheckUtils]: 43: Hoare triple {8758#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8519#true} is VALID [2022-04-28 05:56:34,589 INFO L290 TraceCheckUtils]: 42: Hoare triple {8758#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {8758#(< ~counter~0 99)} is VALID [2022-04-28 05:56:34,589 INFO L290 TraceCheckUtils]: 41: Hoare triple {8783#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8758#(< ~counter~0 99)} is VALID [2022-04-28 05:56:34,589 INFO L290 TraceCheckUtils]: 40: Hoare triple {8783#(< ~counter~0 98)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {8783#(< ~counter~0 98)} is VALID [2022-04-28 05:56:34,590 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {8519#true} {8783#(< ~counter~0 98)} #98#return; {8783#(< ~counter~0 98)} is VALID [2022-04-28 05:56:34,590 INFO L290 TraceCheckUtils]: 38: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-28 05:56:34,590 INFO L290 TraceCheckUtils]: 37: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-28 05:56:34,590 INFO L290 TraceCheckUtils]: 36: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-28 05:56:34,590 INFO L272 TraceCheckUtils]: 35: Hoare triple {8783#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8519#true} is VALID [2022-04-28 05:56:34,591 INFO L290 TraceCheckUtils]: 34: Hoare triple {8783#(< ~counter~0 98)} assume !!(#t~post8 < 100);havoc #t~post8; {8783#(< ~counter~0 98)} is VALID [2022-04-28 05:56:34,591 INFO L290 TraceCheckUtils]: 33: Hoare triple {8808#(< ~counter~0 97)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8783#(< ~counter~0 98)} is VALID [2022-04-28 05:56:34,591 INFO L290 TraceCheckUtils]: 32: Hoare triple {8808#(< ~counter~0 97)} assume !(~r~0 > 0); {8808#(< ~counter~0 97)} is VALID [2022-04-28 05:56:34,592 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {8519#true} {8808#(< ~counter~0 97)} #96#return; {8808#(< ~counter~0 97)} is VALID [2022-04-28 05:56:34,592 INFO L290 TraceCheckUtils]: 30: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-28 05:56:34,592 INFO L290 TraceCheckUtils]: 29: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-28 05:56:34,592 INFO L290 TraceCheckUtils]: 28: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-28 05:56:34,592 INFO L272 TraceCheckUtils]: 27: Hoare triple {8808#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8519#true} is VALID [2022-04-28 05:56:34,592 INFO L290 TraceCheckUtils]: 26: Hoare triple {8808#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {8808#(< ~counter~0 97)} is VALID [2022-04-28 05:56:34,593 INFO L290 TraceCheckUtils]: 25: Hoare triple {8833#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8808#(< ~counter~0 97)} is VALID [2022-04-28 05:56:34,593 INFO L290 TraceCheckUtils]: 24: Hoare triple {8833#(< ~counter~0 96)} assume !!(0 != ~r~0); {8833#(< ~counter~0 96)} is VALID [2022-04-28 05:56:34,593 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8519#true} {8833#(< ~counter~0 96)} #94#return; {8833#(< ~counter~0 96)} is VALID [2022-04-28 05:56:34,593 INFO L290 TraceCheckUtils]: 22: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-28 05:56:34,594 INFO L290 TraceCheckUtils]: 21: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-28 05:56:34,594 INFO L290 TraceCheckUtils]: 20: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-28 05:56:34,594 INFO L272 TraceCheckUtils]: 19: Hoare triple {8833#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8519#true} is VALID [2022-04-28 05:56:34,594 INFO L290 TraceCheckUtils]: 18: Hoare triple {8833#(< ~counter~0 96)} assume !!(#t~post6 < 100);havoc #t~post6; {8833#(< ~counter~0 96)} is VALID [2022-04-28 05:56:34,594 INFO L290 TraceCheckUtils]: 17: Hoare triple {8858#(< ~counter~0 95)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8833#(< ~counter~0 96)} is VALID [2022-04-28 05:56:34,595 INFO L290 TraceCheckUtils]: 16: Hoare triple {8858#(< ~counter~0 95)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {8858#(< ~counter~0 95)} is VALID [2022-04-28 05:56:34,595 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8519#true} {8858#(< ~counter~0 95)} #92#return; {8858#(< ~counter~0 95)} is VALID [2022-04-28 05:56:34,595 INFO L290 TraceCheckUtils]: 14: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-28 05:56:34,595 INFO L290 TraceCheckUtils]: 13: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-28 05:56:34,595 INFO L290 TraceCheckUtils]: 12: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-28 05:56:34,595 INFO L272 TraceCheckUtils]: 11: Hoare triple {8858#(< ~counter~0 95)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {8519#true} is VALID [2022-04-28 05:56:34,614 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8519#true} {8858#(< ~counter~0 95)} #90#return; {8858#(< ~counter~0 95)} is VALID [2022-04-28 05:56:34,614 INFO L290 TraceCheckUtils]: 9: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-28 05:56:34,614 INFO L290 TraceCheckUtils]: 8: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-28 05:56:34,615 INFO L290 TraceCheckUtils]: 7: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-28 05:56:34,615 INFO L272 TraceCheckUtils]: 6: Hoare triple {8858#(< ~counter~0 95)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {8519#true} is VALID [2022-04-28 05:56:34,615 INFO L290 TraceCheckUtils]: 5: Hoare triple {8858#(< ~counter~0 95)} 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 95)} is VALID [2022-04-28 05:56:34,615 INFO L272 TraceCheckUtils]: 4: Hoare triple {8858#(< ~counter~0 95)} call #t~ret9 := main(); {8858#(< ~counter~0 95)} is VALID [2022-04-28 05:56:34,615 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8858#(< ~counter~0 95)} {8519#true} #102#return; {8858#(< ~counter~0 95)} is VALID [2022-04-28 05:56:34,616 INFO L290 TraceCheckUtils]: 2: Hoare triple {8858#(< ~counter~0 95)} assume true; {8858#(< ~counter~0 95)} is VALID [2022-04-28 05:56:34,616 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 95)} is VALID [2022-04-28 05:56:34,616 INFO L272 TraceCheckUtils]: 0: Hoare triple {8519#true} call ULTIMATE.init(); {8519#true} is VALID [2022-04-28 05:56:34,616 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-28 05:56:34,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:56:34,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005224613] [2022-04-28 05:56:34,617 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:56:34,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759047855] [2022-04-28 05:56:34,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759047855] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:56:34,617 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:56:34,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-04-28 05:56:34,617 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:56:34,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1052156049] [2022-04-28 05:56:34,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1052156049] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:56:34,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:56:34,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 05:56:34,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007522328] [2022-04-28 05:56:34,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:56:34,618 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) Word has length 63 [2022-04-28 05:56:34,618 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:56:34,618 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 05:56:34,655 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:56:34,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 05:56:34,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:34,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 05:56:34,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2022-04-28 05:56:34,656 INFO L87 Difference]: Start difference. First operand 96 states and 118 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 05:56:34,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:34,985 INFO L93 Difference]: Finished difference Result 116 states and 142 transitions. [2022-04-28 05:56:34,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 05:56:34,986 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) Word has length 63 [2022-04-28 05:56:34,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:56:34,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 05:56:34,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 115 transitions. [2022-04-28 05:56:34,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 05:56:34,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 115 transitions. [2022-04-28 05:56:34,988 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 115 transitions. [2022-04-28 05:56:35,064 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:56:35,065 INFO L225 Difference]: With dead ends: 116 [2022-04-28 05:56:35,065 INFO L226 Difference]: Without dead ends: 111 [2022-04-28 05:56:35,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=183, Unknown=0, NotChecked=0, Total=306 [2022-04-28 05:56:35,066 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 49 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 05:56:35,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 165 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 05:56:35,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-04-28 05:56:35,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 106. [2022-04-28 05:56:35,167 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:56:35,167 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand has 106 states, 76 states have (on average 1.1973684210526316) internal successors, (91), 78 states have internal predecessors, (91), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 05:56:35,167 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand has 106 states, 76 states have (on average 1.1973684210526316) internal successors, (91), 78 states have internal predecessors, (91), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 05:56:35,167 INFO L87 Difference]: Start difference. First operand 111 states. Second operand has 106 states, 76 states have (on average 1.1973684210526316) internal successors, (91), 78 states have internal predecessors, (91), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 05:56:35,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:35,169 INFO L93 Difference]: Finished difference Result 111 states and 137 transitions. [2022-04-28 05:56:35,169 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 137 transitions. [2022-04-28 05:56:35,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:56:35,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:56:35,170 INFO L74 IsIncluded]: Start isIncluded. First operand has 106 states, 76 states have (on average 1.1973684210526316) internal successors, (91), 78 states have internal predecessors, (91), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) Second operand 111 states. [2022-04-28 05:56:35,170 INFO L87 Difference]: Start difference. First operand has 106 states, 76 states have (on average 1.1973684210526316) internal successors, (91), 78 states have internal predecessors, (91), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) Second operand 111 states. [2022-04-28 05:56:35,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:35,171 INFO L93 Difference]: Finished difference Result 111 states and 137 transitions. [2022-04-28 05:56:35,171 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 137 transitions. [2022-04-28 05:56:35,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:56:35,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:56:35,172 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:56:35,172 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:56:35,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 76 states have (on average 1.1973684210526316) internal successors, (91), 78 states have internal predecessors, (91), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 05:56:35,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 131 transitions. [2022-04-28 05:56:35,174 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 131 transitions. Word has length 63 [2022-04-28 05:56:35,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:56:35,174 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 131 transitions. [2022-04-28 05:56:35,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 05:56:35,174 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 106 states and 131 transitions. [2022-04-28 05:56:37,370 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 130 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 05:56:37,371 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 131 transitions. [2022-04-28 05:56:37,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-28 05:56:37,371 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:56:37,371 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:56:37,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-28 05:56:37,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:56:37,572 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:56:37,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:56:37,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1823928061, now seen corresponding path program 5 times [2022-04-28 05:56:37,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:37,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [299033473] [2022-04-28 05:56:37,572 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:56:37,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1823928061, now seen corresponding path program 6 times [2022-04-28 05:56:37,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:56:37,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318033774] [2022-04-28 05:56:37,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:56:37,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:56:37,582 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:56:37,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1705419286] [2022-04-28 05:56:37,583 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 05:56:37,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:56:37,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:56:37,584 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:56:37,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-28 05:56:37,638 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-28 05:56:37,638 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:56:37,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 05:56:37,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:56:37,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:56:37,953 INFO L272 TraceCheckUtils]: 0: Hoare triple {9582#true} call ULTIMATE.init(); {9582#true} is VALID [2022-04-28 05:56:37,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {9582#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {9590#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:37,954 INFO L290 TraceCheckUtils]: 2: Hoare triple {9590#(<= ~counter~0 0)} assume true; {9590#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:37,954 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9590#(<= ~counter~0 0)} {9582#true} #102#return; {9590#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:37,954 INFO L272 TraceCheckUtils]: 4: Hoare triple {9590#(<= ~counter~0 0)} call #t~ret9 := main(); {9590#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:37,955 INFO L290 TraceCheckUtils]: 5: Hoare triple {9590#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {9590#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:37,955 INFO L272 TraceCheckUtils]: 6: Hoare triple {9590#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {9590#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:37,955 INFO L290 TraceCheckUtils]: 7: Hoare triple {9590#(<= ~counter~0 0)} ~cond := #in~cond; {9590#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:37,956 INFO L290 TraceCheckUtils]: 8: Hoare triple {9590#(<= ~counter~0 0)} assume !(0 == ~cond); {9590#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:37,956 INFO L290 TraceCheckUtils]: 9: Hoare triple {9590#(<= ~counter~0 0)} assume true; {9590#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:37,956 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9590#(<= ~counter~0 0)} {9590#(<= ~counter~0 0)} #90#return; {9590#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:37,957 INFO L272 TraceCheckUtils]: 11: Hoare triple {9590#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {9590#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:37,957 INFO L290 TraceCheckUtils]: 12: Hoare triple {9590#(<= ~counter~0 0)} ~cond := #in~cond; {9590#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:37,957 INFO L290 TraceCheckUtils]: 13: Hoare triple {9590#(<= ~counter~0 0)} assume !(0 == ~cond); {9590#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:37,957 INFO L290 TraceCheckUtils]: 14: Hoare triple {9590#(<= ~counter~0 0)} assume true; {9590#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:37,958 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {9590#(<= ~counter~0 0)} {9590#(<= ~counter~0 0)} #92#return; {9590#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:37,958 INFO L290 TraceCheckUtils]: 16: Hoare triple {9590#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {9590#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:37,959 INFO L290 TraceCheckUtils]: 17: Hoare triple {9590#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9639#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:37,959 INFO L290 TraceCheckUtils]: 18: Hoare triple {9639#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {9639#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:37,959 INFO L272 TraceCheckUtils]: 19: Hoare triple {9639#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {9639#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:37,960 INFO L290 TraceCheckUtils]: 20: Hoare triple {9639#(<= ~counter~0 1)} ~cond := #in~cond; {9639#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:37,960 INFO L290 TraceCheckUtils]: 21: Hoare triple {9639#(<= ~counter~0 1)} assume !(0 == ~cond); {9639#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:37,960 INFO L290 TraceCheckUtils]: 22: Hoare triple {9639#(<= ~counter~0 1)} assume true; {9639#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:37,961 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {9639#(<= ~counter~0 1)} {9639#(<= ~counter~0 1)} #94#return; {9639#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:37,961 INFO L290 TraceCheckUtils]: 24: Hoare triple {9639#(<= ~counter~0 1)} assume !!(0 != ~r~0); {9639#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:37,961 INFO L290 TraceCheckUtils]: 25: Hoare triple {9639#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {9664#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:37,962 INFO L290 TraceCheckUtils]: 26: Hoare triple {9664#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {9664#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:37,962 INFO L272 TraceCheckUtils]: 27: Hoare triple {9664#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {9664#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:37,962 INFO L290 TraceCheckUtils]: 28: Hoare triple {9664#(<= ~counter~0 2)} ~cond := #in~cond; {9664#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:37,963 INFO L290 TraceCheckUtils]: 29: Hoare triple {9664#(<= ~counter~0 2)} assume !(0 == ~cond); {9664#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:37,963 INFO L290 TraceCheckUtils]: 30: Hoare triple {9664#(<= ~counter~0 2)} assume true; {9664#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:37,963 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {9664#(<= ~counter~0 2)} {9664#(<= ~counter~0 2)} #96#return; {9664#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:37,964 INFO L290 TraceCheckUtils]: 32: Hoare triple {9664#(<= ~counter~0 2)} assume !(~r~0 > 0); {9664#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:37,964 INFO L290 TraceCheckUtils]: 33: Hoare triple {9664#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {9689#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:37,964 INFO L290 TraceCheckUtils]: 34: Hoare triple {9689#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {9689#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:37,965 INFO L272 TraceCheckUtils]: 35: Hoare triple {9689#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {9689#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:37,965 INFO L290 TraceCheckUtils]: 36: Hoare triple {9689#(<= ~counter~0 3)} ~cond := #in~cond; {9689#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:37,965 INFO L290 TraceCheckUtils]: 37: Hoare triple {9689#(<= ~counter~0 3)} assume !(0 == ~cond); {9689#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:37,966 INFO L290 TraceCheckUtils]: 38: Hoare triple {9689#(<= ~counter~0 3)} assume true; {9689#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:37,966 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {9689#(<= ~counter~0 3)} {9689#(<= ~counter~0 3)} #98#return; {9689#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:37,966 INFO L290 TraceCheckUtils]: 40: Hoare triple {9689#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {9689#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:37,967 INFO L290 TraceCheckUtils]: 41: Hoare triple {9689#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {9714#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:37,967 INFO L290 TraceCheckUtils]: 42: Hoare triple {9714#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {9714#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:37,968 INFO L272 TraceCheckUtils]: 43: Hoare triple {9714#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {9714#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:37,968 INFO L290 TraceCheckUtils]: 44: Hoare triple {9714#(<= ~counter~0 4)} ~cond := #in~cond; {9714#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:37,968 INFO L290 TraceCheckUtils]: 45: Hoare triple {9714#(<= ~counter~0 4)} assume !(0 == ~cond); {9714#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:37,968 INFO L290 TraceCheckUtils]: 46: Hoare triple {9714#(<= ~counter~0 4)} assume true; {9714#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:37,969 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {9714#(<= ~counter~0 4)} {9714#(<= ~counter~0 4)} #98#return; {9714#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:37,969 INFO L290 TraceCheckUtils]: 48: Hoare triple {9714#(<= ~counter~0 4)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {9714#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:37,969 INFO L290 TraceCheckUtils]: 49: Hoare triple {9714#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {9739#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:37,970 INFO L290 TraceCheckUtils]: 50: Hoare triple {9739#(<= ~counter~0 5)} assume !!(#t~post8 < 100);havoc #t~post8; {9739#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:37,970 INFO L272 TraceCheckUtils]: 51: Hoare triple {9739#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {9739#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:37,970 INFO L290 TraceCheckUtils]: 52: Hoare triple {9739#(<= ~counter~0 5)} ~cond := #in~cond; {9739#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:37,971 INFO L290 TraceCheckUtils]: 53: Hoare triple {9739#(<= ~counter~0 5)} assume !(0 == ~cond); {9739#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:37,971 INFO L290 TraceCheckUtils]: 54: Hoare triple {9739#(<= ~counter~0 5)} assume true; {9739#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:37,971 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {9739#(<= ~counter~0 5)} {9739#(<= ~counter~0 5)} #98#return; {9739#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:37,972 INFO L290 TraceCheckUtils]: 56: Hoare triple {9739#(<= ~counter~0 5)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {9739#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:37,972 INFO L290 TraceCheckUtils]: 57: Hoare triple {9739#(<= ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {9764#(<= |main_#t~post8| 5)} is VALID [2022-04-28 05:56:37,972 INFO L290 TraceCheckUtils]: 58: Hoare triple {9764#(<= |main_#t~post8| 5)} assume !(#t~post8 < 100);havoc #t~post8; {9583#false} is VALID [2022-04-28 05:56:37,972 INFO L290 TraceCheckUtils]: 59: Hoare triple {9583#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9583#false} is VALID [2022-04-28 05:56:37,973 INFO L290 TraceCheckUtils]: 60: Hoare triple {9583#false} assume !(#t~post6 < 100);havoc #t~post6; {9583#false} is VALID [2022-04-28 05:56:37,973 INFO L272 TraceCheckUtils]: 61: Hoare triple {9583#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {9583#false} is VALID [2022-04-28 05:56:37,973 INFO L290 TraceCheckUtils]: 62: Hoare triple {9583#false} ~cond := #in~cond; {9583#false} is VALID [2022-04-28 05:56:37,973 INFO L290 TraceCheckUtils]: 63: Hoare triple {9583#false} assume 0 == ~cond; {9583#false} is VALID [2022-04-28 05:56:37,973 INFO L290 TraceCheckUtils]: 64: Hoare triple {9583#false} assume !false; {9583#false} is VALID [2022-04-28 05:56:37,973 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 58 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:56:37,973 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:56:38,270 INFO L290 TraceCheckUtils]: 64: Hoare triple {9583#false} assume !false; {9583#false} is VALID [2022-04-28 05:56:38,270 INFO L290 TraceCheckUtils]: 63: Hoare triple {9583#false} assume 0 == ~cond; {9583#false} is VALID [2022-04-28 05:56:38,270 INFO L290 TraceCheckUtils]: 62: Hoare triple {9583#false} ~cond := #in~cond; {9583#false} is VALID [2022-04-28 05:56:38,270 INFO L272 TraceCheckUtils]: 61: Hoare triple {9583#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {9583#false} is VALID [2022-04-28 05:56:38,270 INFO L290 TraceCheckUtils]: 60: Hoare triple {9583#false} assume !(#t~post6 < 100);havoc #t~post6; {9583#false} is VALID [2022-04-28 05:56:38,270 INFO L290 TraceCheckUtils]: 59: Hoare triple {9583#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9583#false} is VALID [2022-04-28 05:56:38,270 INFO L290 TraceCheckUtils]: 58: Hoare triple {9804#(< |main_#t~post8| 100)} assume !(#t~post8 < 100);havoc #t~post8; {9583#false} is VALID [2022-04-28 05:56:38,271 INFO L290 TraceCheckUtils]: 57: Hoare triple {9808#(< ~counter~0 100)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {9804#(< |main_#t~post8| 100)} is VALID [2022-04-28 05:56:38,271 INFO L290 TraceCheckUtils]: 56: Hoare triple {9808#(< ~counter~0 100)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {9808#(< ~counter~0 100)} is VALID [2022-04-28 05:56:38,272 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {9582#true} {9808#(< ~counter~0 100)} #98#return; {9808#(< ~counter~0 100)} is VALID [2022-04-28 05:56:38,272 INFO L290 TraceCheckUtils]: 54: Hoare triple {9582#true} assume true; {9582#true} is VALID [2022-04-28 05:56:38,272 INFO L290 TraceCheckUtils]: 53: Hoare triple {9582#true} assume !(0 == ~cond); {9582#true} is VALID [2022-04-28 05:56:38,272 INFO L290 TraceCheckUtils]: 52: Hoare triple {9582#true} ~cond := #in~cond; {9582#true} is VALID [2022-04-28 05:56:38,272 INFO L272 TraceCheckUtils]: 51: Hoare triple {9808#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {9582#true} is VALID [2022-04-28 05:56:38,272 INFO L290 TraceCheckUtils]: 50: Hoare triple {9808#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {9808#(< ~counter~0 100)} is VALID [2022-04-28 05:56:38,273 INFO L290 TraceCheckUtils]: 49: Hoare triple {9833#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {9808#(< ~counter~0 100)} is VALID [2022-04-28 05:56:38,273 INFO L290 TraceCheckUtils]: 48: Hoare triple {9833#(< ~counter~0 99)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {9833#(< ~counter~0 99)} is VALID [2022-04-28 05:56:38,273 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {9582#true} {9833#(< ~counter~0 99)} #98#return; {9833#(< ~counter~0 99)} is VALID [2022-04-28 05:56:38,273 INFO L290 TraceCheckUtils]: 46: Hoare triple {9582#true} assume true; {9582#true} is VALID [2022-04-28 05:56:38,274 INFO L290 TraceCheckUtils]: 45: Hoare triple {9582#true} assume !(0 == ~cond); {9582#true} is VALID [2022-04-28 05:56:38,274 INFO L290 TraceCheckUtils]: 44: Hoare triple {9582#true} ~cond := #in~cond; {9582#true} is VALID [2022-04-28 05:56:38,274 INFO L272 TraceCheckUtils]: 43: Hoare triple {9833#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {9582#true} is VALID [2022-04-28 05:56:38,274 INFO L290 TraceCheckUtils]: 42: Hoare triple {9833#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {9833#(< ~counter~0 99)} is VALID [2022-04-28 05:56:38,274 INFO L290 TraceCheckUtils]: 41: Hoare triple {9858#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {9833#(< ~counter~0 99)} is VALID [2022-04-28 05:56:38,275 INFO L290 TraceCheckUtils]: 40: Hoare triple {9858#(< ~counter~0 98)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {9858#(< ~counter~0 98)} is VALID [2022-04-28 05:56:38,275 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {9582#true} {9858#(< ~counter~0 98)} #98#return; {9858#(< ~counter~0 98)} is VALID [2022-04-28 05:56:38,275 INFO L290 TraceCheckUtils]: 38: Hoare triple {9582#true} assume true; {9582#true} is VALID [2022-04-28 05:56:38,275 INFO L290 TraceCheckUtils]: 37: Hoare triple {9582#true} assume !(0 == ~cond); {9582#true} is VALID [2022-04-28 05:56:38,275 INFO L290 TraceCheckUtils]: 36: Hoare triple {9582#true} ~cond := #in~cond; {9582#true} is VALID [2022-04-28 05:56:38,275 INFO L272 TraceCheckUtils]: 35: Hoare triple {9858#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {9582#true} is VALID [2022-04-28 05:56:38,276 INFO L290 TraceCheckUtils]: 34: Hoare triple {9858#(< ~counter~0 98)} assume !!(#t~post8 < 100);havoc #t~post8; {9858#(< ~counter~0 98)} is VALID [2022-04-28 05:56:38,276 INFO L290 TraceCheckUtils]: 33: Hoare triple {9883#(< ~counter~0 97)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {9858#(< ~counter~0 98)} is VALID [2022-04-28 05:56:38,276 INFO L290 TraceCheckUtils]: 32: Hoare triple {9883#(< ~counter~0 97)} assume !(~r~0 > 0); {9883#(< ~counter~0 97)} is VALID [2022-04-28 05:56:38,277 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {9582#true} {9883#(< ~counter~0 97)} #96#return; {9883#(< ~counter~0 97)} is VALID [2022-04-28 05:56:38,277 INFO L290 TraceCheckUtils]: 30: Hoare triple {9582#true} assume true; {9582#true} is VALID [2022-04-28 05:56:38,277 INFO L290 TraceCheckUtils]: 29: Hoare triple {9582#true} assume !(0 == ~cond); {9582#true} is VALID [2022-04-28 05:56:38,277 INFO L290 TraceCheckUtils]: 28: Hoare triple {9582#true} ~cond := #in~cond; {9582#true} is VALID [2022-04-28 05:56:38,277 INFO L272 TraceCheckUtils]: 27: Hoare triple {9883#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {9582#true} is VALID [2022-04-28 05:56:38,277 INFO L290 TraceCheckUtils]: 26: Hoare triple {9883#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {9883#(< ~counter~0 97)} is VALID [2022-04-28 05:56:38,278 INFO L290 TraceCheckUtils]: 25: Hoare triple {9908#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {9883#(< ~counter~0 97)} is VALID [2022-04-28 05:56:38,278 INFO L290 TraceCheckUtils]: 24: Hoare triple {9908#(< ~counter~0 96)} assume !!(0 != ~r~0); {9908#(< ~counter~0 96)} is VALID [2022-04-28 05:56:38,279 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {9582#true} {9908#(< ~counter~0 96)} #94#return; {9908#(< ~counter~0 96)} is VALID [2022-04-28 05:56:38,279 INFO L290 TraceCheckUtils]: 22: Hoare triple {9582#true} assume true; {9582#true} is VALID [2022-04-28 05:56:38,279 INFO L290 TraceCheckUtils]: 21: Hoare triple {9582#true} assume !(0 == ~cond); {9582#true} is VALID [2022-04-28 05:56:38,279 INFO L290 TraceCheckUtils]: 20: Hoare triple {9582#true} ~cond := #in~cond; {9582#true} is VALID [2022-04-28 05:56:38,279 INFO L272 TraceCheckUtils]: 19: Hoare triple {9908#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {9582#true} is VALID [2022-04-28 05:56:38,279 INFO L290 TraceCheckUtils]: 18: Hoare triple {9908#(< ~counter~0 96)} assume !!(#t~post6 < 100);havoc #t~post6; {9908#(< ~counter~0 96)} is VALID [2022-04-28 05:56:38,280 INFO L290 TraceCheckUtils]: 17: Hoare triple {9933#(< ~counter~0 95)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9908#(< ~counter~0 96)} is VALID [2022-04-28 05:56:38,280 INFO L290 TraceCheckUtils]: 16: Hoare triple {9933#(< ~counter~0 95)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {9933#(< ~counter~0 95)} is VALID [2022-04-28 05:56:38,280 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {9582#true} {9933#(< ~counter~0 95)} #92#return; {9933#(< ~counter~0 95)} is VALID [2022-04-28 05:56:38,280 INFO L290 TraceCheckUtils]: 14: Hoare triple {9582#true} assume true; {9582#true} is VALID [2022-04-28 05:56:38,281 INFO L290 TraceCheckUtils]: 13: Hoare triple {9582#true} assume !(0 == ~cond); {9582#true} is VALID [2022-04-28 05:56:38,281 INFO L290 TraceCheckUtils]: 12: Hoare triple {9582#true} ~cond := #in~cond; {9582#true} is VALID [2022-04-28 05:56:38,281 INFO L272 TraceCheckUtils]: 11: Hoare triple {9933#(< ~counter~0 95)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {9582#true} is VALID [2022-04-28 05:56:38,281 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9582#true} {9933#(< ~counter~0 95)} #90#return; {9933#(< ~counter~0 95)} is VALID [2022-04-28 05:56:38,281 INFO L290 TraceCheckUtils]: 9: Hoare triple {9582#true} assume true; {9582#true} is VALID [2022-04-28 05:56:38,281 INFO L290 TraceCheckUtils]: 8: Hoare triple {9582#true} assume !(0 == ~cond); {9582#true} is VALID [2022-04-28 05:56:38,281 INFO L290 TraceCheckUtils]: 7: Hoare triple {9582#true} ~cond := #in~cond; {9582#true} is VALID [2022-04-28 05:56:38,281 INFO L272 TraceCheckUtils]: 6: Hoare triple {9933#(< ~counter~0 95)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {9582#true} is VALID [2022-04-28 05:56:38,282 INFO L290 TraceCheckUtils]: 5: Hoare triple {9933#(< ~counter~0 95)} 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 95)} is VALID [2022-04-28 05:56:38,282 INFO L272 TraceCheckUtils]: 4: Hoare triple {9933#(< ~counter~0 95)} call #t~ret9 := main(); {9933#(< ~counter~0 95)} is VALID [2022-04-28 05:56:38,282 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9933#(< ~counter~0 95)} {9582#true} #102#return; {9933#(< ~counter~0 95)} is VALID [2022-04-28 05:56:38,283 INFO L290 TraceCheckUtils]: 2: Hoare triple {9933#(< ~counter~0 95)} assume true; {9933#(< ~counter~0 95)} is VALID [2022-04-28 05:56:38,283 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 95)} is VALID [2022-04-28 05:56:38,283 INFO L272 TraceCheckUtils]: 0: Hoare triple {9582#true} call ULTIMATE.init(); {9582#true} is VALID [2022-04-28 05:56:38,283 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-28 05:56:38,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:56:38,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318033774] [2022-04-28 05:56:38,284 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:56:38,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705419286] [2022-04-28 05:56:38,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1705419286] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:56:38,284 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:56:38,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-04-28 05:56:38,284 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:56:38,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [299033473] [2022-04-28 05:56:38,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [299033473] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:56:38,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:56:38,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 05:56:38,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032615882] [2022-04-28 05:56:38,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:56:38,285 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) Word has length 65 [2022-04-28 05:56:38,285 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:56:38,285 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 05:56:38,324 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:56:38,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 05:56:38,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:38,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 05:56:38,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2022-04-28 05:56:38,325 INFO L87 Difference]: Start difference. First operand 106 states and 131 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 05:56:38,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:38,699 INFO L93 Difference]: Finished difference Result 149 states and 191 transitions. [2022-04-28 05:56:38,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 05:56:38,699 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) Word has length 65 [2022-04-28 05:56:38,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:56:38,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 05:56:38,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 137 transitions. [2022-04-28 05:56:38,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 05:56:38,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 137 transitions. [2022-04-28 05:56:38,705 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 137 transitions. [2022-04-28 05:56:38,798 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:56:38,800 INFO L225 Difference]: With dead ends: 149 [2022-04-28 05:56:38,800 INFO L226 Difference]: Without dead ends: 112 [2022-04-28 05:56:38,801 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=135, Invalid=207, Unknown=0, NotChecked=0, Total=342 [2022-04-28 05:56:38,801 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 55 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 05:56:38,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 155 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 05:56:38,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-04-28 05:56:38,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2022-04-28 05:56:38,911 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:56:38,911 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand has 109 states, 79 states have (on average 1.2025316455696202) internal successors, (95), 80 states have internal predecessors, (95), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 05:56:38,912 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand has 109 states, 79 states have (on average 1.2025316455696202) internal successors, (95), 80 states have internal predecessors, (95), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 05:56:38,912 INFO L87 Difference]: Start difference. First operand 112 states. Second operand has 109 states, 79 states have (on average 1.2025316455696202) internal successors, (95), 80 states have internal predecessors, (95), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 05:56:38,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:38,914 INFO L93 Difference]: Finished difference Result 112 states and 138 transitions. [2022-04-28 05:56:38,914 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 138 transitions. [2022-04-28 05:56:38,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:56:38,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:56:38,915 INFO L74 IsIncluded]: Start isIncluded. First operand has 109 states, 79 states have (on average 1.2025316455696202) internal successors, (95), 80 states have internal predecessors, (95), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 112 states. [2022-04-28 05:56:38,915 INFO L87 Difference]: Start difference. First operand has 109 states, 79 states have (on average 1.2025316455696202) internal successors, (95), 80 states have internal predecessors, (95), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 112 states. [2022-04-28 05:56:38,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:38,918 INFO L93 Difference]: Finished difference Result 112 states and 138 transitions. [2022-04-28 05:56:38,918 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 138 transitions. [2022-04-28 05:56:38,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:56:38,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:56:38,918 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:56:38,918 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:56:38,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 79 states have (on average 1.2025316455696202) internal successors, (95), 80 states have internal predecessors, (95), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 05:56:38,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 135 transitions. [2022-04-28 05:56:38,921 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 135 transitions. Word has length 65 [2022-04-28 05:56:38,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:56:38,921 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 135 transitions. [2022-04-28 05:56:38,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 05:56:38,921 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 109 states and 135 transitions. [2022-04-28 05:56:41,002 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:56:41,002 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 135 transitions. [2022-04-28 05:56:41,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-28 05:56:41,003 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:56:41,003 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:56:41,020 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-28 05:56:41,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-28 05:56:41,211 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:56:41,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:56:41,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1211810838, now seen corresponding path program 1 times [2022-04-28 05:56:41,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:41,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1302699529] [2022-04-28 05:56:41,212 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:56:41,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1211810838, now seen corresponding path program 2 times [2022-04-28 05:56:41,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:56:41,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332615782] [2022-04-28 05:56:41,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:56:41,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:56:41,224 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:56:41,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1335226508] [2022-04-28 05:56:41,225 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:56:41,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:56:41,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:56:41,226 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:56:41,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-28 05:56:41,265 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:56:41,265 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:56:41,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 05:56:41,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:56:41,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:56:41,552 INFO L272 TraceCheckUtils]: 0: Hoare triple {10733#true} call ULTIMATE.init(); {10733#true} is VALID [2022-04-28 05:56:41,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {10733#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {10741#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:41,552 INFO L290 TraceCheckUtils]: 2: Hoare triple {10741#(<= ~counter~0 0)} assume true; {10741#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:41,553 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10741#(<= ~counter~0 0)} {10733#true} #102#return; {10741#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:41,553 INFO L272 TraceCheckUtils]: 4: Hoare triple {10741#(<= ~counter~0 0)} call #t~ret9 := main(); {10741#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:41,553 INFO L290 TraceCheckUtils]: 5: Hoare triple {10741#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {10741#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:41,554 INFO L272 TraceCheckUtils]: 6: Hoare triple {10741#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {10741#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:41,554 INFO L290 TraceCheckUtils]: 7: Hoare triple {10741#(<= ~counter~0 0)} ~cond := #in~cond; {10741#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:41,554 INFO L290 TraceCheckUtils]: 8: Hoare triple {10741#(<= ~counter~0 0)} assume !(0 == ~cond); {10741#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:41,554 INFO L290 TraceCheckUtils]: 9: Hoare triple {10741#(<= ~counter~0 0)} assume true; {10741#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:41,555 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10741#(<= ~counter~0 0)} {10741#(<= ~counter~0 0)} #90#return; {10741#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:41,555 INFO L272 TraceCheckUtils]: 11: Hoare triple {10741#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {10741#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:41,556 INFO L290 TraceCheckUtils]: 12: Hoare triple {10741#(<= ~counter~0 0)} ~cond := #in~cond; {10741#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:41,556 INFO L290 TraceCheckUtils]: 13: Hoare triple {10741#(<= ~counter~0 0)} assume !(0 == ~cond); {10741#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:41,556 INFO L290 TraceCheckUtils]: 14: Hoare triple {10741#(<= ~counter~0 0)} assume true; {10741#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:41,556 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10741#(<= ~counter~0 0)} {10741#(<= ~counter~0 0)} #92#return; {10741#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:41,557 INFO L290 TraceCheckUtils]: 16: Hoare triple {10741#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {10741#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:41,557 INFO L290 TraceCheckUtils]: 17: Hoare triple {10741#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10790#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:41,558 INFO L290 TraceCheckUtils]: 18: Hoare triple {10790#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {10790#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:41,558 INFO L272 TraceCheckUtils]: 19: Hoare triple {10790#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10790#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:41,558 INFO L290 TraceCheckUtils]: 20: Hoare triple {10790#(<= ~counter~0 1)} ~cond := #in~cond; {10790#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:41,559 INFO L290 TraceCheckUtils]: 21: Hoare triple {10790#(<= ~counter~0 1)} assume !(0 == ~cond); {10790#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:41,559 INFO L290 TraceCheckUtils]: 22: Hoare triple {10790#(<= ~counter~0 1)} assume true; {10790#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:41,559 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {10790#(<= ~counter~0 1)} {10790#(<= ~counter~0 1)} #94#return; {10790#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:41,560 INFO L290 TraceCheckUtils]: 24: Hoare triple {10790#(<= ~counter~0 1)} assume !!(0 != ~r~0); {10790#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:41,560 INFO L290 TraceCheckUtils]: 25: Hoare triple {10790#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10815#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:41,560 INFO L290 TraceCheckUtils]: 26: Hoare triple {10815#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {10815#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:41,561 INFO L272 TraceCheckUtils]: 27: Hoare triple {10815#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10815#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:41,561 INFO L290 TraceCheckUtils]: 28: Hoare triple {10815#(<= ~counter~0 2)} ~cond := #in~cond; {10815#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:41,561 INFO L290 TraceCheckUtils]: 29: Hoare triple {10815#(<= ~counter~0 2)} assume !(0 == ~cond); {10815#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:41,561 INFO L290 TraceCheckUtils]: 30: Hoare triple {10815#(<= ~counter~0 2)} assume true; {10815#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:41,562 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {10815#(<= ~counter~0 2)} {10815#(<= ~counter~0 2)} #96#return; {10815#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:41,562 INFO L290 TraceCheckUtils]: 32: Hoare triple {10815#(<= ~counter~0 2)} assume !(~r~0 > 0); {10815#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:41,563 INFO L290 TraceCheckUtils]: 33: Hoare triple {10815#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10840#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:41,563 INFO L290 TraceCheckUtils]: 34: Hoare triple {10840#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {10840#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:41,563 INFO L272 TraceCheckUtils]: 35: Hoare triple {10840#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10840#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:41,564 INFO L290 TraceCheckUtils]: 36: Hoare triple {10840#(<= ~counter~0 3)} ~cond := #in~cond; {10840#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:41,564 INFO L290 TraceCheckUtils]: 37: Hoare triple {10840#(<= ~counter~0 3)} assume !(0 == ~cond); {10840#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:41,564 INFO L290 TraceCheckUtils]: 38: Hoare triple {10840#(<= ~counter~0 3)} assume true; {10840#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:41,565 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {10840#(<= ~counter~0 3)} {10840#(<= ~counter~0 3)} #98#return; {10840#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:41,565 INFO L290 TraceCheckUtils]: 40: Hoare triple {10840#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {10840#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:41,565 INFO L290 TraceCheckUtils]: 41: Hoare triple {10840#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10865#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:41,566 INFO L290 TraceCheckUtils]: 42: Hoare triple {10865#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {10865#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:41,566 INFO L272 TraceCheckUtils]: 43: Hoare triple {10865#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10865#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:41,566 INFO L290 TraceCheckUtils]: 44: Hoare triple {10865#(<= ~counter~0 4)} ~cond := #in~cond; {10865#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:41,567 INFO L290 TraceCheckUtils]: 45: Hoare triple {10865#(<= ~counter~0 4)} assume !(0 == ~cond); {10865#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:41,567 INFO L290 TraceCheckUtils]: 46: Hoare triple {10865#(<= ~counter~0 4)} assume true; {10865#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:41,567 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {10865#(<= ~counter~0 4)} {10865#(<= ~counter~0 4)} #98#return; {10865#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:41,568 INFO L290 TraceCheckUtils]: 48: Hoare triple {10865#(<= ~counter~0 4)} assume !(~r~0 < 0); {10865#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:41,568 INFO L290 TraceCheckUtils]: 49: Hoare triple {10865#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10890#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:41,568 INFO L290 TraceCheckUtils]: 50: Hoare triple {10890#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {10890#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:41,569 INFO L272 TraceCheckUtils]: 51: Hoare triple {10890#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10890#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:41,569 INFO L290 TraceCheckUtils]: 52: Hoare triple {10890#(<= ~counter~0 5)} ~cond := #in~cond; {10890#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:41,569 INFO L290 TraceCheckUtils]: 53: Hoare triple {10890#(<= ~counter~0 5)} assume !(0 == ~cond); {10890#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:41,570 INFO L290 TraceCheckUtils]: 54: Hoare triple {10890#(<= ~counter~0 5)} assume true; {10890#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:41,570 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {10890#(<= ~counter~0 5)} {10890#(<= ~counter~0 5)} #94#return; {10890#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:41,570 INFO L290 TraceCheckUtils]: 56: Hoare triple {10890#(<= ~counter~0 5)} assume !!(0 != ~r~0); {10890#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:41,571 INFO L290 TraceCheckUtils]: 57: Hoare triple {10890#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10915#(<= |main_#t~post7| 5)} is VALID [2022-04-28 05:56:41,571 INFO L290 TraceCheckUtils]: 58: Hoare triple {10915#(<= |main_#t~post7| 5)} assume !(#t~post7 < 100);havoc #t~post7; {10734#false} is VALID [2022-04-28 05:56:41,571 INFO L290 TraceCheckUtils]: 59: Hoare triple {10734#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10734#false} is VALID [2022-04-28 05:56:41,571 INFO L290 TraceCheckUtils]: 60: Hoare triple {10734#false} assume !(#t~post8 < 100);havoc #t~post8; {10734#false} is VALID [2022-04-28 05:56:41,571 INFO L290 TraceCheckUtils]: 61: Hoare triple {10734#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10734#false} is VALID [2022-04-28 05:56:41,571 INFO L290 TraceCheckUtils]: 62: Hoare triple {10734#false} assume !(#t~post6 < 100);havoc #t~post6; {10734#false} is VALID [2022-04-28 05:56:41,571 INFO L272 TraceCheckUtils]: 63: Hoare triple {10734#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10734#false} is VALID [2022-04-28 05:56:41,571 INFO L290 TraceCheckUtils]: 64: Hoare triple {10734#false} ~cond := #in~cond; {10734#false} is VALID [2022-04-28 05:56:41,571 INFO L290 TraceCheckUtils]: 65: Hoare triple {10734#false} assume 0 == ~cond; {10734#false} is VALID [2022-04-28 05:56:41,572 INFO L290 TraceCheckUtils]: 66: Hoare triple {10734#false} assume !false; {10734#false} is VALID [2022-04-28 05:56:41,572 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 18 proven. 50 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:56:41,572 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:56:41,864 INFO L290 TraceCheckUtils]: 66: Hoare triple {10734#false} assume !false; {10734#false} is VALID [2022-04-28 05:56:41,865 INFO L290 TraceCheckUtils]: 65: Hoare triple {10734#false} assume 0 == ~cond; {10734#false} is VALID [2022-04-28 05:56:41,865 INFO L290 TraceCheckUtils]: 64: Hoare triple {10734#false} ~cond := #in~cond; {10734#false} is VALID [2022-04-28 05:56:41,865 INFO L272 TraceCheckUtils]: 63: Hoare triple {10734#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10734#false} is VALID [2022-04-28 05:56:41,865 INFO L290 TraceCheckUtils]: 62: Hoare triple {10734#false} assume !(#t~post6 < 100);havoc #t~post6; {10734#false} is VALID [2022-04-28 05:56:41,865 INFO L290 TraceCheckUtils]: 61: Hoare triple {10734#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10734#false} is VALID [2022-04-28 05:56:41,865 INFO L290 TraceCheckUtils]: 60: Hoare triple {10734#false} assume !(#t~post8 < 100);havoc #t~post8; {10734#false} is VALID [2022-04-28 05:56:41,865 INFO L290 TraceCheckUtils]: 59: Hoare triple {10734#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10734#false} is VALID [2022-04-28 05:56:41,865 INFO L290 TraceCheckUtils]: 58: Hoare triple {10967#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {10734#false} is VALID [2022-04-28 05:56:41,866 INFO L290 TraceCheckUtils]: 57: Hoare triple {10971#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10967#(< |main_#t~post7| 100)} is VALID [2022-04-28 05:56:41,866 INFO L290 TraceCheckUtils]: 56: Hoare triple {10971#(< ~counter~0 100)} assume !!(0 != ~r~0); {10971#(< ~counter~0 100)} is VALID [2022-04-28 05:56:41,866 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {10733#true} {10971#(< ~counter~0 100)} #94#return; {10971#(< ~counter~0 100)} is VALID [2022-04-28 05:56:41,867 INFO L290 TraceCheckUtils]: 54: Hoare triple {10733#true} assume true; {10733#true} is VALID [2022-04-28 05:56:41,867 INFO L290 TraceCheckUtils]: 53: Hoare triple {10733#true} assume !(0 == ~cond); {10733#true} is VALID [2022-04-28 05:56:41,867 INFO L290 TraceCheckUtils]: 52: Hoare triple {10733#true} ~cond := #in~cond; {10733#true} is VALID [2022-04-28 05:56:41,867 INFO L272 TraceCheckUtils]: 51: Hoare triple {10971#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10733#true} is VALID [2022-04-28 05:56:41,867 INFO L290 TraceCheckUtils]: 50: Hoare triple {10971#(< ~counter~0 100)} assume !!(#t~post6 < 100);havoc #t~post6; {10971#(< ~counter~0 100)} is VALID [2022-04-28 05:56:41,868 INFO L290 TraceCheckUtils]: 49: Hoare triple {10996#(< ~counter~0 99)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10971#(< ~counter~0 100)} is VALID [2022-04-28 05:56:41,868 INFO L290 TraceCheckUtils]: 48: Hoare triple {10996#(< ~counter~0 99)} assume !(~r~0 < 0); {10996#(< ~counter~0 99)} is VALID [2022-04-28 05:56:41,868 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {10733#true} {10996#(< ~counter~0 99)} #98#return; {10996#(< ~counter~0 99)} is VALID [2022-04-28 05:56:41,868 INFO L290 TraceCheckUtils]: 46: Hoare triple {10733#true} assume true; {10733#true} is VALID [2022-04-28 05:56:41,869 INFO L290 TraceCheckUtils]: 45: Hoare triple {10733#true} assume !(0 == ~cond); {10733#true} is VALID [2022-04-28 05:56:41,869 INFO L290 TraceCheckUtils]: 44: Hoare triple {10733#true} ~cond := #in~cond; {10733#true} is VALID [2022-04-28 05:56:41,869 INFO L272 TraceCheckUtils]: 43: Hoare triple {10996#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10733#true} is VALID [2022-04-28 05:56:41,869 INFO L290 TraceCheckUtils]: 42: Hoare triple {10996#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {10996#(< ~counter~0 99)} is VALID [2022-04-28 05:56:41,869 INFO L290 TraceCheckUtils]: 41: Hoare triple {11021#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10996#(< ~counter~0 99)} is VALID [2022-04-28 05:56:41,870 INFO L290 TraceCheckUtils]: 40: Hoare triple {11021#(< ~counter~0 98)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {11021#(< ~counter~0 98)} is VALID [2022-04-28 05:56:41,870 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {10733#true} {11021#(< ~counter~0 98)} #98#return; {11021#(< ~counter~0 98)} is VALID [2022-04-28 05:56:41,870 INFO L290 TraceCheckUtils]: 38: Hoare triple {10733#true} assume true; {10733#true} is VALID [2022-04-28 05:56:41,870 INFO L290 TraceCheckUtils]: 37: Hoare triple {10733#true} assume !(0 == ~cond); {10733#true} is VALID [2022-04-28 05:56:41,870 INFO L290 TraceCheckUtils]: 36: Hoare triple {10733#true} ~cond := #in~cond; {10733#true} is VALID [2022-04-28 05:56:41,870 INFO L272 TraceCheckUtils]: 35: Hoare triple {11021#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10733#true} is VALID [2022-04-28 05:56:41,871 INFO L290 TraceCheckUtils]: 34: Hoare triple {11021#(< ~counter~0 98)} assume !!(#t~post8 < 100);havoc #t~post8; {11021#(< ~counter~0 98)} is VALID [2022-04-28 05:56:41,871 INFO L290 TraceCheckUtils]: 33: Hoare triple {11046#(< ~counter~0 97)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {11021#(< ~counter~0 98)} is VALID [2022-04-28 05:56:41,871 INFO L290 TraceCheckUtils]: 32: Hoare triple {11046#(< ~counter~0 97)} assume !(~r~0 > 0); {11046#(< ~counter~0 97)} is VALID [2022-04-28 05:56:41,872 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {10733#true} {11046#(< ~counter~0 97)} #96#return; {11046#(< ~counter~0 97)} is VALID [2022-04-28 05:56:41,872 INFO L290 TraceCheckUtils]: 30: Hoare triple {10733#true} assume true; {10733#true} is VALID [2022-04-28 05:56:41,872 INFO L290 TraceCheckUtils]: 29: Hoare triple {10733#true} assume !(0 == ~cond); {10733#true} is VALID [2022-04-28 05:56:41,872 INFO L290 TraceCheckUtils]: 28: Hoare triple {10733#true} ~cond := #in~cond; {10733#true} is VALID [2022-04-28 05:56:41,872 INFO L272 TraceCheckUtils]: 27: Hoare triple {11046#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10733#true} is VALID [2022-04-28 05:56:41,872 INFO L290 TraceCheckUtils]: 26: Hoare triple {11046#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {11046#(< ~counter~0 97)} is VALID [2022-04-28 05:56:41,873 INFO L290 TraceCheckUtils]: 25: Hoare triple {11071#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11046#(< ~counter~0 97)} is VALID [2022-04-28 05:56:41,873 INFO L290 TraceCheckUtils]: 24: Hoare triple {11071#(< ~counter~0 96)} assume !!(0 != ~r~0); {11071#(< ~counter~0 96)} is VALID [2022-04-28 05:56:41,874 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {10733#true} {11071#(< ~counter~0 96)} #94#return; {11071#(< ~counter~0 96)} is VALID [2022-04-28 05:56:41,874 INFO L290 TraceCheckUtils]: 22: Hoare triple {10733#true} assume true; {10733#true} is VALID [2022-04-28 05:56:41,874 INFO L290 TraceCheckUtils]: 21: Hoare triple {10733#true} assume !(0 == ~cond); {10733#true} is VALID [2022-04-28 05:56:41,874 INFO L290 TraceCheckUtils]: 20: Hoare triple {10733#true} ~cond := #in~cond; {10733#true} is VALID [2022-04-28 05:56:41,874 INFO L272 TraceCheckUtils]: 19: Hoare triple {11071#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10733#true} is VALID [2022-04-28 05:56:41,874 INFO L290 TraceCheckUtils]: 18: Hoare triple {11071#(< ~counter~0 96)} assume !!(#t~post6 < 100);havoc #t~post6; {11071#(< ~counter~0 96)} is VALID [2022-04-28 05:56:41,875 INFO L290 TraceCheckUtils]: 17: Hoare triple {11096#(< ~counter~0 95)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11071#(< ~counter~0 96)} is VALID [2022-04-28 05:56:41,875 INFO L290 TraceCheckUtils]: 16: Hoare triple {11096#(< ~counter~0 95)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {11096#(< ~counter~0 95)} is VALID [2022-04-28 05:56:41,875 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10733#true} {11096#(< ~counter~0 95)} #92#return; {11096#(< ~counter~0 95)} is VALID [2022-04-28 05:56:41,875 INFO L290 TraceCheckUtils]: 14: Hoare triple {10733#true} assume true; {10733#true} is VALID [2022-04-28 05:56:41,875 INFO L290 TraceCheckUtils]: 13: Hoare triple {10733#true} assume !(0 == ~cond); {10733#true} is VALID [2022-04-28 05:56:41,876 INFO L290 TraceCheckUtils]: 12: Hoare triple {10733#true} ~cond := #in~cond; {10733#true} is VALID [2022-04-28 05:56:41,876 INFO L272 TraceCheckUtils]: 11: Hoare triple {11096#(< ~counter~0 95)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {10733#true} is VALID [2022-04-28 05:56:41,876 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10733#true} {11096#(< ~counter~0 95)} #90#return; {11096#(< ~counter~0 95)} is VALID [2022-04-28 05:56:41,876 INFO L290 TraceCheckUtils]: 9: Hoare triple {10733#true} assume true; {10733#true} is VALID [2022-04-28 05:56:41,876 INFO L290 TraceCheckUtils]: 8: Hoare triple {10733#true} assume !(0 == ~cond); {10733#true} is VALID [2022-04-28 05:56:41,876 INFO L290 TraceCheckUtils]: 7: Hoare triple {10733#true} ~cond := #in~cond; {10733#true} is VALID [2022-04-28 05:56:41,876 INFO L272 TraceCheckUtils]: 6: Hoare triple {11096#(< ~counter~0 95)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {10733#true} is VALID [2022-04-28 05:56:41,877 INFO L290 TraceCheckUtils]: 5: Hoare triple {11096#(< ~counter~0 95)} 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 95)} is VALID [2022-04-28 05:56:41,877 INFO L272 TraceCheckUtils]: 4: Hoare triple {11096#(< ~counter~0 95)} call #t~ret9 := main(); {11096#(< ~counter~0 95)} is VALID [2022-04-28 05:56:41,877 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11096#(< ~counter~0 95)} {10733#true} #102#return; {11096#(< ~counter~0 95)} is VALID [2022-04-28 05:56:41,877 INFO L290 TraceCheckUtils]: 2: Hoare triple {11096#(< ~counter~0 95)} assume true; {11096#(< ~counter~0 95)} is VALID [2022-04-28 05:56:41,878 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 95)} is VALID [2022-04-28 05:56:41,878 INFO L272 TraceCheckUtils]: 0: Hoare triple {10733#true} call ULTIMATE.init(); {10733#true} is VALID [2022-04-28 05:56:41,878 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-28 05:56:41,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:56:41,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332615782] [2022-04-28 05:56:41,879 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:56:41,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335226508] [2022-04-28 05:56:41,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1335226508] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:56:41,879 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:56:41,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-04-28 05:56:41,879 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:56:41,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1302699529] [2022-04-28 05:56:41,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1302699529] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:56:41,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:56:41,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 05:56:41,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849112422] [2022-04-28 05:56:41,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:56:41,880 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) Word has length 67 [2022-04-28 05:56:41,880 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:56:41,880 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 05:56:41,920 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:56:41,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 05:56:41,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:41,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 05:56:41,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2022-04-28 05:56:41,921 INFO L87 Difference]: Start difference. First operand 109 states and 135 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 05:56:42,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:42,269 INFO L93 Difference]: Finished difference Result 151 states and 194 transitions. [2022-04-28 05:56:42,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 05:56:42,269 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) Word has length 67 [2022-04-28 05:56:42,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:56:42,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 05:56:42,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 137 transitions. [2022-04-28 05:56:42,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 05:56:42,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 137 transitions. [2022-04-28 05:56:42,272 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 137 transitions. [2022-04-28 05:56:42,365 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:56:42,366 INFO L225 Difference]: With dead ends: 151 [2022-04-28 05:56:42,366 INFO L226 Difference]: Without dead ends: 114 [2022-04-28 05:56:42,367 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=152, Invalid=228, Unknown=0, NotChecked=0, Total=380 [2022-04-28 05:56:42,367 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 38 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 05:56:42,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 182 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 05:56:42,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-04-28 05:56:42,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2022-04-28 05:56:42,465 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:56:42,465 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand has 114 states, 84 states have (on average 1.1904761904761905) internal successors, (100), 84 states have internal predecessors, (100), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 05:56:42,465 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand has 114 states, 84 states have (on average 1.1904761904761905) internal successors, (100), 84 states have internal predecessors, (100), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 05:56:42,466 INFO L87 Difference]: Start difference. First operand 114 states. Second operand has 114 states, 84 states have (on average 1.1904761904761905) internal successors, (100), 84 states have internal predecessors, (100), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 05:56:42,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:42,467 INFO L93 Difference]: Finished difference Result 114 states and 140 transitions. [2022-04-28 05:56:42,467 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 140 transitions. [2022-04-28 05:56:42,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:56:42,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:56:42,468 INFO L74 IsIncluded]: Start isIncluded. First operand has 114 states, 84 states have (on average 1.1904761904761905) internal successors, (100), 84 states have internal predecessors, (100), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 114 states. [2022-04-28 05:56:42,468 INFO L87 Difference]: Start difference. First operand has 114 states, 84 states have (on average 1.1904761904761905) internal successors, (100), 84 states have internal predecessors, (100), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 114 states. [2022-04-28 05:56:42,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:42,470 INFO L93 Difference]: Finished difference Result 114 states and 140 transitions. [2022-04-28 05:56:42,470 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 140 transitions. [2022-04-28 05:56:42,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:56:42,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:56:42,471 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:56:42,471 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:56:42,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 84 states have (on average 1.1904761904761905) internal successors, (100), 84 states have internal predecessors, (100), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 05:56:42,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 140 transitions. [2022-04-28 05:56:42,473 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 140 transitions. Word has length 67 [2022-04-28 05:56:42,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:56:42,473 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 140 transitions. [2022-04-28 05:56:42,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 05:56:42,473 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 114 states and 140 transitions. [2022-04-28 05:56:44,680 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 139 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 05:56:44,680 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 140 transitions. [2022-04-28 05:56:44,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-28 05:56:44,681 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:56:44,681 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:56:44,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-04-28 05:56:44,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-28 05:56:44,895 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:56:44,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:56:44,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1645787183, now seen corresponding path program 5 times [2022-04-28 05:56:44,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:44,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1826853570] [2022-04-28 05:56:44,896 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:56:44,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1645787183, now seen corresponding path program 6 times [2022-04-28 05:56:44,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:56:44,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454781437] [2022-04-28 05:56:44,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:56:44,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:56:44,909 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:56:44,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1071700869] [2022-04-28 05:56:44,909 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 05:56:44,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:56:44,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:56:44,910 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:56:44,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-28 05:56:44,974 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 05:56:44,974 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:56:44,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 05:56:44,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:56:44,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:56:45,314 INFO L272 TraceCheckUtils]: 0: Hoare triple {11916#true} call ULTIMATE.init(); {11916#true} is VALID [2022-04-28 05:56:45,315 INFO L290 TraceCheckUtils]: 1: Hoare triple {11916#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {11924#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:45,315 INFO L290 TraceCheckUtils]: 2: Hoare triple {11924#(<= ~counter~0 0)} assume true; {11924#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:45,315 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11924#(<= ~counter~0 0)} {11916#true} #102#return; {11924#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:45,315 INFO L272 TraceCheckUtils]: 4: Hoare triple {11924#(<= ~counter~0 0)} call #t~ret9 := main(); {11924#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:45,316 INFO L290 TraceCheckUtils]: 5: Hoare triple {11924#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {11924#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:45,316 INFO L272 TraceCheckUtils]: 6: Hoare triple {11924#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {11924#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:45,316 INFO L290 TraceCheckUtils]: 7: Hoare triple {11924#(<= ~counter~0 0)} ~cond := #in~cond; {11924#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:45,317 INFO L290 TraceCheckUtils]: 8: Hoare triple {11924#(<= ~counter~0 0)} assume !(0 == ~cond); {11924#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:45,317 INFO L290 TraceCheckUtils]: 9: Hoare triple {11924#(<= ~counter~0 0)} assume true; {11924#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:45,317 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11924#(<= ~counter~0 0)} {11924#(<= ~counter~0 0)} #90#return; {11924#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:45,318 INFO L272 TraceCheckUtils]: 11: Hoare triple {11924#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {11924#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:45,318 INFO L290 TraceCheckUtils]: 12: Hoare triple {11924#(<= ~counter~0 0)} ~cond := #in~cond; {11924#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:45,318 INFO L290 TraceCheckUtils]: 13: Hoare triple {11924#(<= ~counter~0 0)} assume !(0 == ~cond); {11924#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:45,318 INFO L290 TraceCheckUtils]: 14: Hoare triple {11924#(<= ~counter~0 0)} assume true; {11924#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:45,319 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {11924#(<= ~counter~0 0)} {11924#(<= ~counter~0 0)} #92#return; {11924#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:45,319 INFO L290 TraceCheckUtils]: 16: Hoare triple {11924#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {11924#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:45,320 INFO L290 TraceCheckUtils]: 17: Hoare triple {11924#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11973#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:45,320 INFO L290 TraceCheckUtils]: 18: Hoare triple {11973#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {11973#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:45,320 INFO L272 TraceCheckUtils]: 19: Hoare triple {11973#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {11973#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:45,321 INFO L290 TraceCheckUtils]: 20: Hoare triple {11973#(<= ~counter~0 1)} ~cond := #in~cond; {11973#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:45,321 INFO L290 TraceCheckUtils]: 21: Hoare triple {11973#(<= ~counter~0 1)} assume !(0 == ~cond); {11973#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:45,321 INFO L290 TraceCheckUtils]: 22: Hoare triple {11973#(<= ~counter~0 1)} assume true; {11973#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:45,322 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {11973#(<= ~counter~0 1)} {11973#(<= ~counter~0 1)} #94#return; {11973#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:45,322 INFO L290 TraceCheckUtils]: 24: Hoare triple {11973#(<= ~counter~0 1)} assume !!(0 != ~r~0); {11973#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:45,324 INFO L290 TraceCheckUtils]: 25: Hoare triple {11973#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11998#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:45,324 INFO L290 TraceCheckUtils]: 26: Hoare triple {11998#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {11998#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:45,325 INFO L272 TraceCheckUtils]: 27: Hoare triple {11998#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {11998#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:45,325 INFO L290 TraceCheckUtils]: 28: Hoare triple {11998#(<= ~counter~0 2)} ~cond := #in~cond; {11998#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:45,325 INFO L290 TraceCheckUtils]: 29: Hoare triple {11998#(<= ~counter~0 2)} assume !(0 == ~cond); {11998#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:45,325 INFO L290 TraceCheckUtils]: 30: Hoare triple {11998#(<= ~counter~0 2)} assume true; {11998#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:45,326 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {11998#(<= ~counter~0 2)} {11998#(<= ~counter~0 2)} #96#return; {11998#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:45,326 INFO L290 TraceCheckUtils]: 32: Hoare triple {11998#(<= ~counter~0 2)} assume !(~r~0 > 0); {11998#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:45,327 INFO L290 TraceCheckUtils]: 33: Hoare triple {11998#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {12023#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:45,327 INFO L290 TraceCheckUtils]: 34: Hoare triple {12023#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {12023#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:45,327 INFO L272 TraceCheckUtils]: 35: Hoare triple {12023#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {12023#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:45,328 INFO L290 TraceCheckUtils]: 36: Hoare triple {12023#(<= ~counter~0 3)} ~cond := #in~cond; {12023#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:45,328 INFO L290 TraceCheckUtils]: 37: Hoare triple {12023#(<= ~counter~0 3)} assume !(0 == ~cond); {12023#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:45,328 INFO L290 TraceCheckUtils]: 38: Hoare triple {12023#(<= ~counter~0 3)} assume true; {12023#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:45,329 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {12023#(<= ~counter~0 3)} {12023#(<= ~counter~0 3)} #98#return; {12023#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:45,329 INFO L290 TraceCheckUtils]: 40: Hoare triple {12023#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {12023#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:45,329 INFO L290 TraceCheckUtils]: 41: Hoare triple {12023#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {12048#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:45,330 INFO L290 TraceCheckUtils]: 42: Hoare triple {12048#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {12048#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:45,330 INFO L272 TraceCheckUtils]: 43: Hoare triple {12048#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {12048#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:45,330 INFO L290 TraceCheckUtils]: 44: Hoare triple {12048#(<= ~counter~0 4)} ~cond := #in~cond; {12048#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:45,331 INFO L290 TraceCheckUtils]: 45: Hoare triple {12048#(<= ~counter~0 4)} assume !(0 == ~cond); {12048#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:45,331 INFO L290 TraceCheckUtils]: 46: Hoare triple {12048#(<= ~counter~0 4)} assume true; {12048#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:45,331 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {12048#(<= ~counter~0 4)} {12048#(<= ~counter~0 4)} #98#return; {12048#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:45,332 INFO L290 TraceCheckUtils]: 48: Hoare triple {12048#(<= ~counter~0 4)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {12048#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:45,332 INFO L290 TraceCheckUtils]: 49: Hoare triple {12048#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {12073#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:45,332 INFO L290 TraceCheckUtils]: 50: Hoare triple {12073#(<= ~counter~0 5)} assume !!(#t~post8 < 100);havoc #t~post8; {12073#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:45,333 INFO L272 TraceCheckUtils]: 51: Hoare triple {12073#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {12073#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:45,333 INFO L290 TraceCheckUtils]: 52: Hoare triple {12073#(<= ~counter~0 5)} ~cond := #in~cond; {12073#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:45,333 INFO L290 TraceCheckUtils]: 53: Hoare triple {12073#(<= ~counter~0 5)} assume !(0 == ~cond); {12073#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:45,334 INFO L290 TraceCheckUtils]: 54: Hoare triple {12073#(<= ~counter~0 5)} assume true; {12073#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:45,334 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {12073#(<= ~counter~0 5)} {12073#(<= ~counter~0 5)} #98#return; {12073#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:45,334 INFO L290 TraceCheckUtils]: 56: Hoare triple {12073#(<= ~counter~0 5)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {12073#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:45,335 INFO L290 TraceCheckUtils]: 57: Hoare triple {12073#(<= ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {12098#(<= ~counter~0 6)} is VALID [2022-04-28 05:56:45,335 INFO L290 TraceCheckUtils]: 58: Hoare triple {12098#(<= ~counter~0 6)} assume !!(#t~post8 < 100);havoc #t~post8; {12098#(<= ~counter~0 6)} is VALID [2022-04-28 05:56:45,336 INFO L272 TraceCheckUtils]: 59: Hoare triple {12098#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {12098#(<= ~counter~0 6)} is VALID [2022-04-28 05:56:45,349 INFO L290 TraceCheckUtils]: 60: Hoare triple {12098#(<= ~counter~0 6)} ~cond := #in~cond; {12098#(<= ~counter~0 6)} is VALID [2022-04-28 05:56:45,349 INFO L290 TraceCheckUtils]: 61: Hoare triple {12098#(<= ~counter~0 6)} assume !(0 == ~cond); {12098#(<= ~counter~0 6)} is VALID [2022-04-28 05:56:45,349 INFO L290 TraceCheckUtils]: 62: Hoare triple {12098#(<= ~counter~0 6)} assume true; {12098#(<= ~counter~0 6)} is VALID [2022-04-28 05:56:45,350 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {12098#(<= ~counter~0 6)} {12098#(<= ~counter~0 6)} #98#return; {12098#(<= ~counter~0 6)} is VALID [2022-04-28 05:56:45,350 INFO L290 TraceCheckUtils]: 64: Hoare triple {12098#(<= ~counter~0 6)} assume !(~r~0 < 0); {12098#(<= ~counter~0 6)} is VALID [2022-04-28 05:56:45,351 INFO L290 TraceCheckUtils]: 65: Hoare triple {12098#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12123#(<= |main_#t~post6| 6)} is VALID [2022-04-28 05:56:45,351 INFO L290 TraceCheckUtils]: 66: Hoare triple {12123#(<= |main_#t~post6| 6)} assume !(#t~post6 < 100);havoc #t~post6; {11917#false} is VALID [2022-04-28 05:56:45,351 INFO L272 TraceCheckUtils]: 67: Hoare triple {11917#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {11917#false} is VALID [2022-04-28 05:56:45,351 INFO L290 TraceCheckUtils]: 68: Hoare triple {11917#false} ~cond := #in~cond; {11917#false} is VALID [2022-04-28 05:56:45,351 INFO L290 TraceCheckUtils]: 69: Hoare triple {11917#false} assume 0 == ~cond; {11917#false} is VALID [2022-04-28 05:56:45,351 INFO L290 TraceCheckUtils]: 70: Hoare triple {11917#false} assume !false; {11917#false} is VALID [2022-04-28 05:56:45,351 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 12 proven. 86 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:56:45,351 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:56:45,739 INFO L290 TraceCheckUtils]: 70: Hoare triple {11917#false} assume !false; {11917#false} is VALID [2022-04-28 05:56:45,739 INFO L290 TraceCheckUtils]: 69: Hoare triple {11917#false} assume 0 == ~cond; {11917#false} is VALID [2022-04-28 05:56:45,739 INFO L290 TraceCheckUtils]: 68: Hoare triple {11917#false} ~cond := #in~cond; {11917#false} is VALID [2022-04-28 05:56:45,739 INFO L272 TraceCheckUtils]: 67: Hoare triple {11917#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {11917#false} is VALID [2022-04-28 05:56:45,739 INFO L290 TraceCheckUtils]: 66: Hoare triple {12151#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {11917#false} is VALID [2022-04-28 05:56:45,740 INFO L290 TraceCheckUtils]: 65: Hoare triple {12155#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12151#(< |main_#t~post6| 100)} is VALID [2022-04-28 05:56:45,740 INFO L290 TraceCheckUtils]: 64: Hoare triple {12155#(< ~counter~0 100)} assume !(~r~0 < 0); {12155#(< ~counter~0 100)} is VALID [2022-04-28 05:56:45,740 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {11916#true} {12155#(< ~counter~0 100)} #98#return; {12155#(< ~counter~0 100)} is VALID [2022-04-28 05:56:45,740 INFO L290 TraceCheckUtils]: 62: Hoare triple {11916#true} assume true; {11916#true} is VALID [2022-04-28 05:56:45,741 INFO L290 TraceCheckUtils]: 61: Hoare triple {11916#true} assume !(0 == ~cond); {11916#true} is VALID [2022-04-28 05:56:45,741 INFO L290 TraceCheckUtils]: 60: Hoare triple {11916#true} ~cond := #in~cond; {11916#true} is VALID [2022-04-28 05:56:45,741 INFO L272 TraceCheckUtils]: 59: Hoare triple {12155#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {11916#true} is VALID [2022-04-28 05:56:45,741 INFO L290 TraceCheckUtils]: 58: Hoare triple {12155#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {12155#(< ~counter~0 100)} is VALID [2022-04-28 05:56:45,742 INFO L290 TraceCheckUtils]: 57: Hoare triple {12180#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {12155#(< ~counter~0 100)} is VALID [2022-04-28 05:56:45,742 INFO L290 TraceCheckUtils]: 56: Hoare triple {12180#(< ~counter~0 99)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {12180#(< ~counter~0 99)} is VALID [2022-04-28 05:56:45,742 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {11916#true} {12180#(< ~counter~0 99)} #98#return; {12180#(< ~counter~0 99)} is VALID [2022-04-28 05:56:45,743 INFO L290 TraceCheckUtils]: 54: Hoare triple {11916#true} assume true; {11916#true} is VALID [2022-04-28 05:56:45,743 INFO L290 TraceCheckUtils]: 53: Hoare triple {11916#true} assume !(0 == ~cond); {11916#true} is VALID [2022-04-28 05:56:45,743 INFO L290 TraceCheckUtils]: 52: Hoare triple {11916#true} ~cond := #in~cond; {11916#true} is VALID [2022-04-28 05:56:45,743 INFO L272 TraceCheckUtils]: 51: Hoare triple {12180#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {11916#true} is VALID [2022-04-28 05:56:45,743 INFO L290 TraceCheckUtils]: 50: Hoare triple {12180#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {12180#(< ~counter~0 99)} is VALID [2022-04-28 05:56:45,743 INFO L290 TraceCheckUtils]: 49: Hoare triple {12205#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {12180#(< ~counter~0 99)} is VALID [2022-04-28 05:56:45,744 INFO L290 TraceCheckUtils]: 48: Hoare triple {12205#(< ~counter~0 98)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {12205#(< ~counter~0 98)} is VALID [2022-04-28 05:56:45,744 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {11916#true} {12205#(< ~counter~0 98)} #98#return; {12205#(< ~counter~0 98)} is VALID [2022-04-28 05:56:45,744 INFO L290 TraceCheckUtils]: 46: Hoare triple {11916#true} assume true; {11916#true} is VALID [2022-04-28 05:56:45,745 INFO L290 TraceCheckUtils]: 45: Hoare triple {11916#true} assume !(0 == ~cond); {11916#true} is VALID [2022-04-28 05:56:45,745 INFO L290 TraceCheckUtils]: 44: Hoare triple {11916#true} ~cond := #in~cond; {11916#true} is VALID [2022-04-28 05:56:45,745 INFO L272 TraceCheckUtils]: 43: Hoare triple {12205#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {11916#true} is VALID [2022-04-28 05:56:45,745 INFO L290 TraceCheckUtils]: 42: Hoare triple {12205#(< ~counter~0 98)} assume !!(#t~post8 < 100);havoc #t~post8; {12205#(< ~counter~0 98)} is VALID [2022-04-28 05:56:45,746 INFO L290 TraceCheckUtils]: 41: Hoare triple {12230#(< ~counter~0 97)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {12205#(< ~counter~0 98)} is VALID [2022-04-28 05:56:45,746 INFO L290 TraceCheckUtils]: 40: Hoare triple {12230#(< ~counter~0 97)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {12230#(< ~counter~0 97)} is VALID [2022-04-28 05:56:45,746 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {11916#true} {12230#(< ~counter~0 97)} #98#return; {12230#(< ~counter~0 97)} is VALID [2022-04-28 05:56:45,746 INFO L290 TraceCheckUtils]: 38: Hoare triple {11916#true} assume true; {11916#true} is VALID [2022-04-28 05:56:45,747 INFO L290 TraceCheckUtils]: 37: Hoare triple {11916#true} assume !(0 == ~cond); {11916#true} is VALID [2022-04-28 05:56:45,747 INFO L290 TraceCheckUtils]: 36: Hoare triple {11916#true} ~cond := #in~cond; {11916#true} is VALID [2022-04-28 05:56:45,747 INFO L272 TraceCheckUtils]: 35: Hoare triple {12230#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {11916#true} is VALID [2022-04-28 05:56:45,747 INFO L290 TraceCheckUtils]: 34: Hoare triple {12230#(< ~counter~0 97)} assume !!(#t~post8 < 100);havoc #t~post8; {12230#(< ~counter~0 97)} is VALID [2022-04-28 05:56:45,747 INFO L290 TraceCheckUtils]: 33: Hoare triple {12255#(< ~counter~0 96)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {12230#(< ~counter~0 97)} is VALID [2022-04-28 05:56:45,748 INFO L290 TraceCheckUtils]: 32: Hoare triple {12255#(< ~counter~0 96)} assume !(~r~0 > 0); {12255#(< ~counter~0 96)} is VALID [2022-04-28 05:56:45,748 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {11916#true} {12255#(< ~counter~0 96)} #96#return; {12255#(< ~counter~0 96)} is VALID [2022-04-28 05:56:45,748 INFO L290 TraceCheckUtils]: 30: Hoare triple {11916#true} assume true; {11916#true} is VALID [2022-04-28 05:56:45,748 INFO L290 TraceCheckUtils]: 29: Hoare triple {11916#true} assume !(0 == ~cond); {11916#true} is VALID [2022-04-28 05:56:45,748 INFO L290 TraceCheckUtils]: 28: Hoare triple {11916#true} ~cond := #in~cond; {11916#true} is VALID [2022-04-28 05:56:45,749 INFO L272 TraceCheckUtils]: 27: Hoare triple {12255#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {11916#true} is VALID [2022-04-28 05:56:45,749 INFO L290 TraceCheckUtils]: 26: Hoare triple {12255#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {12255#(< ~counter~0 96)} is VALID [2022-04-28 05:56:45,749 INFO L290 TraceCheckUtils]: 25: Hoare triple {12280#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {12255#(< ~counter~0 96)} is VALID [2022-04-28 05:56:45,750 INFO L290 TraceCheckUtils]: 24: Hoare triple {12280#(< ~counter~0 95)} assume !!(0 != ~r~0); {12280#(< ~counter~0 95)} is VALID [2022-04-28 05:56:45,750 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {11916#true} {12280#(< ~counter~0 95)} #94#return; {12280#(< ~counter~0 95)} is VALID [2022-04-28 05:56:45,750 INFO L290 TraceCheckUtils]: 22: Hoare triple {11916#true} assume true; {11916#true} is VALID [2022-04-28 05:56:45,750 INFO L290 TraceCheckUtils]: 21: Hoare triple {11916#true} assume !(0 == ~cond); {11916#true} is VALID [2022-04-28 05:56:45,750 INFO L290 TraceCheckUtils]: 20: Hoare triple {11916#true} ~cond := #in~cond; {11916#true} is VALID [2022-04-28 05:56:45,750 INFO L272 TraceCheckUtils]: 19: Hoare triple {12280#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {11916#true} is VALID [2022-04-28 05:56:45,751 INFO L290 TraceCheckUtils]: 18: Hoare triple {12280#(< ~counter~0 95)} assume !!(#t~post6 < 100);havoc #t~post6; {12280#(< ~counter~0 95)} is VALID [2022-04-28 05:56:45,751 INFO L290 TraceCheckUtils]: 17: Hoare triple {12305#(< ~counter~0 94)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12280#(< ~counter~0 95)} is VALID [2022-04-28 05:56:45,751 INFO L290 TraceCheckUtils]: 16: Hoare triple {12305#(< ~counter~0 94)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {12305#(< ~counter~0 94)} is VALID [2022-04-28 05:56:45,752 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {11916#true} {12305#(< ~counter~0 94)} #92#return; {12305#(< ~counter~0 94)} is VALID [2022-04-28 05:56:45,752 INFO L290 TraceCheckUtils]: 14: Hoare triple {11916#true} assume true; {11916#true} is VALID [2022-04-28 05:56:45,752 INFO L290 TraceCheckUtils]: 13: Hoare triple {11916#true} assume !(0 == ~cond); {11916#true} is VALID [2022-04-28 05:56:45,752 INFO L290 TraceCheckUtils]: 12: Hoare triple {11916#true} ~cond := #in~cond; {11916#true} is VALID [2022-04-28 05:56:45,752 INFO L272 TraceCheckUtils]: 11: Hoare triple {12305#(< ~counter~0 94)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {11916#true} is VALID [2022-04-28 05:56:45,753 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11916#true} {12305#(< ~counter~0 94)} #90#return; {12305#(< ~counter~0 94)} is VALID [2022-04-28 05:56:45,753 INFO L290 TraceCheckUtils]: 9: Hoare triple {11916#true} assume true; {11916#true} is VALID [2022-04-28 05:56:45,753 INFO L290 TraceCheckUtils]: 8: Hoare triple {11916#true} assume !(0 == ~cond); {11916#true} is VALID [2022-04-28 05:56:45,753 INFO L290 TraceCheckUtils]: 7: Hoare triple {11916#true} ~cond := #in~cond; {11916#true} is VALID [2022-04-28 05:56:45,753 INFO L272 TraceCheckUtils]: 6: Hoare triple {12305#(< ~counter~0 94)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {11916#true} is VALID [2022-04-28 05:56:45,753 INFO L290 TraceCheckUtils]: 5: Hoare triple {12305#(< ~counter~0 94)} 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 94)} is VALID [2022-04-28 05:56:45,754 INFO L272 TraceCheckUtils]: 4: Hoare triple {12305#(< ~counter~0 94)} call #t~ret9 := main(); {12305#(< ~counter~0 94)} is VALID [2022-04-28 05:56:45,754 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12305#(< ~counter~0 94)} {11916#true} #102#return; {12305#(< ~counter~0 94)} is VALID [2022-04-28 05:56:45,754 INFO L290 TraceCheckUtils]: 2: Hoare triple {12305#(< ~counter~0 94)} assume true; {12305#(< ~counter~0 94)} is VALID [2022-04-28 05:56:45,755 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 94)} is VALID [2022-04-28 05:56:45,755 INFO L272 TraceCheckUtils]: 0: Hoare triple {11916#true} call ULTIMATE.init(); {11916#true} is VALID [2022-04-28 05:56:45,755 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 12 proven. 26 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-28 05:56:45,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:56:45,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454781437] [2022-04-28 05:56:45,755 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:56:45,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071700869] [2022-04-28 05:56:45,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071700869] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:56:45,756 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:56:45,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-28 05:56:45,756 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:56:45,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1826853570] [2022-04-28 05:56:45,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1826853570] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:56:45,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:56:45,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 05:56:45,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454332403] [2022-04-28 05:56:45,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:56:45,757 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) Word has length 71 [2022-04-28 05:56:45,757 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:56:45,757 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 05:56:45,800 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:56:45,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 05:56:45,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:45,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 05:56:45,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-28 05:56:45,801 INFO L87 Difference]: Start difference. First operand 114 states and 140 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 05:56:46,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:46,221 INFO L93 Difference]: Finished difference Result 137 states and 169 transitions. [2022-04-28 05:56:46,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 05:56:46,221 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) Word has length 71 [2022-04-28 05:56:46,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:56:46,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 05:56:46,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 135 transitions. [2022-04-28 05:56:46,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 05:56:46,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 135 transitions. [2022-04-28 05:56:46,225 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 135 transitions. [2022-04-28 05:56:46,331 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:56:46,333 INFO L225 Difference]: With dead ends: 137 [2022-04-28 05:56:46,333 INFO L226 Difference]: Without dead ends: 132 [2022-04-28 05:56:46,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=170, Invalid=250, Unknown=0, NotChecked=0, Total=420 [2022-04-28 05:56:46,334 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 61 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 05:56:46,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 189 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 05:56:46,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-04-28 05:56:46,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 125. [2022-04-28 05:56:46,461 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:56:46,461 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand has 125 states, 90 states have (on average 1.1888888888888889) internal successors, (107), 93 states have internal predecessors, (107), 25 states have call successors, (25), 11 states have call predecessors, (25), 9 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-28 05:56:46,462 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand has 125 states, 90 states have (on average 1.1888888888888889) internal successors, (107), 93 states have internal predecessors, (107), 25 states have call successors, (25), 11 states have call predecessors, (25), 9 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-28 05:56:46,462 INFO L87 Difference]: Start difference. First operand 132 states. Second operand has 125 states, 90 states have (on average 1.1888888888888889) internal successors, (107), 93 states have internal predecessors, (107), 25 states have call successors, (25), 11 states have call predecessors, (25), 9 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-28 05:56:46,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:46,468 INFO L93 Difference]: Finished difference Result 132 states and 164 transitions. [2022-04-28 05:56:46,468 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 164 transitions. [2022-04-28 05:56:46,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:56:46,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:56:46,469 INFO L74 IsIncluded]: Start isIncluded. First operand has 125 states, 90 states have (on average 1.1888888888888889) internal successors, (107), 93 states have internal predecessors, (107), 25 states have call successors, (25), 11 states have call predecessors, (25), 9 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) Second operand 132 states. [2022-04-28 05:56:46,469 INFO L87 Difference]: Start difference. First operand has 125 states, 90 states have (on average 1.1888888888888889) internal successors, (107), 93 states have internal predecessors, (107), 25 states have call successors, (25), 11 states have call predecessors, (25), 9 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) Second operand 132 states. [2022-04-28 05:56:46,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:46,472 INFO L93 Difference]: Finished difference Result 132 states and 164 transitions. [2022-04-28 05:56:46,472 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 164 transitions. [2022-04-28 05:56:46,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:56:46,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:56:46,473 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:56:46,473 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:56:46,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 90 states have (on average 1.1888888888888889) internal successors, (107), 93 states have internal predecessors, (107), 25 states have call successors, (25), 11 states have call predecessors, (25), 9 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-28 05:56:46,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 155 transitions. [2022-04-28 05:56:46,475 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 155 transitions. Word has length 71 [2022-04-28 05:56:46,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:56:46,477 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 155 transitions. [2022-04-28 05:56:46,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 05:56:46,477 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 125 states and 155 transitions. [2022-04-28 05:56:48,407 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:56:48,407 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 155 transitions. [2022-04-28 05:56:48,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-28 05:56:48,407 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:56:48,407 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:56:48,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-28 05:56:48,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-28 05:56:48,615 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:56:48,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:56:48,616 INFO L85 PathProgramCache]: Analyzing trace with hash -15963768, now seen corresponding path program 1 times [2022-04-28 05:56:48,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:48,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [127858448] [2022-04-28 05:56:48,616 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:56:48,616 INFO L85 PathProgramCache]: Analyzing trace with hash -15963768, now seen corresponding path program 2 times [2022-04-28 05:56:48,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:56:48,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224303325] [2022-04-28 05:56:48,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:56:48,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:56:48,625 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:56:48,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1806166308] [2022-04-28 05:56:48,625 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:56:48,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:56:48,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:56:48,626 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:56:48,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-28 05:56:48,687 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:56:48,687 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:56:48,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-28 05:56:48,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:56:48,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:56:48,903 INFO L272 TraceCheckUtils]: 0: Hoare triple {13153#true} call ULTIMATE.init(); {13153#true} is VALID [2022-04-28 05:56:48,904 INFO L290 TraceCheckUtils]: 1: Hoare triple {13153#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {13153#true} is VALID [2022-04-28 05:56:48,904 INFO L290 TraceCheckUtils]: 2: Hoare triple {13153#true} assume true; {13153#true} is VALID [2022-04-28 05:56:48,904 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13153#true} {13153#true} #102#return; {13153#true} is VALID [2022-04-28 05:56:48,904 INFO L272 TraceCheckUtils]: 4: Hoare triple {13153#true} call #t~ret9 := main(); {13153#true} is VALID [2022-04-28 05:56:48,904 INFO L290 TraceCheckUtils]: 5: Hoare triple {13153#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {13153#true} is VALID [2022-04-28 05:56:48,904 INFO L272 TraceCheckUtils]: 6: Hoare triple {13153#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {13153#true} is VALID [2022-04-28 05:56:48,904 INFO L290 TraceCheckUtils]: 7: Hoare triple {13153#true} ~cond := #in~cond; {13153#true} is VALID [2022-04-28 05:56:48,904 INFO L290 TraceCheckUtils]: 8: Hoare triple {13153#true} assume !(0 == ~cond); {13153#true} is VALID [2022-04-28 05:56:48,904 INFO L290 TraceCheckUtils]: 9: Hoare triple {13153#true} assume true; {13153#true} is VALID [2022-04-28 05:56:48,904 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13153#true} {13153#true} #90#return; {13153#true} is VALID [2022-04-28 05:56:48,904 INFO L272 TraceCheckUtils]: 11: Hoare triple {13153#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {13153#true} is VALID [2022-04-28 05:56:48,904 INFO L290 TraceCheckUtils]: 12: Hoare triple {13153#true} ~cond := #in~cond; {13153#true} is VALID [2022-04-28 05:56:48,905 INFO L290 TraceCheckUtils]: 13: Hoare triple {13153#true} assume !(0 == ~cond); {13153#true} is VALID [2022-04-28 05:56:48,905 INFO L290 TraceCheckUtils]: 14: Hoare triple {13153#true} assume true; {13153#true} is VALID [2022-04-28 05:56:48,905 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {13153#true} {13153#true} #92#return; {13153#true} is VALID [2022-04-28 05:56:48,905 INFO L290 TraceCheckUtils]: 16: Hoare triple {13153#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {13153#true} is VALID [2022-04-28 05:56:48,905 INFO L290 TraceCheckUtils]: 17: Hoare triple {13153#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13153#true} is VALID [2022-04-28 05:56:48,905 INFO L290 TraceCheckUtils]: 18: Hoare triple {13153#true} assume !!(#t~post6 < 100);havoc #t~post6; {13153#true} is VALID [2022-04-28 05:56:48,905 INFO L272 TraceCheckUtils]: 19: Hoare triple {13153#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13153#true} is VALID [2022-04-28 05:56:48,905 INFO L290 TraceCheckUtils]: 20: Hoare triple {13153#true} ~cond := #in~cond; {13153#true} is VALID [2022-04-28 05:56:48,905 INFO L290 TraceCheckUtils]: 21: Hoare triple {13153#true} assume !(0 == ~cond); {13153#true} is VALID [2022-04-28 05:56:48,905 INFO L290 TraceCheckUtils]: 22: Hoare triple {13153#true} assume true; {13153#true} is VALID [2022-04-28 05:56:48,905 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {13153#true} {13153#true} #94#return; {13153#true} is VALID [2022-04-28 05:56:48,905 INFO L290 TraceCheckUtils]: 24: Hoare triple {13153#true} assume !!(0 != ~r~0); {13153#true} is VALID [2022-04-28 05:56:48,905 INFO L290 TraceCheckUtils]: 25: Hoare triple {13153#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13153#true} is VALID [2022-04-28 05:56:48,905 INFO L290 TraceCheckUtils]: 26: Hoare triple {13153#true} assume !!(#t~post7 < 100);havoc #t~post7; {13153#true} is VALID [2022-04-28 05:56:48,906 INFO L272 TraceCheckUtils]: 27: Hoare triple {13153#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13153#true} is VALID [2022-04-28 05:56:48,906 INFO L290 TraceCheckUtils]: 28: Hoare triple {13153#true} ~cond := #in~cond; {13153#true} is VALID [2022-04-28 05:56:48,906 INFO L290 TraceCheckUtils]: 29: Hoare triple {13153#true} assume !(0 == ~cond); {13153#true} is VALID [2022-04-28 05:56:48,906 INFO L290 TraceCheckUtils]: 30: Hoare triple {13153#true} assume true; {13153#true} is VALID [2022-04-28 05:56:48,906 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {13153#true} {13153#true} #96#return; {13153#true} is VALID [2022-04-28 05:56:48,906 INFO L290 TraceCheckUtils]: 32: Hoare triple {13153#true} assume !(~r~0 > 0); {13153#true} is VALID [2022-04-28 05:56:48,906 INFO L290 TraceCheckUtils]: 33: Hoare triple {13153#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {13153#true} is VALID [2022-04-28 05:56:48,906 INFO L290 TraceCheckUtils]: 34: Hoare triple {13153#true} assume !!(#t~post8 < 100);havoc #t~post8; {13153#true} is VALID [2022-04-28 05:56:48,906 INFO L272 TraceCheckUtils]: 35: Hoare triple {13153#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13153#true} is VALID [2022-04-28 05:56:48,906 INFO L290 TraceCheckUtils]: 36: Hoare triple {13153#true} ~cond := #in~cond; {13153#true} is VALID [2022-04-28 05:56:48,906 INFO L290 TraceCheckUtils]: 37: Hoare triple {13153#true} assume !(0 == ~cond); {13153#true} is VALID [2022-04-28 05:56:48,906 INFO L290 TraceCheckUtils]: 38: Hoare triple {13153#true} assume true; {13153#true} is VALID [2022-04-28 05:56:48,906 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {13153#true} {13153#true} #98#return; {13153#true} is VALID [2022-04-28 05:56:48,906 INFO L290 TraceCheckUtils]: 40: Hoare triple {13153#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {13153#true} is VALID [2022-04-28 05:56:48,907 INFO L290 TraceCheckUtils]: 41: Hoare triple {13153#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {13153#true} is VALID [2022-04-28 05:56:48,907 INFO L290 TraceCheckUtils]: 42: Hoare triple {13153#true} assume !!(#t~post8 < 100);havoc #t~post8; {13153#true} is VALID [2022-04-28 05:56:48,907 INFO L272 TraceCheckUtils]: 43: Hoare triple {13153#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13153#true} is VALID [2022-04-28 05:56:48,907 INFO L290 TraceCheckUtils]: 44: Hoare triple {13153#true} ~cond := #in~cond; {13153#true} is VALID [2022-04-28 05:56:48,907 INFO L290 TraceCheckUtils]: 45: Hoare triple {13153#true} assume !(0 == ~cond); {13153#true} is VALID [2022-04-28 05:56:48,907 INFO L290 TraceCheckUtils]: 46: Hoare triple {13153#true} assume true; {13153#true} is VALID [2022-04-28 05:56:48,907 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {13153#true} {13153#true} #98#return; {13153#true} is VALID [2022-04-28 05:56:48,907 INFO L290 TraceCheckUtils]: 48: Hoare triple {13153#true} assume !(~r~0 < 0); {13302#(not (< main_~r~0 0))} is VALID [2022-04-28 05:56:48,908 INFO L290 TraceCheckUtils]: 49: Hoare triple {13302#(not (< main_~r~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13302#(not (< main_~r~0 0))} is VALID [2022-04-28 05:56:48,908 INFO L290 TraceCheckUtils]: 50: Hoare triple {13302#(not (< main_~r~0 0))} assume !!(#t~post6 < 100);havoc #t~post6; {13302#(not (< main_~r~0 0))} is VALID [2022-04-28 05:56:48,908 INFO L272 TraceCheckUtils]: 51: Hoare triple {13302#(not (< main_~r~0 0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13153#true} is VALID [2022-04-28 05:56:48,908 INFO L290 TraceCheckUtils]: 52: Hoare triple {13153#true} ~cond := #in~cond; {13153#true} is VALID [2022-04-28 05:56:48,908 INFO L290 TraceCheckUtils]: 53: Hoare triple {13153#true} assume !(0 == ~cond); {13153#true} is VALID [2022-04-28 05:56:48,908 INFO L290 TraceCheckUtils]: 54: Hoare triple {13153#true} assume true; {13153#true} is VALID [2022-04-28 05:56:48,909 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {13153#true} {13302#(not (< main_~r~0 0))} #94#return; {13302#(not (< main_~r~0 0))} is VALID [2022-04-28 05:56:48,909 INFO L290 TraceCheckUtils]: 56: Hoare triple {13302#(not (< main_~r~0 0))} assume !!(0 != ~r~0); {13327#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} is VALID [2022-04-28 05:56:48,909 INFO L290 TraceCheckUtils]: 57: Hoare triple {13327#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13327#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} is VALID [2022-04-28 05:56:48,910 INFO L290 TraceCheckUtils]: 58: Hoare triple {13327#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} assume !!(#t~post7 < 100);havoc #t~post7; {13327#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} is VALID [2022-04-28 05:56:48,910 INFO L272 TraceCheckUtils]: 59: Hoare triple {13327#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13153#true} is VALID [2022-04-28 05:56:48,910 INFO L290 TraceCheckUtils]: 60: Hoare triple {13153#true} ~cond := #in~cond; {13153#true} is VALID [2022-04-28 05:56:48,910 INFO L290 TraceCheckUtils]: 61: Hoare triple {13153#true} assume !(0 == ~cond); {13153#true} is VALID [2022-04-28 05:56:48,910 INFO L290 TraceCheckUtils]: 62: Hoare triple {13153#true} assume true; {13153#true} is VALID [2022-04-28 05:56:48,910 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {13153#true} {13327#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} #96#return; {13327#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} is VALID [2022-04-28 05:56:48,911 INFO L290 TraceCheckUtils]: 64: Hoare triple {13327#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} assume !(~r~0 > 0); {13154#false} is VALID [2022-04-28 05:56:48,911 INFO L290 TraceCheckUtils]: 65: Hoare triple {13154#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {13154#false} is VALID [2022-04-28 05:56:48,911 INFO L290 TraceCheckUtils]: 66: Hoare triple {13154#false} assume !(#t~post8 < 100);havoc #t~post8; {13154#false} is VALID [2022-04-28 05:56:48,911 INFO L290 TraceCheckUtils]: 67: Hoare triple {13154#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13154#false} is VALID [2022-04-28 05:56:48,911 INFO L290 TraceCheckUtils]: 68: Hoare triple {13154#false} assume !(#t~post6 < 100);havoc #t~post6; {13154#false} is VALID [2022-04-28 05:56:48,911 INFO L272 TraceCheckUtils]: 69: Hoare triple {13154#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13154#false} is VALID [2022-04-28 05:56:48,911 INFO L290 TraceCheckUtils]: 70: Hoare triple {13154#false} ~cond := #in~cond; {13154#false} is VALID [2022-04-28 05:56:48,911 INFO L290 TraceCheckUtils]: 71: Hoare triple {13154#false} assume 0 == ~cond; {13154#false} is VALID [2022-04-28 05:56:48,911 INFO L290 TraceCheckUtils]: 72: Hoare triple {13154#false} assume !false; {13154#false} is VALID [2022-04-28 05:56:48,912 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-04-28 05:56:48,912 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 05:56:48,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:56:48,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224303325] [2022-04-28 05:56:48,912 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:56:48,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806166308] [2022-04-28 05:56:48,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806166308] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:56:48,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:56:48,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 05:56:48,913 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:56:48,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [127858448] [2022-04-28 05:56:48,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [127858448] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:56:48,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:56:48,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 05:56:48,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607866576] [2022-04-28 05:56:48,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:56:48,914 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 73 [2022-04-28 05:56:48,914 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:56:48,914 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 05:56:48,947 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:56:48,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 05:56:48,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:48,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 05:56:48,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-28 05:56:48,948 INFO L87 Difference]: Start difference. First operand 125 states and 155 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 05:56:49,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:49,157 INFO L93 Difference]: Finished difference Result 180 states and 235 transitions. [2022-04-28 05:56:49,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 05:56:49,157 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 73 [2022-04-28 05:56:49,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:56:49,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 05:56:49,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-04-28 05:56:49,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 05:56:49,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-04-28 05:56:49,159 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 94 transitions. [2022-04-28 05:56:49,228 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:56:49,230 INFO L225 Difference]: With dead ends: 180 [2022-04-28 05:56:49,230 INFO L226 Difference]: Without dead ends: 143 [2022-04-28 05:56:49,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-28 05:56:49,231 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 17 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 05:56:49,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 93 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 05:56:49,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-04-28 05:56:49,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 137. [2022-04-28 05:56:49,379 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:56:49,379 INFO L82 GeneralOperation]: Start isEquivalent. First operand 143 states. Second operand has 137 states, 99 states have (on average 1.202020202020202) internal successors, (119), 102 states have internal predecessors, (119), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 05:56:49,380 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand has 137 states, 99 states have (on average 1.202020202020202) internal successors, (119), 102 states have internal predecessors, (119), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 05:56:49,380 INFO L87 Difference]: Start difference. First operand 143 states. Second operand has 137 states, 99 states have (on average 1.202020202020202) internal successors, (119), 102 states have internal predecessors, (119), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 05:56:49,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:49,382 INFO L93 Difference]: Finished difference Result 143 states and 181 transitions. [2022-04-28 05:56:49,382 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 181 transitions. [2022-04-28 05:56:49,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:56:49,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:56:49,383 INFO L74 IsIncluded]: Start isIncluded. First operand has 137 states, 99 states have (on average 1.202020202020202) internal successors, (119), 102 states have internal predecessors, (119), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) Second operand 143 states. [2022-04-28 05:56:49,383 INFO L87 Difference]: Start difference. First operand has 137 states, 99 states have (on average 1.202020202020202) internal successors, (119), 102 states have internal predecessors, (119), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) Second operand 143 states. [2022-04-28 05:56:49,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:49,385 INFO L93 Difference]: Finished difference Result 143 states and 181 transitions. [2022-04-28 05:56:49,385 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 181 transitions. [2022-04-28 05:56:49,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:56:49,385 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:56:49,385 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:56:49,385 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:56:49,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 99 states have (on average 1.202020202020202) internal successors, (119), 102 states have internal predecessors, (119), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 05:56:49,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 173 transitions. [2022-04-28 05:56:49,387 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 173 transitions. Word has length 73 [2022-04-28 05:56:49,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:56:49,388 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 173 transitions. [2022-04-28 05:56:49,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 05:56:49,388 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 137 states and 173 transitions. [2022-04-28 05:56:51,655 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 172 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 05:56:51,656 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 173 transitions. [2022-04-28 05:56:51,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-28 05:56:51,656 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:56:51,656 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 5, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:56:51,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-28 05:56:51,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-28 05:56:51,863 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:56:51,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:56:51,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1401128268, now seen corresponding path program 7 times [2022-04-28 05:56:51,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:51,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1443313319] [2022-04-28 05:56:51,864 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:56:51,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1401128268, now seen corresponding path program 8 times [2022-04-28 05:56:51,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:56:51,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358979208] [2022-04-28 05:56:51,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:56:51,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:56:51,894 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:56:51,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [222843713] [2022-04-28 05:56:51,894 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:56:51,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:56:51,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:56:51,896 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:56:51,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-28 05:56:51,940 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:56:51,940 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:56:51,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 05:56:51,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:56:51,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:56:52,283 INFO L272 TraceCheckUtils]: 0: Hoare triple {14295#true} call ULTIMATE.init(); {14295#true} is VALID [2022-04-28 05:56:52,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {14295#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {14303#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:52,283 INFO L290 TraceCheckUtils]: 2: Hoare triple {14303#(<= ~counter~0 0)} assume true; {14303#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:52,284 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14303#(<= ~counter~0 0)} {14295#true} #102#return; {14303#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:52,284 INFO L272 TraceCheckUtils]: 4: Hoare triple {14303#(<= ~counter~0 0)} call #t~ret9 := main(); {14303#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:52,284 INFO L290 TraceCheckUtils]: 5: Hoare triple {14303#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {14303#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:52,285 INFO L272 TraceCheckUtils]: 6: Hoare triple {14303#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {14303#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:52,285 INFO L290 TraceCheckUtils]: 7: Hoare triple {14303#(<= ~counter~0 0)} ~cond := #in~cond; {14303#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:52,285 INFO L290 TraceCheckUtils]: 8: Hoare triple {14303#(<= ~counter~0 0)} assume !(0 == ~cond); {14303#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:52,286 INFO L290 TraceCheckUtils]: 9: Hoare triple {14303#(<= ~counter~0 0)} assume true; {14303#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:52,286 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14303#(<= ~counter~0 0)} {14303#(<= ~counter~0 0)} #90#return; {14303#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:52,286 INFO L272 TraceCheckUtils]: 11: Hoare triple {14303#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {14303#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:52,287 INFO L290 TraceCheckUtils]: 12: Hoare triple {14303#(<= ~counter~0 0)} ~cond := #in~cond; {14303#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:52,287 INFO L290 TraceCheckUtils]: 13: Hoare triple {14303#(<= ~counter~0 0)} assume !(0 == ~cond); {14303#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:52,287 INFO L290 TraceCheckUtils]: 14: Hoare triple {14303#(<= ~counter~0 0)} assume true; {14303#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:52,288 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {14303#(<= ~counter~0 0)} {14303#(<= ~counter~0 0)} #92#return; {14303#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:52,288 INFO L290 TraceCheckUtils]: 16: Hoare triple {14303#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {14303#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:52,288 INFO L290 TraceCheckUtils]: 17: Hoare triple {14303#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14352#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:52,289 INFO L290 TraceCheckUtils]: 18: Hoare triple {14352#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {14352#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:52,289 INFO L272 TraceCheckUtils]: 19: Hoare triple {14352#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {14352#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:52,289 INFO L290 TraceCheckUtils]: 20: Hoare triple {14352#(<= ~counter~0 1)} ~cond := #in~cond; {14352#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:52,290 INFO L290 TraceCheckUtils]: 21: Hoare triple {14352#(<= ~counter~0 1)} assume !(0 == ~cond); {14352#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:52,290 INFO L290 TraceCheckUtils]: 22: Hoare triple {14352#(<= ~counter~0 1)} assume true; {14352#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:52,290 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {14352#(<= ~counter~0 1)} {14352#(<= ~counter~0 1)} #94#return; {14352#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:52,291 INFO L290 TraceCheckUtils]: 24: Hoare triple {14352#(<= ~counter~0 1)} assume !!(0 != ~r~0); {14352#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:52,291 INFO L290 TraceCheckUtils]: 25: Hoare triple {14352#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {14377#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:52,291 INFO L290 TraceCheckUtils]: 26: Hoare triple {14377#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {14377#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:52,292 INFO L272 TraceCheckUtils]: 27: Hoare triple {14377#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {14377#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:52,292 INFO L290 TraceCheckUtils]: 28: Hoare triple {14377#(<= ~counter~0 2)} ~cond := #in~cond; {14377#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:52,293 INFO L290 TraceCheckUtils]: 29: Hoare triple {14377#(<= ~counter~0 2)} assume !(0 == ~cond); {14377#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:52,293 INFO L290 TraceCheckUtils]: 30: Hoare triple {14377#(<= ~counter~0 2)} assume true; {14377#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:52,293 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {14377#(<= ~counter~0 2)} {14377#(<= ~counter~0 2)} #96#return; {14377#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:52,294 INFO L290 TraceCheckUtils]: 32: Hoare triple {14377#(<= ~counter~0 2)} assume !(~r~0 > 0); {14377#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:52,295 INFO L290 TraceCheckUtils]: 33: Hoare triple {14377#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14402#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:52,295 INFO L290 TraceCheckUtils]: 34: Hoare triple {14402#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {14402#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:52,296 INFO L272 TraceCheckUtils]: 35: Hoare triple {14402#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {14402#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:52,296 INFO L290 TraceCheckUtils]: 36: Hoare triple {14402#(<= ~counter~0 3)} ~cond := #in~cond; {14402#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:52,296 INFO L290 TraceCheckUtils]: 37: Hoare triple {14402#(<= ~counter~0 3)} assume !(0 == ~cond); {14402#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:52,297 INFO L290 TraceCheckUtils]: 38: Hoare triple {14402#(<= ~counter~0 3)} assume true; {14402#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:52,297 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {14402#(<= ~counter~0 3)} {14402#(<= ~counter~0 3)} #98#return; {14402#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:52,297 INFO L290 TraceCheckUtils]: 40: Hoare triple {14402#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {14402#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:52,298 INFO L290 TraceCheckUtils]: 41: Hoare triple {14402#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14427#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:52,298 INFO L290 TraceCheckUtils]: 42: Hoare triple {14427#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {14427#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:52,299 INFO L272 TraceCheckUtils]: 43: Hoare triple {14427#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {14427#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:52,299 INFO L290 TraceCheckUtils]: 44: Hoare triple {14427#(<= ~counter~0 4)} ~cond := #in~cond; {14427#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:52,300 INFO L290 TraceCheckUtils]: 45: Hoare triple {14427#(<= ~counter~0 4)} assume !(0 == ~cond); {14427#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:52,300 INFO L290 TraceCheckUtils]: 46: Hoare triple {14427#(<= ~counter~0 4)} assume true; {14427#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:52,301 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {14427#(<= ~counter~0 4)} {14427#(<= ~counter~0 4)} #98#return; {14427#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:52,301 INFO L290 TraceCheckUtils]: 48: Hoare triple {14427#(<= ~counter~0 4)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {14427#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:52,301 INFO L290 TraceCheckUtils]: 49: Hoare triple {14427#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14452#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:52,302 INFO L290 TraceCheckUtils]: 50: Hoare triple {14452#(<= ~counter~0 5)} assume !!(#t~post8 < 100);havoc #t~post8; {14452#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:52,302 INFO L272 TraceCheckUtils]: 51: Hoare triple {14452#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {14452#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:52,302 INFO L290 TraceCheckUtils]: 52: Hoare triple {14452#(<= ~counter~0 5)} ~cond := #in~cond; {14452#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:52,303 INFO L290 TraceCheckUtils]: 53: Hoare triple {14452#(<= ~counter~0 5)} assume !(0 == ~cond); {14452#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:52,303 INFO L290 TraceCheckUtils]: 54: Hoare triple {14452#(<= ~counter~0 5)} assume true; {14452#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:52,303 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {14452#(<= ~counter~0 5)} {14452#(<= ~counter~0 5)} #98#return; {14452#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:52,304 INFO L290 TraceCheckUtils]: 56: Hoare triple {14452#(<= ~counter~0 5)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {14452#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:52,304 INFO L290 TraceCheckUtils]: 57: Hoare triple {14452#(<= ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14477#(<= ~counter~0 6)} is VALID [2022-04-28 05:56:52,305 INFO L290 TraceCheckUtils]: 58: Hoare triple {14477#(<= ~counter~0 6)} assume !!(#t~post8 < 100);havoc #t~post8; {14477#(<= ~counter~0 6)} is VALID [2022-04-28 05:56:52,305 INFO L272 TraceCheckUtils]: 59: Hoare triple {14477#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {14477#(<= ~counter~0 6)} is VALID [2022-04-28 05:56:52,305 INFO L290 TraceCheckUtils]: 60: Hoare triple {14477#(<= ~counter~0 6)} ~cond := #in~cond; {14477#(<= ~counter~0 6)} is VALID [2022-04-28 05:56:52,306 INFO L290 TraceCheckUtils]: 61: Hoare triple {14477#(<= ~counter~0 6)} assume !(0 == ~cond); {14477#(<= ~counter~0 6)} is VALID [2022-04-28 05:56:52,306 INFO L290 TraceCheckUtils]: 62: Hoare triple {14477#(<= ~counter~0 6)} assume true; {14477#(<= ~counter~0 6)} is VALID [2022-04-28 05:56:52,307 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {14477#(<= ~counter~0 6)} {14477#(<= ~counter~0 6)} #98#return; {14477#(<= ~counter~0 6)} is VALID [2022-04-28 05:56:52,307 INFO L290 TraceCheckUtils]: 64: Hoare triple {14477#(<= ~counter~0 6)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {14477#(<= ~counter~0 6)} is VALID [2022-04-28 05:56:52,307 INFO L290 TraceCheckUtils]: 65: Hoare triple {14477#(<= ~counter~0 6)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14502#(<= |main_#t~post8| 6)} is VALID [2022-04-28 05:56:52,308 INFO L290 TraceCheckUtils]: 66: Hoare triple {14502#(<= |main_#t~post8| 6)} assume !(#t~post8 < 100);havoc #t~post8; {14296#false} is VALID [2022-04-28 05:56:52,308 INFO L290 TraceCheckUtils]: 67: Hoare triple {14296#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14296#false} is VALID [2022-04-28 05:56:52,308 INFO L290 TraceCheckUtils]: 68: Hoare triple {14296#false} assume !(#t~post6 < 100);havoc #t~post6; {14296#false} is VALID [2022-04-28 05:56:52,308 INFO L272 TraceCheckUtils]: 69: Hoare triple {14296#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {14296#false} is VALID [2022-04-28 05:56:52,308 INFO L290 TraceCheckUtils]: 70: Hoare triple {14296#false} ~cond := #in~cond; {14296#false} is VALID [2022-04-28 05:56:52,308 INFO L290 TraceCheckUtils]: 71: Hoare triple {14296#false} assume 0 == ~cond; {14296#false} is VALID [2022-04-28 05:56:52,308 INFO L290 TraceCheckUtils]: 72: Hoare triple {14296#false} assume !false; {14296#false} is VALID [2022-04-28 05:56:52,308 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 14 proven. 92 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:56:52,308 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:56:52,680 INFO L290 TraceCheckUtils]: 72: Hoare triple {14296#false} assume !false; {14296#false} is VALID [2022-04-28 05:56:52,680 INFO L290 TraceCheckUtils]: 71: Hoare triple {14296#false} assume 0 == ~cond; {14296#false} is VALID [2022-04-28 05:56:52,680 INFO L290 TraceCheckUtils]: 70: Hoare triple {14296#false} ~cond := #in~cond; {14296#false} is VALID [2022-04-28 05:56:52,680 INFO L272 TraceCheckUtils]: 69: Hoare triple {14296#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {14296#false} is VALID [2022-04-28 05:56:52,680 INFO L290 TraceCheckUtils]: 68: Hoare triple {14296#false} assume !(#t~post6 < 100);havoc #t~post6; {14296#false} is VALID [2022-04-28 05:56:52,680 INFO L290 TraceCheckUtils]: 67: Hoare triple {14296#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14296#false} is VALID [2022-04-28 05:56:52,680 INFO L290 TraceCheckUtils]: 66: Hoare triple {14542#(< |main_#t~post8| 100)} assume !(#t~post8 < 100);havoc #t~post8; {14296#false} is VALID [2022-04-28 05:56:52,681 INFO L290 TraceCheckUtils]: 65: Hoare triple {14546#(< ~counter~0 100)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14542#(< |main_#t~post8| 100)} is VALID [2022-04-28 05:56:52,681 INFO L290 TraceCheckUtils]: 64: Hoare triple {14546#(< ~counter~0 100)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {14546#(< ~counter~0 100)} is VALID [2022-04-28 05:56:52,682 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {14295#true} {14546#(< ~counter~0 100)} #98#return; {14546#(< ~counter~0 100)} is VALID [2022-04-28 05:56:52,682 INFO L290 TraceCheckUtils]: 62: Hoare triple {14295#true} assume true; {14295#true} is VALID [2022-04-28 05:56:52,682 INFO L290 TraceCheckUtils]: 61: Hoare triple {14295#true} assume !(0 == ~cond); {14295#true} is VALID [2022-04-28 05:56:52,682 INFO L290 TraceCheckUtils]: 60: Hoare triple {14295#true} ~cond := #in~cond; {14295#true} is VALID [2022-04-28 05:56:52,682 INFO L272 TraceCheckUtils]: 59: Hoare triple {14546#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {14295#true} is VALID [2022-04-28 05:56:52,682 INFO L290 TraceCheckUtils]: 58: Hoare triple {14546#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {14546#(< ~counter~0 100)} is VALID [2022-04-28 05:56:52,683 INFO L290 TraceCheckUtils]: 57: Hoare triple {14571#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14546#(< ~counter~0 100)} is VALID [2022-04-28 05:56:52,683 INFO L290 TraceCheckUtils]: 56: Hoare triple {14571#(< ~counter~0 99)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {14571#(< ~counter~0 99)} is VALID [2022-04-28 05:56:52,683 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {14295#true} {14571#(< ~counter~0 99)} #98#return; {14571#(< ~counter~0 99)} is VALID [2022-04-28 05:56:52,684 INFO L290 TraceCheckUtils]: 54: Hoare triple {14295#true} assume true; {14295#true} is VALID [2022-04-28 05:56:52,684 INFO L290 TraceCheckUtils]: 53: Hoare triple {14295#true} assume !(0 == ~cond); {14295#true} is VALID [2022-04-28 05:56:52,684 INFO L290 TraceCheckUtils]: 52: Hoare triple {14295#true} ~cond := #in~cond; {14295#true} is VALID [2022-04-28 05:56:52,684 INFO L272 TraceCheckUtils]: 51: Hoare triple {14571#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {14295#true} is VALID [2022-04-28 05:56:52,685 INFO L290 TraceCheckUtils]: 50: Hoare triple {14571#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {14571#(< ~counter~0 99)} is VALID [2022-04-28 05:56:52,686 INFO L290 TraceCheckUtils]: 49: Hoare triple {14596#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14571#(< ~counter~0 99)} is VALID [2022-04-28 05:56:52,686 INFO L290 TraceCheckUtils]: 48: Hoare triple {14596#(< ~counter~0 98)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {14596#(< ~counter~0 98)} is VALID [2022-04-28 05:56:52,687 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {14295#true} {14596#(< ~counter~0 98)} #98#return; {14596#(< ~counter~0 98)} is VALID [2022-04-28 05:56:52,687 INFO L290 TraceCheckUtils]: 46: Hoare triple {14295#true} assume true; {14295#true} is VALID [2022-04-28 05:56:52,687 INFO L290 TraceCheckUtils]: 45: Hoare triple {14295#true} assume !(0 == ~cond); {14295#true} is VALID [2022-04-28 05:56:52,687 INFO L290 TraceCheckUtils]: 44: Hoare triple {14295#true} ~cond := #in~cond; {14295#true} is VALID [2022-04-28 05:56:52,687 INFO L272 TraceCheckUtils]: 43: Hoare triple {14596#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {14295#true} is VALID [2022-04-28 05:56:52,687 INFO L290 TraceCheckUtils]: 42: Hoare triple {14596#(< ~counter~0 98)} assume !!(#t~post8 < 100);havoc #t~post8; {14596#(< ~counter~0 98)} is VALID [2022-04-28 05:56:52,688 INFO L290 TraceCheckUtils]: 41: Hoare triple {14621#(< ~counter~0 97)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14596#(< ~counter~0 98)} is VALID [2022-04-28 05:56:52,688 INFO L290 TraceCheckUtils]: 40: Hoare triple {14621#(< ~counter~0 97)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {14621#(< ~counter~0 97)} is VALID [2022-04-28 05:56:52,688 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {14295#true} {14621#(< ~counter~0 97)} #98#return; {14621#(< ~counter~0 97)} is VALID [2022-04-28 05:56:52,689 INFO L290 TraceCheckUtils]: 38: Hoare triple {14295#true} assume true; {14295#true} is VALID [2022-04-28 05:56:52,689 INFO L290 TraceCheckUtils]: 37: Hoare triple {14295#true} assume !(0 == ~cond); {14295#true} is VALID [2022-04-28 05:56:52,689 INFO L290 TraceCheckUtils]: 36: Hoare triple {14295#true} ~cond := #in~cond; {14295#true} is VALID [2022-04-28 05:56:52,689 INFO L272 TraceCheckUtils]: 35: Hoare triple {14621#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {14295#true} is VALID [2022-04-28 05:56:52,689 INFO L290 TraceCheckUtils]: 34: Hoare triple {14621#(< ~counter~0 97)} assume !!(#t~post8 < 100);havoc #t~post8; {14621#(< ~counter~0 97)} is VALID [2022-04-28 05:56:52,689 INFO L290 TraceCheckUtils]: 33: Hoare triple {14646#(< ~counter~0 96)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14621#(< ~counter~0 97)} is VALID [2022-04-28 05:56:52,690 INFO L290 TraceCheckUtils]: 32: Hoare triple {14646#(< ~counter~0 96)} assume !(~r~0 > 0); {14646#(< ~counter~0 96)} is VALID [2022-04-28 05:56:52,690 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {14295#true} {14646#(< ~counter~0 96)} #96#return; {14646#(< ~counter~0 96)} is VALID [2022-04-28 05:56:52,690 INFO L290 TraceCheckUtils]: 30: Hoare triple {14295#true} assume true; {14295#true} is VALID [2022-04-28 05:56:52,690 INFO L290 TraceCheckUtils]: 29: Hoare triple {14295#true} assume !(0 == ~cond); {14295#true} is VALID [2022-04-28 05:56:52,690 INFO L290 TraceCheckUtils]: 28: Hoare triple {14295#true} ~cond := #in~cond; {14295#true} is VALID [2022-04-28 05:56:52,691 INFO L272 TraceCheckUtils]: 27: Hoare triple {14646#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {14295#true} is VALID [2022-04-28 05:56:52,691 INFO L290 TraceCheckUtils]: 26: Hoare triple {14646#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {14646#(< ~counter~0 96)} is VALID [2022-04-28 05:56:52,691 INFO L290 TraceCheckUtils]: 25: Hoare triple {14671#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {14646#(< ~counter~0 96)} is VALID [2022-04-28 05:56:52,692 INFO L290 TraceCheckUtils]: 24: Hoare triple {14671#(< ~counter~0 95)} assume !!(0 != ~r~0); {14671#(< ~counter~0 95)} is VALID [2022-04-28 05:56:52,692 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {14295#true} {14671#(< ~counter~0 95)} #94#return; {14671#(< ~counter~0 95)} is VALID [2022-04-28 05:56:52,692 INFO L290 TraceCheckUtils]: 22: Hoare triple {14295#true} assume true; {14295#true} is VALID [2022-04-28 05:56:52,692 INFO L290 TraceCheckUtils]: 21: Hoare triple {14295#true} assume !(0 == ~cond); {14295#true} is VALID [2022-04-28 05:56:52,692 INFO L290 TraceCheckUtils]: 20: Hoare triple {14295#true} ~cond := #in~cond; {14295#true} is VALID [2022-04-28 05:56:52,692 INFO L272 TraceCheckUtils]: 19: Hoare triple {14671#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {14295#true} is VALID [2022-04-28 05:56:52,693 INFO L290 TraceCheckUtils]: 18: Hoare triple {14671#(< ~counter~0 95)} assume !!(#t~post6 < 100);havoc #t~post6; {14671#(< ~counter~0 95)} is VALID [2022-04-28 05:56:52,693 INFO L290 TraceCheckUtils]: 17: Hoare triple {14696#(< ~counter~0 94)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14671#(< ~counter~0 95)} is VALID [2022-04-28 05:56:52,693 INFO L290 TraceCheckUtils]: 16: Hoare triple {14696#(< ~counter~0 94)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {14696#(< ~counter~0 94)} is VALID [2022-04-28 05:56:52,694 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {14295#true} {14696#(< ~counter~0 94)} #92#return; {14696#(< ~counter~0 94)} is VALID [2022-04-28 05:56:52,694 INFO L290 TraceCheckUtils]: 14: Hoare triple {14295#true} assume true; {14295#true} is VALID [2022-04-28 05:56:52,694 INFO L290 TraceCheckUtils]: 13: Hoare triple {14295#true} assume !(0 == ~cond); {14295#true} is VALID [2022-04-28 05:56:52,694 INFO L290 TraceCheckUtils]: 12: Hoare triple {14295#true} ~cond := #in~cond; {14295#true} is VALID [2022-04-28 05:56:52,694 INFO L272 TraceCheckUtils]: 11: Hoare triple {14696#(< ~counter~0 94)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {14295#true} is VALID [2022-04-28 05:56:52,694 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14295#true} {14696#(< ~counter~0 94)} #90#return; {14696#(< ~counter~0 94)} is VALID [2022-04-28 05:56:52,694 INFO L290 TraceCheckUtils]: 9: Hoare triple {14295#true} assume true; {14295#true} is VALID [2022-04-28 05:56:52,695 INFO L290 TraceCheckUtils]: 8: Hoare triple {14295#true} assume !(0 == ~cond); {14295#true} is VALID [2022-04-28 05:56:52,695 INFO L290 TraceCheckUtils]: 7: Hoare triple {14295#true} ~cond := #in~cond; {14295#true} is VALID [2022-04-28 05:56:52,695 INFO L272 TraceCheckUtils]: 6: Hoare triple {14696#(< ~counter~0 94)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {14295#true} is VALID [2022-04-28 05:56:52,695 INFO L290 TraceCheckUtils]: 5: Hoare triple {14696#(< ~counter~0 94)} 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 94)} is VALID [2022-04-28 05:56:52,695 INFO L272 TraceCheckUtils]: 4: Hoare triple {14696#(< ~counter~0 94)} call #t~ret9 := main(); {14696#(< ~counter~0 94)} is VALID [2022-04-28 05:56:52,696 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14696#(< ~counter~0 94)} {14295#true} #102#return; {14696#(< ~counter~0 94)} is VALID [2022-04-28 05:56:52,696 INFO L290 TraceCheckUtils]: 2: Hoare triple {14696#(< ~counter~0 94)} assume true; {14696#(< ~counter~0 94)} is VALID [2022-04-28 05:56:52,696 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 94)} is VALID [2022-04-28 05:56:52,696 INFO L272 TraceCheckUtils]: 0: Hoare triple {14295#true} call ULTIMATE.init(); {14295#true} is VALID [2022-04-28 05:56:52,697 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 14 proven. 32 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-28 05:56:52,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:56:52,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358979208] [2022-04-28 05:56:52,697 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:56:52,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222843713] [2022-04-28 05:56:52,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [222843713] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:56:52,697 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:56:52,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-28 05:56:52,697 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:56:52,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1443313319] [2022-04-28 05:56:52,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1443313319] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:56:52,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:56:52,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 05:56:52,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851732237] [2022-04-28 05:56:52,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:56:52,698 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) Word has length 73 [2022-04-28 05:56:52,698 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:56:52,698 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 05:56:52,748 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:56:52,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 05:56:52,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:52,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 05:56:52,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-28 05:56:52,748 INFO L87 Difference]: Start difference. First operand 137 states and 173 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 05:56:53,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:53,235 INFO L93 Difference]: Finished difference Result 193 states and 252 transitions. [2022-04-28 05:56:53,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 05:56:53,236 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) Word has length 73 [2022-04-28 05:56:53,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:56:53,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 05:56:53,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 157 transitions. [2022-04-28 05:56:53,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 05:56:53,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 157 transitions. [2022-04-28 05:56:53,240 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 157 transitions. [2022-04-28 05:56:53,355 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:56:53,357 INFO L225 Difference]: With dead ends: 193 [2022-04-28 05:56:53,357 INFO L226 Difference]: Without dead ends: 144 [2022-04-28 05:56:53,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=185, Invalid=277, Unknown=0, NotChecked=0, Total=462 [2022-04-28 05:56:53,358 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 53 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 05:56:53,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 197 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 05:56:53,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-04-28 05:56:53,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 140. [2022-04-28 05:56:53,506 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:56:53,506 INFO L82 GeneralOperation]: Start isEquivalent. First operand 144 states. Second operand has 140 states, 102 states have (on average 1.2058823529411764) internal successors, (123), 104 states have internal predecessors, (123), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 05:56:53,506 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand has 140 states, 102 states have (on average 1.2058823529411764) internal successors, (123), 104 states have internal predecessors, (123), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 05:56:53,506 INFO L87 Difference]: Start difference. First operand 144 states. Second operand has 140 states, 102 states have (on average 1.2058823529411764) internal successors, (123), 104 states have internal predecessors, (123), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 05:56:53,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:53,509 INFO L93 Difference]: Finished difference Result 144 states and 181 transitions. [2022-04-28 05:56:53,509 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 181 transitions. [2022-04-28 05:56:53,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:56:53,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:56:53,509 INFO L74 IsIncluded]: Start isIncluded. First operand has 140 states, 102 states have (on average 1.2058823529411764) internal successors, (123), 104 states have internal predecessors, (123), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) Second operand 144 states. [2022-04-28 05:56:53,510 INFO L87 Difference]: Start difference. First operand has 140 states, 102 states have (on average 1.2058823529411764) internal successors, (123), 104 states have internal predecessors, (123), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) Second operand 144 states. [2022-04-28 05:56:53,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:53,511 INFO L93 Difference]: Finished difference Result 144 states and 181 transitions. [2022-04-28 05:56:53,512 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 181 transitions. [2022-04-28 05:56:53,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:56:53,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:56:53,512 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:56:53,512 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:56:53,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 102 states have (on average 1.2058823529411764) internal successors, (123), 104 states have internal predecessors, (123), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 05:56:53,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 177 transitions. [2022-04-28 05:56:53,516 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 177 transitions. Word has length 73 [2022-04-28 05:56:53,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:56:53,516 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 177 transitions. [2022-04-28 05:56:53,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 05:56:53,516 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 140 states and 177 transitions. [2022-04-28 05:56:55,824 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 176 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 05:56:55,824 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 177 transitions. [2022-04-28 05:56:55,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-28 05:56:55,825 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:56:55,825 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:56:55,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-28 05:56:56,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:56:56,025 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:56:56,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:56:56,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1116733197, now seen corresponding path program 1 times [2022-04-28 05:56:56,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:56,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [615856406] [2022-04-28 05:56:56,026 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:56:56,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1116733197, now seen corresponding path program 2 times [2022-04-28 05:56:56,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:56:56,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679443164] [2022-04-28 05:56:56,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:56:56,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:56:56,036 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:56:56,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [439433696] [2022-04-28 05:56:56,037 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:56:56,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:56:56,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:56:56,038 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:56:56,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-28 05:56:56,086 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:56:56,086 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:56:56,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 05:56:56,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:56:56,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:56:56,408 INFO L272 TraceCheckUtils]: 0: Hoare triple {15712#true} call ULTIMATE.init(); {15712#true} is VALID [2022-04-28 05:56:56,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {15712#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {15720#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:56,409 INFO L290 TraceCheckUtils]: 2: Hoare triple {15720#(<= ~counter~0 0)} assume true; {15720#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:56,409 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15720#(<= ~counter~0 0)} {15712#true} #102#return; {15720#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:56,410 INFO L272 TraceCheckUtils]: 4: Hoare triple {15720#(<= ~counter~0 0)} call #t~ret9 := main(); {15720#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:56,410 INFO L290 TraceCheckUtils]: 5: Hoare triple {15720#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {15720#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:56,410 INFO L272 TraceCheckUtils]: 6: Hoare triple {15720#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {15720#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:56,411 INFO L290 TraceCheckUtils]: 7: Hoare triple {15720#(<= ~counter~0 0)} ~cond := #in~cond; {15720#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:56,411 INFO L290 TraceCheckUtils]: 8: Hoare triple {15720#(<= ~counter~0 0)} assume !(0 == ~cond); {15720#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:56,411 INFO L290 TraceCheckUtils]: 9: Hoare triple {15720#(<= ~counter~0 0)} assume true; {15720#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:56,412 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15720#(<= ~counter~0 0)} {15720#(<= ~counter~0 0)} #90#return; {15720#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:56,412 INFO L272 TraceCheckUtils]: 11: Hoare triple {15720#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {15720#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:56,413 INFO L290 TraceCheckUtils]: 12: Hoare triple {15720#(<= ~counter~0 0)} ~cond := #in~cond; {15720#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:56,413 INFO L290 TraceCheckUtils]: 13: Hoare triple {15720#(<= ~counter~0 0)} assume !(0 == ~cond); {15720#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:56,413 INFO L290 TraceCheckUtils]: 14: Hoare triple {15720#(<= ~counter~0 0)} assume true; {15720#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:56,414 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {15720#(<= ~counter~0 0)} {15720#(<= ~counter~0 0)} #92#return; {15720#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:56,414 INFO L290 TraceCheckUtils]: 16: Hoare triple {15720#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {15720#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:56,414 INFO L290 TraceCheckUtils]: 17: Hoare triple {15720#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15769#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:56,415 INFO L290 TraceCheckUtils]: 18: Hoare triple {15769#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {15769#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:56,415 INFO L272 TraceCheckUtils]: 19: Hoare triple {15769#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {15769#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:56,416 INFO L290 TraceCheckUtils]: 20: Hoare triple {15769#(<= ~counter~0 1)} ~cond := #in~cond; {15769#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:56,416 INFO L290 TraceCheckUtils]: 21: Hoare triple {15769#(<= ~counter~0 1)} assume !(0 == ~cond); {15769#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:56,416 INFO L290 TraceCheckUtils]: 22: Hoare triple {15769#(<= ~counter~0 1)} assume true; {15769#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:56,417 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {15769#(<= ~counter~0 1)} {15769#(<= ~counter~0 1)} #94#return; {15769#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:56,417 INFO L290 TraceCheckUtils]: 24: Hoare triple {15769#(<= ~counter~0 1)} assume !!(0 != ~r~0); {15769#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:56,418 INFO L290 TraceCheckUtils]: 25: Hoare triple {15769#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {15794#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:56,418 INFO L290 TraceCheckUtils]: 26: Hoare triple {15794#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {15794#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:56,418 INFO L272 TraceCheckUtils]: 27: Hoare triple {15794#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {15794#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:56,419 INFO L290 TraceCheckUtils]: 28: Hoare triple {15794#(<= ~counter~0 2)} ~cond := #in~cond; {15794#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:56,419 INFO L290 TraceCheckUtils]: 29: Hoare triple {15794#(<= ~counter~0 2)} assume !(0 == ~cond); {15794#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:56,419 INFO L290 TraceCheckUtils]: 30: Hoare triple {15794#(<= ~counter~0 2)} assume true; {15794#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:56,420 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {15794#(<= ~counter~0 2)} {15794#(<= ~counter~0 2)} #96#return; {15794#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:56,420 INFO L290 TraceCheckUtils]: 32: Hoare triple {15794#(<= ~counter~0 2)} assume !(~r~0 > 0); {15794#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:56,421 INFO L290 TraceCheckUtils]: 33: Hoare triple {15794#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {15819#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:56,421 INFO L290 TraceCheckUtils]: 34: Hoare triple {15819#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {15819#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:56,422 INFO L272 TraceCheckUtils]: 35: Hoare triple {15819#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {15819#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:56,422 INFO L290 TraceCheckUtils]: 36: Hoare triple {15819#(<= ~counter~0 3)} ~cond := #in~cond; {15819#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:56,422 INFO L290 TraceCheckUtils]: 37: Hoare triple {15819#(<= ~counter~0 3)} assume !(0 == ~cond); {15819#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:56,422 INFO L290 TraceCheckUtils]: 38: Hoare triple {15819#(<= ~counter~0 3)} assume true; {15819#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:56,423 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {15819#(<= ~counter~0 3)} {15819#(<= ~counter~0 3)} #98#return; {15819#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:56,423 INFO L290 TraceCheckUtils]: 40: Hoare triple {15819#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {15819#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:56,424 INFO L290 TraceCheckUtils]: 41: Hoare triple {15819#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {15844#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:56,424 INFO L290 TraceCheckUtils]: 42: Hoare triple {15844#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {15844#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:56,425 INFO L272 TraceCheckUtils]: 43: Hoare triple {15844#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {15844#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:56,425 INFO L290 TraceCheckUtils]: 44: Hoare triple {15844#(<= ~counter~0 4)} ~cond := #in~cond; {15844#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:56,426 INFO L290 TraceCheckUtils]: 45: Hoare triple {15844#(<= ~counter~0 4)} assume !(0 == ~cond); {15844#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:56,426 INFO L290 TraceCheckUtils]: 46: Hoare triple {15844#(<= ~counter~0 4)} assume true; {15844#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:56,427 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {15844#(<= ~counter~0 4)} {15844#(<= ~counter~0 4)} #98#return; {15844#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:56,427 INFO L290 TraceCheckUtils]: 48: Hoare triple {15844#(<= ~counter~0 4)} assume !(~r~0 < 0); {15844#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:56,427 INFO L290 TraceCheckUtils]: 49: Hoare triple {15844#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15869#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:56,428 INFO L290 TraceCheckUtils]: 50: Hoare triple {15869#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {15869#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:56,428 INFO L272 TraceCheckUtils]: 51: Hoare triple {15869#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {15869#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:56,429 INFO L290 TraceCheckUtils]: 52: Hoare triple {15869#(<= ~counter~0 5)} ~cond := #in~cond; {15869#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:56,429 INFO L290 TraceCheckUtils]: 53: Hoare triple {15869#(<= ~counter~0 5)} assume !(0 == ~cond); {15869#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:56,429 INFO L290 TraceCheckUtils]: 54: Hoare triple {15869#(<= ~counter~0 5)} assume true; {15869#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:56,430 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {15869#(<= ~counter~0 5)} {15869#(<= ~counter~0 5)} #94#return; {15869#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:56,430 INFO L290 TraceCheckUtils]: 56: Hoare triple {15869#(<= ~counter~0 5)} assume !!(0 != ~r~0); {15869#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:56,431 INFO L290 TraceCheckUtils]: 57: Hoare triple {15869#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {15894#(<= ~counter~0 6)} is VALID [2022-04-28 05:56:56,431 INFO L290 TraceCheckUtils]: 58: Hoare triple {15894#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {15894#(<= ~counter~0 6)} is VALID [2022-04-28 05:56:56,432 INFO L272 TraceCheckUtils]: 59: Hoare triple {15894#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {15894#(<= ~counter~0 6)} is VALID [2022-04-28 05:56:56,432 INFO L290 TraceCheckUtils]: 60: Hoare triple {15894#(<= ~counter~0 6)} ~cond := #in~cond; {15894#(<= ~counter~0 6)} is VALID [2022-04-28 05:56:56,432 INFO L290 TraceCheckUtils]: 61: Hoare triple {15894#(<= ~counter~0 6)} assume !(0 == ~cond); {15894#(<= ~counter~0 6)} is VALID [2022-04-28 05:56:56,433 INFO L290 TraceCheckUtils]: 62: Hoare triple {15894#(<= ~counter~0 6)} assume true; {15894#(<= ~counter~0 6)} is VALID [2022-04-28 05:56:56,433 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {15894#(<= ~counter~0 6)} {15894#(<= ~counter~0 6)} #96#return; {15894#(<= ~counter~0 6)} is VALID [2022-04-28 05:56:56,433 INFO L290 TraceCheckUtils]: 64: Hoare triple {15894#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {15894#(<= ~counter~0 6)} is VALID [2022-04-28 05:56:56,434 INFO L290 TraceCheckUtils]: 65: Hoare triple {15894#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {15919#(<= |main_#t~post7| 6)} is VALID [2022-04-28 05:56:56,434 INFO L290 TraceCheckUtils]: 66: Hoare triple {15919#(<= |main_#t~post7| 6)} assume !(#t~post7 < 100);havoc #t~post7; {15713#false} is VALID [2022-04-28 05:56:56,434 INFO L290 TraceCheckUtils]: 67: Hoare triple {15713#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {15713#false} is VALID [2022-04-28 05:56:56,434 INFO L290 TraceCheckUtils]: 68: Hoare triple {15713#false} assume !(#t~post8 < 100);havoc #t~post8; {15713#false} is VALID [2022-04-28 05:56:56,434 INFO L290 TraceCheckUtils]: 69: Hoare triple {15713#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15713#false} is VALID [2022-04-28 05:56:56,434 INFO L290 TraceCheckUtils]: 70: Hoare triple {15713#false} assume !(#t~post6 < 100);havoc #t~post6; {15713#false} is VALID [2022-04-28 05:56:56,434 INFO L272 TraceCheckUtils]: 71: Hoare triple {15713#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {15713#false} is VALID [2022-04-28 05:56:56,435 INFO L290 TraceCheckUtils]: 72: Hoare triple {15713#false} ~cond := #in~cond; {15713#false} is VALID [2022-04-28 05:56:56,435 INFO L290 TraceCheckUtils]: 73: Hoare triple {15713#false} assume 0 == ~cond; {15713#false} is VALID [2022-04-28 05:56:56,435 INFO L290 TraceCheckUtils]: 74: Hoare triple {15713#false} assume !false; {15713#false} is VALID [2022-04-28 05:56:56,435 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 20 proven. 76 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:56:56,435 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:56:56,797 INFO L290 TraceCheckUtils]: 74: Hoare triple {15713#false} assume !false; {15713#false} is VALID [2022-04-28 05:56:56,797 INFO L290 TraceCheckUtils]: 73: Hoare triple {15713#false} assume 0 == ~cond; {15713#false} is VALID [2022-04-28 05:56:56,798 INFO L290 TraceCheckUtils]: 72: Hoare triple {15713#false} ~cond := #in~cond; {15713#false} is VALID [2022-04-28 05:56:56,798 INFO L272 TraceCheckUtils]: 71: Hoare triple {15713#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {15713#false} is VALID [2022-04-28 05:56:56,798 INFO L290 TraceCheckUtils]: 70: Hoare triple {15713#false} assume !(#t~post6 < 100);havoc #t~post6; {15713#false} is VALID [2022-04-28 05:56:56,798 INFO L290 TraceCheckUtils]: 69: Hoare triple {15713#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15713#false} is VALID [2022-04-28 05:56:56,798 INFO L290 TraceCheckUtils]: 68: Hoare triple {15713#false} assume !(#t~post8 < 100);havoc #t~post8; {15713#false} is VALID [2022-04-28 05:56:56,798 INFO L290 TraceCheckUtils]: 67: Hoare triple {15713#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {15713#false} is VALID [2022-04-28 05:56:56,800 INFO L290 TraceCheckUtils]: 66: Hoare triple {15971#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {15713#false} is VALID [2022-04-28 05:56:56,800 INFO L290 TraceCheckUtils]: 65: Hoare triple {15975#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {15971#(< |main_#t~post7| 100)} is VALID [2022-04-28 05:56:56,800 INFO L290 TraceCheckUtils]: 64: Hoare triple {15975#(< ~counter~0 100)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {15975#(< ~counter~0 100)} is VALID [2022-04-28 05:56:56,801 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {15712#true} {15975#(< ~counter~0 100)} #96#return; {15975#(< ~counter~0 100)} is VALID [2022-04-28 05:56:56,801 INFO L290 TraceCheckUtils]: 62: Hoare triple {15712#true} assume true; {15712#true} is VALID [2022-04-28 05:56:56,801 INFO L290 TraceCheckUtils]: 61: Hoare triple {15712#true} assume !(0 == ~cond); {15712#true} is VALID [2022-04-28 05:56:56,801 INFO L290 TraceCheckUtils]: 60: Hoare triple {15712#true} ~cond := #in~cond; {15712#true} is VALID [2022-04-28 05:56:56,801 INFO L272 TraceCheckUtils]: 59: Hoare triple {15975#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {15712#true} is VALID [2022-04-28 05:56:56,802 INFO L290 TraceCheckUtils]: 58: Hoare triple {15975#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {15975#(< ~counter~0 100)} is VALID [2022-04-28 05:56:56,802 INFO L290 TraceCheckUtils]: 57: Hoare triple {16000#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {15975#(< ~counter~0 100)} is VALID [2022-04-28 05:56:56,803 INFO L290 TraceCheckUtils]: 56: Hoare triple {16000#(< ~counter~0 99)} assume !!(0 != ~r~0); {16000#(< ~counter~0 99)} is VALID [2022-04-28 05:56:56,803 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {15712#true} {16000#(< ~counter~0 99)} #94#return; {16000#(< ~counter~0 99)} is VALID [2022-04-28 05:56:56,803 INFO L290 TraceCheckUtils]: 54: Hoare triple {15712#true} assume true; {15712#true} is VALID [2022-04-28 05:56:56,803 INFO L290 TraceCheckUtils]: 53: Hoare triple {15712#true} assume !(0 == ~cond); {15712#true} is VALID [2022-04-28 05:56:56,803 INFO L290 TraceCheckUtils]: 52: Hoare triple {15712#true} ~cond := #in~cond; {15712#true} is VALID [2022-04-28 05:56:56,803 INFO L272 TraceCheckUtils]: 51: Hoare triple {16000#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {15712#true} is VALID [2022-04-28 05:56:56,804 INFO L290 TraceCheckUtils]: 50: Hoare triple {16000#(< ~counter~0 99)} assume !!(#t~post6 < 100);havoc #t~post6; {16000#(< ~counter~0 99)} is VALID [2022-04-28 05:56:56,804 INFO L290 TraceCheckUtils]: 49: Hoare triple {16025#(< ~counter~0 98)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16000#(< ~counter~0 99)} is VALID [2022-04-28 05:56:56,804 INFO L290 TraceCheckUtils]: 48: Hoare triple {16025#(< ~counter~0 98)} assume !(~r~0 < 0); {16025#(< ~counter~0 98)} is VALID [2022-04-28 05:56:56,805 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {15712#true} {16025#(< ~counter~0 98)} #98#return; {16025#(< ~counter~0 98)} is VALID [2022-04-28 05:56:56,805 INFO L290 TraceCheckUtils]: 46: Hoare triple {15712#true} assume true; {15712#true} is VALID [2022-04-28 05:56:56,805 INFO L290 TraceCheckUtils]: 45: Hoare triple {15712#true} assume !(0 == ~cond); {15712#true} is VALID [2022-04-28 05:56:56,805 INFO L290 TraceCheckUtils]: 44: Hoare triple {15712#true} ~cond := #in~cond; {15712#true} is VALID [2022-04-28 05:56:56,805 INFO L272 TraceCheckUtils]: 43: Hoare triple {16025#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {15712#true} is VALID [2022-04-28 05:56:56,805 INFO L290 TraceCheckUtils]: 42: Hoare triple {16025#(< ~counter~0 98)} assume !!(#t~post8 < 100);havoc #t~post8; {16025#(< ~counter~0 98)} is VALID [2022-04-28 05:56:56,806 INFO L290 TraceCheckUtils]: 41: Hoare triple {16050#(< ~counter~0 97)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {16025#(< ~counter~0 98)} is VALID [2022-04-28 05:56:56,806 INFO L290 TraceCheckUtils]: 40: Hoare triple {16050#(< ~counter~0 97)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {16050#(< ~counter~0 97)} is VALID [2022-04-28 05:56:56,807 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {15712#true} {16050#(< ~counter~0 97)} #98#return; {16050#(< ~counter~0 97)} is VALID [2022-04-28 05:56:56,807 INFO L290 TraceCheckUtils]: 38: Hoare triple {15712#true} assume true; {15712#true} is VALID [2022-04-28 05:56:56,807 INFO L290 TraceCheckUtils]: 37: Hoare triple {15712#true} assume !(0 == ~cond); {15712#true} is VALID [2022-04-28 05:56:56,807 INFO L290 TraceCheckUtils]: 36: Hoare triple {15712#true} ~cond := #in~cond; {15712#true} is VALID [2022-04-28 05:56:56,807 INFO L272 TraceCheckUtils]: 35: Hoare triple {16050#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {15712#true} is VALID [2022-04-28 05:56:56,807 INFO L290 TraceCheckUtils]: 34: Hoare triple {16050#(< ~counter~0 97)} assume !!(#t~post8 < 100);havoc #t~post8; {16050#(< ~counter~0 97)} is VALID [2022-04-28 05:56:56,808 INFO L290 TraceCheckUtils]: 33: Hoare triple {16075#(< ~counter~0 96)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {16050#(< ~counter~0 97)} is VALID [2022-04-28 05:56:56,808 INFO L290 TraceCheckUtils]: 32: Hoare triple {16075#(< ~counter~0 96)} assume !(~r~0 > 0); {16075#(< ~counter~0 96)} is VALID [2022-04-28 05:56:56,808 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {15712#true} {16075#(< ~counter~0 96)} #96#return; {16075#(< ~counter~0 96)} is VALID [2022-04-28 05:56:56,808 INFO L290 TraceCheckUtils]: 30: Hoare triple {15712#true} assume true; {15712#true} is VALID [2022-04-28 05:56:56,809 INFO L290 TraceCheckUtils]: 29: Hoare triple {15712#true} assume !(0 == ~cond); {15712#true} is VALID [2022-04-28 05:56:56,809 INFO L290 TraceCheckUtils]: 28: Hoare triple {15712#true} ~cond := #in~cond; {15712#true} is VALID [2022-04-28 05:56:56,809 INFO L272 TraceCheckUtils]: 27: Hoare triple {16075#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {15712#true} is VALID [2022-04-28 05:56:56,809 INFO L290 TraceCheckUtils]: 26: Hoare triple {16075#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {16075#(< ~counter~0 96)} is VALID [2022-04-28 05:56:56,809 INFO L290 TraceCheckUtils]: 25: Hoare triple {16100#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16075#(< ~counter~0 96)} is VALID [2022-04-28 05:56:56,810 INFO L290 TraceCheckUtils]: 24: Hoare triple {16100#(< ~counter~0 95)} assume !!(0 != ~r~0); {16100#(< ~counter~0 95)} is VALID [2022-04-28 05:56:56,810 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {15712#true} {16100#(< ~counter~0 95)} #94#return; {16100#(< ~counter~0 95)} is VALID [2022-04-28 05:56:56,810 INFO L290 TraceCheckUtils]: 22: Hoare triple {15712#true} assume true; {15712#true} is VALID [2022-04-28 05:56:56,810 INFO L290 TraceCheckUtils]: 21: Hoare triple {15712#true} assume !(0 == ~cond); {15712#true} is VALID [2022-04-28 05:56:56,810 INFO L290 TraceCheckUtils]: 20: Hoare triple {15712#true} ~cond := #in~cond; {15712#true} is VALID [2022-04-28 05:56:56,810 INFO L272 TraceCheckUtils]: 19: Hoare triple {16100#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {15712#true} is VALID [2022-04-28 05:56:56,811 INFO L290 TraceCheckUtils]: 18: Hoare triple {16100#(< ~counter~0 95)} assume !!(#t~post6 < 100);havoc #t~post6; {16100#(< ~counter~0 95)} is VALID [2022-04-28 05:56:56,811 INFO L290 TraceCheckUtils]: 17: Hoare triple {16125#(< ~counter~0 94)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16100#(< ~counter~0 95)} is VALID [2022-04-28 05:56:56,811 INFO L290 TraceCheckUtils]: 16: Hoare triple {16125#(< ~counter~0 94)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {16125#(< ~counter~0 94)} is VALID [2022-04-28 05:56:56,812 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {15712#true} {16125#(< ~counter~0 94)} #92#return; {16125#(< ~counter~0 94)} is VALID [2022-04-28 05:56:56,812 INFO L290 TraceCheckUtils]: 14: Hoare triple {15712#true} assume true; {15712#true} is VALID [2022-04-28 05:56:56,812 INFO L290 TraceCheckUtils]: 13: Hoare triple {15712#true} assume !(0 == ~cond); {15712#true} is VALID [2022-04-28 05:56:56,812 INFO L290 TraceCheckUtils]: 12: Hoare triple {15712#true} ~cond := #in~cond; {15712#true} is VALID [2022-04-28 05:56:56,812 INFO L272 TraceCheckUtils]: 11: Hoare triple {16125#(< ~counter~0 94)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {15712#true} is VALID [2022-04-28 05:56:56,812 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15712#true} {16125#(< ~counter~0 94)} #90#return; {16125#(< ~counter~0 94)} is VALID [2022-04-28 05:56:56,813 INFO L290 TraceCheckUtils]: 9: Hoare triple {15712#true} assume true; {15712#true} is VALID [2022-04-28 05:56:56,813 INFO L290 TraceCheckUtils]: 8: Hoare triple {15712#true} assume !(0 == ~cond); {15712#true} is VALID [2022-04-28 05:56:56,813 INFO L290 TraceCheckUtils]: 7: Hoare triple {15712#true} ~cond := #in~cond; {15712#true} is VALID [2022-04-28 05:56:56,813 INFO L272 TraceCheckUtils]: 6: Hoare triple {16125#(< ~counter~0 94)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {15712#true} is VALID [2022-04-28 05:56:56,813 INFO L290 TraceCheckUtils]: 5: Hoare triple {16125#(< ~counter~0 94)} 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 94)} is VALID [2022-04-28 05:56:56,813 INFO L272 TraceCheckUtils]: 4: Hoare triple {16125#(< ~counter~0 94)} call #t~ret9 := main(); {16125#(< ~counter~0 94)} is VALID [2022-04-28 05:56:56,814 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16125#(< ~counter~0 94)} {15712#true} #102#return; {16125#(< ~counter~0 94)} is VALID [2022-04-28 05:56:56,814 INFO L290 TraceCheckUtils]: 2: Hoare triple {16125#(< ~counter~0 94)} assume true; {16125#(< ~counter~0 94)} is VALID [2022-04-28 05:56:56,814 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 94)} is VALID [2022-04-28 05:56:56,814 INFO L272 TraceCheckUtils]: 0: Hoare triple {15712#true} call ULTIMATE.init(); {15712#true} is VALID [2022-04-28 05:56:56,815 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 20 proven. 16 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-28 05:56:56,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:56:56,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679443164] [2022-04-28 05:56:56,815 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:56:56,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439433696] [2022-04-28 05:56:56,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439433696] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:56:56,815 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:56:56,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-28 05:56:56,815 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:56:56,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [615856406] [2022-04-28 05:56:56,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [615856406] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:56:56,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:56:56,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 05:56:56,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879763172] [2022-04-28 05:56:56,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:56:56,816 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) Word has length 75 [2022-04-28 05:56:56,816 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:56:56,816 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 05:56:56,870 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:56:56,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 05:56:56,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:56,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 05:56:56,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-28 05:56:56,871 INFO L87 Difference]: Start difference. First operand 140 states and 177 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 05:56:57,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:57,374 INFO L93 Difference]: Finished difference Result 195 states and 255 transitions. [2022-04-28 05:56:57,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 05:56:57,374 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) Word has length 75 [2022-04-28 05:56:57,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:56:57,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 05:56:57,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 157 transitions. [2022-04-28 05:56:57,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 05:56:57,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 157 transitions. [2022-04-28 05:56:57,377 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 157 transitions. [2022-04-28 05:56:57,494 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:56:57,496 INFO L225 Difference]: With dead ends: 195 [2022-04-28 05:56:57,496 INFO L226 Difference]: Without dead ends: 146 [2022-04-28 05:56:57,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=205, Invalid=301, Unknown=0, NotChecked=0, Total=506 [2022-04-28 05:56:57,497 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 69 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 05:56:57,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 179 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 05:56:57,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-04-28 05:56:57,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2022-04-28 05:56:57,644 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:56:57,644 INFO L82 GeneralOperation]: Start isEquivalent. First operand 146 states. Second operand has 146 states, 108 states have (on average 1.1944444444444444) internal successors, (129), 108 states have internal predecessors, (129), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 05:56:57,644 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand has 146 states, 108 states have (on average 1.1944444444444444) internal successors, (129), 108 states have internal predecessors, (129), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 05:56:57,644 INFO L87 Difference]: Start difference. First operand 146 states. Second operand has 146 states, 108 states have (on average 1.1944444444444444) internal successors, (129), 108 states have internal predecessors, (129), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 05:56:57,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:57,646 INFO L93 Difference]: Finished difference Result 146 states and 183 transitions. [2022-04-28 05:56:57,647 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 183 transitions. [2022-04-28 05:56:57,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:56:57,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:56:57,647 INFO L74 IsIncluded]: Start isIncluded. First operand has 146 states, 108 states have (on average 1.1944444444444444) internal successors, (129), 108 states have internal predecessors, (129), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand 146 states. [2022-04-28 05:56:57,647 INFO L87 Difference]: Start difference. First operand has 146 states, 108 states have (on average 1.1944444444444444) internal successors, (129), 108 states have internal predecessors, (129), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand 146 states. [2022-04-28 05:56:57,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:57,649 INFO L93 Difference]: Finished difference Result 146 states and 183 transitions. [2022-04-28 05:56:57,649 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 183 transitions. [2022-04-28 05:56:57,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:56:57,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:56:57,650 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:56:57,650 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:56:57,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 108 states have (on average 1.1944444444444444) internal successors, (129), 108 states have internal predecessors, (129), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 05:56:57,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 183 transitions. [2022-04-28 05:56:57,652 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 183 transitions. Word has length 75 [2022-04-28 05:56:57,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:56:57,652 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 183 transitions. [2022-04-28 05:56:57,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 05:56:57,652 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 146 states and 183 transitions. [2022-04-28 05:56:59,671 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-28 05:56:59,671 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 183 transitions. [2022-04-28 05:56:59,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-28 05:56:59,672 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:56:59,672 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 5, 5, 5, 5, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:56:59,688 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-28 05:56:59,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:56:59,879 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:56:59,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:56:59,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1970775776, now seen corresponding path program 7 times [2022-04-28 05:56:59,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:59,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [640562320] [2022-04-28 05:56:59,880 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:56:59,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1970775776, now seen corresponding path program 8 times [2022-04-28 05:56:59,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:56:59,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845551505] [2022-04-28 05:56:59,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:56:59,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:56:59,896 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:56:59,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [957091280] [2022-04-28 05:56:59,896 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:56:59,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:56:59,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:56:59,897 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:56:59,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-28 05:56:59,939 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:56:59,940 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:56:59,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 05:56:59,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:56:59,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:57:00,300 INFO L272 TraceCheckUtils]: 0: Hoare triple {17163#true} call ULTIMATE.init(); {17163#true} is VALID [2022-04-28 05:57:00,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {17163#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {17171#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:00,301 INFO L290 TraceCheckUtils]: 2: Hoare triple {17171#(<= ~counter~0 0)} assume true; {17171#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:00,301 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17171#(<= ~counter~0 0)} {17163#true} #102#return; {17171#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:00,302 INFO L272 TraceCheckUtils]: 4: Hoare triple {17171#(<= ~counter~0 0)} call #t~ret9 := main(); {17171#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:00,302 INFO L290 TraceCheckUtils]: 5: Hoare triple {17171#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {17171#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:00,302 INFO L272 TraceCheckUtils]: 6: Hoare triple {17171#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {17171#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:00,303 INFO L290 TraceCheckUtils]: 7: Hoare triple {17171#(<= ~counter~0 0)} ~cond := #in~cond; {17171#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:00,303 INFO L290 TraceCheckUtils]: 8: Hoare triple {17171#(<= ~counter~0 0)} assume !(0 == ~cond); {17171#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:00,303 INFO L290 TraceCheckUtils]: 9: Hoare triple {17171#(<= ~counter~0 0)} assume true; {17171#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:00,304 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17171#(<= ~counter~0 0)} {17171#(<= ~counter~0 0)} #90#return; {17171#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:00,304 INFO L272 TraceCheckUtils]: 11: Hoare triple {17171#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {17171#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:00,304 INFO L290 TraceCheckUtils]: 12: Hoare triple {17171#(<= ~counter~0 0)} ~cond := #in~cond; {17171#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:00,304 INFO L290 TraceCheckUtils]: 13: Hoare triple {17171#(<= ~counter~0 0)} assume !(0 == ~cond); {17171#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:00,305 INFO L290 TraceCheckUtils]: 14: Hoare triple {17171#(<= ~counter~0 0)} assume true; {17171#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:00,305 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {17171#(<= ~counter~0 0)} {17171#(<= ~counter~0 0)} #92#return; {17171#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:00,305 INFO L290 TraceCheckUtils]: 16: Hoare triple {17171#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {17171#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:00,306 INFO L290 TraceCheckUtils]: 17: Hoare triple {17171#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17220#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:00,306 INFO L290 TraceCheckUtils]: 18: Hoare triple {17220#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {17220#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:00,307 INFO L272 TraceCheckUtils]: 19: Hoare triple {17220#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17220#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:00,307 INFO L290 TraceCheckUtils]: 20: Hoare triple {17220#(<= ~counter~0 1)} ~cond := #in~cond; {17220#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:00,307 INFO L290 TraceCheckUtils]: 21: Hoare triple {17220#(<= ~counter~0 1)} assume !(0 == ~cond); {17220#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:00,308 INFO L290 TraceCheckUtils]: 22: Hoare triple {17220#(<= ~counter~0 1)} assume true; {17220#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:00,308 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {17220#(<= ~counter~0 1)} {17220#(<= ~counter~0 1)} #94#return; {17220#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:00,308 INFO L290 TraceCheckUtils]: 24: Hoare triple {17220#(<= ~counter~0 1)} assume !!(0 != ~r~0); {17220#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:00,309 INFO L290 TraceCheckUtils]: 25: Hoare triple {17220#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {17245#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:00,309 INFO L290 TraceCheckUtils]: 26: Hoare triple {17245#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {17245#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:00,309 INFO L272 TraceCheckUtils]: 27: Hoare triple {17245#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17245#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:00,310 INFO L290 TraceCheckUtils]: 28: Hoare triple {17245#(<= ~counter~0 2)} ~cond := #in~cond; {17245#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:00,310 INFO L290 TraceCheckUtils]: 29: Hoare triple {17245#(<= ~counter~0 2)} assume !(0 == ~cond); {17245#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:00,310 INFO L290 TraceCheckUtils]: 30: Hoare triple {17245#(<= ~counter~0 2)} assume true; {17245#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:00,311 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {17245#(<= ~counter~0 2)} {17245#(<= ~counter~0 2)} #96#return; {17245#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:00,311 INFO L290 TraceCheckUtils]: 32: Hoare triple {17245#(<= ~counter~0 2)} assume !(~r~0 > 0); {17245#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:00,311 INFO L290 TraceCheckUtils]: 33: Hoare triple {17245#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {17270#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:00,312 INFO L290 TraceCheckUtils]: 34: Hoare triple {17270#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {17270#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:00,312 INFO L272 TraceCheckUtils]: 35: Hoare triple {17270#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17270#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:00,312 INFO L290 TraceCheckUtils]: 36: Hoare triple {17270#(<= ~counter~0 3)} ~cond := #in~cond; {17270#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:00,313 INFO L290 TraceCheckUtils]: 37: Hoare triple {17270#(<= ~counter~0 3)} assume !(0 == ~cond); {17270#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:00,313 INFO L290 TraceCheckUtils]: 38: Hoare triple {17270#(<= ~counter~0 3)} assume true; {17270#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:00,313 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {17270#(<= ~counter~0 3)} {17270#(<= ~counter~0 3)} #98#return; {17270#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:00,314 INFO L290 TraceCheckUtils]: 40: Hoare triple {17270#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {17270#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:00,314 INFO L290 TraceCheckUtils]: 41: Hoare triple {17270#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {17295#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:00,314 INFO L290 TraceCheckUtils]: 42: Hoare triple {17295#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {17295#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:00,315 INFO L272 TraceCheckUtils]: 43: Hoare triple {17295#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17295#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:00,315 INFO L290 TraceCheckUtils]: 44: Hoare triple {17295#(<= ~counter~0 4)} ~cond := #in~cond; {17295#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:00,315 INFO L290 TraceCheckUtils]: 45: Hoare triple {17295#(<= ~counter~0 4)} assume !(0 == ~cond); {17295#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:00,316 INFO L290 TraceCheckUtils]: 46: Hoare triple {17295#(<= ~counter~0 4)} assume true; {17295#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:00,316 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {17295#(<= ~counter~0 4)} {17295#(<= ~counter~0 4)} #98#return; {17295#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:00,316 INFO L290 TraceCheckUtils]: 48: Hoare triple {17295#(<= ~counter~0 4)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {17295#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:00,317 INFO L290 TraceCheckUtils]: 49: Hoare triple {17295#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {17320#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:00,317 INFO L290 TraceCheckUtils]: 50: Hoare triple {17320#(<= ~counter~0 5)} assume !!(#t~post8 < 100);havoc #t~post8; {17320#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:00,318 INFO L272 TraceCheckUtils]: 51: Hoare triple {17320#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17320#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:00,318 INFO L290 TraceCheckUtils]: 52: Hoare triple {17320#(<= ~counter~0 5)} ~cond := #in~cond; {17320#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:00,318 INFO L290 TraceCheckUtils]: 53: Hoare triple {17320#(<= ~counter~0 5)} assume !(0 == ~cond); {17320#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:00,318 INFO L290 TraceCheckUtils]: 54: Hoare triple {17320#(<= ~counter~0 5)} assume true; {17320#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:00,319 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {17320#(<= ~counter~0 5)} {17320#(<= ~counter~0 5)} #98#return; {17320#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:00,319 INFO L290 TraceCheckUtils]: 56: Hoare triple {17320#(<= ~counter~0 5)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {17320#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:00,320 INFO L290 TraceCheckUtils]: 57: Hoare triple {17320#(<= ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {17345#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:00,320 INFO L290 TraceCheckUtils]: 58: Hoare triple {17345#(<= ~counter~0 6)} assume !!(#t~post8 < 100);havoc #t~post8; {17345#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:00,320 INFO L272 TraceCheckUtils]: 59: Hoare triple {17345#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17345#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:00,321 INFO L290 TraceCheckUtils]: 60: Hoare triple {17345#(<= ~counter~0 6)} ~cond := #in~cond; {17345#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:00,321 INFO L290 TraceCheckUtils]: 61: Hoare triple {17345#(<= ~counter~0 6)} assume !(0 == ~cond); {17345#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:00,321 INFO L290 TraceCheckUtils]: 62: Hoare triple {17345#(<= ~counter~0 6)} assume true; {17345#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:00,322 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {17345#(<= ~counter~0 6)} {17345#(<= ~counter~0 6)} #98#return; {17345#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:00,322 INFO L290 TraceCheckUtils]: 64: Hoare triple {17345#(<= ~counter~0 6)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {17345#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:00,322 INFO L290 TraceCheckUtils]: 65: Hoare triple {17345#(<= ~counter~0 6)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {17370#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:00,323 INFO L290 TraceCheckUtils]: 66: Hoare triple {17370#(<= ~counter~0 7)} assume !!(#t~post8 < 100);havoc #t~post8; {17370#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:00,323 INFO L272 TraceCheckUtils]: 67: Hoare triple {17370#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17370#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:00,323 INFO L290 TraceCheckUtils]: 68: Hoare triple {17370#(<= ~counter~0 7)} ~cond := #in~cond; {17370#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:00,323 INFO L290 TraceCheckUtils]: 69: Hoare triple {17370#(<= ~counter~0 7)} assume !(0 == ~cond); {17370#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:00,324 INFO L290 TraceCheckUtils]: 70: Hoare triple {17370#(<= ~counter~0 7)} assume true; {17370#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:00,324 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {17370#(<= ~counter~0 7)} {17370#(<= ~counter~0 7)} #98#return; {17370#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:00,324 INFO L290 TraceCheckUtils]: 72: Hoare triple {17370#(<= ~counter~0 7)} assume !(~r~0 < 0); {17370#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:00,325 INFO L290 TraceCheckUtils]: 73: Hoare triple {17370#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17395#(<= |main_#t~post6| 7)} is VALID [2022-04-28 05:57:00,325 INFO L290 TraceCheckUtils]: 74: Hoare triple {17395#(<= |main_#t~post6| 7)} assume !(#t~post6 < 100);havoc #t~post6; {17164#false} is VALID [2022-04-28 05:57:00,325 INFO L272 TraceCheckUtils]: 75: Hoare triple {17164#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17164#false} is VALID [2022-04-28 05:57:00,325 INFO L290 TraceCheckUtils]: 76: Hoare triple {17164#false} ~cond := #in~cond; {17164#false} is VALID [2022-04-28 05:57:00,325 INFO L290 TraceCheckUtils]: 77: Hoare triple {17164#false} assume 0 == ~cond; {17164#false} is VALID [2022-04-28 05:57:00,325 INFO L290 TraceCheckUtils]: 78: Hoare triple {17164#false} assume !false; {17164#false} is VALID [2022-04-28 05:57:00,326 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 14 proven. 126 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:57:00,326 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:57:00,740 INFO L290 TraceCheckUtils]: 78: Hoare triple {17164#false} assume !false; {17164#false} is VALID [2022-04-28 05:57:00,740 INFO L290 TraceCheckUtils]: 77: Hoare triple {17164#false} assume 0 == ~cond; {17164#false} is VALID [2022-04-28 05:57:00,740 INFO L290 TraceCheckUtils]: 76: Hoare triple {17164#false} ~cond := #in~cond; {17164#false} is VALID [2022-04-28 05:57:00,740 INFO L272 TraceCheckUtils]: 75: Hoare triple {17164#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17164#false} is VALID [2022-04-28 05:57:00,740 INFO L290 TraceCheckUtils]: 74: Hoare triple {17423#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {17164#false} is VALID [2022-04-28 05:57:00,741 INFO L290 TraceCheckUtils]: 73: Hoare triple {17427#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17423#(< |main_#t~post6| 100)} is VALID [2022-04-28 05:57:00,741 INFO L290 TraceCheckUtils]: 72: Hoare triple {17427#(< ~counter~0 100)} assume !(~r~0 < 0); {17427#(< ~counter~0 100)} is VALID [2022-04-28 05:57:00,741 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {17163#true} {17427#(< ~counter~0 100)} #98#return; {17427#(< ~counter~0 100)} is VALID [2022-04-28 05:57:00,742 INFO L290 TraceCheckUtils]: 70: Hoare triple {17163#true} assume true; {17163#true} is VALID [2022-04-28 05:57:00,742 INFO L290 TraceCheckUtils]: 69: Hoare triple {17163#true} assume !(0 == ~cond); {17163#true} is VALID [2022-04-28 05:57:00,742 INFO L290 TraceCheckUtils]: 68: Hoare triple {17163#true} ~cond := #in~cond; {17163#true} is VALID [2022-04-28 05:57:00,742 INFO L272 TraceCheckUtils]: 67: Hoare triple {17427#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17163#true} is VALID [2022-04-28 05:57:00,742 INFO L290 TraceCheckUtils]: 66: Hoare triple {17427#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {17427#(< ~counter~0 100)} is VALID [2022-04-28 05:57:00,743 INFO L290 TraceCheckUtils]: 65: Hoare triple {17452#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {17427#(< ~counter~0 100)} is VALID [2022-04-28 05:57:00,743 INFO L290 TraceCheckUtils]: 64: Hoare triple {17452#(< ~counter~0 99)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {17452#(< ~counter~0 99)} is VALID [2022-04-28 05:57:00,744 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {17163#true} {17452#(< ~counter~0 99)} #98#return; {17452#(< ~counter~0 99)} is VALID [2022-04-28 05:57:00,744 INFO L290 TraceCheckUtils]: 62: Hoare triple {17163#true} assume true; {17163#true} is VALID [2022-04-28 05:57:00,744 INFO L290 TraceCheckUtils]: 61: Hoare triple {17163#true} assume !(0 == ~cond); {17163#true} is VALID [2022-04-28 05:57:00,744 INFO L290 TraceCheckUtils]: 60: Hoare triple {17163#true} ~cond := #in~cond; {17163#true} is VALID [2022-04-28 05:57:00,744 INFO L272 TraceCheckUtils]: 59: Hoare triple {17452#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17163#true} is VALID [2022-04-28 05:57:00,744 INFO L290 TraceCheckUtils]: 58: Hoare triple {17452#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {17452#(< ~counter~0 99)} is VALID [2022-04-28 05:57:00,745 INFO L290 TraceCheckUtils]: 57: Hoare triple {17477#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {17452#(< ~counter~0 99)} is VALID [2022-04-28 05:57:00,745 INFO L290 TraceCheckUtils]: 56: Hoare triple {17477#(< ~counter~0 98)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {17477#(< ~counter~0 98)} is VALID [2022-04-28 05:57:00,745 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {17163#true} {17477#(< ~counter~0 98)} #98#return; {17477#(< ~counter~0 98)} is VALID [2022-04-28 05:57:00,745 INFO L290 TraceCheckUtils]: 54: Hoare triple {17163#true} assume true; {17163#true} is VALID [2022-04-28 05:57:00,746 INFO L290 TraceCheckUtils]: 53: Hoare triple {17163#true} assume !(0 == ~cond); {17163#true} is VALID [2022-04-28 05:57:00,746 INFO L290 TraceCheckUtils]: 52: Hoare triple {17163#true} ~cond := #in~cond; {17163#true} is VALID [2022-04-28 05:57:00,746 INFO L272 TraceCheckUtils]: 51: Hoare triple {17477#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17163#true} is VALID [2022-04-28 05:57:00,746 INFO L290 TraceCheckUtils]: 50: Hoare triple {17477#(< ~counter~0 98)} assume !!(#t~post8 < 100);havoc #t~post8; {17477#(< ~counter~0 98)} is VALID [2022-04-28 05:57:00,746 INFO L290 TraceCheckUtils]: 49: Hoare triple {17502#(< ~counter~0 97)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {17477#(< ~counter~0 98)} is VALID [2022-04-28 05:57:00,747 INFO L290 TraceCheckUtils]: 48: Hoare triple {17502#(< ~counter~0 97)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {17502#(< ~counter~0 97)} is VALID [2022-04-28 05:57:00,747 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {17163#true} {17502#(< ~counter~0 97)} #98#return; {17502#(< ~counter~0 97)} is VALID [2022-04-28 05:57:00,747 INFO L290 TraceCheckUtils]: 46: Hoare triple {17163#true} assume true; {17163#true} is VALID [2022-04-28 05:57:00,748 INFO L290 TraceCheckUtils]: 45: Hoare triple {17163#true} assume !(0 == ~cond); {17163#true} is VALID [2022-04-28 05:57:00,748 INFO L290 TraceCheckUtils]: 44: Hoare triple {17163#true} ~cond := #in~cond; {17163#true} is VALID [2022-04-28 05:57:00,748 INFO L272 TraceCheckUtils]: 43: Hoare triple {17502#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17163#true} is VALID [2022-04-28 05:57:00,748 INFO L290 TraceCheckUtils]: 42: Hoare triple {17502#(< ~counter~0 97)} assume !!(#t~post8 < 100);havoc #t~post8; {17502#(< ~counter~0 97)} is VALID [2022-04-28 05:57:00,749 INFO L290 TraceCheckUtils]: 41: Hoare triple {17527#(< ~counter~0 96)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {17502#(< ~counter~0 97)} is VALID [2022-04-28 05:57:00,749 INFO L290 TraceCheckUtils]: 40: Hoare triple {17527#(< ~counter~0 96)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {17527#(< ~counter~0 96)} is VALID [2022-04-28 05:57:00,749 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {17163#true} {17527#(< ~counter~0 96)} #98#return; {17527#(< ~counter~0 96)} is VALID [2022-04-28 05:57:00,749 INFO L290 TraceCheckUtils]: 38: Hoare triple {17163#true} assume true; {17163#true} is VALID [2022-04-28 05:57:00,749 INFO L290 TraceCheckUtils]: 37: Hoare triple {17163#true} assume !(0 == ~cond); {17163#true} is VALID [2022-04-28 05:57:00,750 INFO L290 TraceCheckUtils]: 36: Hoare triple {17163#true} ~cond := #in~cond; {17163#true} is VALID [2022-04-28 05:57:00,750 INFO L272 TraceCheckUtils]: 35: Hoare triple {17527#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17163#true} is VALID [2022-04-28 05:57:00,750 INFO L290 TraceCheckUtils]: 34: Hoare triple {17527#(< ~counter~0 96)} assume !!(#t~post8 < 100);havoc #t~post8; {17527#(< ~counter~0 96)} is VALID [2022-04-28 05:57:00,750 INFO L290 TraceCheckUtils]: 33: Hoare triple {17552#(< ~counter~0 95)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {17527#(< ~counter~0 96)} is VALID [2022-04-28 05:57:00,751 INFO L290 TraceCheckUtils]: 32: Hoare triple {17552#(< ~counter~0 95)} assume !(~r~0 > 0); {17552#(< ~counter~0 95)} is VALID [2022-04-28 05:57:00,751 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {17163#true} {17552#(< ~counter~0 95)} #96#return; {17552#(< ~counter~0 95)} is VALID [2022-04-28 05:57:00,751 INFO L290 TraceCheckUtils]: 30: Hoare triple {17163#true} assume true; {17163#true} is VALID [2022-04-28 05:57:00,751 INFO L290 TraceCheckUtils]: 29: Hoare triple {17163#true} assume !(0 == ~cond); {17163#true} is VALID [2022-04-28 05:57:00,751 INFO L290 TraceCheckUtils]: 28: Hoare triple {17163#true} ~cond := #in~cond; {17163#true} is VALID [2022-04-28 05:57:00,751 INFO L272 TraceCheckUtils]: 27: Hoare triple {17552#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17163#true} is VALID [2022-04-28 05:57:00,752 INFO L290 TraceCheckUtils]: 26: Hoare triple {17552#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {17552#(< ~counter~0 95)} is VALID [2022-04-28 05:57:00,752 INFO L290 TraceCheckUtils]: 25: Hoare triple {17577#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {17552#(< ~counter~0 95)} is VALID [2022-04-28 05:57:00,752 INFO L290 TraceCheckUtils]: 24: Hoare triple {17577#(< ~counter~0 94)} assume !!(0 != ~r~0); {17577#(< ~counter~0 94)} is VALID [2022-04-28 05:57:00,753 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {17163#true} {17577#(< ~counter~0 94)} #94#return; {17577#(< ~counter~0 94)} is VALID [2022-04-28 05:57:00,753 INFO L290 TraceCheckUtils]: 22: Hoare triple {17163#true} assume true; {17163#true} is VALID [2022-04-28 05:57:00,753 INFO L290 TraceCheckUtils]: 21: Hoare triple {17163#true} assume !(0 == ~cond); {17163#true} is VALID [2022-04-28 05:57:00,753 INFO L290 TraceCheckUtils]: 20: Hoare triple {17163#true} ~cond := #in~cond; {17163#true} is VALID [2022-04-28 05:57:00,753 INFO L272 TraceCheckUtils]: 19: Hoare triple {17577#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17163#true} is VALID [2022-04-28 05:57:00,753 INFO L290 TraceCheckUtils]: 18: Hoare triple {17577#(< ~counter~0 94)} assume !!(#t~post6 < 100);havoc #t~post6; {17577#(< ~counter~0 94)} is VALID [2022-04-28 05:57:00,754 INFO L290 TraceCheckUtils]: 17: Hoare triple {17602#(< ~counter~0 93)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17577#(< ~counter~0 94)} is VALID [2022-04-28 05:57:00,754 INFO L290 TraceCheckUtils]: 16: Hoare triple {17602#(< ~counter~0 93)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {17602#(< ~counter~0 93)} is VALID [2022-04-28 05:57:00,755 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {17163#true} {17602#(< ~counter~0 93)} #92#return; {17602#(< ~counter~0 93)} is VALID [2022-04-28 05:57:00,755 INFO L290 TraceCheckUtils]: 14: Hoare triple {17163#true} assume true; {17163#true} is VALID [2022-04-28 05:57:00,755 INFO L290 TraceCheckUtils]: 13: Hoare triple {17163#true} assume !(0 == ~cond); {17163#true} is VALID [2022-04-28 05:57:00,755 INFO L290 TraceCheckUtils]: 12: Hoare triple {17163#true} ~cond := #in~cond; {17163#true} is VALID [2022-04-28 05:57:00,755 INFO L272 TraceCheckUtils]: 11: Hoare triple {17602#(< ~counter~0 93)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {17163#true} is VALID [2022-04-28 05:57:00,755 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17163#true} {17602#(< ~counter~0 93)} #90#return; {17602#(< ~counter~0 93)} is VALID [2022-04-28 05:57:00,755 INFO L290 TraceCheckUtils]: 9: Hoare triple {17163#true} assume true; {17163#true} is VALID [2022-04-28 05:57:00,755 INFO L290 TraceCheckUtils]: 8: Hoare triple {17163#true} assume !(0 == ~cond); {17163#true} is VALID [2022-04-28 05:57:00,756 INFO L290 TraceCheckUtils]: 7: Hoare triple {17163#true} ~cond := #in~cond; {17163#true} is VALID [2022-04-28 05:57:00,756 INFO L272 TraceCheckUtils]: 6: Hoare triple {17602#(< ~counter~0 93)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {17163#true} is VALID [2022-04-28 05:57:00,756 INFO L290 TraceCheckUtils]: 5: Hoare triple {17602#(< ~counter~0 93)} 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 93)} is VALID [2022-04-28 05:57:00,756 INFO L272 TraceCheckUtils]: 4: Hoare triple {17602#(< ~counter~0 93)} call #t~ret9 := main(); {17602#(< ~counter~0 93)} is VALID [2022-04-28 05:57:00,756 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17602#(< ~counter~0 93)} {17163#true} #102#return; {17602#(< ~counter~0 93)} is VALID [2022-04-28 05:57:00,757 INFO L290 TraceCheckUtils]: 2: Hoare triple {17602#(< ~counter~0 93)} assume true; {17602#(< ~counter~0 93)} is VALID [2022-04-28 05:57:00,757 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 93)} is VALID [2022-04-28 05:57:00,757 INFO L272 TraceCheckUtils]: 0: Hoare triple {17163#true} call ULTIMATE.init(); {17163#true} is VALID [2022-04-28 05:57:00,757 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 14 proven. 42 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-04-28 05:57:00,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:57:00,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845551505] [2022-04-28 05:57:00,758 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:57:00,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [957091280] [2022-04-28 05:57:00,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [957091280] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:57:00,758 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:57:00,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-04-28 05:57:00,758 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:57:00,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [640562320] [2022-04-28 05:57:00,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [640562320] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:57:00,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:57:00,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 05:57:00,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038790475] [2022-04-28 05:57:00,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:57:00,759 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) Word has length 79 [2022-04-28 05:57:00,759 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:57:00,759 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 05:57:00,822 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:00,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 05:57:00,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:57:00,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 05:57:00,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2022-04-28 05:57:00,823 INFO L87 Difference]: Start difference. First operand 146 states and 183 transitions. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 05:57:01,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:01,406 INFO L93 Difference]: Finished difference Result 168 states and 210 transitions. [2022-04-28 05:57:01,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 05:57:01,406 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) Word has length 79 [2022-04-28 05:57:01,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:57:01,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 05:57:01,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 155 transitions. [2022-04-28 05:57:01,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 05:57:01,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 155 transitions. [2022-04-28 05:57:01,409 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 155 transitions. [2022-04-28 05:57:01,513 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:01,524 INFO L225 Difference]: With dead ends: 168 [2022-04-28 05:57:01,524 INFO L226 Difference]: Without dead ends: 163 [2022-04-28 05:57:01,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=225, Invalid=327, Unknown=0, NotChecked=0, Total=552 [2022-04-28 05:57:01,525 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 82 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 05:57:01,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 221 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 05:57:01,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-04-28 05:57:01,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 157. [2022-04-28 05:57:01,689 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:57:01,689 INFO L82 GeneralOperation]: Start isEquivalent. First operand 163 states. Second operand has 157 states, 114 states have (on average 1.1929824561403508) internal successors, (136), 117 states have internal predecessors, (136), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-28 05:57:01,689 INFO L74 IsIncluded]: Start isIncluded. First operand 163 states. Second operand has 157 states, 114 states have (on average 1.1929824561403508) internal successors, (136), 117 states have internal predecessors, (136), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-28 05:57:01,690 INFO L87 Difference]: Start difference. First operand 163 states. Second operand has 157 states, 114 states have (on average 1.1929824561403508) internal successors, (136), 117 states have internal predecessors, (136), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-28 05:57:01,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:01,693 INFO L93 Difference]: Finished difference Result 163 states and 205 transitions. [2022-04-28 05:57:01,693 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 205 transitions. [2022-04-28 05:57:01,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:57:01,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:57:01,694 INFO L74 IsIncluded]: Start isIncluded. First operand has 157 states, 114 states have (on average 1.1929824561403508) internal successors, (136), 117 states have internal predecessors, (136), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) Second operand 163 states. [2022-04-28 05:57:01,694 INFO L87 Difference]: Start difference. First operand has 157 states, 114 states have (on average 1.1929824561403508) internal successors, (136), 117 states have internal predecessors, (136), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) Second operand 163 states. [2022-04-28 05:57:01,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:01,696 INFO L93 Difference]: Finished difference Result 163 states and 205 transitions. [2022-04-28 05:57:01,696 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 205 transitions. [2022-04-28 05:57:01,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:57:01,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:57:01,696 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:57:01,696 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:57:01,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 114 states have (on average 1.1929824561403508) internal successors, (136), 117 states have internal predecessors, (136), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-28 05:57:01,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 198 transitions. [2022-04-28 05:57:01,699 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 198 transitions. Word has length 79 [2022-04-28 05:57:01,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:57:01,699 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 198 transitions. [2022-04-28 05:57:01,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 05:57:01,699 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 157 states and 198 transitions. [2022-04-28 05:57:04,009 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 197 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:04,009 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 198 transitions. [2022-04-28 05:57:04,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-04-28 05:57:04,019 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:57:04,020 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:57:04,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-28 05:57:04,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:57:04,236 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:57:04,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:57:04,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1693648491, now seen corresponding path program 1 times [2022-04-28 05:57:04,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:57:04,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1845496963] [2022-04-28 05:57:04,237 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:57:04,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1693648491, now seen corresponding path program 2 times [2022-04-28 05:57:04,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:57:04,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865572020] [2022-04-28 05:57:04,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:57:04,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:57:04,247 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:57:04,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [982332590] [2022-04-28 05:57:04,247 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:57:04,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:57:04,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:57:04,250 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:57:04,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-28 05:57:04,292 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:57:04,293 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:57:04,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 05:57:04,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:57:04,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:57:04,651 INFO L272 TraceCheckUtils]: 0: Hoare triple {18640#true} call ULTIMATE.init(); {18640#true} is VALID [2022-04-28 05:57:04,651 INFO L290 TraceCheckUtils]: 1: Hoare triple {18640#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {18648#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:04,652 INFO L290 TraceCheckUtils]: 2: Hoare triple {18648#(<= ~counter~0 0)} assume true; {18648#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:04,652 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18648#(<= ~counter~0 0)} {18640#true} #102#return; {18648#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:04,652 INFO L272 TraceCheckUtils]: 4: Hoare triple {18648#(<= ~counter~0 0)} call #t~ret9 := main(); {18648#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:04,653 INFO L290 TraceCheckUtils]: 5: Hoare triple {18648#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {18648#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:04,653 INFO L272 TraceCheckUtils]: 6: Hoare triple {18648#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {18648#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:04,653 INFO L290 TraceCheckUtils]: 7: Hoare triple {18648#(<= ~counter~0 0)} ~cond := #in~cond; {18648#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:04,654 INFO L290 TraceCheckUtils]: 8: Hoare triple {18648#(<= ~counter~0 0)} assume !(0 == ~cond); {18648#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:04,654 INFO L290 TraceCheckUtils]: 9: Hoare triple {18648#(<= ~counter~0 0)} assume true; {18648#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:04,654 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18648#(<= ~counter~0 0)} {18648#(<= ~counter~0 0)} #90#return; {18648#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:04,655 INFO L272 TraceCheckUtils]: 11: Hoare triple {18648#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {18648#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:04,655 INFO L290 TraceCheckUtils]: 12: Hoare triple {18648#(<= ~counter~0 0)} ~cond := #in~cond; {18648#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:04,655 INFO L290 TraceCheckUtils]: 13: Hoare triple {18648#(<= ~counter~0 0)} assume !(0 == ~cond); {18648#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:04,656 INFO L290 TraceCheckUtils]: 14: Hoare triple {18648#(<= ~counter~0 0)} assume true; {18648#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:04,656 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {18648#(<= ~counter~0 0)} {18648#(<= ~counter~0 0)} #92#return; {18648#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:04,656 INFO L290 TraceCheckUtils]: 16: Hoare triple {18648#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {18648#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:04,657 INFO L290 TraceCheckUtils]: 17: Hoare triple {18648#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18697#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:04,657 INFO L290 TraceCheckUtils]: 18: Hoare triple {18697#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {18697#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:04,658 INFO L272 TraceCheckUtils]: 19: Hoare triple {18697#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18697#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:04,658 INFO L290 TraceCheckUtils]: 20: Hoare triple {18697#(<= ~counter~0 1)} ~cond := #in~cond; {18697#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:04,658 INFO L290 TraceCheckUtils]: 21: Hoare triple {18697#(<= ~counter~0 1)} assume !(0 == ~cond); {18697#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:04,658 INFO L290 TraceCheckUtils]: 22: Hoare triple {18697#(<= ~counter~0 1)} assume true; {18697#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:04,659 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {18697#(<= ~counter~0 1)} {18697#(<= ~counter~0 1)} #94#return; {18697#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:04,659 INFO L290 TraceCheckUtils]: 24: Hoare triple {18697#(<= ~counter~0 1)} assume !!(0 != ~r~0); {18697#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:04,660 INFO L290 TraceCheckUtils]: 25: Hoare triple {18697#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18722#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:04,663 INFO L290 TraceCheckUtils]: 26: Hoare triple {18722#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {18722#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:04,664 INFO L272 TraceCheckUtils]: 27: Hoare triple {18722#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18722#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:04,664 INFO L290 TraceCheckUtils]: 28: Hoare triple {18722#(<= ~counter~0 2)} ~cond := #in~cond; {18722#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:04,664 INFO L290 TraceCheckUtils]: 29: Hoare triple {18722#(<= ~counter~0 2)} assume !(0 == ~cond); {18722#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:04,665 INFO L290 TraceCheckUtils]: 30: Hoare triple {18722#(<= ~counter~0 2)} assume true; {18722#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:04,665 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {18722#(<= ~counter~0 2)} {18722#(<= ~counter~0 2)} #96#return; {18722#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:04,665 INFO L290 TraceCheckUtils]: 32: Hoare triple {18722#(<= ~counter~0 2)} assume !(~r~0 > 0); {18722#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:04,666 INFO L290 TraceCheckUtils]: 33: Hoare triple {18722#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18747#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:04,666 INFO L290 TraceCheckUtils]: 34: Hoare triple {18747#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {18747#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:04,667 INFO L272 TraceCheckUtils]: 35: Hoare triple {18747#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18747#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:04,667 INFO L290 TraceCheckUtils]: 36: Hoare triple {18747#(<= ~counter~0 3)} ~cond := #in~cond; {18747#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:04,667 INFO L290 TraceCheckUtils]: 37: Hoare triple {18747#(<= ~counter~0 3)} assume !(0 == ~cond); {18747#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:04,668 INFO L290 TraceCheckUtils]: 38: Hoare triple {18747#(<= ~counter~0 3)} assume true; {18747#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:04,668 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {18747#(<= ~counter~0 3)} {18747#(<= ~counter~0 3)} #98#return; {18747#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:04,668 INFO L290 TraceCheckUtils]: 40: Hoare triple {18747#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {18747#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:04,669 INFO L290 TraceCheckUtils]: 41: Hoare triple {18747#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18772#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:04,669 INFO L290 TraceCheckUtils]: 42: Hoare triple {18772#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {18772#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:04,670 INFO L272 TraceCheckUtils]: 43: Hoare triple {18772#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18772#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:04,670 INFO L290 TraceCheckUtils]: 44: Hoare triple {18772#(<= ~counter~0 4)} ~cond := #in~cond; {18772#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:04,670 INFO L290 TraceCheckUtils]: 45: Hoare triple {18772#(<= ~counter~0 4)} assume !(0 == ~cond); {18772#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:04,670 INFO L290 TraceCheckUtils]: 46: Hoare triple {18772#(<= ~counter~0 4)} assume true; {18772#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:04,671 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {18772#(<= ~counter~0 4)} {18772#(<= ~counter~0 4)} #98#return; {18772#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:04,671 INFO L290 TraceCheckUtils]: 48: Hoare triple {18772#(<= ~counter~0 4)} assume !(~r~0 < 0); {18772#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:04,672 INFO L290 TraceCheckUtils]: 49: Hoare triple {18772#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18797#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:04,672 INFO L290 TraceCheckUtils]: 50: Hoare triple {18797#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {18797#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:04,672 INFO L272 TraceCheckUtils]: 51: Hoare triple {18797#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18797#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:04,673 INFO L290 TraceCheckUtils]: 52: Hoare triple {18797#(<= ~counter~0 5)} ~cond := #in~cond; {18797#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:04,673 INFO L290 TraceCheckUtils]: 53: Hoare triple {18797#(<= ~counter~0 5)} assume !(0 == ~cond); {18797#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:04,673 INFO L290 TraceCheckUtils]: 54: Hoare triple {18797#(<= ~counter~0 5)} assume true; {18797#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:04,674 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {18797#(<= ~counter~0 5)} {18797#(<= ~counter~0 5)} #94#return; {18797#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:04,674 INFO L290 TraceCheckUtils]: 56: Hoare triple {18797#(<= ~counter~0 5)} assume !!(0 != ~r~0); {18797#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:04,674 INFO L290 TraceCheckUtils]: 57: Hoare triple {18797#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18822#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:04,675 INFO L290 TraceCheckUtils]: 58: Hoare triple {18822#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {18822#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:04,675 INFO L272 TraceCheckUtils]: 59: Hoare triple {18822#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18822#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:04,675 INFO L290 TraceCheckUtils]: 60: Hoare triple {18822#(<= ~counter~0 6)} ~cond := #in~cond; {18822#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:04,676 INFO L290 TraceCheckUtils]: 61: Hoare triple {18822#(<= ~counter~0 6)} assume !(0 == ~cond); {18822#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:04,676 INFO L290 TraceCheckUtils]: 62: Hoare triple {18822#(<= ~counter~0 6)} assume true; {18822#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:04,676 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {18822#(<= ~counter~0 6)} {18822#(<= ~counter~0 6)} #96#return; {18822#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:04,677 INFO L290 TraceCheckUtils]: 64: Hoare triple {18822#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {18822#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:04,677 INFO L290 TraceCheckUtils]: 65: Hoare triple {18822#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18847#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:04,677 INFO L290 TraceCheckUtils]: 66: Hoare triple {18847#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {18847#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:04,678 INFO L272 TraceCheckUtils]: 67: Hoare triple {18847#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18847#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:04,678 INFO L290 TraceCheckUtils]: 68: Hoare triple {18847#(<= ~counter~0 7)} ~cond := #in~cond; {18847#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:04,678 INFO L290 TraceCheckUtils]: 69: Hoare triple {18847#(<= ~counter~0 7)} assume !(0 == ~cond); {18847#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:04,679 INFO L290 TraceCheckUtils]: 70: Hoare triple {18847#(<= ~counter~0 7)} assume true; {18847#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:04,679 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {18847#(<= ~counter~0 7)} {18847#(<= ~counter~0 7)} #96#return; {18847#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:04,679 INFO L290 TraceCheckUtils]: 72: Hoare triple {18847#(<= ~counter~0 7)} assume !(~r~0 > 0); {18847#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:04,680 INFO L290 TraceCheckUtils]: 73: Hoare triple {18847#(<= ~counter~0 7)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18872#(<= |main_#t~post8| 7)} is VALID [2022-04-28 05:57:04,680 INFO L290 TraceCheckUtils]: 74: Hoare triple {18872#(<= |main_#t~post8| 7)} assume !(#t~post8 < 100);havoc #t~post8; {18641#false} is VALID [2022-04-28 05:57:04,680 INFO L290 TraceCheckUtils]: 75: Hoare triple {18641#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18641#false} is VALID [2022-04-28 05:57:04,680 INFO L290 TraceCheckUtils]: 76: Hoare triple {18641#false} assume !(#t~post6 < 100);havoc #t~post6; {18641#false} is VALID [2022-04-28 05:57:04,680 INFO L272 TraceCheckUtils]: 77: Hoare triple {18641#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18641#false} is VALID [2022-04-28 05:57:04,680 INFO L290 TraceCheckUtils]: 78: Hoare triple {18641#false} ~cond := #in~cond; {18641#false} is VALID [2022-04-28 05:57:04,680 INFO L290 TraceCheckUtils]: 79: Hoare triple {18641#false} assume 0 == ~cond; {18641#false} is VALID [2022-04-28 05:57:04,680 INFO L290 TraceCheckUtils]: 80: Hoare triple {18641#false} assume !false; {18641#false} is VALID [2022-04-28 05:57:04,681 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 18 proven. 108 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:57:04,681 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:57:05,070 INFO L290 TraceCheckUtils]: 80: Hoare triple {18641#false} assume !false; {18641#false} is VALID [2022-04-28 05:57:05,070 INFO L290 TraceCheckUtils]: 79: Hoare triple {18641#false} assume 0 == ~cond; {18641#false} is VALID [2022-04-28 05:57:05,070 INFO L290 TraceCheckUtils]: 78: Hoare triple {18641#false} ~cond := #in~cond; {18641#false} is VALID [2022-04-28 05:57:05,070 INFO L272 TraceCheckUtils]: 77: Hoare triple {18641#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18641#false} is VALID [2022-04-28 05:57:05,070 INFO L290 TraceCheckUtils]: 76: Hoare triple {18641#false} assume !(#t~post6 < 100);havoc #t~post6; {18641#false} is VALID [2022-04-28 05:57:05,070 INFO L290 TraceCheckUtils]: 75: Hoare triple {18641#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18641#false} is VALID [2022-04-28 05:57:05,070 INFO L290 TraceCheckUtils]: 74: Hoare triple {18912#(< |main_#t~post8| 100)} assume !(#t~post8 < 100);havoc #t~post8; {18641#false} is VALID [2022-04-28 05:57:05,071 INFO L290 TraceCheckUtils]: 73: Hoare triple {18916#(< ~counter~0 100)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18912#(< |main_#t~post8| 100)} is VALID [2022-04-28 05:57:05,071 INFO L290 TraceCheckUtils]: 72: Hoare triple {18916#(< ~counter~0 100)} assume !(~r~0 > 0); {18916#(< ~counter~0 100)} is VALID [2022-04-28 05:57:05,072 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {18640#true} {18916#(< ~counter~0 100)} #96#return; {18916#(< ~counter~0 100)} is VALID [2022-04-28 05:57:05,072 INFO L290 TraceCheckUtils]: 70: Hoare triple {18640#true} assume true; {18640#true} is VALID [2022-04-28 05:57:05,072 INFO L290 TraceCheckUtils]: 69: Hoare triple {18640#true} assume !(0 == ~cond); {18640#true} is VALID [2022-04-28 05:57:05,072 INFO L290 TraceCheckUtils]: 68: Hoare triple {18640#true} ~cond := #in~cond; {18640#true} is VALID [2022-04-28 05:57:05,072 INFO L272 TraceCheckUtils]: 67: Hoare triple {18916#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18640#true} is VALID [2022-04-28 05:57:05,072 INFO L290 TraceCheckUtils]: 66: Hoare triple {18916#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {18916#(< ~counter~0 100)} is VALID [2022-04-28 05:57:05,073 INFO L290 TraceCheckUtils]: 65: Hoare triple {18941#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18916#(< ~counter~0 100)} is VALID [2022-04-28 05:57:05,073 INFO L290 TraceCheckUtils]: 64: Hoare triple {18941#(< ~counter~0 99)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {18941#(< ~counter~0 99)} is VALID [2022-04-28 05:57:05,074 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {18640#true} {18941#(< ~counter~0 99)} #96#return; {18941#(< ~counter~0 99)} is VALID [2022-04-28 05:57:05,074 INFO L290 TraceCheckUtils]: 62: Hoare triple {18640#true} assume true; {18640#true} is VALID [2022-04-28 05:57:05,074 INFO L290 TraceCheckUtils]: 61: Hoare triple {18640#true} assume !(0 == ~cond); {18640#true} is VALID [2022-04-28 05:57:05,074 INFO L290 TraceCheckUtils]: 60: Hoare triple {18640#true} ~cond := #in~cond; {18640#true} is VALID [2022-04-28 05:57:05,074 INFO L272 TraceCheckUtils]: 59: Hoare triple {18941#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18640#true} is VALID [2022-04-28 05:57:05,074 INFO L290 TraceCheckUtils]: 58: Hoare triple {18941#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {18941#(< ~counter~0 99)} is VALID [2022-04-28 05:57:05,075 INFO L290 TraceCheckUtils]: 57: Hoare triple {18966#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18941#(< ~counter~0 99)} is VALID [2022-04-28 05:57:05,075 INFO L290 TraceCheckUtils]: 56: Hoare triple {18966#(< ~counter~0 98)} assume !!(0 != ~r~0); {18966#(< ~counter~0 98)} is VALID [2022-04-28 05:57:05,076 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {18640#true} {18966#(< ~counter~0 98)} #94#return; {18966#(< ~counter~0 98)} is VALID [2022-04-28 05:57:05,076 INFO L290 TraceCheckUtils]: 54: Hoare triple {18640#true} assume true; {18640#true} is VALID [2022-04-28 05:57:05,076 INFO L290 TraceCheckUtils]: 53: Hoare triple {18640#true} assume !(0 == ~cond); {18640#true} is VALID [2022-04-28 05:57:05,076 INFO L290 TraceCheckUtils]: 52: Hoare triple {18640#true} ~cond := #in~cond; {18640#true} is VALID [2022-04-28 05:57:05,076 INFO L272 TraceCheckUtils]: 51: Hoare triple {18966#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18640#true} is VALID [2022-04-28 05:57:05,076 INFO L290 TraceCheckUtils]: 50: Hoare triple {18966#(< ~counter~0 98)} assume !!(#t~post6 < 100);havoc #t~post6; {18966#(< ~counter~0 98)} is VALID [2022-04-28 05:57:05,077 INFO L290 TraceCheckUtils]: 49: Hoare triple {18991#(< ~counter~0 97)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18966#(< ~counter~0 98)} is VALID [2022-04-28 05:57:05,077 INFO L290 TraceCheckUtils]: 48: Hoare triple {18991#(< ~counter~0 97)} assume !(~r~0 < 0); {18991#(< ~counter~0 97)} is VALID [2022-04-28 05:57:05,077 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {18640#true} {18991#(< ~counter~0 97)} #98#return; {18991#(< ~counter~0 97)} is VALID [2022-04-28 05:57:05,077 INFO L290 TraceCheckUtils]: 46: Hoare triple {18640#true} assume true; {18640#true} is VALID [2022-04-28 05:57:05,077 INFO L290 TraceCheckUtils]: 45: Hoare triple {18640#true} assume !(0 == ~cond); {18640#true} is VALID [2022-04-28 05:57:05,078 INFO L290 TraceCheckUtils]: 44: Hoare triple {18640#true} ~cond := #in~cond; {18640#true} is VALID [2022-04-28 05:57:05,078 INFO L272 TraceCheckUtils]: 43: Hoare triple {18991#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18640#true} is VALID [2022-04-28 05:57:05,078 INFO L290 TraceCheckUtils]: 42: Hoare triple {18991#(< ~counter~0 97)} assume !!(#t~post8 < 100);havoc #t~post8; {18991#(< ~counter~0 97)} is VALID [2022-04-28 05:57:05,078 INFO L290 TraceCheckUtils]: 41: Hoare triple {19016#(< ~counter~0 96)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18991#(< ~counter~0 97)} is VALID [2022-04-28 05:57:05,079 INFO L290 TraceCheckUtils]: 40: Hoare triple {19016#(< ~counter~0 96)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {19016#(< ~counter~0 96)} is VALID [2022-04-28 05:57:05,079 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {18640#true} {19016#(< ~counter~0 96)} #98#return; {19016#(< ~counter~0 96)} is VALID [2022-04-28 05:57:05,079 INFO L290 TraceCheckUtils]: 38: Hoare triple {18640#true} assume true; {18640#true} is VALID [2022-04-28 05:57:05,079 INFO L290 TraceCheckUtils]: 37: Hoare triple {18640#true} assume !(0 == ~cond); {18640#true} is VALID [2022-04-28 05:57:05,079 INFO L290 TraceCheckUtils]: 36: Hoare triple {18640#true} ~cond := #in~cond; {18640#true} is VALID [2022-04-28 05:57:05,079 INFO L272 TraceCheckUtils]: 35: Hoare triple {19016#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18640#true} is VALID [2022-04-28 05:57:05,080 INFO L290 TraceCheckUtils]: 34: Hoare triple {19016#(< ~counter~0 96)} assume !!(#t~post8 < 100);havoc #t~post8; {19016#(< ~counter~0 96)} is VALID [2022-04-28 05:57:05,080 INFO L290 TraceCheckUtils]: 33: Hoare triple {19041#(< ~counter~0 95)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {19016#(< ~counter~0 96)} is VALID [2022-04-28 05:57:05,080 INFO L290 TraceCheckUtils]: 32: Hoare triple {19041#(< ~counter~0 95)} assume !(~r~0 > 0); {19041#(< ~counter~0 95)} is VALID [2022-04-28 05:57:05,081 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {18640#true} {19041#(< ~counter~0 95)} #96#return; {19041#(< ~counter~0 95)} is VALID [2022-04-28 05:57:05,081 INFO L290 TraceCheckUtils]: 30: Hoare triple {18640#true} assume true; {18640#true} is VALID [2022-04-28 05:57:05,081 INFO L290 TraceCheckUtils]: 29: Hoare triple {18640#true} assume !(0 == ~cond); {18640#true} is VALID [2022-04-28 05:57:05,081 INFO L290 TraceCheckUtils]: 28: Hoare triple {18640#true} ~cond := #in~cond; {18640#true} is VALID [2022-04-28 05:57:05,081 INFO L272 TraceCheckUtils]: 27: Hoare triple {19041#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18640#true} is VALID [2022-04-28 05:57:05,081 INFO L290 TraceCheckUtils]: 26: Hoare triple {19041#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {19041#(< ~counter~0 95)} is VALID [2022-04-28 05:57:05,082 INFO L290 TraceCheckUtils]: 25: Hoare triple {19066#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {19041#(< ~counter~0 95)} is VALID [2022-04-28 05:57:05,082 INFO L290 TraceCheckUtils]: 24: Hoare triple {19066#(< ~counter~0 94)} assume !!(0 != ~r~0); {19066#(< ~counter~0 94)} is VALID [2022-04-28 05:57:05,083 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {18640#true} {19066#(< ~counter~0 94)} #94#return; {19066#(< ~counter~0 94)} is VALID [2022-04-28 05:57:05,083 INFO L290 TraceCheckUtils]: 22: Hoare triple {18640#true} assume true; {18640#true} is VALID [2022-04-28 05:57:05,083 INFO L290 TraceCheckUtils]: 21: Hoare triple {18640#true} assume !(0 == ~cond); {18640#true} is VALID [2022-04-28 05:57:05,083 INFO L290 TraceCheckUtils]: 20: Hoare triple {18640#true} ~cond := #in~cond; {18640#true} is VALID [2022-04-28 05:57:05,083 INFO L272 TraceCheckUtils]: 19: Hoare triple {19066#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18640#true} is VALID [2022-04-28 05:57:05,083 INFO L290 TraceCheckUtils]: 18: Hoare triple {19066#(< ~counter~0 94)} assume !!(#t~post6 < 100);havoc #t~post6; {19066#(< ~counter~0 94)} is VALID [2022-04-28 05:57:05,084 INFO L290 TraceCheckUtils]: 17: Hoare triple {19091#(< ~counter~0 93)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19066#(< ~counter~0 94)} is VALID [2022-04-28 05:57:05,084 INFO L290 TraceCheckUtils]: 16: Hoare triple {19091#(< ~counter~0 93)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {19091#(< ~counter~0 93)} is VALID [2022-04-28 05:57:05,084 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {18640#true} {19091#(< ~counter~0 93)} #92#return; {19091#(< ~counter~0 93)} is VALID [2022-04-28 05:57:05,084 INFO L290 TraceCheckUtils]: 14: Hoare triple {18640#true} assume true; {18640#true} is VALID [2022-04-28 05:57:05,084 INFO L290 TraceCheckUtils]: 13: Hoare triple {18640#true} assume !(0 == ~cond); {18640#true} is VALID [2022-04-28 05:57:05,084 INFO L290 TraceCheckUtils]: 12: Hoare triple {18640#true} ~cond := #in~cond; {18640#true} is VALID [2022-04-28 05:57:05,084 INFO L272 TraceCheckUtils]: 11: Hoare triple {19091#(< ~counter~0 93)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {18640#true} is VALID [2022-04-28 05:57:05,085 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18640#true} {19091#(< ~counter~0 93)} #90#return; {19091#(< ~counter~0 93)} is VALID [2022-04-28 05:57:05,085 INFO L290 TraceCheckUtils]: 9: Hoare triple {18640#true} assume true; {18640#true} is VALID [2022-04-28 05:57:05,085 INFO L290 TraceCheckUtils]: 8: Hoare triple {18640#true} assume !(0 == ~cond); {18640#true} is VALID [2022-04-28 05:57:05,085 INFO L290 TraceCheckUtils]: 7: Hoare triple {18640#true} ~cond := #in~cond; {18640#true} is VALID [2022-04-28 05:57:05,085 INFO L272 TraceCheckUtils]: 6: Hoare triple {19091#(< ~counter~0 93)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {18640#true} is VALID [2022-04-28 05:57:05,085 INFO L290 TraceCheckUtils]: 5: Hoare triple {19091#(< ~counter~0 93)} 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 93)} is VALID [2022-04-28 05:57:05,086 INFO L272 TraceCheckUtils]: 4: Hoare triple {19091#(< ~counter~0 93)} call #t~ret9 := main(); {19091#(< ~counter~0 93)} is VALID [2022-04-28 05:57:05,086 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19091#(< ~counter~0 93)} {18640#true} #102#return; {19091#(< ~counter~0 93)} is VALID [2022-04-28 05:57:05,086 INFO L290 TraceCheckUtils]: 2: Hoare triple {19091#(< ~counter~0 93)} assume true; {19091#(< ~counter~0 93)} is VALID [2022-04-28 05:57:05,087 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 93)} is VALID [2022-04-28 05:57:05,087 INFO L272 TraceCheckUtils]: 0: Hoare triple {18640#true} call ULTIMATE.init(); {18640#true} is VALID [2022-04-28 05:57:05,087 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 18 proven. 24 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-04-28 05:57:05,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:57:05,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865572020] [2022-04-28 05:57:05,087 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:57:05,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982332590] [2022-04-28 05:57:05,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [982332590] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:57:05,088 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:57:05,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-04-28 05:57:05,088 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:57:05,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1845496963] [2022-04-28 05:57:05,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1845496963] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:57:05,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:57:05,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 05:57:05,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942800735] [2022-04-28 05:57:05,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:57:05,089 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) Word has length 81 [2022-04-28 05:57:05,089 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:57:05,089 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 05:57:05,142 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:05,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 05:57:05,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:57:05,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 05:57:05,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2022-04-28 05:57:05,143 INFO L87 Difference]: Start difference. First operand 157 states and 198 transitions. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 05:57:05,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:05,680 INFO L93 Difference]: Finished difference Result 213 states and 277 transitions. [2022-04-28 05:57:05,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 05:57:05,681 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) Word has length 81 [2022-04-28 05:57:05,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:57:05,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 05:57:05,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 177 transitions. [2022-04-28 05:57:05,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 05:57:05,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 177 transitions. [2022-04-28 05:57:05,684 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 177 transitions. [2022-04-28 05:57:05,810 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:05,812 INFO L225 Difference]: With dead ends: 213 [2022-04-28 05:57:05,812 INFO L226 Difference]: Without dead ends: 164 [2022-04-28 05:57:05,812 INFO L412 NwaCegarLoop]: 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-28 05:57:05,813 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 82 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 05:57:05,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 193 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 05:57:05,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-04-28 05:57:05,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 160. [2022-04-28 05:57:05,982 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:57:05,982 INFO L82 GeneralOperation]: Start isEquivalent. First operand 164 states. Second operand has 160 states, 117 states have (on average 1.1965811965811965) internal successors, (140), 119 states have internal predecessors, (140), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-28 05:57:05,982 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand has 160 states, 117 states have (on average 1.1965811965811965) internal successors, (140), 119 states have internal predecessors, (140), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-28 05:57:05,982 INFO L87 Difference]: Start difference. First operand 164 states. Second operand has 160 states, 117 states have (on average 1.1965811965811965) internal successors, (140), 119 states have internal predecessors, (140), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-28 05:57:05,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:05,985 INFO L93 Difference]: Finished difference Result 164 states and 206 transitions. [2022-04-28 05:57:05,985 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 206 transitions. [2022-04-28 05:57:05,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:57:05,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:57:05,985 INFO L74 IsIncluded]: Start isIncluded. First operand has 160 states, 117 states have (on average 1.1965811965811965) internal successors, (140), 119 states have internal predecessors, (140), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) Second operand 164 states. [2022-04-28 05:57:05,985 INFO L87 Difference]: Start difference. First operand has 160 states, 117 states have (on average 1.1965811965811965) internal successors, (140), 119 states have internal predecessors, (140), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) Second operand 164 states. [2022-04-28 05:57:05,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:05,987 INFO L93 Difference]: Finished difference Result 164 states and 206 transitions. [2022-04-28 05:57:05,988 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 206 transitions. [2022-04-28 05:57:05,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:57:05,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:57:05,988 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:57:05,988 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:57:05,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 117 states have (on average 1.1965811965811965) internal successors, (140), 119 states have internal predecessors, (140), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-28 05:57:05,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 202 transitions. [2022-04-28 05:57:05,990 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 202 transitions. Word has length 81 [2022-04-28 05:57:05,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:57:05,991 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 202 transitions. [2022-04-28 05:57:05,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 05:57:05,991 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 160 states and 202 transitions. [2022-04-28 05:57:06,824 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 202 edges. 202 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:06,824 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 202 transitions. [2022-04-28 05:57:06,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-04-28 05:57:06,824 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:57:06,824 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:57:06,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-28 05:57:07,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:57:07,025 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:57:07,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:57:07,026 INFO L85 PathProgramCache]: Analyzing trace with hash -918360272, now seen corresponding path program 3 times [2022-04-28 05:57:07,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:57:07,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [325401918] [2022-04-28 05:57:07,026 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:57:07,026 INFO L85 PathProgramCache]: Analyzing trace with hash -918360272, now seen corresponding path program 4 times [2022-04-28 05:57:07,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:57:07,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442462646] [2022-04-28 05:57:07,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:57:07,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:57:07,037 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:57:07,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1684940530] [2022-04-28 05:57:07,037 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 05:57:07,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:57:07,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:57:07,038 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:57:07,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-28 05:57:07,146 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 05:57:07,146 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:57:07,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 05:57:07,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:57:07,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:57:07,503 INFO L272 TraceCheckUtils]: 0: Hoare triple {20229#true} call ULTIMATE.init(); {20229#true} is VALID [2022-04-28 05:57:07,504 INFO L290 TraceCheckUtils]: 1: Hoare triple {20229#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {20237#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:07,504 INFO L290 TraceCheckUtils]: 2: Hoare triple {20237#(<= ~counter~0 0)} assume true; {20237#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:07,504 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20237#(<= ~counter~0 0)} {20229#true} #102#return; {20237#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:07,505 INFO L272 TraceCheckUtils]: 4: Hoare triple {20237#(<= ~counter~0 0)} call #t~ret9 := main(); {20237#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:07,505 INFO L290 TraceCheckUtils]: 5: Hoare triple {20237#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {20237#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:07,505 INFO L272 TraceCheckUtils]: 6: Hoare triple {20237#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {20237#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:07,506 INFO L290 TraceCheckUtils]: 7: Hoare triple {20237#(<= ~counter~0 0)} ~cond := #in~cond; {20237#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:07,506 INFO L290 TraceCheckUtils]: 8: Hoare triple {20237#(<= ~counter~0 0)} assume !(0 == ~cond); {20237#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:07,506 INFO L290 TraceCheckUtils]: 9: Hoare triple {20237#(<= ~counter~0 0)} assume true; {20237#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:07,507 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20237#(<= ~counter~0 0)} {20237#(<= ~counter~0 0)} #90#return; {20237#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:07,507 INFO L272 TraceCheckUtils]: 11: Hoare triple {20237#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {20237#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:07,507 INFO L290 TraceCheckUtils]: 12: Hoare triple {20237#(<= ~counter~0 0)} ~cond := #in~cond; {20237#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:07,508 INFO L290 TraceCheckUtils]: 13: Hoare triple {20237#(<= ~counter~0 0)} assume !(0 == ~cond); {20237#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:07,508 INFO L290 TraceCheckUtils]: 14: Hoare triple {20237#(<= ~counter~0 0)} assume true; {20237#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:07,508 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {20237#(<= ~counter~0 0)} {20237#(<= ~counter~0 0)} #92#return; {20237#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:07,508 INFO L290 TraceCheckUtils]: 16: Hoare triple {20237#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {20237#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:07,509 INFO L290 TraceCheckUtils]: 17: Hoare triple {20237#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20286#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:07,510 INFO L290 TraceCheckUtils]: 18: Hoare triple {20286#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {20286#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:07,510 INFO L272 TraceCheckUtils]: 19: Hoare triple {20286#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {20286#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:07,510 INFO L290 TraceCheckUtils]: 20: Hoare triple {20286#(<= ~counter~0 1)} ~cond := #in~cond; {20286#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:07,511 INFO L290 TraceCheckUtils]: 21: Hoare triple {20286#(<= ~counter~0 1)} assume !(0 == ~cond); {20286#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:07,511 INFO L290 TraceCheckUtils]: 22: Hoare triple {20286#(<= ~counter~0 1)} assume true; {20286#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:07,511 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {20286#(<= ~counter~0 1)} {20286#(<= ~counter~0 1)} #94#return; {20286#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:07,512 INFO L290 TraceCheckUtils]: 24: Hoare triple {20286#(<= ~counter~0 1)} assume !!(0 != ~r~0); {20286#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:07,512 INFO L290 TraceCheckUtils]: 25: Hoare triple {20286#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20311#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:07,512 INFO L290 TraceCheckUtils]: 26: Hoare triple {20311#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {20311#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:07,513 INFO L272 TraceCheckUtils]: 27: Hoare triple {20311#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {20311#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:07,513 INFO L290 TraceCheckUtils]: 28: Hoare triple {20311#(<= ~counter~0 2)} ~cond := #in~cond; {20311#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:07,513 INFO L290 TraceCheckUtils]: 29: Hoare triple {20311#(<= ~counter~0 2)} assume !(0 == ~cond); {20311#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:07,514 INFO L290 TraceCheckUtils]: 30: Hoare triple {20311#(<= ~counter~0 2)} assume true; {20311#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:07,514 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {20311#(<= ~counter~0 2)} {20311#(<= ~counter~0 2)} #96#return; {20311#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:07,514 INFO L290 TraceCheckUtils]: 32: Hoare triple {20311#(<= ~counter~0 2)} assume !(~r~0 > 0); {20311#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:07,515 INFO L290 TraceCheckUtils]: 33: Hoare triple {20311#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {20336#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:07,515 INFO L290 TraceCheckUtils]: 34: Hoare triple {20336#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {20336#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:07,516 INFO L272 TraceCheckUtils]: 35: Hoare triple {20336#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {20336#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:07,516 INFO L290 TraceCheckUtils]: 36: Hoare triple {20336#(<= ~counter~0 3)} ~cond := #in~cond; {20336#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:07,516 INFO L290 TraceCheckUtils]: 37: Hoare triple {20336#(<= ~counter~0 3)} assume !(0 == ~cond); {20336#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:07,516 INFO L290 TraceCheckUtils]: 38: Hoare triple {20336#(<= ~counter~0 3)} assume true; {20336#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:07,517 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {20336#(<= ~counter~0 3)} {20336#(<= ~counter~0 3)} #98#return; {20336#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:07,517 INFO L290 TraceCheckUtils]: 40: Hoare triple {20336#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {20336#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:07,517 INFO L290 TraceCheckUtils]: 41: Hoare triple {20336#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {20361#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:07,518 INFO L290 TraceCheckUtils]: 42: Hoare triple {20361#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {20361#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:07,520 INFO L272 TraceCheckUtils]: 43: Hoare triple {20361#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {20361#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:07,520 INFO L290 TraceCheckUtils]: 44: Hoare triple {20361#(<= ~counter~0 4)} ~cond := #in~cond; {20361#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:07,521 INFO L290 TraceCheckUtils]: 45: Hoare triple {20361#(<= ~counter~0 4)} assume !(0 == ~cond); {20361#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:07,521 INFO L290 TraceCheckUtils]: 46: Hoare triple {20361#(<= ~counter~0 4)} assume true; {20361#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:07,521 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {20361#(<= ~counter~0 4)} {20361#(<= ~counter~0 4)} #98#return; {20361#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:07,521 INFO L290 TraceCheckUtils]: 48: Hoare triple {20361#(<= ~counter~0 4)} assume !(~r~0 < 0); {20361#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:07,522 INFO L290 TraceCheckUtils]: 49: Hoare triple {20361#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20386#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:07,522 INFO L290 TraceCheckUtils]: 50: Hoare triple {20386#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {20386#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:07,523 INFO L272 TraceCheckUtils]: 51: Hoare triple {20386#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {20386#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:07,523 INFO L290 TraceCheckUtils]: 52: Hoare triple {20386#(<= ~counter~0 5)} ~cond := #in~cond; {20386#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:07,523 INFO L290 TraceCheckUtils]: 53: Hoare triple {20386#(<= ~counter~0 5)} assume !(0 == ~cond); {20386#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:07,523 INFO L290 TraceCheckUtils]: 54: Hoare triple {20386#(<= ~counter~0 5)} assume true; {20386#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:07,524 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {20386#(<= ~counter~0 5)} {20386#(<= ~counter~0 5)} #94#return; {20386#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:07,524 INFO L290 TraceCheckUtils]: 56: Hoare triple {20386#(<= ~counter~0 5)} assume !!(0 != ~r~0); {20386#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:07,525 INFO L290 TraceCheckUtils]: 57: Hoare triple {20386#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20411#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:07,525 INFO L290 TraceCheckUtils]: 58: Hoare triple {20411#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {20411#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:07,525 INFO L272 TraceCheckUtils]: 59: Hoare triple {20411#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {20411#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:07,526 INFO L290 TraceCheckUtils]: 60: Hoare triple {20411#(<= ~counter~0 6)} ~cond := #in~cond; {20411#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:07,526 INFO L290 TraceCheckUtils]: 61: Hoare triple {20411#(<= ~counter~0 6)} assume !(0 == ~cond); {20411#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:07,526 INFO L290 TraceCheckUtils]: 62: Hoare triple {20411#(<= ~counter~0 6)} assume true; {20411#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:07,527 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {20411#(<= ~counter~0 6)} {20411#(<= ~counter~0 6)} #96#return; {20411#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:07,527 INFO L290 TraceCheckUtils]: 64: Hoare triple {20411#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {20411#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:07,527 INFO L290 TraceCheckUtils]: 65: Hoare triple {20411#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20436#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:07,528 INFO L290 TraceCheckUtils]: 66: Hoare triple {20436#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {20436#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:07,528 INFO L272 TraceCheckUtils]: 67: Hoare triple {20436#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {20436#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:07,528 INFO L290 TraceCheckUtils]: 68: Hoare triple {20436#(<= ~counter~0 7)} ~cond := #in~cond; {20436#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:07,529 INFO L290 TraceCheckUtils]: 69: Hoare triple {20436#(<= ~counter~0 7)} assume !(0 == ~cond); {20436#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:07,529 INFO L290 TraceCheckUtils]: 70: Hoare triple {20436#(<= ~counter~0 7)} assume true; {20436#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:07,529 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {20436#(<= ~counter~0 7)} {20436#(<= ~counter~0 7)} #96#return; {20436#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:07,530 INFO L290 TraceCheckUtils]: 72: Hoare triple {20436#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {20436#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:07,530 INFO L290 TraceCheckUtils]: 73: Hoare triple {20436#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20461#(<= |main_#t~post7| 7)} is VALID [2022-04-28 05:57:07,530 INFO L290 TraceCheckUtils]: 74: Hoare triple {20461#(<= |main_#t~post7| 7)} assume !(#t~post7 < 100);havoc #t~post7; {20230#false} is VALID [2022-04-28 05:57:07,530 INFO L290 TraceCheckUtils]: 75: Hoare triple {20230#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {20230#false} is VALID [2022-04-28 05:57:07,530 INFO L290 TraceCheckUtils]: 76: Hoare triple {20230#false} assume !(#t~post8 < 100);havoc #t~post8; {20230#false} is VALID [2022-04-28 05:57:07,530 INFO L290 TraceCheckUtils]: 77: Hoare triple {20230#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20230#false} is VALID [2022-04-28 05:57:07,530 INFO L290 TraceCheckUtils]: 78: Hoare triple {20230#false} assume !(#t~post6 < 100);havoc #t~post6; {20230#false} is VALID [2022-04-28 05:57:07,531 INFO L272 TraceCheckUtils]: 79: Hoare triple {20230#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {20230#false} is VALID [2022-04-28 05:57:07,531 INFO L290 TraceCheckUtils]: 80: Hoare triple {20230#false} ~cond := #in~cond; {20230#false} is VALID [2022-04-28 05:57:07,531 INFO L290 TraceCheckUtils]: 81: Hoare triple {20230#false} assume 0 == ~cond; {20230#false} is VALID [2022-04-28 05:57:07,531 INFO L290 TraceCheckUtils]: 82: Hoare triple {20230#false} assume !false; {20230#false} is VALID [2022-04-28 05:57:07,531 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 22 proven. 110 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:57:07,531 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:57:07,959 INFO L290 TraceCheckUtils]: 82: Hoare triple {20230#false} assume !false; {20230#false} is VALID [2022-04-28 05:57:07,959 INFO L290 TraceCheckUtils]: 81: Hoare triple {20230#false} assume 0 == ~cond; {20230#false} is VALID [2022-04-28 05:57:07,959 INFO L290 TraceCheckUtils]: 80: Hoare triple {20230#false} ~cond := #in~cond; {20230#false} is VALID [2022-04-28 05:57:07,959 INFO L272 TraceCheckUtils]: 79: Hoare triple {20230#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {20230#false} is VALID [2022-04-28 05:57:07,960 INFO L290 TraceCheckUtils]: 78: Hoare triple {20230#false} assume !(#t~post6 < 100);havoc #t~post6; {20230#false} is VALID [2022-04-28 05:57:07,960 INFO L290 TraceCheckUtils]: 77: Hoare triple {20230#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20230#false} is VALID [2022-04-28 05:57:07,960 INFO L290 TraceCheckUtils]: 76: Hoare triple {20230#false} assume !(#t~post8 < 100);havoc #t~post8; {20230#false} is VALID [2022-04-28 05:57:07,960 INFO L290 TraceCheckUtils]: 75: Hoare triple {20230#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {20230#false} is VALID [2022-04-28 05:57:07,960 INFO L290 TraceCheckUtils]: 74: Hoare triple {20513#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {20230#false} is VALID [2022-04-28 05:57:07,960 INFO L290 TraceCheckUtils]: 73: Hoare triple {20517#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20513#(< |main_#t~post7| 100)} is VALID [2022-04-28 05:57:07,961 INFO L290 TraceCheckUtils]: 72: Hoare triple {20517#(< ~counter~0 100)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {20517#(< ~counter~0 100)} is VALID [2022-04-28 05:57:07,961 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {20229#true} {20517#(< ~counter~0 100)} #96#return; {20517#(< ~counter~0 100)} is VALID [2022-04-28 05:57:07,961 INFO L290 TraceCheckUtils]: 70: Hoare triple {20229#true} assume true; {20229#true} is VALID [2022-04-28 05:57:07,961 INFO L290 TraceCheckUtils]: 69: Hoare triple {20229#true} assume !(0 == ~cond); {20229#true} is VALID [2022-04-28 05:57:07,961 INFO L290 TraceCheckUtils]: 68: Hoare triple {20229#true} ~cond := #in~cond; {20229#true} is VALID [2022-04-28 05:57:07,961 INFO L272 TraceCheckUtils]: 67: Hoare triple {20517#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {20229#true} is VALID [2022-04-28 05:57:07,962 INFO L290 TraceCheckUtils]: 66: Hoare triple {20517#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {20517#(< ~counter~0 100)} is VALID [2022-04-28 05:57:07,962 INFO L290 TraceCheckUtils]: 65: Hoare triple {20542#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20517#(< ~counter~0 100)} is VALID [2022-04-28 05:57:07,963 INFO L290 TraceCheckUtils]: 64: Hoare triple {20542#(< ~counter~0 99)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {20542#(< ~counter~0 99)} is VALID [2022-04-28 05:57:07,963 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {20229#true} {20542#(< ~counter~0 99)} #96#return; {20542#(< ~counter~0 99)} is VALID [2022-04-28 05:57:07,963 INFO L290 TraceCheckUtils]: 62: Hoare triple {20229#true} assume true; {20229#true} is VALID [2022-04-28 05:57:07,963 INFO L290 TraceCheckUtils]: 61: Hoare triple {20229#true} assume !(0 == ~cond); {20229#true} is VALID [2022-04-28 05:57:07,963 INFO L290 TraceCheckUtils]: 60: Hoare triple {20229#true} ~cond := #in~cond; {20229#true} is VALID [2022-04-28 05:57:07,964 INFO L272 TraceCheckUtils]: 59: Hoare triple {20542#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {20229#true} is VALID [2022-04-28 05:57:07,964 INFO L290 TraceCheckUtils]: 58: Hoare triple {20542#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {20542#(< ~counter~0 99)} is VALID [2022-04-28 05:57:07,964 INFO L290 TraceCheckUtils]: 57: Hoare triple {20567#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20542#(< ~counter~0 99)} is VALID [2022-04-28 05:57:07,965 INFO L290 TraceCheckUtils]: 56: Hoare triple {20567#(< ~counter~0 98)} assume !!(0 != ~r~0); {20567#(< ~counter~0 98)} is VALID [2022-04-28 05:57:07,965 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {20229#true} {20567#(< ~counter~0 98)} #94#return; {20567#(< ~counter~0 98)} is VALID [2022-04-28 05:57:07,965 INFO L290 TraceCheckUtils]: 54: Hoare triple {20229#true} assume true; {20229#true} is VALID [2022-04-28 05:57:07,965 INFO L290 TraceCheckUtils]: 53: Hoare triple {20229#true} assume !(0 == ~cond); {20229#true} is VALID [2022-04-28 05:57:07,965 INFO L290 TraceCheckUtils]: 52: Hoare triple {20229#true} ~cond := #in~cond; {20229#true} is VALID [2022-04-28 05:57:07,965 INFO L272 TraceCheckUtils]: 51: Hoare triple {20567#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {20229#true} is VALID [2022-04-28 05:57:07,966 INFO L290 TraceCheckUtils]: 50: Hoare triple {20567#(< ~counter~0 98)} assume !!(#t~post6 < 100);havoc #t~post6; {20567#(< ~counter~0 98)} is VALID [2022-04-28 05:57:07,966 INFO L290 TraceCheckUtils]: 49: Hoare triple {20592#(< ~counter~0 97)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20567#(< ~counter~0 98)} is VALID [2022-04-28 05:57:07,966 INFO L290 TraceCheckUtils]: 48: Hoare triple {20592#(< ~counter~0 97)} assume !(~r~0 < 0); {20592#(< ~counter~0 97)} is VALID [2022-04-28 05:57:07,967 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {20229#true} {20592#(< ~counter~0 97)} #98#return; {20592#(< ~counter~0 97)} is VALID [2022-04-28 05:57:07,967 INFO L290 TraceCheckUtils]: 46: Hoare triple {20229#true} assume true; {20229#true} is VALID [2022-04-28 05:57:07,967 INFO L290 TraceCheckUtils]: 45: Hoare triple {20229#true} assume !(0 == ~cond); {20229#true} is VALID [2022-04-28 05:57:07,967 INFO L290 TraceCheckUtils]: 44: Hoare triple {20229#true} ~cond := #in~cond; {20229#true} is VALID [2022-04-28 05:57:07,967 INFO L272 TraceCheckUtils]: 43: Hoare triple {20592#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {20229#true} is VALID [2022-04-28 05:57:07,967 INFO L290 TraceCheckUtils]: 42: Hoare triple {20592#(< ~counter~0 97)} assume !!(#t~post8 < 100);havoc #t~post8; {20592#(< ~counter~0 97)} is VALID [2022-04-28 05:57:07,968 INFO L290 TraceCheckUtils]: 41: Hoare triple {20617#(< ~counter~0 96)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {20592#(< ~counter~0 97)} is VALID [2022-04-28 05:57:07,968 INFO L290 TraceCheckUtils]: 40: Hoare triple {20617#(< ~counter~0 96)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {20617#(< ~counter~0 96)} is VALID [2022-04-28 05:57:07,969 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {20229#true} {20617#(< ~counter~0 96)} #98#return; {20617#(< ~counter~0 96)} is VALID [2022-04-28 05:57:07,969 INFO L290 TraceCheckUtils]: 38: Hoare triple {20229#true} assume true; {20229#true} is VALID [2022-04-28 05:57:07,969 INFO L290 TraceCheckUtils]: 37: Hoare triple {20229#true} assume !(0 == ~cond); {20229#true} is VALID [2022-04-28 05:57:07,969 INFO L290 TraceCheckUtils]: 36: Hoare triple {20229#true} ~cond := #in~cond; {20229#true} is VALID [2022-04-28 05:57:07,969 INFO L272 TraceCheckUtils]: 35: Hoare triple {20617#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {20229#true} is VALID [2022-04-28 05:57:07,969 INFO L290 TraceCheckUtils]: 34: Hoare triple {20617#(< ~counter~0 96)} assume !!(#t~post8 < 100);havoc #t~post8; {20617#(< ~counter~0 96)} is VALID [2022-04-28 05:57:07,970 INFO L290 TraceCheckUtils]: 33: Hoare triple {20642#(< ~counter~0 95)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {20617#(< ~counter~0 96)} is VALID [2022-04-28 05:57:07,970 INFO L290 TraceCheckUtils]: 32: Hoare triple {20642#(< ~counter~0 95)} assume !(~r~0 > 0); {20642#(< ~counter~0 95)} is VALID [2022-04-28 05:57:07,970 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {20229#true} {20642#(< ~counter~0 95)} #96#return; {20642#(< ~counter~0 95)} is VALID [2022-04-28 05:57:07,971 INFO L290 TraceCheckUtils]: 30: Hoare triple {20229#true} assume true; {20229#true} is VALID [2022-04-28 05:57:07,971 INFO L290 TraceCheckUtils]: 29: Hoare triple {20229#true} assume !(0 == ~cond); {20229#true} is VALID [2022-04-28 05:57:07,971 INFO L290 TraceCheckUtils]: 28: Hoare triple {20229#true} ~cond := #in~cond; {20229#true} is VALID [2022-04-28 05:57:07,971 INFO L272 TraceCheckUtils]: 27: Hoare triple {20642#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {20229#true} is VALID [2022-04-28 05:57:07,971 INFO L290 TraceCheckUtils]: 26: Hoare triple {20642#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {20642#(< ~counter~0 95)} is VALID [2022-04-28 05:57:07,971 INFO L290 TraceCheckUtils]: 25: Hoare triple {20667#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20642#(< ~counter~0 95)} is VALID [2022-04-28 05:57:07,972 INFO L290 TraceCheckUtils]: 24: Hoare triple {20667#(< ~counter~0 94)} assume !!(0 != ~r~0); {20667#(< ~counter~0 94)} is VALID [2022-04-28 05:57:07,972 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {20229#true} {20667#(< ~counter~0 94)} #94#return; {20667#(< ~counter~0 94)} is VALID [2022-04-28 05:57:07,972 INFO L290 TraceCheckUtils]: 22: Hoare triple {20229#true} assume true; {20229#true} is VALID [2022-04-28 05:57:07,972 INFO L290 TraceCheckUtils]: 21: Hoare triple {20229#true} assume !(0 == ~cond); {20229#true} is VALID [2022-04-28 05:57:07,972 INFO L290 TraceCheckUtils]: 20: Hoare triple {20229#true} ~cond := #in~cond; {20229#true} is VALID [2022-04-28 05:57:07,973 INFO L272 TraceCheckUtils]: 19: Hoare triple {20667#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {20229#true} is VALID [2022-04-28 05:57:07,973 INFO L290 TraceCheckUtils]: 18: Hoare triple {20667#(< ~counter~0 94)} assume !!(#t~post6 < 100);havoc #t~post6; {20667#(< ~counter~0 94)} is VALID [2022-04-28 05:57:07,973 INFO L290 TraceCheckUtils]: 17: Hoare triple {20692#(< ~counter~0 93)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20667#(< ~counter~0 94)} is VALID [2022-04-28 05:57:07,973 INFO L290 TraceCheckUtils]: 16: Hoare triple {20692#(< ~counter~0 93)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {20692#(< ~counter~0 93)} is VALID [2022-04-28 05:57:07,974 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {20229#true} {20692#(< ~counter~0 93)} #92#return; {20692#(< ~counter~0 93)} is VALID [2022-04-28 05:57:07,974 INFO L290 TraceCheckUtils]: 14: Hoare triple {20229#true} assume true; {20229#true} is VALID [2022-04-28 05:57:07,974 INFO L290 TraceCheckUtils]: 13: Hoare triple {20229#true} assume !(0 == ~cond); {20229#true} is VALID [2022-04-28 05:57:07,974 INFO L290 TraceCheckUtils]: 12: Hoare triple {20229#true} ~cond := #in~cond; {20229#true} is VALID [2022-04-28 05:57:07,974 INFO L272 TraceCheckUtils]: 11: Hoare triple {20692#(< ~counter~0 93)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {20229#true} is VALID [2022-04-28 05:57:07,975 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20229#true} {20692#(< ~counter~0 93)} #90#return; {20692#(< ~counter~0 93)} is VALID [2022-04-28 05:57:07,975 INFO L290 TraceCheckUtils]: 9: Hoare triple {20229#true} assume true; {20229#true} is VALID [2022-04-28 05:57:07,975 INFO L290 TraceCheckUtils]: 8: Hoare triple {20229#true} assume !(0 == ~cond); {20229#true} is VALID [2022-04-28 05:57:07,975 INFO L290 TraceCheckUtils]: 7: Hoare triple {20229#true} ~cond := #in~cond; {20229#true} is VALID [2022-04-28 05:57:07,975 INFO L272 TraceCheckUtils]: 6: Hoare triple {20692#(< ~counter~0 93)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {20229#true} is VALID [2022-04-28 05:57:07,975 INFO L290 TraceCheckUtils]: 5: Hoare triple {20692#(< ~counter~0 93)} 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 93)} is VALID [2022-04-28 05:57:07,975 INFO L272 TraceCheckUtils]: 4: Hoare triple {20692#(< ~counter~0 93)} call #t~ret9 := main(); {20692#(< ~counter~0 93)} is VALID [2022-04-28 05:57:07,976 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20692#(< ~counter~0 93)} {20229#true} #102#return; {20692#(< ~counter~0 93)} is VALID [2022-04-28 05:57:07,976 INFO L290 TraceCheckUtils]: 2: Hoare triple {20692#(< ~counter~0 93)} assume true; {20692#(< ~counter~0 93)} is VALID [2022-04-28 05:57:07,976 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 93)} is VALID [2022-04-28 05:57:07,976 INFO L272 TraceCheckUtils]: 0: Hoare triple {20229#true} call ULTIMATE.init(); {20229#true} is VALID [2022-04-28 05:57:07,977 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 22 proven. 26 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-04-28 05:57:07,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:57:07,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442462646] [2022-04-28 05:57:07,977 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:57:07,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1684940530] [2022-04-28 05:57:07,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1684940530] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:57:07,977 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:57:07,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-04-28 05:57:07,977 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:57:07,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [325401918] [2022-04-28 05:57:07,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [325401918] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:57:07,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:57:07,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 05:57:07,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582146488] [2022-04-28 05:57:07,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:57:07,978 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) Word has length 83 [2022-04-28 05:57:07,978 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:57:07,978 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 05:57:08,040 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:08,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 05:57:08,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:57:08,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 05:57:08,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2022-04-28 05:57:08,041 INFO L87 Difference]: Start difference. First operand 160 states and 202 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 05:57:08,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:08,598 INFO L93 Difference]: Finished difference Result 215 states and 280 transitions. [2022-04-28 05:57:08,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 05:57:08,599 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) Word has length 83 [2022-04-28 05:57:08,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:57:08,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 05:57:08,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 177 transitions. [2022-04-28 05:57:08,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 05:57:08,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 177 transitions. [2022-04-28 05:57:08,601 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 177 transitions. [2022-04-28 05:57:08,736 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:08,739 INFO L225 Difference]: With dead ends: 215 [2022-04-28 05:57:08,739 INFO L226 Difference]: Without dead ends: 166 [2022-04-28 05:57:08,740 INFO L412 NwaCegarLoop]: 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-28 05:57:08,740 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 67 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 05:57:08,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 215 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 05:57:08,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-04-28 05:57:08,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2022-04-28 05:57:08,943 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:57:08,943 INFO L82 GeneralOperation]: Start isEquivalent. First operand 166 states. Second operand has 166 states, 123 states have (on average 1.1869918699186992) internal successors, (146), 123 states have internal predecessors, (146), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-28 05:57:08,943 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand has 166 states, 123 states have (on average 1.1869918699186992) internal successors, (146), 123 states have internal predecessors, (146), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-28 05:57:08,944 INFO L87 Difference]: Start difference. First operand 166 states. Second operand has 166 states, 123 states have (on average 1.1869918699186992) internal successors, (146), 123 states have internal predecessors, (146), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-28 05:57:08,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:08,949 INFO L93 Difference]: Finished difference Result 166 states and 208 transitions. [2022-04-28 05:57:08,949 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 208 transitions. [2022-04-28 05:57:08,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:57:08,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:57:08,950 INFO L74 IsIncluded]: Start isIncluded. First operand has 166 states, 123 states have (on average 1.1869918699186992) internal successors, (146), 123 states have internal predecessors, (146), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand 166 states. [2022-04-28 05:57:08,951 INFO L87 Difference]: Start difference. First operand has 166 states, 123 states have (on average 1.1869918699186992) internal successors, (146), 123 states have internal predecessors, (146), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand 166 states. [2022-04-28 05:57:08,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:08,953 INFO L93 Difference]: Finished difference Result 166 states and 208 transitions. [2022-04-28 05:57:08,953 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 208 transitions. [2022-04-28 05:57:08,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:57:08,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:57:08,954 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:57:08,954 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:57:08,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 123 states have (on average 1.1869918699186992) internal successors, (146), 123 states have internal predecessors, (146), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-28 05:57:08,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 208 transitions. [2022-04-28 05:57:08,956 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 208 transitions. Word has length 83 [2022-04-28 05:57:08,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:57:08,957 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 208 transitions. [2022-04-28 05:57:08,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 05:57:08,957 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 166 states and 208 transitions. [2022-04-28 05:57:09,926 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 208 edges. 208 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:09,926 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 208 transitions. [2022-04-28 05:57:09,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-28 05:57:09,927 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:57:09,927 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:57:09,945 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-04-28 05:57:10,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:57:10,127 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:57:10,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:57:10,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1698627479, now seen corresponding path program 1 times [2022-04-28 05:57:10,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:57:10,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [777814676] [2022-04-28 05:57:10,128 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:57:10,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1698627479, now seen corresponding path program 2 times [2022-04-28 05:57:10,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:57:10,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870522582] [2022-04-28 05:57:10,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:57:10,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:57:10,138 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:57:10,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1174915581] [2022-04-28 05:57:10,138 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:57:10,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:57:10,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:57:10,139 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:57:10,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-28 05:57:10,183 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:57:10,184 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:57:10,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 05:57:10,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:57:10,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:57:10,571 INFO L272 TraceCheckUtils]: 0: Hoare triple {21852#true} call ULTIMATE.init(); {21852#true} is VALID [2022-04-28 05:57:10,572 INFO L290 TraceCheckUtils]: 1: Hoare triple {21852#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {21860#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:10,572 INFO L290 TraceCheckUtils]: 2: Hoare triple {21860#(<= ~counter~0 0)} assume true; {21860#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:10,573 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21860#(<= ~counter~0 0)} {21852#true} #102#return; {21860#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:10,573 INFO L272 TraceCheckUtils]: 4: Hoare triple {21860#(<= ~counter~0 0)} call #t~ret9 := main(); {21860#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:10,573 INFO L290 TraceCheckUtils]: 5: Hoare triple {21860#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {21860#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:10,574 INFO L272 TraceCheckUtils]: 6: Hoare triple {21860#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {21860#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:10,574 INFO L290 TraceCheckUtils]: 7: Hoare triple {21860#(<= ~counter~0 0)} ~cond := #in~cond; {21860#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:10,574 INFO L290 TraceCheckUtils]: 8: Hoare triple {21860#(<= ~counter~0 0)} assume !(0 == ~cond); {21860#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:10,574 INFO L290 TraceCheckUtils]: 9: Hoare triple {21860#(<= ~counter~0 0)} assume true; {21860#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:10,575 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {21860#(<= ~counter~0 0)} {21860#(<= ~counter~0 0)} #90#return; {21860#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:10,575 INFO L272 TraceCheckUtils]: 11: Hoare triple {21860#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {21860#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:10,575 INFO L290 TraceCheckUtils]: 12: Hoare triple {21860#(<= ~counter~0 0)} ~cond := #in~cond; {21860#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:10,576 INFO L290 TraceCheckUtils]: 13: Hoare triple {21860#(<= ~counter~0 0)} assume !(0 == ~cond); {21860#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:10,576 INFO L290 TraceCheckUtils]: 14: Hoare triple {21860#(<= ~counter~0 0)} assume true; {21860#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:10,576 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {21860#(<= ~counter~0 0)} {21860#(<= ~counter~0 0)} #92#return; {21860#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:10,576 INFO L290 TraceCheckUtils]: 16: Hoare triple {21860#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {21860#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:10,577 INFO L290 TraceCheckUtils]: 17: Hoare triple {21860#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21909#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:10,577 INFO L290 TraceCheckUtils]: 18: Hoare triple {21909#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {21909#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:10,578 INFO L272 TraceCheckUtils]: 19: Hoare triple {21909#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21909#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:10,578 INFO L290 TraceCheckUtils]: 20: Hoare triple {21909#(<= ~counter~0 1)} ~cond := #in~cond; {21909#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:10,578 INFO L290 TraceCheckUtils]: 21: Hoare triple {21909#(<= ~counter~0 1)} assume !(0 == ~cond); {21909#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:10,579 INFO L290 TraceCheckUtils]: 22: Hoare triple {21909#(<= ~counter~0 1)} assume true; {21909#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:10,579 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {21909#(<= ~counter~0 1)} {21909#(<= ~counter~0 1)} #94#return; {21909#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:10,579 INFO L290 TraceCheckUtils]: 24: Hoare triple {21909#(<= ~counter~0 1)} assume !!(0 != ~r~0); {21909#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:10,580 INFO L290 TraceCheckUtils]: 25: Hoare triple {21909#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {21934#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:10,580 INFO L290 TraceCheckUtils]: 26: Hoare triple {21934#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {21934#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:10,581 INFO L272 TraceCheckUtils]: 27: Hoare triple {21934#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21934#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:10,581 INFO L290 TraceCheckUtils]: 28: Hoare triple {21934#(<= ~counter~0 2)} ~cond := #in~cond; {21934#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:10,581 INFO L290 TraceCheckUtils]: 29: Hoare triple {21934#(<= ~counter~0 2)} assume !(0 == ~cond); {21934#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:10,581 INFO L290 TraceCheckUtils]: 30: Hoare triple {21934#(<= ~counter~0 2)} assume true; {21934#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:10,582 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {21934#(<= ~counter~0 2)} {21934#(<= ~counter~0 2)} #96#return; {21934#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:10,582 INFO L290 TraceCheckUtils]: 32: Hoare triple {21934#(<= ~counter~0 2)} assume !(~r~0 > 0); {21934#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:10,583 INFO L290 TraceCheckUtils]: 33: Hoare triple {21934#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {21959#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:10,583 INFO L290 TraceCheckUtils]: 34: Hoare triple {21959#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {21959#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:10,583 INFO L272 TraceCheckUtils]: 35: Hoare triple {21959#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21959#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:10,584 INFO L290 TraceCheckUtils]: 36: Hoare triple {21959#(<= ~counter~0 3)} ~cond := #in~cond; {21959#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:10,584 INFO L290 TraceCheckUtils]: 37: Hoare triple {21959#(<= ~counter~0 3)} assume !(0 == ~cond); {21959#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:10,584 INFO L290 TraceCheckUtils]: 38: Hoare triple {21959#(<= ~counter~0 3)} assume true; {21959#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:10,585 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {21959#(<= ~counter~0 3)} {21959#(<= ~counter~0 3)} #98#return; {21959#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:10,585 INFO L290 TraceCheckUtils]: 40: Hoare triple {21959#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {21959#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:10,585 INFO L290 TraceCheckUtils]: 41: Hoare triple {21959#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {21984#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:10,586 INFO L290 TraceCheckUtils]: 42: Hoare triple {21984#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {21984#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:10,586 INFO L272 TraceCheckUtils]: 43: Hoare triple {21984#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21984#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:10,586 INFO L290 TraceCheckUtils]: 44: Hoare triple {21984#(<= ~counter~0 4)} ~cond := #in~cond; {21984#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:10,587 INFO L290 TraceCheckUtils]: 45: Hoare triple {21984#(<= ~counter~0 4)} assume !(0 == ~cond); {21984#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:10,587 INFO L290 TraceCheckUtils]: 46: Hoare triple {21984#(<= ~counter~0 4)} assume true; {21984#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:10,587 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {21984#(<= ~counter~0 4)} {21984#(<= ~counter~0 4)} #98#return; {21984#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:10,588 INFO L290 TraceCheckUtils]: 48: Hoare triple {21984#(<= ~counter~0 4)} assume !(~r~0 < 0); {21984#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:10,588 INFO L290 TraceCheckUtils]: 49: Hoare triple {21984#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22009#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:10,588 INFO L290 TraceCheckUtils]: 50: Hoare triple {22009#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {22009#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:10,589 INFO L272 TraceCheckUtils]: 51: Hoare triple {22009#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {22009#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:10,589 INFO L290 TraceCheckUtils]: 52: Hoare triple {22009#(<= ~counter~0 5)} ~cond := #in~cond; {22009#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:10,589 INFO L290 TraceCheckUtils]: 53: Hoare triple {22009#(<= ~counter~0 5)} assume !(0 == ~cond); {22009#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:10,590 INFO L290 TraceCheckUtils]: 54: Hoare triple {22009#(<= ~counter~0 5)} assume true; {22009#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:10,590 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {22009#(<= ~counter~0 5)} {22009#(<= ~counter~0 5)} #94#return; {22009#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:10,591 INFO L290 TraceCheckUtils]: 56: Hoare triple {22009#(<= ~counter~0 5)} assume !!(0 != ~r~0); {22009#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:10,591 INFO L290 TraceCheckUtils]: 57: Hoare triple {22009#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22034#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:10,591 INFO L290 TraceCheckUtils]: 58: Hoare triple {22034#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {22034#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:10,592 INFO L272 TraceCheckUtils]: 59: Hoare triple {22034#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {22034#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:10,592 INFO L290 TraceCheckUtils]: 60: Hoare triple {22034#(<= ~counter~0 6)} ~cond := #in~cond; {22034#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:10,592 INFO L290 TraceCheckUtils]: 61: Hoare triple {22034#(<= ~counter~0 6)} assume !(0 == ~cond); {22034#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:10,593 INFO L290 TraceCheckUtils]: 62: Hoare triple {22034#(<= ~counter~0 6)} assume true; {22034#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:10,593 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {22034#(<= ~counter~0 6)} {22034#(<= ~counter~0 6)} #96#return; {22034#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:10,593 INFO L290 TraceCheckUtils]: 64: Hoare triple {22034#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {22034#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:10,594 INFO L290 TraceCheckUtils]: 65: Hoare triple {22034#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22059#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:10,594 INFO L290 TraceCheckUtils]: 66: Hoare triple {22059#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {22059#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:10,595 INFO L272 TraceCheckUtils]: 67: Hoare triple {22059#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {22059#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:10,595 INFO L290 TraceCheckUtils]: 68: Hoare triple {22059#(<= ~counter~0 7)} ~cond := #in~cond; {22059#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:10,595 INFO L290 TraceCheckUtils]: 69: Hoare triple {22059#(<= ~counter~0 7)} assume !(0 == ~cond); {22059#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:10,595 INFO L290 TraceCheckUtils]: 70: Hoare triple {22059#(<= ~counter~0 7)} assume true; {22059#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:10,596 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {22059#(<= ~counter~0 7)} {22059#(<= ~counter~0 7)} #96#return; {22059#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:10,596 INFO L290 TraceCheckUtils]: 72: Hoare triple {22059#(<= ~counter~0 7)} assume !(~r~0 > 0); {22059#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:10,597 INFO L290 TraceCheckUtils]: 73: Hoare triple {22059#(<= ~counter~0 7)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {22084#(<= ~counter~0 8)} is VALID [2022-04-28 05:57:10,597 INFO L290 TraceCheckUtils]: 74: Hoare triple {22084#(<= ~counter~0 8)} assume !!(#t~post8 < 100);havoc #t~post8; {22084#(<= ~counter~0 8)} is VALID [2022-04-28 05:57:10,597 INFO L272 TraceCheckUtils]: 75: Hoare triple {22084#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {22084#(<= ~counter~0 8)} is VALID [2022-04-28 05:57:10,598 INFO L290 TraceCheckUtils]: 76: Hoare triple {22084#(<= ~counter~0 8)} ~cond := #in~cond; {22084#(<= ~counter~0 8)} is VALID [2022-04-28 05:57:10,598 INFO L290 TraceCheckUtils]: 77: Hoare triple {22084#(<= ~counter~0 8)} assume !(0 == ~cond); {22084#(<= ~counter~0 8)} is VALID [2022-04-28 05:57:10,598 INFO L290 TraceCheckUtils]: 78: Hoare triple {22084#(<= ~counter~0 8)} assume true; {22084#(<= ~counter~0 8)} is VALID [2022-04-28 05:57:10,599 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {22084#(<= ~counter~0 8)} {22084#(<= ~counter~0 8)} #98#return; {22084#(<= ~counter~0 8)} is VALID [2022-04-28 05:57:10,599 INFO L290 TraceCheckUtils]: 80: Hoare triple {22084#(<= ~counter~0 8)} assume !(~r~0 < 0); {22084#(<= ~counter~0 8)} is VALID [2022-04-28 05:57:10,599 INFO L290 TraceCheckUtils]: 81: Hoare triple {22084#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22109#(<= |main_#t~post6| 8)} is VALID [2022-04-28 05:57:10,600 INFO L290 TraceCheckUtils]: 82: Hoare triple {22109#(<= |main_#t~post6| 8)} assume !(#t~post6 < 100);havoc #t~post6; {21853#false} is VALID [2022-04-28 05:57:10,600 INFO L272 TraceCheckUtils]: 83: Hoare triple {21853#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21853#false} is VALID [2022-04-28 05:57:10,600 INFO L290 TraceCheckUtils]: 84: Hoare triple {21853#false} ~cond := #in~cond; {21853#false} is VALID [2022-04-28 05:57:10,600 INFO L290 TraceCheckUtils]: 85: Hoare triple {21853#false} assume 0 == ~cond; {21853#false} is VALID [2022-04-28 05:57:10,600 INFO L290 TraceCheckUtils]: 86: Hoare triple {21853#false} assume !false; {21853#false} is VALID [2022-04-28 05:57:10,600 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 16 proven. 144 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:57:10,600 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:57:11,031 INFO L290 TraceCheckUtils]: 86: Hoare triple {21853#false} assume !false; {21853#false} is VALID [2022-04-28 05:57:11,031 INFO L290 TraceCheckUtils]: 85: Hoare triple {21853#false} assume 0 == ~cond; {21853#false} is VALID [2022-04-28 05:57:11,031 INFO L290 TraceCheckUtils]: 84: Hoare triple {21853#false} ~cond := #in~cond; {21853#false} is VALID [2022-04-28 05:57:11,031 INFO L272 TraceCheckUtils]: 83: Hoare triple {21853#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21853#false} is VALID [2022-04-28 05:57:11,032 INFO L290 TraceCheckUtils]: 82: Hoare triple {22137#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {21853#false} is VALID [2022-04-28 05:57:11,032 INFO L290 TraceCheckUtils]: 81: Hoare triple {22141#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22137#(< |main_#t~post6| 100)} is VALID [2022-04-28 05:57:11,032 INFO L290 TraceCheckUtils]: 80: Hoare triple {22141#(< ~counter~0 100)} assume !(~r~0 < 0); {22141#(< ~counter~0 100)} is VALID [2022-04-28 05:57:11,033 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {21852#true} {22141#(< ~counter~0 100)} #98#return; {22141#(< ~counter~0 100)} is VALID [2022-04-28 05:57:11,033 INFO L290 TraceCheckUtils]: 78: Hoare triple {21852#true} assume true; {21852#true} is VALID [2022-04-28 05:57:11,033 INFO L290 TraceCheckUtils]: 77: Hoare triple {21852#true} assume !(0 == ~cond); {21852#true} is VALID [2022-04-28 05:57:11,033 INFO L290 TraceCheckUtils]: 76: Hoare triple {21852#true} ~cond := #in~cond; {21852#true} is VALID [2022-04-28 05:57:11,033 INFO L272 TraceCheckUtils]: 75: Hoare triple {22141#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21852#true} is VALID [2022-04-28 05:57:11,033 INFO L290 TraceCheckUtils]: 74: Hoare triple {22141#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {22141#(< ~counter~0 100)} is VALID [2022-04-28 05:57:11,034 INFO L290 TraceCheckUtils]: 73: Hoare triple {22166#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {22141#(< ~counter~0 100)} is VALID [2022-04-28 05:57:11,034 INFO L290 TraceCheckUtils]: 72: Hoare triple {22166#(< ~counter~0 99)} assume !(~r~0 > 0); {22166#(< ~counter~0 99)} is VALID [2022-04-28 05:57:11,035 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {21852#true} {22166#(< ~counter~0 99)} #96#return; {22166#(< ~counter~0 99)} is VALID [2022-04-28 05:57:11,035 INFO L290 TraceCheckUtils]: 70: Hoare triple {21852#true} assume true; {21852#true} is VALID [2022-04-28 05:57:11,035 INFO L290 TraceCheckUtils]: 69: Hoare triple {21852#true} assume !(0 == ~cond); {21852#true} is VALID [2022-04-28 05:57:11,035 INFO L290 TraceCheckUtils]: 68: Hoare triple {21852#true} ~cond := #in~cond; {21852#true} is VALID [2022-04-28 05:57:11,035 INFO L272 TraceCheckUtils]: 67: Hoare triple {22166#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21852#true} is VALID [2022-04-28 05:57:11,035 INFO L290 TraceCheckUtils]: 66: Hoare triple {22166#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {22166#(< ~counter~0 99)} is VALID [2022-04-28 05:57:11,036 INFO L290 TraceCheckUtils]: 65: Hoare triple {22191#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22166#(< ~counter~0 99)} is VALID [2022-04-28 05:57:11,036 INFO L290 TraceCheckUtils]: 64: Hoare triple {22191#(< ~counter~0 98)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {22191#(< ~counter~0 98)} is VALID [2022-04-28 05:57:11,037 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {21852#true} {22191#(< ~counter~0 98)} #96#return; {22191#(< ~counter~0 98)} is VALID [2022-04-28 05:57:11,037 INFO L290 TraceCheckUtils]: 62: Hoare triple {21852#true} assume true; {21852#true} is VALID [2022-04-28 05:57:11,037 INFO L290 TraceCheckUtils]: 61: Hoare triple {21852#true} assume !(0 == ~cond); {21852#true} is VALID [2022-04-28 05:57:11,037 INFO L290 TraceCheckUtils]: 60: Hoare triple {21852#true} ~cond := #in~cond; {21852#true} is VALID [2022-04-28 05:57:11,037 INFO L272 TraceCheckUtils]: 59: Hoare triple {22191#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21852#true} is VALID [2022-04-28 05:57:11,037 INFO L290 TraceCheckUtils]: 58: Hoare triple {22191#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {22191#(< ~counter~0 98)} is VALID [2022-04-28 05:57:11,038 INFO L290 TraceCheckUtils]: 57: Hoare triple {22216#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22191#(< ~counter~0 98)} is VALID [2022-04-28 05:57:11,038 INFO L290 TraceCheckUtils]: 56: Hoare triple {22216#(< ~counter~0 97)} assume !!(0 != ~r~0); {22216#(< ~counter~0 97)} is VALID [2022-04-28 05:57:11,038 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {21852#true} {22216#(< ~counter~0 97)} #94#return; {22216#(< ~counter~0 97)} is VALID [2022-04-28 05:57:11,038 INFO L290 TraceCheckUtils]: 54: Hoare triple {21852#true} assume true; {21852#true} is VALID [2022-04-28 05:57:11,038 INFO L290 TraceCheckUtils]: 53: Hoare triple {21852#true} assume !(0 == ~cond); {21852#true} is VALID [2022-04-28 05:57:11,038 INFO L290 TraceCheckUtils]: 52: Hoare triple {21852#true} ~cond := #in~cond; {21852#true} is VALID [2022-04-28 05:57:11,039 INFO L272 TraceCheckUtils]: 51: Hoare triple {22216#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21852#true} is VALID [2022-04-28 05:57:11,039 INFO L290 TraceCheckUtils]: 50: Hoare triple {22216#(< ~counter~0 97)} assume !!(#t~post6 < 100);havoc #t~post6; {22216#(< ~counter~0 97)} is VALID [2022-04-28 05:57:11,039 INFO L290 TraceCheckUtils]: 49: Hoare triple {22241#(< ~counter~0 96)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22216#(< ~counter~0 97)} is VALID [2022-04-28 05:57:11,040 INFO L290 TraceCheckUtils]: 48: Hoare triple {22241#(< ~counter~0 96)} assume !(~r~0 < 0); {22241#(< ~counter~0 96)} is VALID [2022-04-28 05:57:11,040 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {21852#true} {22241#(< ~counter~0 96)} #98#return; {22241#(< ~counter~0 96)} is VALID [2022-04-28 05:57:11,040 INFO L290 TraceCheckUtils]: 46: Hoare triple {21852#true} assume true; {21852#true} is VALID [2022-04-28 05:57:11,040 INFO L290 TraceCheckUtils]: 45: Hoare triple {21852#true} assume !(0 == ~cond); {21852#true} is VALID [2022-04-28 05:57:11,040 INFO L290 TraceCheckUtils]: 44: Hoare triple {21852#true} ~cond := #in~cond; {21852#true} is VALID [2022-04-28 05:57:11,040 INFO L272 TraceCheckUtils]: 43: Hoare triple {22241#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21852#true} is VALID [2022-04-28 05:57:11,041 INFO L290 TraceCheckUtils]: 42: Hoare triple {22241#(< ~counter~0 96)} assume !!(#t~post8 < 100);havoc #t~post8; {22241#(< ~counter~0 96)} is VALID [2022-04-28 05:57:11,041 INFO L290 TraceCheckUtils]: 41: Hoare triple {22266#(< ~counter~0 95)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {22241#(< ~counter~0 96)} is VALID [2022-04-28 05:57:11,041 INFO L290 TraceCheckUtils]: 40: Hoare triple {22266#(< ~counter~0 95)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {22266#(< ~counter~0 95)} is VALID [2022-04-28 05:57:11,042 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {21852#true} {22266#(< ~counter~0 95)} #98#return; {22266#(< ~counter~0 95)} is VALID [2022-04-28 05:57:11,042 INFO L290 TraceCheckUtils]: 38: Hoare triple {21852#true} assume true; {21852#true} is VALID [2022-04-28 05:57:11,042 INFO L290 TraceCheckUtils]: 37: Hoare triple {21852#true} assume !(0 == ~cond); {21852#true} is VALID [2022-04-28 05:57:11,042 INFO L290 TraceCheckUtils]: 36: Hoare triple {21852#true} ~cond := #in~cond; {21852#true} is VALID [2022-04-28 05:57:11,042 INFO L272 TraceCheckUtils]: 35: Hoare triple {22266#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21852#true} is VALID [2022-04-28 05:57:11,042 INFO L290 TraceCheckUtils]: 34: Hoare triple {22266#(< ~counter~0 95)} assume !!(#t~post8 < 100);havoc #t~post8; {22266#(< ~counter~0 95)} is VALID [2022-04-28 05:57:11,043 INFO L290 TraceCheckUtils]: 33: Hoare triple {22291#(< ~counter~0 94)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {22266#(< ~counter~0 95)} is VALID [2022-04-28 05:57:11,043 INFO L290 TraceCheckUtils]: 32: Hoare triple {22291#(< ~counter~0 94)} assume !(~r~0 > 0); {22291#(< ~counter~0 94)} is VALID [2022-04-28 05:57:11,044 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {21852#true} {22291#(< ~counter~0 94)} #96#return; {22291#(< ~counter~0 94)} is VALID [2022-04-28 05:57:11,044 INFO L290 TraceCheckUtils]: 30: Hoare triple {21852#true} assume true; {21852#true} is VALID [2022-04-28 05:57:11,044 INFO L290 TraceCheckUtils]: 29: Hoare triple {21852#true} assume !(0 == ~cond); {21852#true} is VALID [2022-04-28 05:57:11,044 INFO L290 TraceCheckUtils]: 28: Hoare triple {21852#true} ~cond := #in~cond; {21852#true} is VALID [2022-04-28 05:57:11,044 INFO L272 TraceCheckUtils]: 27: Hoare triple {22291#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21852#true} is VALID [2022-04-28 05:57:11,044 INFO L290 TraceCheckUtils]: 26: Hoare triple {22291#(< ~counter~0 94)} assume !!(#t~post7 < 100);havoc #t~post7; {22291#(< ~counter~0 94)} is VALID [2022-04-28 05:57:11,045 INFO L290 TraceCheckUtils]: 25: Hoare triple {22316#(< ~counter~0 93)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22291#(< ~counter~0 94)} is VALID [2022-04-28 05:57:11,045 INFO L290 TraceCheckUtils]: 24: Hoare triple {22316#(< ~counter~0 93)} assume !!(0 != ~r~0); {22316#(< ~counter~0 93)} is VALID [2022-04-28 05:57:11,045 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {21852#true} {22316#(< ~counter~0 93)} #94#return; {22316#(< ~counter~0 93)} is VALID [2022-04-28 05:57:11,045 INFO L290 TraceCheckUtils]: 22: Hoare triple {21852#true} assume true; {21852#true} is VALID [2022-04-28 05:57:11,045 INFO L290 TraceCheckUtils]: 21: Hoare triple {21852#true} assume !(0 == ~cond); {21852#true} is VALID [2022-04-28 05:57:11,045 INFO L290 TraceCheckUtils]: 20: Hoare triple {21852#true} ~cond := #in~cond; {21852#true} is VALID [2022-04-28 05:57:11,046 INFO L272 TraceCheckUtils]: 19: Hoare triple {22316#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21852#true} is VALID [2022-04-28 05:57:11,046 INFO L290 TraceCheckUtils]: 18: Hoare triple {22316#(< ~counter~0 93)} assume !!(#t~post6 < 100);havoc #t~post6; {22316#(< ~counter~0 93)} is VALID [2022-04-28 05:57:11,046 INFO L290 TraceCheckUtils]: 17: Hoare triple {22341#(< ~counter~0 92)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22316#(< ~counter~0 93)} is VALID [2022-04-28 05:57:11,047 INFO L290 TraceCheckUtils]: 16: Hoare triple {22341#(< ~counter~0 92)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {22341#(< ~counter~0 92)} is VALID [2022-04-28 05:57:11,047 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {21852#true} {22341#(< ~counter~0 92)} #92#return; {22341#(< ~counter~0 92)} is VALID [2022-04-28 05:57:11,047 INFO L290 TraceCheckUtils]: 14: Hoare triple {21852#true} assume true; {21852#true} is VALID [2022-04-28 05:57:11,047 INFO L290 TraceCheckUtils]: 13: Hoare triple {21852#true} assume !(0 == ~cond); {21852#true} is VALID [2022-04-28 05:57:11,047 INFO L290 TraceCheckUtils]: 12: Hoare triple {21852#true} ~cond := #in~cond; {21852#true} is VALID [2022-04-28 05:57:11,047 INFO L272 TraceCheckUtils]: 11: Hoare triple {22341#(< ~counter~0 92)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {21852#true} is VALID [2022-04-28 05:57:11,056 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {21852#true} {22341#(< ~counter~0 92)} #90#return; {22341#(< ~counter~0 92)} is VALID [2022-04-28 05:57:11,056 INFO L290 TraceCheckUtils]: 9: Hoare triple {21852#true} assume true; {21852#true} is VALID [2022-04-28 05:57:11,056 INFO L290 TraceCheckUtils]: 8: Hoare triple {21852#true} assume !(0 == ~cond); {21852#true} is VALID [2022-04-28 05:57:11,057 INFO L290 TraceCheckUtils]: 7: Hoare triple {21852#true} ~cond := #in~cond; {21852#true} is VALID [2022-04-28 05:57:11,057 INFO L272 TraceCheckUtils]: 6: Hoare triple {22341#(< ~counter~0 92)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {21852#true} is VALID [2022-04-28 05:57:11,057 INFO L290 TraceCheckUtils]: 5: Hoare triple {22341#(< ~counter~0 92)} 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 92)} is VALID [2022-04-28 05:57:11,057 INFO L272 TraceCheckUtils]: 4: Hoare triple {22341#(< ~counter~0 92)} call #t~ret9 := main(); {22341#(< ~counter~0 92)} is VALID [2022-04-28 05:57:11,058 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22341#(< ~counter~0 92)} {21852#true} #102#return; {22341#(< ~counter~0 92)} is VALID [2022-04-28 05:57:11,058 INFO L290 TraceCheckUtils]: 2: Hoare triple {22341#(< ~counter~0 92)} assume true; {22341#(< ~counter~0 92)} is VALID [2022-04-28 05:57:11,058 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 92)} is VALID [2022-04-28 05:57:11,058 INFO L272 TraceCheckUtils]: 0: Hoare triple {21852#true} call ULTIMATE.init(); {21852#true} is VALID [2022-04-28 05:57:11,059 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 16 proven. 32 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-04-28 05:57:11,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:57:11,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870522582] [2022-04-28 05:57:11,059 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:57:11,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174915581] [2022-04-28 05:57:11,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1174915581] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:57:11,059 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:57:11,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2022-04-28 05:57:11,060 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:57:11,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [777814676] [2022-04-28 05:57:11,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [777814676] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:57:11,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:57:11,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 05:57:11,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517913483] [2022-04-28 05:57:11,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:57:11,061 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) Word has length 87 [2022-04-28 05:57:11,061 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:57:11,061 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-28 05:57:11,134 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:11,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 05:57:11,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:57:11,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 05:57:11,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=267, Unknown=0, NotChecked=0, Total=462 [2022-04-28 05:57:11,135 INFO L87 Difference]: Start difference. First operand 166 states and 208 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-28 05:57:11,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:11,830 INFO L93 Difference]: Finished difference Result 188 states and 235 transitions. [2022-04-28 05:57:11,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 05:57:11,830 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) Word has length 87 [2022-04-28 05:57:11,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:57:11,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-28 05:57:11,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 175 transitions. [2022-04-28 05:57:11,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-28 05:57:11,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 175 transitions. [2022-04-28 05:57:11,833 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 175 transitions. [2022-04-28 05:57:11,963 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:11,965 INFO L225 Difference]: With dead ends: 188 [2022-04-28 05:57:11,965 INFO L226 Difference]: Without dead ends: 183 [2022-04-28 05:57:11,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=288, Invalid=414, Unknown=0, NotChecked=0, Total=702 [2022-04-28 05:57:11,966 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 83 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 05:57:11,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 256 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 05:57:11,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-04-28 05:57:12,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 177. [2022-04-28 05:57:12,167 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:57:12,168 INFO L82 GeneralOperation]: Start isEquivalent. First operand 183 states. Second operand has 177 states, 129 states have (on average 1.186046511627907) internal successors, (153), 132 states have internal predecessors, (153), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-28 05:57:12,168 INFO L74 IsIncluded]: Start isIncluded. First operand 183 states. Second operand has 177 states, 129 states have (on average 1.186046511627907) internal successors, (153), 132 states have internal predecessors, (153), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-28 05:57:12,168 INFO L87 Difference]: Start difference. First operand 183 states. Second operand has 177 states, 129 states have (on average 1.186046511627907) internal successors, (153), 132 states have internal predecessors, (153), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-28 05:57:12,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:12,171 INFO L93 Difference]: Finished difference Result 183 states and 230 transitions. [2022-04-28 05:57:12,171 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 230 transitions. [2022-04-28 05:57:12,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:57:12,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:57:12,171 INFO L74 IsIncluded]: Start isIncluded. First operand has 177 states, 129 states have (on average 1.186046511627907) internal successors, (153), 132 states have internal predecessors, (153), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) Second operand 183 states. [2022-04-28 05:57:12,171 INFO L87 Difference]: Start difference. First operand has 177 states, 129 states have (on average 1.186046511627907) internal successors, (153), 132 states have internal predecessors, (153), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) Second operand 183 states. [2022-04-28 05:57:12,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:12,174 INFO L93 Difference]: Finished difference Result 183 states and 230 transitions. [2022-04-28 05:57:12,174 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 230 transitions. [2022-04-28 05:57:12,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:57:12,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:57:12,174 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:57:12,174 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:57:12,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 129 states have (on average 1.186046511627907) internal successors, (153), 132 states have internal predecessors, (153), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-28 05:57:12,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 223 transitions. [2022-04-28 05:57:12,177 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 223 transitions. Word has length 87 [2022-04-28 05:57:12,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:57:12,177 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 223 transitions. [2022-04-28 05:57:12,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-28 05:57:12,177 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 177 states and 223 transitions. [2022-04-28 05:57:14,414 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 223 edges. 223 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:14,414 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 223 transitions. [2022-04-28 05:57:14,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-28 05:57:14,415 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:57:14,415 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:57:14,433 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-04-28 05:57:14,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:57:14,631 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:57:14,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:57:14,632 INFO L85 PathProgramCache]: Analyzing trace with hash 2133755932, now seen corresponding path program 3 times [2022-04-28 05:57:14,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:57:14,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1295278499] [2022-04-28 05:57:14,632 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:57:14,632 INFO L85 PathProgramCache]: Analyzing trace with hash 2133755932, now seen corresponding path program 4 times [2022-04-28 05:57:14,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:57:14,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036975528] [2022-04-28 05:57:14,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:57:14,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:57:14,642 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:57:14,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1079421736] [2022-04-28 05:57:14,642 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 05:57:14,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:57:14,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:57:14,643 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:57:14,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-28 05:57:14,683 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 05:57:14,683 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:57:14,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-28 05:57:14,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:57:14,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:57:14,893 INFO L272 TraceCheckUtils]: 0: Hoare triple {23501#true} call ULTIMATE.init(); {23501#true} is VALID [2022-04-28 05:57:14,893 INFO L290 TraceCheckUtils]: 1: Hoare triple {23501#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {23501#true} is VALID [2022-04-28 05:57:14,893 INFO L290 TraceCheckUtils]: 2: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-28 05:57:14,894 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23501#true} {23501#true} #102#return; {23501#true} is VALID [2022-04-28 05:57:14,894 INFO L272 TraceCheckUtils]: 4: Hoare triple {23501#true} call #t~ret9 := main(); {23501#true} is VALID [2022-04-28 05:57:14,894 INFO L290 TraceCheckUtils]: 5: Hoare triple {23501#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {23501#true} is VALID [2022-04-28 05:57:14,894 INFO L272 TraceCheckUtils]: 6: Hoare triple {23501#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {23501#true} is VALID [2022-04-28 05:57:14,894 INFO L290 TraceCheckUtils]: 7: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-28 05:57:14,894 INFO L290 TraceCheckUtils]: 8: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-28 05:57:14,894 INFO L290 TraceCheckUtils]: 9: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-28 05:57:14,894 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23501#true} {23501#true} #90#return; {23501#true} is VALID [2022-04-28 05:57:14,894 INFO L272 TraceCheckUtils]: 11: Hoare triple {23501#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {23501#true} is VALID [2022-04-28 05:57:14,894 INFO L290 TraceCheckUtils]: 12: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-28 05:57:14,894 INFO L290 TraceCheckUtils]: 13: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-28 05:57:14,894 INFO L290 TraceCheckUtils]: 14: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-28 05:57:14,894 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {23501#true} {23501#true} #92#return; {23501#true} is VALID [2022-04-28 05:57:14,895 INFO L290 TraceCheckUtils]: 16: Hoare triple {23501#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:57:14,895 INFO L290 TraceCheckUtils]: 17: Hoare triple {23554#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:57:14,895 INFO L290 TraceCheckUtils]: 18: Hoare triple {23554#(<= main_~v~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:57:14,895 INFO L272 TraceCheckUtils]: 19: Hoare triple {23554#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23501#true} is VALID [2022-04-28 05:57:14,895 INFO L290 TraceCheckUtils]: 20: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-28 05:57:14,895 INFO L290 TraceCheckUtils]: 21: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-28 05:57:14,896 INFO L290 TraceCheckUtils]: 22: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-28 05:57:14,896 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {23501#true} {23554#(<= main_~v~0 1)} #94#return; {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:57:14,896 INFO L290 TraceCheckUtils]: 24: Hoare triple {23554#(<= main_~v~0 1)} assume !!(0 != ~r~0); {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:57:14,896 INFO L290 TraceCheckUtils]: 25: Hoare triple {23554#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:57:14,897 INFO L290 TraceCheckUtils]: 26: Hoare triple {23554#(<= main_~v~0 1)} assume !!(#t~post7 < 100);havoc #t~post7; {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:57:14,897 INFO L272 TraceCheckUtils]: 27: Hoare triple {23554#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23501#true} is VALID [2022-04-28 05:57:14,897 INFO L290 TraceCheckUtils]: 28: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-28 05:57:14,897 INFO L290 TraceCheckUtils]: 29: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-28 05:57:14,897 INFO L290 TraceCheckUtils]: 30: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-28 05:57:14,897 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {23501#true} {23554#(<= main_~v~0 1)} #96#return; {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:57:14,898 INFO L290 TraceCheckUtils]: 32: Hoare triple {23554#(<= main_~v~0 1)} assume !(~r~0 > 0); {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:57:14,898 INFO L290 TraceCheckUtils]: 33: Hoare triple {23554#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:57:14,898 INFO L290 TraceCheckUtils]: 34: Hoare triple {23554#(<= main_~v~0 1)} assume !!(#t~post8 < 100);havoc #t~post8; {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:57:14,898 INFO L272 TraceCheckUtils]: 35: Hoare triple {23554#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23501#true} is VALID [2022-04-28 05:57:14,898 INFO L290 TraceCheckUtils]: 36: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-28 05:57:14,898 INFO L290 TraceCheckUtils]: 37: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-28 05:57:14,899 INFO L290 TraceCheckUtils]: 38: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-28 05:57:14,899 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {23501#true} {23554#(<= main_~v~0 1)} #98#return; {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:57:14,899 INFO L290 TraceCheckUtils]: 40: Hoare triple {23554#(<= main_~v~0 1)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:57:14,899 INFO L290 TraceCheckUtils]: 41: Hoare triple {23554#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:57:14,900 INFO L290 TraceCheckUtils]: 42: Hoare triple {23554#(<= main_~v~0 1)} assume !!(#t~post8 < 100);havoc #t~post8; {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:57:14,900 INFO L272 TraceCheckUtils]: 43: Hoare triple {23554#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23501#true} is VALID [2022-04-28 05:57:14,900 INFO L290 TraceCheckUtils]: 44: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-28 05:57:14,900 INFO L290 TraceCheckUtils]: 45: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-28 05:57:14,900 INFO L290 TraceCheckUtils]: 46: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-28 05:57:14,900 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {23501#true} {23554#(<= main_~v~0 1)} #98#return; {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:57:14,901 INFO L290 TraceCheckUtils]: 48: Hoare triple {23554#(<= main_~v~0 1)} assume !(~r~0 < 0); {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:57:14,901 INFO L290 TraceCheckUtils]: 49: Hoare triple {23554#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:57:14,901 INFO L290 TraceCheckUtils]: 50: Hoare triple {23554#(<= main_~v~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:57:14,901 INFO L272 TraceCheckUtils]: 51: Hoare triple {23554#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23501#true} is VALID [2022-04-28 05:57:14,901 INFO L290 TraceCheckUtils]: 52: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-28 05:57:14,901 INFO L290 TraceCheckUtils]: 53: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-28 05:57:14,902 INFO L290 TraceCheckUtils]: 54: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-28 05:57:14,902 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {23501#true} {23554#(<= main_~v~0 1)} #94#return; {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:57:14,902 INFO L290 TraceCheckUtils]: 56: Hoare triple {23554#(<= main_~v~0 1)} assume !!(0 != ~r~0); {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:57:14,903 INFO L290 TraceCheckUtils]: 57: Hoare triple {23554#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:57:14,903 INFO L290 TraceCheckUtils]: 58: Hoare triple {23554#(<= main_~v~0 1)} assume !!(#t~post7 < 100);havoc #t~post7; {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:57:14,903 INFO L272 TraceCheckUtils]: 59: Hoare triple {23554#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23501#true} is VALID [2022-04-28 05:57:14,903 INFO L290 TraceCheckUtils]: 60: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-28 05:57:14,903 INFO L290 TraceCheckUtils]: 61: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-28 05:57:14,903 INFO L290 TraceCheckUtils]: 62: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-28 05:57:14,904 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {23501#true} {23554#(<= main_~v~0 1)} #96#return; {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:57:14,904 INFO L290 TraceCheckUtils]: 64: Hoare triple {23554#(<= main_~v~0 1)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {23699#(< 0 (+ main_~r~0 1))} is VALID [2022-04-28 05:57:14,905 INFO L290 TraceCheckUtils]: 65: Hoare triple {23699#(< 0 (+ main_~r~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23699#(< 0 (+ main_~r~0 1))} is VALID [2022-04-28 05:57:14,905 INFO L290 TraceCheckUtils]: 66: Hoare triple {23699#(< 0 (+ main_~r~0 1))} assume !!(#t~post7 < 100);havoc #t~post7; {23699#(< 0 (+ main_~r~0 1))} is VALID [2022-04-28 05:57:14,905 INFO L272 TraceCheckUtils]: 67: Hoare triple {23699#(< 0 (+ main_~r~0 1))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23501#true} is VALID [2022-04-28 05:57:14,905 INFO L290 TraceCheckUtils]: 68: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-28 05:57:14,905 INFO L290 TraceCheckUtils]: 69: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-28 05:57:14,905 INFO L290 TraceCheckUtils]: 70: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-28 05:57:14,906 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {23501#true} {23699#(< 0 (+ main_~r~0 1))} #96#return; {23699#(< 0 (+ main_~r~0 1))} is VALID [2022-04-28 05:57:14,906 INFO L290 TraceCheckUtils]: 72: Hoare triple {23699#(< 0 (+ main_~r~0 1))} assume !(~r~0 > 0); {23699#(< 0 (+ main_~r~0 1))} is VALID [2022-04-28 05:57:14,906 INFO L290 TraceCheckUtils]: 73: Hoare triple {23699#(< 0 (+ main_~r~0 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23699#(< 0 (+ main_~r~0 1))} is VALID [2022-04-28 05:57:14,906 INFO L290 TraceCheckUtils]: 74: Hoare triple {23699#(< 0 (+ main_~r~0 1))} assume !!(#t~post8 < 100);havoc #t~post8; {23699#(< 0 (+ main_~r~0 1))} is VALID [2022-04-28 05:57:14,907 INFO L272 TraceCheckUtils]: 75: Hoare triple {23699#(< 0 (+ main_~r~0 1))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23501#true} is VALID [2022-04-28 05:57:14,907 INFO L290 TraceCheckUtils]: 76: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-28 05:57:14,907 INFO L290 TraceCheckUtils]: 77: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-28 05:57:14,907 INFO L290 TraceCheckUtils]: 78: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-28 05:57:14,907 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {23501#true} {23699#(< 0 (+ main_~r~0 1))} #98#return; {23699#(< 0 (+ main_~r~0 1))} is VALID [2022-04-28 05:57:14,908 INFO L290 TraceCheckUtils]: 80: Hoare triple {23699#(< 0 (+ main_~r~0 1))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {23502#false} is VALID [2022-04-28 05:57:14,908 INFO L290 TraceCheckUtils]: 81: Hoare triple {23502#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23502#false} is VALID [2022-04-28 05:57:14,908 INFO L290 TraceCheckUtils]: 82: Hoare triple {23502#false} assume !(#t~post8 < 100);havoc #t~post8; {23502#false} is VALID [2022-04-28 05:57:14,908 INFO L290 TraceCheckUtils]: 83: Hoare triple {23502#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23502#false} is VALID [2022-04-28 05:57:14,908 INFO L290 TraceCheckUtils]: 84: Hoare triple {23502#false} assume !(#t~post6 < 100);havoc #t~post6; {23502#false} is VALID [2022-04-28 05:57:14,908 INFO L272 TraceCheckUtils]: 85: Hoare triple {23502#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23502#false} is VALID [2022-04-28 05:57:14,909 INFO L290 TraceCheckUtils]: 86: Hoare triple {23502#false} ~cond := #in~cond; {23502#false} is VALID [2022-04-28 05:57:14,909 INFO L290 TraceCheckUtils]: 87: Hoare triple {23502#false} assume 0 == ~cond; {23502#false} is VALID [2022-04-28 05:57:14,909 INFO L290 TraceCheckUtils]: 88: Hoare triple {23502#false} assume !false; {23502#false} is VALID [2022-04-28 05:57:14,909 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 26 proven. 16 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2022-04-28 05:57:14,909 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:57:15,123 INFO L290 TraceCheckUtils]: 88: Hoare triple {23502#false} assume !false; {23502#false} is VALID [2022-04-28 05:57:15,123 INFO L290 TraceCheckUtils]: 87: Hoare triple {23502#false} assume 0 == ~cond; {23502#false} is VALID [2022-04-28 05:57:15,123 INFO L290 TraceCheckUtils]: 86: Hoare triple {23502#false} ~cond := #in~cond; {23502#false} is VALID [2022-04-28 05:57:15,123 INFO L272 TraceCheckUtils]: 85: Hoare triple {23502#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23502#false} is VALID [2022-04-28 05:57:15,123 INFO L290 TraceCheckUtils]: 84: Hoare triple {23502#false} assume !(#t~post6 < 100);havoc #t~post6; {23502#false} is VALID [2022-04-28 05:57:15,123 INFO L290 TraceCheckUtils]: 83: Hoare triple {23502#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23502#false} is VALID [2022-04-28 05:57:15,124 INFO L290 TraceCheckUtils]: 82: Hoare triple {23502#false} assume !(#t~post8 < 100);havoc #t~post8; {23502#false} is VALID [2022-04-28 05:57:15,124 INFO L290 TraceCheckUtils]: 81: Hoare triple {23502#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23502#false} is VALID [2022-04-28 05:57:15,124 INFO L290 TraceCheckUtils]: 80: Hoare triple {23699#(< 0 (+ main_~r~0 1))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {23502#false} is VALID [2022-04-28 05:57:15,125 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {23501#true} {23699#(< 0 (+ main_~r~0 1))} #98#return; {23699#(< 0 (+ main_~r~0 1))} is VALID [2022-04-28 05:57:15,125 INFO L290 TraceCheckUtils]: 78: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-28 05:57:15,125 INFO L290 TraceCheckUtils]: 77: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-28 05:57:15,125 INFO L290 TraceCheckUtils]: 76: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-28 05:57:15,125 INFO L272 TraceCheckUtils]: 75: Hoare triple {23699#(< 0 (+ main_~r~0 1))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23501#true} is VALID [2022-04-28 05:57:15,126 INFO L290 TraceCheckUtils]: 74: Hoare triple {23699#(< 0 (+ main_~r~0 1))} assume !!(#t~post8 < 100);havoc #t~post8; {23699#(< 0 (+ main_~r~0 1))} is VALID [2022-04-28 05:57:15,126 INFO L290 TraceCheckUtils]: 73: Hoare triple {23699#(< 0 (+ main_~r~0 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23699#(< 0 (+ main_~r~0 1))} is VALID [2022-04-28 05:57:15,126 INFO L290 TraceCheckUtils]: 72: Hoare triple {23699#(< 0 (+ main_~r~0 1))} assume !(~r~0 > 0); {23699#(< 0 (+ main_~r~0 1))} is VALID [2022-04-28 05:57:15,127 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {23501#true} {23699#(< 0 (+ main_~r~0 1))} #96#return; {23699#(< 0 (+ main_~r~0 1))} is VALID [2022-04-28 05:57:15,127 INFO L290 TraceCheckUtils]: 70: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-28 05:57:15,127 INFO L290 TraceCheckUtils]: 69: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-28 05:57:15,127 INFO L290 TraceCheckUtils]: 68: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-28 05:57:15,127 INFO L272 TraceCheckUtils]: 67: Hoare triple {23699#(< 0 (+ main_~r~0 1))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23501#true} is VALID [2022-04-28 05:57:15,127 INFO L290 TraceCheckUtils]: 66: Hoare triple {23699#(< 0 (+ main_~r~0 1))} assume !!(#t~post7 < 100);havoc #t~post7; {23699#(< 0 (+ main_~r~0 1))} is VALID [2022-04-28 05:57:15,127 INFO L290 TraceCheckUtils]: 65: Hoare triple {23699#(< 0 (+ main_~r~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23699#(< 0 (+ main_~r~0 1))} is VALID [2022-04-28 05:57:15,128 INFO L290 TraceCheckUtils]: 64: Hoare triple {23554#(<= main_~v~0 1)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {23699#(< 0 (+ main_~r~0 1))} is VALID [2022-04-28 05:57:15,128 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {23501#true} {23554#(<= main_~v~0 1)} #96#return; {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:57:15,128 INFO L290 TraceCheckUtils]: 62: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-28 05:57:15,129 INFO L290 TraceCheckUtils]: 61: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-28 05:57:15,129 INFO L290 TraceCheckUtils]: 60: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-28 05:57:15,129 INFO L272 TraceCheckUtils]: 59: Hoare triple {23554#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23501#true} is VALID [2022-04-28 05:57:15,129 INFO L290 TraceCheckUtils]: 58: Hoare triple {23554#(<= main_~v~0 1)} assume !!(#t~post7 < 100);havoc #t~post7; {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:57:15,129 INFO L290 TraceCheckUtils]: 57: Hoare triple {23554#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:57:15,130 INFO L290 TraceCheckUtils]: 56: Hoare triple {23554#(<= main_~v~0 1)} assume !!(0 != ~r~0); {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:57:15,130 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {23501#true} {23554#(<= main_~v~0 1)} #94#return; {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:57:15,130 INFO L290 TraceCheckUtils]: 54: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-28 05:57:15,130 INFO L290 TraceCheckUtils]: 53: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-28 05:57:15,130 INFO L290 TraceCheckUtils]: 52: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-28 05:57:15,130 INFO L272 TraceCheckUtils]: 51: Hoare triple {23554#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23501#true} is VALID [2022-04-28 05:57:15,131 INFO L290 TraceCheckUtils]: 50: Hoare triple {23554#(<= main_~v~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:57:15,131 INFO L290 TraceCheckUtils]: 49: Hoare triple {23554#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:57:15,131 INFO L290 TraceCheckUtils]: 48: Hoare triple {23554#(<= main_~v~0 1)} assume !(~r~0 < 0); {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:57:15,132 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {23501#true} {23554#(<= main_~v~0 1)} #98#return; {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:57:15,132 INFO L290 TraceCheckUtils]: 46: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-28 05:57:15,132 INFO L290 TraceCheckUtils]: 45: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-28 05:57:15,132 INFO L290 TraceCheckUtils]: 44: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-28 05:57:15,132 INFO L272 TraceCheckUtils]: 43: Hoare triple {23554#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23501#true} is VALID [2022-04-28 05:57:15,132 INFO L290 TraceCheckUtils]: 42: Hoare triple {23554#(<= main_~v~0 1)} assume !!(#t~post8 < 100);havoc #t~post8; {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:57:15,133 INFO L290 TraceCheckUtils]: 41: Hoare triple {23554#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:57:15,133 INFO L290 TraceCheckUtils]: 40: Hoare triple {23554#(<= main_~v~0 1)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:57:15,133 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {23501#true} {23554#(<= main_~v~0 1)} #98#return; {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:57:15,133 INFO L290 TraceCheckUtils]: 38: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-28 05:57:15,134 INFO L290 TraceCheckUtils]: 37: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-28 05:57:15,134 INFO L290 TraceCheckUtils]: 36: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-28 05:57:15,134 INFO L272 TraceCheckUtils]: 35: Hoare triple {23554#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23501#true} is VALID [2022-04-28 05:57:15,134 INFO L290 TraceCheckUtils]: 34: Hoare triple {23554#(<= main_~v~0 1)} assume !!(#t~post8 < 100);havoc #t~post8; {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:57:15,134 INFO L290 TraceCheckUtils]: 33: Hoare triple {23554#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:57:15,135 INFO L290 TraceCheckUtils]: 32: Hoare triple {23554#(<= main_~v~0 1)} assume !(~r~0 > 0); {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:57:15,135 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {23501#true} {23554#(<= main_~v~0 1)} #96#return; {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:57:15,135 INFO L290 TraceCheckUtils]: 30: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-28 05:57:15,135 INFO L290 TraceCheckUtils]: 29: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-28 05:57:15,135 INFO L290 TraceCheckUtils]: 28: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-28 05:57:15,135 INFO L272 TraceCheckUtils]: 27: Hoare triple {23554#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23501#true} is VALID [2022-04-28 05:57:15,136 INFO L290 TraceCheckUtils]: 26: Hoare triple {23554#(<= main_~v~0 1)} assume !!(#t~post7 < 100);havoc #t~post7; {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:57:15,136 INFO L290 TraceCheckUtils]: 25: Hoare triple {23554#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:57:15,136 INFO L290 TraceCheckUtils]: 24: Hoare triple {23554#(<= main_~v~0 1)} assume !!(0 != ~r~0); {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:57:15,137 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {23501#true} {23554#(<= main_~v~0 1)} #94#return; {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:57:15,137 INFO L290 TraceCheckUtils]: 22: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-28 05:57:15,137 INFO L290 TraceCheckUtils]: 21: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-28 05:57:15,137 INFO L290 TraceCheckUtils]: 20: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-28 05:57:15,137 INFO L272 TraceCheckUtils]: 19: Hoare triple {23554#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23501#true} is VALID [2022-04-28 05:57:15,137 INFO L290 TraceCheckUtils]: 18: Hoare triple {23554#(<= main_~v~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:57:15,138 INFO L290 TraceCheckUtils]: 17: Hoare triple {23554#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:57:15,138 INFO L290 TraceCheckUtils]: 16: Hoare triple {23501#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {23554#(<= main_~v~0 1)} is VALID [2022-04-28 05:57:15,138 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {23501#true} {23501#true} #92#return; {23501#true} is VALID [2022-04-28 05:57:15,138 INFO L290 TraceCheckUtils]: 14: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-28 05:57:15,138 INFO L290 TraceCheckUtils]: 13: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-28 05:57:15,138 INFO L290 TraceCheckUtils]: 12: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-28 05:57:15,139 INFO L272 TraceCheckUtils]: 11: Hoare triple {23501#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {23501#true} is VALID [2022-04-28 05:57:15,139 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23501#true} {23501#true} #90#return; {23501#true} is VALID [2022-04-28 05:57:15,139 INFO L290 TraceCheckUtils]: 9: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-28 05:57:15,139 INFO L290 TraceCheckUtils]: 8: Hoare triple {23501#true} assume !(0 == ~cond); {23501#true} is VALID [2022-04-28 05:57:15,139 INFO L290 TraceCheckUtils]: 7: Hoare triple {23501#true} ~cond := #in~cond; {23501#true} is VALID [2022-04-28 05:57:15,139 INFO L272 TraceCheckUtils]: 6: Hoare triple {23501#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {23501#true} is VALID [2022-04-28 05:57:15,139 INFO L290 TraceCheckUtils]: 5: Hoare triple {23501#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {23501#true} is VALID [2022-04-28 05:57:15,139 INFO L272 TraceCheckUtils]: 4: Hoare triple {23501#true} call #t~ret9 := main(); {23501#true} is VALID [2022-04-28 05:57:15,139 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23501#true} {23501#true} #102#return; {23501#true} is VALID [2022-04-28 05:57:15,139 INFO L290 TraceCheckUtils]: 2: Hoare triple {23501#true} assume true; {23501#true} is VALID [2022-04-28 05:57:15,139 INFO L290 TraceCheckUtils]: 1: Hoare triple {23501#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {23501#true} is VALID [2022-04-28 05:57:15,139 INFO L272 TraceCheckUtils]: 0: Hoare triple {23501#true} call ULTIMATE.init(); {23501#true} is VALID [2022-04-28 05:57:15,140 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 26 proven. 16 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2022-04-28 05:57:15,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:57:15,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036975528] [2022-04-28 05:57:15,140 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:57:15,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079421736] [2022-04-28 05:57:15,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1079421736] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:57:15,140 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:57:15,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2022-04-28 05:57:15,140 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:57:15,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1295278499] [2022-04-28 05:57:15,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1295278499] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:57:15,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:57:15,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 05:57:15,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255584119] [2022-04-28 05:57:15,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:57:15,141 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 89 [2022-04-28 05:57:15,141 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:57:15,141 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 05:57:15,175 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:15,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 05:57:15,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:57:15,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 05:57:15,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 05:57:15,176 INFO L87 Difference]: Start difference. First operand 177 states and 223 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 05:57:15,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:15,763 INFO L93 Difference]: Finished difference Result 407 states and 543 transitions. [2022-04-28 05:57:15,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 05:57:15,779 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 89 [2022-04-28 05:57:15,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:57:15,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 05:57:15,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2022-04-28 05:57:15,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 05:57:15,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2022-04-28 05:57:15,781 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 127 transitions. [2022-04-28 05:57:15,867 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:15,872 INFO L225 Difference]: With dead ends: 407 [2022-04-28 05:57:15,872 INFO L226 Difference]: Without dead ends: 301 [2022-04-28 05:57:15,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 174 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 05:57:15,873 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 15 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 05:57:15,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 138 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 05:57:15,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2022-04-28 05:57:16,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 296. [2022-04-28 05:57:16,236 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:57:16,236 INFO L82 GeneralOperation]: Start isEquivalent. First operand 301 states. Second operand has 296 states, 219 states have (on average 1.2191780821917808) internal successors, (267), 225 states have internal predecessors, (267), 65 states have call successors, (65), 13 states have call predecessors, (65), 11 states have return successors, (63), 57 states have call predecessors, (63), 63 states have call successors, (63) [2022-04-28 05:57:16,237 INFO L74 IsIncluded]: Start isIncluded. First operand 301 states. Second operand has 296 states, 219 states have (on average 1.2191780821917808) internal successors, (267), 225 states have internal predecessors, (267), 65 states have call successors, (65), 13 states have call predecessors, (65), 11 states have return successors, (63), 57 states have call predecessors, (63), 63 states have call successors, (63) [2022-04-28 05:57:16,237 INFO L87 Difference]: Start difference. First operand 301 states. Second operand has 296 states, 219 states have (on average 1.2191780821917808) internal successors, (267), 225 states have internal predecessors, (267), 65 states have call successors, (65), 13 states have call predecessors, (65), 11 states have return successors, (63), 57 states have call predecessors, (63), 63 states have call successors, (63) [2022-04-28 05:57:16,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:16,242 INFO L93 Difference]: Finished difference Result 301 states and 401 transitions. [2022-04-28 05:57:16,242 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 401 transitions. [2022-04-28 05:57:16,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:57:16,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:57:16,243 INFO L74 IsIncluded]: Start isIncluded. First operand has 296 states, 219 states have (on average 1.2191780821917808) internal successors, (267), 225 states have internal predecessors, (267), 65 states have call successors, (65), 13 states have call predecessors, (65), 11 states have return successors, (63), 57 states have call predecessors, (63), 63 states have call successors, (63) Second operand 301 states. [2022-04-28 05:57:16,243 INFO L87 Difference]: Start difference. First operand has 296 states, 219 states have (on average 1.2191780821917808) internal successors, (267), 225 states have internal predecessors, (267), 65 states have call successors, (65), 13 states have call predecessors, (65), 11 states have return successors, (63), 57 states have call predecessors, (63), 63 states have call successors, (63) Second operand 301 states. [2022-04-28 05:57:16,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:16,248 INFO L93 Difference]: Finished difference Result 301 states and 401 transitions. [2022-04-28 05:57:16,248 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 401 transitions. [2022-04-28 05:57:16,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:57:16,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:57:16,249 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:57:16,249 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:57:16,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 219 states have (on average 1.2191780821917808) internal successors, (267), 225 states have internal predecessors, (267), 65 states have call successors, (65), 13 states have call predecessors, (65), 11 states have return successors, (63), 57 states have call predecessors, (63), 63 states have call successors, (63) [2022-04-28 05:57:16,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 395 transitions. [2022-04-28 05:57:16,254 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 395 transitions. Word has length 89 [2022-04-28 05:57:16,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:57:16,255 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 395 transitions. [2022-04-28 05:57:16,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 05:57:16,255 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 296 states and 395 transitions. [2022-04-28 05:57:18,959 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 395 edges. 394 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:18,959 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 395 transitions. [2022-04-28 05:57:18,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-28 05:57:18,960 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:57:18,960 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:57:18,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-04-28 05:57:19,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-04-28 05:57:19,161 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:57:19,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:57:19,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1322512306, now seen corresponding path program 5 times [2022-04-28 05:57:19,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:57:19,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1587892263] [2022-04-28 05:57:19,161 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:57:19,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1322512306, now seen corresponding path program 6 times [2022-04-28 05:57:19,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:57:19,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657663868] [2022-04-28 05:57:19,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:57:19,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:57:19,180 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:57:19,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1657869671] [2022-04-28 05:57:19,180 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 05:57:19,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:57:19,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:57:19,181 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:57:19,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-28 05:57:19,349 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-28 05:57:19,350 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:57:19,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 05:57:19,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:57:19,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:57:19,768 INFO L272 TraceCheckUtils]: 0: Hoare triple {26048#true} call ULTIMATE.init(); {26048#true} is VALID [2022-04-28 05:57:19,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {26048#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {26056#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:19,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {26056#(<= ~counter~0 0)} assume true; {26056#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:19,769 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26056#(<= ~counter~0 0)} {26048#true} #102#return; {26056#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:19,769 INFO L272 TraceCheckUtils]: 4: Hoare triple {26056#(<= ~counter~0 0)} call #t~ret9 := main(); {26056#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:19,769 INFO L290 TraceCheckUtils]: 5: Hoare triple {26056#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {26056#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:19,770 INFO L272 TraceCheckUtils]: 6: Hoare triple {26056#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {26056#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:19,770 INFO L290 TraceCheckUtils]: 7: Hoare triple {26056#(<= ~counter~0 0)} ~cond := #in~cond; {26056#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:19,770 INFO L290 TraceCheckUtils]: 8: Hoare triple {26056#(<= ~counter~0 0)} assume !(0 == ~cond); {26056#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:19,771 INFO L290 TraceCheckUtils]: 9: Hoare triple {26056#(<= ~counter~0 0)} assume true; {26056#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:19,771 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {26056#(<= ~counter~0 0)} {26056#(<= ~counter~0 0)} #90#return; {26056#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:19,771 INFO L272 TraceCheckUtils]: 11: Hoare triple {26056#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {26056#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:19,772 INFO L290 TraceCheckUtils]: 12: Hoare triple {26056#(<= ~counter~0 0)} ~cond := #in~cond; {26056#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:19,772 INFO L290 TraceCheckUtils]: 13: Hoare triple {26056#(<= ~counter~0 0)} assume !(0 == ~cond); {26056#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:19,772 INFO L290 TraceCheckUtils]: 14: Hoare triple {26056#(<= ~counter~0 0)} assume true; {26056#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:19,773 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {26056#(<= ~counter~0 0)} {26056#(<= ~counter~0 0)} #92#return; {26056#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:19,773 INFO L290 TraceCheckUtils]: 16: Hoare triple {26056#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {26056#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:19,774 INFO L290 TraceCheckUtils]: 17: Hoare triple {26056#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26105#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:19,774 INFO L290 TraceCheckUtils]: 18: Hoare triple {26105#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {26105#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:19,775 INFO L272 TraceCheckUtils]: 19: Hoare triple {26105#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26105#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:19,775 INFO L290 TraceCheckUtils]: 20: Hoare triple {26105#(<= ~counter~0 1)} ~cond := #in~cond; {26105#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:19,775 INFO L290 TraceCheckUtils]: 21: Hoare triple {26105#(<= ~counter~0 1)} assume !(0 == ~cond); {26105#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:19,775 INFO L290 TraceCheckUtils]: 22: Hoare triple {26105#(<= ~counter~0 1)} assume true; {26105#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:19,776 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {26105#(<= ~counter~0 1)} {26105#(<= ~counter~0 1)} #94#return; {26105#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:19,776 INFO L290 TraceCheckUtils]: 24: Hoare triple {26105#(<= ~counter~0 1)} assume !!(0 != ~r~0); {26105#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:19,777 INFO L290 TraceCheckUtils]: 25: Hoare triple {26105#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26130#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:19,777 INFO L290 TraceCheckUtils]: 26: Hoare triple {26130#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {26130#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:19,778 INFO L272 TraceCheckUtils]: 27: Hoare triple {26130#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26130#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:19,778 INFO L290 TraceCheckUtils]: 28: Hoare triple {26130#(<= ~counter~0 2)} ~cond := #in~cond; {26130#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:19,779 INFO L290 TraceCheckUtils]: 29: Hoare triple {26130#(<= ~counter~0 2)} assume !(0 == ~cond); {26130#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:19,779 INFO L290 TraceCheckUtils]: 30: Hoare triple {26130#(<= ~counter~0 2)} assume true; {26130#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:19,780 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {26130#(<= ~counter~0 2)} {26130#(<= ~counter~0 2)} #96#return; {26130#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:19,780 INFO L290 TraceCheckUtils]: 32: Hoare triple {26130#(<= ~counter~0 2)} assume !(~r~0 > 0); {26130#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:19,781 INFO L290 TraceCheckUtils]: 33: Hoare triple {26130#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {26155#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:19,781 INFO L290 TraceCheckUtils]: 34: Hoare triple {26155#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {26155#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:19,781 INFO L272 TraceCheckUtils]: 35: Hoare triple {26155#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26155#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:19,782 INFO L290 TraceCheckUtils]: 36: Hoare triple {26155#(<= ~counter~0 3)} ~cond := #in~cond; {26155#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:19,782 INFO L290 TraceCheckUtils]: 37: Hoare triple {26155#(<= ~counter~0 3)} assume !(0 == ~cond); {26155#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:19,782 INFO L290 TraceCheckUtils]: 38: Hoare triple {26155#(<= ~counter~0 3)} assume true; {26155#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:19,783 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {26155#(<= ~counter~0 3)} {26155#(<= ~counter~0 3)} #98#return; {26155#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:19,783 INFO L290 TraceCheckUtils]: 40: Hoare triple {26155#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {26155#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:19,784 INFO L290 TraceCheckUtils]: 41: Hoare triple {26155#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {26180#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:19,784 INFO L290 TraceCheckUtils]: 42: Hoare triple {26180#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {26180#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:19,784 INFO L272 TraceCheckUtils]: 43: Hoare triple {26180#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26180#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:19,785 INFO L290 TraceCheckUtils]: 44: Hoare triple {26180#(<= ~counter~0 4)} ~cond := #in~cond; {26180#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:19,785 INFO L290 TraceCheckUtils]: 45: Hoare triple {26180#(<= ~counter~0 4)} assume !(0 == ~cond); {26180#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:19,785 INFO L290 TraceCheckUtils]: 46: Hoare triple {26180#(<= ~counter~0 4)} assume true; {26180#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:19,786 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {26180#(<= ~counter~0 4)} {26180#(<= ~counter~0 4)} #98#return; {26180#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:19,786 INFO L290 TraceCheckUtils]: 48: Hoare triple {26180#(<= ~counter~0 4)} assume !(~r~0 < 0); {26180#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:19,787 INFO L290 TraceCheckUtils]: 49: Hoare triple {26180#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26205#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:19,787 INFO L290 TraceCheckUtils]: 50: Hoare triple {26205#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {26205#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:19,787 INFO L272 TraceCheckUtils]: 51: Hoare triple {26205#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26205#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:19,788 INFO L290 TraceCheckUtils]: 52: Hoare triple {26205#(<= ~counter~0 5)} ~cond := #in~cond; {26205#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:19,788 INFO L290 TraceCheckUtils]: 53: Hoare triple {26205#(<= ~counter~0 5)} assume !(0 == ~cond); {26205#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:19,788 INFO L290 TraceCheckUtils]: 54: Hoare triple {26205#(<= ~counter~0 5)} assume true; {26205#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:19,789 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {26205#(<= ~counter~0 5)} {26205#(<= ~counter~0 5)} #94#return; {26205#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:19,789 INFO L290 TraceCheckUtils]: 56: Hoare triple {26205#(<= ~counter~0 5)} assume !!(0 != ~r~0); {26205#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:19,789 INFO L290 TraceCheckUtils]: 57: Hoare triple {26205#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26230#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:19,790 INFO L290 TraceCheckUtils]: 58: Hoare triple {26230#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {26230#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:19,790 INFO L272 TraceCheckUtils]: 59: Hoare triple {26230#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26230#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:19,791 INFO L290 TraceCheckUtils]: 60: Hoare triple {26230#(<= ~counter~0 6)} ~cond := #in~cond; {26230#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:19,791 INFO L290 TraceCheckUtils]: 61: Hoare triple {26230#(<= ~counter~0 6)} assume !(0 == ~cond); {26230#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:19,791 INFO L290 TraceCheckUtils]: 62: Hoare triple {26230#(<= ~counter~0 6)} assume true; {26230#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:19,792 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {26230#(<= ~counter~0 6)} {26230#(<= ~counter~0 6)} #96#return; {26230#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:19,792 INFO L290 TraceCheckUtils]: 64: Hoare triple {26230#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26230#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:19,792 INFO L290 TraceCheckUtils]: 65: Hoare triple {26230#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26255#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:19,793 INFO L290 TraceCheckUtils]: 66: Hoare triple {26255#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {26255#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:19,793 INFO L272 TraceCheckUtils]: 67: Hoare triple {26255#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26255#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:19,793 INFO L290 TraceCheckUtils]: 68: Hoare triple {26255#(<= ~counter~0 7)} ~cond := #in~cond; {26255#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:19,794 INFO L290 TraceCheckUtils]: 69: Hoare triple {26255#(<= ~counter~0 7)} assume !(0 == ~cond); {26255#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:19,794 INFO L290 TraceCheckUtils]: 70: Hoare triple {26255#(<= ~counter~0 7)} assume true; {26255#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:19,794 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {26255#(<= ~counter~0 7)} {26255#(<= ~counter~0 7)} #96#return; {26255#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:19,795 INFO L290 TraceCheckUtils]: 72: Hoare triple {26255#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26255#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:19,795 INFO L290 TraceCheckUtils]: 73: Hoare triple {26255#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26280#(<= ~counter~0 8)} is VALID [2022-04-28 05:57:19,796 INFO L290 TraceCheckUtils]: 74: Hoare triple {26280#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {26280#(<= ~counter~0 8)} is VALID [2022-04-28 05:57:19,796 INFO L272 TraceCheckUtils]: 75: Hoare triple {26280#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26280#(<= ~counter~0 8)} is VALID [2022-04-28 05:57:19,796 INFO L290 TraceCheckUtils]: 76: Hoare triple {26280#(<= ~counter~0 8)} ~cond := #in~cond; {26280#(<= ~counter~0 8)} is VALID [2022-04-28 05:57:19,797 INFO L290 TraceCheckUtils]: 77: Hoare triple {26280#(<= ~counter~0 8)} assume !(0 == ~cond); {26280#(<= ~counter~0 8)} is VALID [2022-04-28 05:57:19,797 INFO L290 TraceCheckUtils]: 78: Hoare triple {26280#(<= ~counter~0 8)} assume true; {26280#(<= ~counter~0 8)} is VALID [2022-04-28 05:57:19,797 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {26280#(<= ~counter~0 8)} {26280#(<= ~counter~0 8)} #96#return; {26280#(<= ~counter~0 8)} is VALID [2022-04-28 05:57:19,798 INFO L290 TraceCheckUtils]: 80: Hoare triple {26280#(<= ~counter~0 8)} assume !(~r~0 > 0); {26280#(<= ~counter~0 8)} is VALID [2022-04-28 05:57:19,798 INFO L290 TraceCheckUtils]: 81: Hoare triple {26280#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {26305#(<= ~counter~0 9)} is VALID [2022-04-28 05:57:19,803 INFO L290 TraceCheckUtils]: 82: Hoare triple {26305#(<= ~counter~0 9)} assume !(#t~post8 < 100);havoc #t~post8; {26305#(<= ~counter~0 9)} is VALID [2022-04-28 05:57:19,803 INFO L290 TraceCheckUtils]: 83: Hoare triple {26305#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26312#(<= |main_#t~post6| 9)} is VALID [2022-04-28 05:57:19,804 INFO L290 TraceCheckUtils]: 84: Hoare triple {26312#(<= |main_#t~post6| 9)} assume !(#t~post6 < 100);havoc #t~post6; {26049#false} is VALID [2022-04-28 05:57:19,804 INFO L272 TraceCheckUtils]: 85: Hoare triple {26049#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26049#false} is VALID [2022-04-28 05:57:19,804 INFO L290 TraceCheckUtils]: 86: Hoare triple {26049#false} ~cond := #in~cond; {26049#false} is VALID [2022-04-28 05:57:19,804 INFO L290 TraceCheckUtils]: 87: Hoare triple {26049#false} assume 0 == ~cond; {26049#false} is VALID [2022-04-28 05:57:19,804 INFO L290 TraceCheckUtils]: 88: Hoare triple {26049#false} assume !false; {26049#false} is VALID [2022-04-28 05:57:19,804 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 16 proven. 152 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:57:19,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:57:20,274 INFO L290 TraceCheckUtils]: 88: Hoare triple {26049#false} assume !false; {26049#false} is VALID [2022-04-28 05:57:20,274 INFO L290 TraceCheckUtils]: 87: Hoare triple {26049#false} assume 0 == ~cond; {26049#false} is VALID [2022-04-28 05:57:20,275 INFO L290 TraceCheckUtils]: 86: Hoare triple {26049#false} ~cond := #in~cond; {26049#false} is VALID [2022-04-28 05:57:20,275 INFO L272 TraceCheckUtils]: 85: Hoare triple {26049#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26049#false} is VALID [2022-04-28 05:57:20,275 INFO L290 TraceCheckUtils]: 84: Hoare triple {26340#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {26049#false} is VALID [2022-04-28 05:57:20,275 INFO L290 TraceCheckUtils]: 83: Hoare triple {26344#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26340#(< |main_#t~post6| 100)} is VALID [2022-04-28 05:57:20,275 INFO L290 TraceCheckUtils]: 82: Hoare triple {26344#(< ~counter~0 100)} assume !(#t~post8 < 100);havoc #t~post8; {26344#(< ~counter~0 100)} is VALID [2022-04-28 05:57:20,276 INFO L290 TraceCheckUtils]: 81: Hoare triple {26351#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {26344#(< ~counter~0 100)} is VALID [2022-04-28 05:57:20,277 INFO L290 TraceCheckUtils]: 80: Hoare triple {26351#(< ~counter~0 99)} assume !(~r~0 > 0); {26351#(< ~counter~0 99)} is VALID [2022-04-28 05:57:20,277 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {26048#true} {26351#(< ~counter~0 99)} #96#return; {26351#(< ~counter~0 99)} is VALID [2022-04-28 05:57:20,277 INFO L290 TraceCheckUtils]: 78: Hoare triple {26048#true} assume true; {26048#true} is VALID [2022-04-28 05:57:20,277 INFO L290 TraceCheckUtils]: 77: Hoare triple {26048#true} assume !(0 == ~cond); {26048#true} is VALID [2022-04-28 05:57:20,277 INFO L290 TraceCheckUtils]: 76: Hoare triple {26048#true} ~cond := #in~cond; {26048#true} is VALID [2022-04-28 05:57:20,277 INFO L272 TraceCheckUtils]: 75: Hoare triple {26351#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26048#true} is VALID [2022-04-28 05:57:20,278 INFO L290 TraceCheckUtils]: 74: Hoare triple {26351#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {26351#(< ~counter~0 99)} is VALID [2022-04-28 05:57:20,278 INFO L290 TraceCheckUtils]: 73: Hoare triple {26376#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26351#(< ~counter~0 99)} is VALID [2022-04-28 05:57:20,279 INFO L290 TraceCheckUtils]: 72: Hoare triple {26376#(< ~counter~0 98)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26376#(< ~counter~0 98)} is VALID [2022-04-28 05:57:20,279 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {26048#true} {26376#(< ~counter~0 98)} #96#return; {26376#(< ~counter~0 98)} is VALID [2022-04-28 05:57:20,279 INFO L290 TraceCheckUtils]: 70: Hoare triple {26048#true} assume true; {26048#true} is VALID [2022-04-28 05:57:20,279 INFO L290 TraceCheckUtils]: 69: Hoare triple {26048#true} assume !(0 == ~cond); {26048#true} is VALID [2022-04-28 05:57:20,279 INFO L290 TraceCheckUtils]: 68: Hoare triple {26048#true} ~cond := #in~cond; {26048#true} is VALID [2022-04-28 05:57:20,279 INFO L272 TraceCheckUtils]: 67: Hoare triple {26376#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26048#true} is VALID [2022-04-28 05:57:20,280 INFO L290 TraceCheckUtils]: 66: Hoare triple {26376#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {26376#(< ~counter~0 98)} is VALID [2022-04-28 05:57:20,280 INFO L290 TraceCheckUtils]: 65: Hoare triple {26401#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26376#(< ~counter~0 98)} is VALID [2022-04-28 05:57:20,280 INFO L290 TraceCheckUtils]: 64: Hoare triple {26401#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26401#(< ~counter~0 97)} is VALID [2022-04-28 05:57:20,281 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {26048#true} {26401#(< ~counter~0 97)} #96#return; {26401#(< ~counter~0 97)} is VALID [2022-04-28 05:57:20,281 INFO L290 TraceCheckUtils]: 62: Hoare triple {26048#true} assume true; {26048#true} is VALID [2022-04-28 05:57:20,281 INFO L290 TraceCheckUtils]: 61: Hoare triple {26048#true} assume !(0 == ~cond); {26048#true} is VALID [2022-04-28 05:57:20,281 INFO L290 TraceCheckUtils]: 60: Hoare triple {26048#true} ~cond := #in~cond; {26048#true} is VALID [2022-04-28 05:57:20,281 INFO L272 TraceCheckUtils]: 59: Hoare triple {26401#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26048#true} is VALID [2022-04-28 05:57:20,282 INFO L290 TraceCheckUtils]: 58: Hoare triple {26401#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {26401#(< ~counter~0 97)} is VALID [2022-04-28 05:57:20,282 INFO L290 TraceCheckUtils]: 57: Hoare triple {26426#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26401#(< ~counter~0 97)} is VALID [2022-04-28 05:57:20,282 INFO L290 TraceCheckUtils]: 56: Hoare triple {26426#(< ~counter~0 96)} assume !!(0 != ~r~0); {26426#(< ~counter~0 96)} is VALID [2022-04-28 05:57:20,283 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {26048#true} {26426#(< ~counter~0 96)} #94#return; {26426#(< ~counter~0 96)} is VALID [2022-04-28 05:57:20,283 INFO L290 TraceCheckUtils]: 54: Hoare triple {26048#true} assume true; {26048#true} is VALID [2022-04-28 05:57:20,283 INFO L290 TraceCheckUtils]: 53: Hoare triple {26048#true} assume !(0 == ~cond); {26048#true} is VALID [2022-04-28 05:57:20,283 INFO L290 TraceCheckUtils]: 52: Hoare triple {26048#true} ~cond := #in~cond; {26048#true} is VALID [2022-04-28 05:57:20,283 INFO L272 TraceCheckUtils]: 51: Hoare triple {26426#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26048#true} is VALID [2022-04-28 05:57:20,284 INFO L290 TraceCheckUtils]: 50: Hoare triple {26426#(< ~counter~0 96)} assume !!(#t~post6 < 100);havoc #t~post6; {26426#(< ~counter~0 96)} is VALID [2022-04-28 05:57:20,284 INFO L290 TraceCheckUtils]: 49: Hoare triple {26451#(< ~counter~0 95)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26426#(< ~counter~0 96)} is VALID [2022-04-28 05:57:20,285 INFO L290 TraceCheckUtils]: 48: Hoare triple {26451#(< ~counter~0 95)} assume !(~r~0 < 0); {26451#(< ~counter~0 95)} is VALID [2022-04-28 05:57:20,285 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {26048#true} {26451#(< ~counter~0 95)} #98#return; {26451#(< ~counter~0 95)} is VALID [2022-04-28 05:57:20,285 INFO L290 TraceCheckUtils]: 46: Hoare triple {26048#true} assume true; {26048#true} is VALID [2022-04-28 05:57:20,285 INFO L290 TraceCheckUtils]: 45: Hoare triple {26048#true} assume !(0 == ~cond); {26048#true} is VALID [2022-04-28 05:57:20,285 INFO L290 TraceCheckUtils]: 44: Hoare triple {26048#true} ~cond := #in~cond; {26048#true} is VALID [2022-04-28 05:57:20,285 INFO L272 TraceCheckUtils]: 43: Hoare triple {26451#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26048#true} is VALID [2022-04-28 05:57:20,286 INFO L290 TraceCheckUtils]: 42: Hoare triple {26451#(< ~counter~0 95)} assume !!(#t~post8 < 100);havoc #t~post8; {26451#(< ~counter~0 95)} is VALID [2022-04-28 05:57:20,286 INFO L290 TraceCheckUtils]: 41: Hoare triple {26476#(< ~counter~0 94)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {26451#(< ~counter~0 95)} is VALID [2022-04-28 05:57:20,286 INFO L290 TraceCheckUtils]: 40: Hoare triple {26476#(< ~counter~0 94)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {26476#(< ~counter~0 94)} is VALID [2022-04-28 05:57:20,287 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {26048#true} {26476#(< ~counter~0 94)} #98#return; {26476#(< ~counter~0 94)} is VALID [2022-04-28 05:57:20,287 INFO L290 TraceCheckUtils]: 38: Hoare triple {26048#true} assume true; {26048#true} is VALID [2022-04-28 05:57:20,287 INFO L290 TraceCheckUtils]: 37: Hoare triple {26048#true} assume !(0 == ~cond); {26048#true} is VALID [2022-04-28 05:57:20,287 INFO L290 TraceCheckUtils]: 36: Hoare triple {26048#true} ~cond := #in~cond; {26048#true} is VALID [2022-04-28 05:57:20,287 INFO L272 TraceCheckUtils]: 35: Hoare triple {26476#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26048#true} is VALID [2022-04-28 05:57:20,288 INFO L290 TraceCheckUtils]: 34: Hoare triple {26476#(< ~counter~0 94)} assume !!(#t~post8 < 100);havoc #t~post8; {26476#(< ~counter~0 94)} is VALID [2022-04-28 05:57:20,288 INFO L290 TraceCheckUtils]: 33: Hoare triple {26501#(< ~counter~0 93)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {26476#(< ~counter~0 94)} is VALID [2022-04-28 05:57:20,288 INFO L290 TraceCheckUtils]: 32: Hoare triple {26501#(< ~counter~0 93)} assume !(~r~0 > 0); {26501#(< ~counter~0 93)} is VALID [2022-04-28 05:57:20,289 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {26048#true} {26501#(< ~counter~0 93)} #96#return; {26501#(< ~counter~0 93)} is VALID [2022-04-28 05:57:20,289 INFO L290 TraceCheckUtils]: 30: Hoare triple {26048#true} assume true; {26048#true} is VALID [2022-04-28 05:57:20,289 INFO L290 TraceCheckUtils]: 29: Hoare triple {26048#true} assume !(0 == ~cond); {26048#true} is VALID [2022-04-28 05:57:20,289 INFO L290 TraceCheckUtils]: 28: Hoare triple {26048#true} ~cond := #in~cond; {26048#true} is VALID [2022-04-28 05:57:20,289 INFO L272 TraceCheckUtils]: 27: Hoare triple {26501#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26048#true} is VALID [2022-04-28 05:57:20,290 INFO L290 TraceCheckUtils]: 26: Hoare triple {26501#(< ~counter~0 93)} assume !!(#t~post7 < 100);havoc #t~post7; {26501#(< ~counter~0 93)} is VALID [2022-04-28 05:57:20,290 INFO L290 TraceCheckUtils]: 25: Hoare triple {26526#(< ~counter~0 92)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26501#(< ~counter~0 93)} is VALID [2022-04-28 05:57:20,290 INFO L290 TraceCheckUtils]: 24: Hoare triple {26526#(< ~counter~0 92)} assume !!(0 != ~r~0); {26526#(< ~counter~0 92)} is VALID [2022-04-28 05:57:20,291 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {26048#true} {26526#(< ~counter~0 92)} #94#return; {26526#(< ~counter~0 92)} is VALID [2022-04-28 05:57:20,291 INFO L290 TraceCheckUtils]: 22: Hoare triple {26048#true} assume true; {26048#true} is VALID [2022-04-28 05:57:20,291 INFO L290 TraceCheckUtils]: 21: Hoare triple {26048#true} assume !(0 == ~cond); {26048#true} is VALID [2022-04-28 05:57:20,291 INFO L290 TraceCheckUtils]: 20: Hoare triple {26048#true} ~cond := #in~cond; {26048#true} is VALID [2022-04-28 05:57:20,291 INFO L272 TraceCheckUtils]: 19: Hoare triple {26526#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26048#true} is VALID [2022-04-28 05:57:20,292 INFO L290 TraceCheckUtils]: 18: Hoare triple {26526#(< ~counter~0 92)} assume !!(#t~post6 < 100);havoc #t~post6; {26526#(< ~counter~0 92)} is VALID [2022-04-28 05:57:20,292 INFO L290 TraceCheckUtils]: 17: Hoare triple {26551#(< ~counter~0 91)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26526#(< ~counter~0 92)} is VALID [2022-04-28 05:57:20,292 INFO L290 TraceCheckUtils]: 16: Hoare triple {26551#(< ~counter~0 91)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {26551#(< ~counter~0 91)} is VALID [2022-04-28 05:57:20,293 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {26048#true} {26551#(< ~counter~0 91)} #92#return; {26551#(< ~counter~0 91)} is VALID [2022-04-28 05:57:20,293 INFO L290 TraceCheckUtils]: 14: Hoare triple {26048#true} assume true; {26048#true} is VALID [2022-04-28 05:57:20,293 INFO L290 TraceCheckUtils]: 13: Hoare triple {26048#true} assume !(0 == ~cond); {26048#true} is VALID [2022-04-28 05:57:20,293 INFO L290 TraceCheckUtils]: 12: Hoare triple {26048#true} ~cond := #in~cond; {26048#true} is VALID [2022-04-28 05:57:20,293 INFO L272 TraceCheckUtils]: 11: Hoare triple {26551#(< ~counter~0 91)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {26048#true} is VALID [2022-04-28 05:57:20,294 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {26048#true} {26551#(< ~counter~0 91)} #90#return; {26551#(< ~counter~0 91)} is VALID [2022-04-28 05:57:20,294 INFO L290 TraceCheckUtils]: 9: Hoare triple {26048#true} assume true; {26048#true} is VALID [2022-04-28 05:57:20,294 INFO L290 TraceCheckUtils]: 8: Hoare triple {26048#true} assume !(0 == ~cond); {26048#true} is VALID [2022-04-28 05:57:20,294 INFO L290 TraceCheckUtils]: 7: Hoare triple {26048#true} ~cond := #in~cond; {26048#true} is VALID [2022-04-28 05:57:20,294 INFO L272 TraceCheckUtils]: 6: Hoare triple {26551#(< ~counter~0 91)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {26048#true} is VALID [2022-04-28 05:57:20,294 INFO L290 TraceCheckUtils]: 5: Hoare triple {26551#(< ~counter~0 91)} 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 91)} is VALID [2022-04-28 05:57:20,295 INFO L272 TraceCheckUtils]: 4: Hoare triple {26551#(< ~counter~0 91)} call #t~ret9 := main(); {26551#(< ~counter~0 91)} is VALID [2022-04-28 05:57:20,295 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26551#(< ~counter~0 91)} {26048#true} #102#return; {26551#(< ~counter~0 91)} is VALID [2022-04-28 05:57:20,295 INFO L290 TraceCheckUtils]: 2: Hoare triple {26551#(< ~counter~0 91)} assume true; {26551#(< ~counter~0 91)} is VALID [2022-04-28 05:57:20,296 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 91)} is VALID [2022-04-28 05:57:20,296 INFO L272 TraceCheckUtils]: 0: Hoare triple {26048#true} call ULTIMATE.init(); {26048#true} is VALID [2022-04-28 05:57:20,296 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 16 proven. 40 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-04-28 05:57:20,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:57:20,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657663868] [2022-04-28 05:57:20,296 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:57:20,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657869671] [2022-04-28 05:57:20,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657869671] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:57:20,297 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:57:20,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-04-28 05:57:20,297 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:57:20,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1587892263] [2022-04-28 05:57:20,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1587892263] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:57:20,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:57:20,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 05:57:20,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256483758] [2022-04-28 05:57:20,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:57:20,298 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) Word has length 89 [2022-04-28 05:57:20,298 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:57:20,298 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-28 05:57:20,355 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:20,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 05:57:20,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:57:20,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 05:57:20,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-28 05:57:20,356 INFO L87 Difference]: Start difference. First operand 296 states and 395 transitions. Second operand has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-28 05:57:21,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:21,375 INFO L93 Difference]: Finished difference Result 362 states and 486 transitions. [2022-04-28 05:57:21,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 05:57:21,375 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) Word has length 89 [2022-04-28 05:57:21,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:57:21,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-28 05:57:21,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 197 transitions. [2022-04-28 05:57:21,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-28 05:57:21,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 197 transitions. [2022-04-28 05:57:21,378 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 197 transitions. [2022-04-28 05:57:21,520 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 197 edges. 197 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:21,531 INFO L225 Difference]: With dead ends: 362 [2022-04-28 05:57:21,531 INFO L226 Difference]: Without dead ends: 357 [2022-04-28 05:57:21,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=359, Invalid=511, Unknown=0, NotChecked=0, Total=870 [2022-04-28 05:57:21,532 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 148 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 05:57:21,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 236 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 05:57:21,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2022-04-28 05:57:21,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 342. [2022-04-28 05:57:21,990 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:57:21,990 INFO L82 GeneralOperation]: Start isEquivalent. First operand 357 states. Second operand has 342 states, 255 states have (on average 1.231372549019608) internal successors, (314), 261 states have internal predecessors, (314), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-28 05:57:21,990 INFO L74 IsIncluded]: Start isIncluded. First operand 357 states. Second operand has 342 states, 255 states have (on average 1.231372549019608) internal successors, (314), 261 states have internal predecessors, (314), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-28 05:57:21,991 INFO L87 Difference]: Start difference. First operand 357 states. Second operand has 342 states, 255 states have (on average 1.231372549019608) internal successors, (314), 261 states have internal predecessors, (314), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-28 05:57:21,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:21,996 INFO L93 Difference]: Finished difference Result 357 states and 477 transitions. [2022-04-28 05:57:21,996 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 477 transitions. [2022-04-28 05:57:21,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:57:21,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:57:21,997 INFO L74 IsIncluded]: Start isIncluded. First operand has 342 states, 255 states have (on average 1.231372549019608) internal successors, (314), 261 states have internal predecessors, (314), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) Second operand 357 states. [2022-04-28 05:57:21,998 INFO L87 Difference]: Start difference. First operand has 342 states, 255 states have (on average 1.231372549019608) internal successors, (314), 261 states have internal predecessors, (314), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) Second operand 357 states. [2022-04-28 05:57:22,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:22,003 INFO L93 Difference]: Finished difference Result 357 states and 477 transitions. [2022-04-28 05:57:22,003 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 477 transitions. [2022-04-28 05:57:22,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:57:22,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:57:22,004 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:57:22,004 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:57:22,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 255 states have (on average 1.231372549019608) internal successors, (314), 261 states have internal predecessors, (314), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-28 05:57:22,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 460 transitions. [2022-04-28 05:57:22,011 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 460 transitions. Word has length 89 [2022-04-28 05:57:22,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:57:22,011 INFO L495 AbstractCegarLoop]: Abstraction has 342 states and 460 transitions. [2022-04-28 05:57:22,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-28 05:57:22,011 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 342 states and 460 transitions. [2022-04-28 05:57:24,822 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 460 edges. 459 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:24,823 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 460 transitions. [2022-04-28 05:57:24,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-28 05:57:24,823 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:57:24,824 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:57:24,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-04-28 05:57:25,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-28 05:57:25,028 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:57:25,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:57:25,028 INFO L85 PathProgramCache]: Analyzing trace with hash -345961389, now seen corresponding path program 5 times [2022-04-28 05:57:25,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:57:25,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [230488649] [2022-04-28 05:57:25,029 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:57:25,029 INFO L85 PathProgramCache]: Analyzing trace with hash -345961389, now seen corresponding path program 6 times [2022-04-28 05:57:25,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:57:25,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934595959] [2022-04-28 05:57:25,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:57:25,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:57:25,039 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:57:25,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1156176755] [2022-04-28 05:57:25,039 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 05:57:25,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:57:25,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:57:25,041 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:57:25,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-04-28 05:57:25,188 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-28 05:57:25,188 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:57:25,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 05:57:25,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:57:25,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:57:25,590 INFO L272 TraceCheckUtils]: 0: Hoare triple {28739#true} call ULTIMATE.init(); {28739#true} is VALID [2022-04-28 05:57:25,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {28739#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {28747#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:25,590 INFO L290 TraceCheckUtils]: 2: Hoare triple {28747#(<= ~counter~0 0)} assume true; {28747#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:25,591 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28747#(<= ~counter~0 0)} {28739#true} #102#return; {28747#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:25,591 INFO L272 TraceCheckUtils]: 4: Hoare triple {28747#(<= ~counter~0 0)} call #t~ret9 := main(); {28747#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:25,591 INFO L290 TraceCheckUtils]: 5: Hoare triple {28747#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {28747#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:25,592 INFO L272 TraceCheckUtils]: 6: Hoare triple {28747#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {28747#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:25,592 INFO L290 TraceCheckUtils]: 7: Hoare triple {28747#(<= ~counter~0 0)} ~cond := #in~cond; {28747#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:25,592 INFO L290 TraceCheckUtils]: 8: Hoare triple {28747#(<= ~counter~0 0)} assume !(0 == ~cond); {28747#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:25,592 INFO L290 TraceCheckUtils]: 9: Hoare triple {28747#(<= ~counter~0 0)} assume true; {28747#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:25,593 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {28747#(<= ~counter~0 0)} {28747#(<= ~counter~0 0)} #90#return; {28747#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:25,593 INFO L272 TraceCheckUtils]: 11: Hoare triple {28747#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {28747#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:25,593 INFO L290 TraceCheckUtils]: 12: Hoare triple {28747#(<= ~counter~0 0)} ~cond := #in~cond; {28747#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:25,594 INFO L290 TraceCheckUtils]: 13: Hoare triple {28747#(<= ~counter~0 0)} assume !(0 == ~cond); {28747#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:25,594 INFO L290 TraceCheckUtils]: 14: Hoare triple {28747#(<= ~counter~0 0)} assume true; {28747#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:25,594 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {28747#(<= ~counter~0 0)} {28747#(<= ~counter~0 0)} #92#return; {28747#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:25,595 INFO L290 TraceCheckUtils]: 16: Hoare triple {28747#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {28747#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:25,595 INFO L290 TraceCheckUtils]: 17: Hoare triple {28747#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {28796#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:25,596 INFO L290 TraceCheckUtils]: 18: Hoare triple {28796#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {28796#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:25,596 INFO L272 TraceCheckUtils]: 19: Hoare triple {28796#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28796#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:25,596 INFO L290 TraceCheckUtils]: 20: Hoare triple {28796#(<= ~counter~0 1)} ~cond := #in~cond; {28796#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:25,597 INFO L290 TraceCheckUtils]: 21: Hoare triple {28796#(<= ~counter~0 1)} assume !(0 == ~cond); {28796#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:25,597 INFO L290 TraceCheckUtils]: 22: Hoare triple {28796#(<= ~counter~0 1)} assume true; {28796#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:25,597 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {28796#(<= ~counter~0 1)} {28796#(<= ~counter~0 1)} #94#return; {28796#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:25,598 INFO L290 TraceCheckUtils]: 24: Hoare triple {28796#(<= ~counter~0 1)} assume !!(0 != ~r~0); {28796#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:25,598 INFO L290 TraceCheckUtils]: 25: Hoare triple {28796#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28821#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:25,598 INFO L290 TraceCheckUtils]: 26: Hoare triple {28821#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {28821#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:25,599 INFO L272 TraceCheckUtils]: 27: Hoare triple {28821#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28821#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:25,599 INFO L290 TraceCheckUtils]: 28: Hoare triple {28821#(<= ~counter~0 2)} ~cond := #in~cond; {28821#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:25,599 INFO L290 TraceCheckUtils]: 29: Hoare triple {28821#(<= ~counter~0 2)} assume !(0 == ~cond); {28821#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:25,600 INFO L290 TraceCheckUtils]: 30: Hoare triple {28821#(<= ~counter~0 2)} assume true; {28821#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:25,600 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {28821#(<= ~counter~0 2)} {28821#(<= ~counter~0 2)} #96#return; {28821#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:25,600 INFO L290 TraceCheckUtils]: 32: Hoare triple {28821#(<= ~counter~0 2)} assume !(~r~0 > 0); {28821#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:25,601 INFO L290 TraceCheckUtils]: 33: Hoare triple {28821#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {28846#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:25,601 INFO L290 TraceCheckUtils]: 34: Hoare triple {28846#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {28846#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:25,602 INFO L272 TraceCheckUtils]: 35: Hoare triple {28846#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28846#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:25,602 INFO L290 TraceCheckUtils]: 36: Hoare triple {28846#(<= ~counter~0 3)} ~cond := #in~cond; {28846#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:25,602 INFO L290 TraceCheckUtils]: 37: Hoare triple {28846#(<= ~counter~0 3)} assume !(0 == ~cond); {28846#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:25,602 INFO L290 TraceCheckUtils]: 38: Hoare triple {28846#(<= ~counter~0 3)} assume true; {28846#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:25,603 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {28846#(<= ~counter~0 3)} {28846#(<= ~counter~0 3)} #98#return; {28846#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:25,603 INFO L290 TraceCheckUtils]: 40: Hoare triple {28846#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {28846#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:25,616 INFO L290 TraceCheckUtils]: 41: Hoare triple {28846#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {28871#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:25,617 INFO L290 TraceCheckUtils]: 42: Hoare triple {28871#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {28871#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:25,617 INFO L272 TraceCheckUtils]: 43: Hoare triple {28871#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28871#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:25,617 INFO L290 TraceCheckUtils]: 44: Hoare triple {28871#(<= ~counter~0 4)} ~cond := #in~cond; {28871#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:25,618 INFO L290 TraceCheckUtils]: 45: Hoare triple {28871#(<= ~counter~0 4)} assume !(0 == ~cond); {28871#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:25,618 INFO L290 TraceCheckUtils]: 46: Hoare triple {28871#(<= ~counter~0 4)} assume true; {28871#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:25,619 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {28871#(<= ~counter~0 4)} {28871#(<= ~counter~0 4)} #98#return; {28871#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:25,619 INFO L290 TraceCheckUtils]: 48: Hoare triple {28871#(<= ~counter~0 4)} assume !(~r~0 < 0); {28871#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:25,619 INFO L290 TraceCheckUtils]: 49: Hoare triple {28871#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {28896#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:25,620 INFO L290 TraceCheckUtils]: 50: Hoare triple {28896#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {28896#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:25,620 INFO L272 TraceCheckUtils]: 51: Hoare triple {28896#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28896#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:25,621 INFO L290 TraceCheckUtils]: 52: Hoare triple {28896#(<= ~counter~0 5)} ~cond := #in~cond; {28896#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:25,621 INFO L290 TraceCheckUtils]: 53: Hoare triple {28896#(<= ~counter~0 5)} assume !(0 == ~cond); {28896#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:25,621 INFO L290 TraceCheckUtils]: 54: Hoare triple {28896#(<= ~counter~0 5)} assume true; {28896#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:25,622 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {28896#(<= ~counter~0 5)} {28896#(<= ~counter~0 5)} #94#return; {28896#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:25,622 INFO L290 TraceCheckUtils]: 56: Hoare triple {28896#(<= ~counter~0 5)} assume !!(0 != ~r~0); {28896#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:25,623 INFO L290 TraceCheckUtils]: 57: Hoare triple {28896#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28921#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:25,623 INFO L290 TraceCheckUtils]: 58: Hoare triple {28921#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {28921#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:25,623 INFO L272 TraceCheckUtils]: 59: Hoare triple {28921#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28921#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:25,624 INFO L290 TraceCheckUtils]: 60: Hoare triple {28921#(<= ~counter~0 6)} ~cond := #in~cond; {28921#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:25,624 INFO L290 TraceCheckUtils]: 61: Hoare triple {28921#(<= ~counter~0 6)} assume !(0 == ~cond); {28921#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:25,624 INFO L290 TraceCheckUtils]: 62: Hoare triple {28921#(<= ~counter~0 6)} assume true; {28921#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:25,625 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {28921#(<= ~counter~0 6)} {28921#(<= ~counter~0 6)} #96#return; {28921#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:25,625 INFO L290 TraceCheckUtils]: 64: Hoare triple {28921#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {28921#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:25,626 INFO L290 TraceCheckUtils]: 65: Hoare triple {28921#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28946#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:25,626 INFO L290 TraceCheckUtils]: 66: Hoare triple {28946#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {28946#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:25,626 INFO L272 TraceCheckUtils]: 67: Hoare triple {28946#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28946#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:25,627 INFO L290 TraceCheckUtils]: 68: Hoare triple {28946#(<= ~counter~0 7)} ~cond := #in~cond; {28946#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:25,627 INFO L290 TraceCheckUtils]: 69: Hoare triple {28946#(<= ~counter~0 7)} assume !(0 == ~cond); {28946#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:25,627 INFO L290 TraceCheckUtils]: 70: Hoare triple {28946#(<= ~counter~0 7)} assume true; {28946#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:25,628 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {28946#(<= ~counter~0 7)} {28946#(<= ~counter~0 7)} #96#return; {28946#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:25,628 INFO L290 TraceCheckUtils]: 72: Hoare triple {28946#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {28946#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:25,629 INFO L290 TraceCheckUtils]: 73: Hoare triple {28946#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28971#(<= ~counter~0 8)} is VALID [2022-04-28 05:57:25,629 INFO L290 TraceCheckUtils]: 74: Hoare triple {28971#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {28971#(<= ~counter~0 8)} is VALID [2022-04-28 05:57:25,630 INFO L272 TraceCheckUtils]: 75: Hoare triple {28971#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28971#(<= ~counter~0 8)} is VALID [2022-04-28 05:57:25,630 INFO L290 TraceCheckUtils]: 76: Hoare triple {28971#(<= ~counter~0 8)} ~cond := #in~cond; {28971#(<= ~counter~0 8)} is VALID [2022-04-28 05:57:25,630 INFO L290 TraceCheckUtils]: 77: Hoare triple {28971#(<= ~counter~0 8)} assume !(0 == ~cond); {28971#(<= ~counter~0 8)} is VALID [2022-04-28 05:57:25,630 INFO L290 TraceCheckUtils]: 78: Hoare triple {28971#(<= ~counter~0 8)} assume true; {28971#(<= ~counter~0 8)} is VALID [2022-04-28 05:57:25,631 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {28971#(<= ~counter~0 8)} {28971#(<= ~counter~0 8)} #96#return; {28971#(<= ~counter~0 8)} is VALID [2022-04-28 05:57:25,631 INFO L290 TraceCheckUtils]: 80: Hoare triple {28971#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {28971#(<= ~counter~0 8)} is VALID [2022-04-28 05:57:25,632 INFO L290 TraceCheckUtils]: 81: Hoare triple {28971#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28996#(<= |main_#t~post7| 8)} is VALID [2022-04-28 05:57:25,632 INFO L290 TraceCheckUtils]: 82: Hoare triple {28996#(<= |main_#t~post7| 8)} assume !(#t~post7 < 100);havoc #t~post7; {28740#false} is VALID [2022-04-28 05:57:25,632 INFO L290 TraceCheckUtils]: 83: Hoare triple {28740#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {28740#false} is VALID [2022-04-28 05:57:25,632 INFO L290 TraceCheckUtils]: 84: Hoare triple {28740#false} assume !(#t~post8 < 100);havoc #t~post8; {28740#false} is VALID [2022-04-28 05:57:25,632 INFO L290 TraceCheckUtils]: 85: Hoare triple {28740#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {28740#false} is VALID [2022-04-28 05:57:25,632 INFO L290 TraceCheckUtils]: 86: Hoare triple {28740#false} assume !(#t~post6 < 100);havoc #t~post6; {28740#false} is VALID [2022-04-28 05:57:25,632 INFO L272 TraceCheckUtils]: 87: Hoare triple {28740#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28740#false} is VALID [2022-04-28 05:57:25,632 INFO L290 TraceCheckUtils]: 88: Hoare triple {28740#false} ~cond := #in~cond; {28740#false} is VALID [2022-04-28 05:57:25,632 INFO L290 TraceCheckUtils]: 89: Hoare triple {28740#false} assume 0 == ~cond; {28740#false} is VALID [2022-04-28 05:57:25,633 INFO L290 TraceCheckUtils]: 90: Hoare triple {28740#false} assume !false; {28740#false} is VALID [2022-04-28 05:57:25,633 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 24 proven. 152 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:57:25,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:57:26,088 INFO L290 TraceCheckUtils]: 90: Hoare triple {28740#false} assume !false; {28740#false} is VALID [2022-04-28 05:57:26,088 INFO L290 TraceCheckUtils]: 89: Hoare triple {28740#false} assume 0 == ~cond; {28740#false} is VALID [2022-04-28 05:57:26,088 INFO L290 TraceCheckUtils]: 88: Hoare triple {28740#false} ~cond := #in~cond; {28740#false} is VALID [2022-04-28 05:57:26,088 INFO L272 TraceCheckUtils]: 87: Hoare triple {28740#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28740#false} is VALID [2022-04-28 05:57:26,088 INFO L290 TraceCheckUtils]: 86: Hoare triple {28740#false} assume !(#t~post6 < 100);havoc #t~post6; {28740#false} is VALID [2022-04-28 05:57:26,088 INFO L290 TraceCheckUtils]: 85: Hoare triple {28740#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {28740#false} is VALID [2022-04-28 05:57:26,088 INFO L290 TraceCheckUtils]: 84: Hoare triple {28740#false} assume !(#t~post8 < 100);havoc #t~post8; {28740#false} is VALID [2022-04-28 05:57:26,088 INFO L290 TraceCheckUtils]: 83: Hoare triple {28740#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {28740#false} is VALID [2022-04-28 05:57:26,089 INFO L290 TraceCheckUtils]: 82: Hoare triple {29048#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {28740#false} is VALID [2022-04-28 05:57:26,089 INFO L290 TraceCheckUtils]: 81: Hoare triple {29052#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29048#(< |main_#t~post7| 100)} is VALID [2022-04-28 05:57:26,089 INFO L290 TraceCheckUtils]: 80: Hoare triple {29052#(< ~counter~0 100)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {29052#(< ~counter~0 100)} is VALID [2022-04-28 05:57:26,090 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {28739#true} {29052#(< ~counter~0 100)} #96#return; {29052#(< ~counter~0 100)} is VALID [2022-04-28 05:57:26,090 INFO L290 TraceCheckUtils]: 78: Hoare triple {28739#true} assume true; {28739#true} is VALID [2022-04-28 05:57:26,090 INFO L290 TraceCheckUtils]: 77: Hoare triple {28739#true} assume !(0 == ~cond); {28739#true} is VALID [2022-04-28 05:57:26,090 INFO L290 TraceCheckUtils]: 76: Hoare triple {28739#true} ~cond := #in~cond; {28739#true} is VALID [2022-04-28 05:57:26,090 INFO L272 TraceCheckUtils]: 75: Hoare triple {29052#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28739#true} is VALID [2022-04-28 05:57:26,091 INFO L290 TraceCheckUtils]: 74: Hoare triple {29052#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {29052#(< ~counter~0 100)} is VALID [2022-04-28 05:57:26,092 INFO L290 TraceCheckUtils]: 73: Hoare triple {29077#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29052#(< ~counter~0 100)} is VALID [2022-04-28 05:57:26,092 INFO L290 TraceCheckUtils]: 72: Hoare triple {29077#(< ~counter~0 99)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {29077#(< ~counter~0 99)} is VALID [2022-04-28 05:57:26,093 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {28739#true} {29077#(< ~counter~0 99)} #96#return; {29077#(< ~counter~0 99)} is VALID [2022-04-28 05:57:26,093 INFO L290 TraceCheckUtils]: 70: Hoare triple {28739#true} assume true; {28739#true} is VALID [2022-04-28 05:57:26,093 INFO L290 TraceCheckUtils]: 69: Hoare triple {28739#true} assume !(0 == ~cond); {28739#true} is VALID [2022-04-28 05:57:26,093 INFO L290 TraceCheckUtils]: 68: Hoare triple {28739#true} ~cond := #in~cond; {28739#true} is VALID [2022-04-28 05:57:26,093 INFO L272 TraceCheckUtils]: 67: Hoare triple {29077#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28739#true} is VALID [2022-04-28 05:57:26,093 INFO L290 TraceCheckUtils]: 66: Hoare triple {29077#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {29077#(< ~counter~0 99)} is VALID [2022-04-28 05:57:26,094 INFO L290 TraceCheckUtils]: 65: Hoare triple {29102#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29077#(< ~counter~0 99)} is VALID [2022-04-28 05:57:26,094 INFO L290 TraceCheckUtils]: 64: Hoare triple {29102#(< ~counter~0 98)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {29102#(< ~counter~0 98)} is VALID [2022-04-28 05:57:26,095 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {28739#true} {29102#(< ~counter~0 98)} #96#return; {29102#(< ~counter~0 98)} is VALID [2022-04-28 05:57:26,095 INFO L290 TraceCheckUtils]: 62: Hoare triple {28739#true} assume true; {28739#true} is VALID [2022-04-28 05:57:26,095 INFO L290 TraceCheckUtils]: 61: Hoare triple {28739#true} assume !(0 == ~cond); {28739#true} is VALID [2022-04-28 05:57:26,095 INFO L290 TraceCheckUtils]: 60: Hoare triple {28739#true} ~cond := #in~cond; {28739#true} is VALID [2022-04-28 05:57:26,095 INFO L272 TraceCheckUtils]: 59: Hoare triple {29102#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28739#true} is VALID [2022-04-28 05:57:26,095 INFO L290 TraceCheckUtils]: 58: Hoare triple {29102#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {29102#(< ~counter~0 98)} is VALID [2022-04-28 05:57:26,096 INFO L290 TraceCheckUtils]: 57: Hoare triple {29127#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29102#(< ~counter~0 98)} is VALID [2022-04-28 05:57:26,096 INFO L290 TraceCheckUtils]: 56: Hoare triple {29127#(< ~counter~0 97)} assume !!(0 != ~r~0); {29127#(< ~counter~0 97)} is VALID [2022-04-28 05:57:26,097 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {28739#true} {29127#(< ~counter~0 97)} #94#return; {29127#(< ~counter~0 97)} is VALID [2022-04-28 05:57:26,097 INFO L290 TraceCheckUtils]: 54: Hoare triple {28739#true} assume true; {28739#true} is VALID [2022-04-28 05:57:26,097 INFO L290 TraceCheckUtils]: 53: Hoare triple {28739#true} assume !(0 == ~cond); {28739#true} is VALID [2022-04-28 05:57:26,097 INFO L290 TraceCheckUtils]: 52: Hoare triple {28739#true} ~cond := #in~cond; {28739#true} is VALID [2022-04-28 05:57:26,097 INFO L272 TraceCheckUtils]: 51: Hoare triple {29127#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28739#true} is VALID [2022-04-28 05:57:26,098 INFO L290 TraceCheckUtils]: 50: Hoare triple {29127#(< ~counter~0 97)} assume !!(#t~post6 < 100);havoc #t~post6; {29127#(< ~counter~0 97)} is VALID [2022-04-28 05:57:26,098 INFO L290 TraceCheckUtils]: 49: Hoare triple {29152#(< ~counter~0 96)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29127#(< ~counter~0 97)} is VALID [2022-04-28 05:57:26,099 INFO L290 TraceCheckUtils]: 48: Hoare triple {29152#(< ~counter~0 96)} assume !(~r~0 < 0); {29152#(< ~counter~0 96)} is VALID [2022-04-28 05:57:26,099 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {28739#true} {29152#(< ~counter~0 96)} #98#return; {29152#(< ~counter~0 96)} is VALID [2022-04-28 05:57:26,099 INFO L290 TraceCheckUtils]: 46: Hoare triple {28739#true} assume true; {28739#true} is VALID [2022-04-28 05:57:26,099 INFO L290 TraceCheckUtils]: 45: Hoare triple {28739#true} assume !(0 == ~cond); {28739#true} is VALID [2022-04-28 05:57:26,099 INFO L290 TraceCheckUtils]: 44: Hoare triple {28739#true} ~cond := #in~cond; {28739#true} is VALID [2022-04-28 05:57:26,099 INFO L272 TraceCheckUtils]: 43: Hoare triple {29152#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28739#true} is VALID [2022-04-28 05:57:26,100 INFO L290 TraceCheckUtils]: 42: Hoare triple {29152#(< ~counter~0 96)} assume !!(#t~post8 < 100);havoc #t~post8; {29152#(< ~counter~0 96)} is VALID [2022-04-28 05:57:26,100 INFO L290 TraceCheckUtils]: 41: Hoare triple {29177#(< ~counter~0 95)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {29152#(< ~counter~0 96)} is VALID [2022-04-28 05:57:26,101 INFO L290 TraceCheckUtils]: 40: Hoare triple {29177#(< ~counter~0 95)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {29177#(< ~counter~0 95)} is VALID [2022-04-28 05:57:26,101 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {28739#true} {29177#(< ~counter~0 95)} #98#return; {29177#(< ~counter~0 95)} is VALID [2022-04-28 05:57:26,101 INFO L290 TraceCheckUtils]: 38: Hoare triple {28739#true} assume true; {28739#true} is VALID [2022-04-28 05:57:26,101 INFO L290 TraceCheckUtils]: 37: Hoare triple {28739#true} assume !(0 == ~cond); {28739#true} is VALID [2022-04-28 05:57:26,102 INFO L290 TraceCheckUtils]: 36: Hoare triple {28739#true} ~cond := #in~cond; {28739#true} is VALID [2022-04-28 05:57:26,102 INFO L272 TraceCheckUtils]: 35: Hoare triple {29177#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28739#true} is VALID [2022-04-28 05:57:26,102 INFO L290 TraceCheckUtils]: 34: Hoare triple {29177#(< ~counter~0 95)} assume !!(#t~post8 < 100);havoc #t~post8; {29177#(< ~counter~0 95)} is VALID [2022-04-28 05:57:26,103 INFO L290 TraceCheckUtils]: 33: Hoare triple {29202#(< ~counter~0 94)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {29177#(< ~counter~0 95)} is VALID [2022-04-28 05:57:26,103 INFO L290 TraceCheckUtils]: 32: Hoare triple {29202#(< ~counter~0 94)} assume !(~r~0 > 0); {29202#(< ~counter~0 94)} is VALID [2022-04-28 05:57:26,103 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {28739#true} {29202#(< ~counter~0 94)} #96#return; {29202#(< ~counter~0 94)} is VALID [2022-04-28 05:57:26,104 INFO L290 TraceCheckUtils]: 30: Hoare triple {28739#true} assume true; {28739#true} is VALID [2022-04-28 05:57:26,104 INFO L290 TraceCheckUtils]: 29: Hoare triple {28739#true} assume !(0 == ~cond); {28739#true} is VALID [2022-04-28 05:57:26,104 INFO L290 TraceCheckUtils]: 28: Hoare triple {28739#true} ~cond := #in~cond; {28739#true} is VALID [2022-04-28 05:57:26,104 INFO L272 TraceCheckUtils]: 27: Hoare triple {29202#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28739#true} is VALID [2022-04-28 05:57:26,104 INFO L290 TraceCheckUtils]: 26: Hoare triple {29202#(< ~counter~0 94)} assume !!(#t~post7 < 100);havoc #t~post7; {29202#(< ~counter~0 94)} is VALID [2022-04-28 05:57:26,105 INFO L290 TraceCheckUtils]: 25: Hoare triple {29227#(< ~counter~0 93)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29202#(< ~counter~0 94)} is VALID [2022-04-28 05:57:26,105 INFO L290 TraceCheckUtils]: 24: Hoare triple {29227#(< ~counter~0 93)} assume !!(0 != ~r~0); {29227#(< ~counter~0 93)} is VALID [2022-04-28 05:57:26,106 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {28739#true} {29227#(< ~counter~0 93)} #94#return; {29227#(< ~counter~0 93)} is VALID [2022-04-28 05:57:26,106 INFO L290 TraceCheckUtils]: 22: Hoare triple {28739#true} assume true; {28739#true} is VALID [2022-04-28 05:57:26,106 INFO L290 TraceCheckUtils]: 21: Hoare triple {28739#true} assume !(0 == ~cond); {28739#true} is VALID [2022-04-28 05:57:26,106 INFO L290 TraceCheckUtils]: 20: Hoare triple {28739#true} ~cond := #in~cond; {28739#true} is VALID [2022-04-28 05:57:26,106 INFO L272 TraceCheckUtils]: 19: Hoare triple {29227#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28739#true} is VALID [2022-04-28 05:57:26,106 INFO L290 TraceCheckUtils]: 18: Hoare triple {29227#(< ~counter~0 93)} assume !!(#t~post6 < 100);havoc #t~post6; {29227#(< ~counter~0 93)} is VALID [2022-04-28 05:57:26,107 INFO L290 TraceCheckUtils]: 17: Hoare triple {29252#(< ~counter~0 92)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29227#(< ~counter~0 93)} is VALID [2022-04-28 05:57:26,107 INFO L290 TraceCheckUtils]: 16: Hoare triple {29252#(< ~counter~0 92)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {29252#(< ~counter~0 92)} is VALID [2022-04-28 05:57:26,108 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {28739#true} {29252#(< ~counter~0 92)} #92#return; {29252#(< ~counter~0 92)} is VALID [2022-04-28 05:57:26,108 INFO L290 TraceCheckUtils]: 14: Hoare triple {28739#true} assume true; {28739#true} is VALID [2022-04-28 05:57:26,108 INFO L290 TraceCheckUtils]: 13: Hoare triple {28739#true} assume !(0 == ~cond); {28739#true} is VALID [2022-04-28 05:57:26,108 INFO L290 TraceCheckUtils]: 12: Hoare triple {28739#true} ~cond := #in~cond; {28739#true} is VALID [2022-04-28 05:57:26,108 INFO L272 TraceCheckUtils]: 11: Hoare triple {29252#(< ~counter~0 92)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {28739#true} is VALID [2022-04-28 05:57:26,109 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {28739#true} {29252#(< ~counter~0 92)} #90#return; {29252#(< ~counter~0 92)} is VALID [2022-04-28 05:57:26,109 INFO L290 TraceCheckUtils]: 9: Hoare triple {28739#true} assume true; {28739#true} is VALID [2022-04-28 05:57:26,109 INFO L290 TraceCheckUtils]: 8: Hoare triple {28739#true} assume !(0 == ~cond); {28739#true} is VALID [2022-04-28 05:57:26,109 INFO L290 TraceCheckUtils]: 7: Hoare triple {28739#true} ~cond := #in~cond; {28739#true} is VALID [2022-04-28 05:57:26,109 INFO L272 TraceCheckUtils]: 6: Hoare triple {29252#(< ~counter~0 92)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {28739#true} is VALID [2022-04-28 05:57:26,109 INFO L290 TraceCheckUtils]: 5: Hoare triple {29252#(< ~counter~0 92)} 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 92)} is VALID [2022-04-28 05:57:26,109 INFO L272 TraceCheckUtils]: 4: Hoare triple {29252#(< ~counter~0 92)} call #t~ret9 := main(); {29252#(< ~counter~0 92)} is VALID [2022-04-28 05:57:26,110 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29252#(< ~counter~0 92)} {28739#true} #102#return; {29252#(< ~counter~0 92)} is VALID [2022-04-28 05:57:26,110 INFO L290 TraceCheckUtils]: 2: Hoare triple {29252#(< ~counter~0 92)} assume true; {29252#(< ~counter~0 92)} is VALID [2022-04-28 05:57:26,111 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 92)} is VALID [2022-04-28 05:57:26,111 INFO L272 TraceCheckUtils]: 0: Hoare triple {28739#true} call ULTIMATE.init(); {28739#true} is VALID [2022-04-28 05:57:26,111 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 24 proven. 40 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-04-28 05:57:26,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:57:26,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934595959] [2022-04-28 05:57:26,111 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:57:26,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156176755] [2022-04-28 05:57:26,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156176755] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:57:26,111 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:57:26,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2022-04-28 05:57:26,112 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:57:26,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [230488649] [2022-04-28 05:57:26,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [230488649] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:57:26,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:57:26,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 05:57:26,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933222063] [2022-04-28 05:57:26,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:57:26,112 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 11 states have internal predecessors, (64), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) Word has length 91 [2022-04-28 05:57:26,112 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:57:26,113 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 11 states have internal predecessors, (64), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-28 05:57:26,179 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:26,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 05:57:26,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:57:26,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 05:57:26,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=267, Unknown=0, NotChecked=0, Total=462 [2022-04-28 05:57:26,180 INFO L87 Difference]: Start difference. First operand 342 states and 460 transitions. Second operand has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 11 states have internal predecessors, (64), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-28 05:57:27,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:27,092 INFO L93 Difference]: Finished difference Result 427 states and 585 transitions. [2022-04-28 05:57:27,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 05:57:27,093 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 11 states have internal predecessors, (64), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) Word has length 91 [2022-04-28 05:57:27,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:57:27,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 11 states have internal predecessors, (64), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-28 05:57:27,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 197 transitions. [2022-04-28 05:57:27,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 11 states have internal predecessors, (64), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-28 05:57:27,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 197 transitions. [2022-04-28 05:57:27,096 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 197 transitions. [2022-04-28 05:57:27,242 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 197 edges. 197 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:27,248 INFO L225 Difference]: With dead ends: 427 [2022-04-28 05:57:27,248 INFO L226 Difference]: Without dead ends: 342 [2022-04-28 05:57:27,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=335, Invalid=477, Unknown=0, NotChecked=0, Total=812 [2022-04-28 05:57:27,249 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 95 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 05:57:27,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 217 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 05:57:27,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2022-04-28 05:57:27,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2022-04-28 05:57:27,744 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:57:27,744 INFO L82 GeneralOperation]: Start isEquivalent. First operand 342 states. Second operand has 342 states, 255 states have (on average 1.2156862745098038) internal successors, (310), 261 states have internal predecessors, (310), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-28 05:57:27,745 INFO L74 IsIncluded]: Start isIncluded. First operand 342 states. Second operand has 342 states, 255 states have (on average 1.2156862745098038) internal successors, (310), 261 states have internal predecessors, (310), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-28 05:57:27,745 INFO L87 Difference]: Start difference. First operand 342 states. Second operand has 342 states, 255 states have (on average 1.2156862745098038) internal successors, (310), 261 states have internal predecessors, (310), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-28 05:57:27,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:27,750 INFO L93 Difference]: Finished difference Result 342 states and 456 transitions. [2022-04-28 05:57:27,751 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 456 transitions. [2022-04-28 05:57:27,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:57:27,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:57:27,752 INFO L74 IsIncluded]: Start isIncluded. First operand has 342 states, 255 states have (on average 1.2156862745098038) internal successors, (310), 261 states have internal predecessors, (310), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) Second operand 342 states. [2022-04-28 05:57:27,752 INFO L87 Difference]: Start difference. First operand has 342 states, 255 states have (on average 1.2156862745098038) internal successors, (310), 261 states have internal predecessors, (310), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) Second operand 342 states. [2022-04-28 05:57:27,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:27,758 INFO L93 Difference]: Finished difference Result 342 states and 456 transitions. [2022-04-28 05:57:27,758 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 456 transitions. [2022-04-28 05:57:27,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:57:27,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:57:27,758 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:57:27,758 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:57:27,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 255 states have (on average 1.2156862745098038) internal successors, (310), 261 states have internal predecessors, (310), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-28 05:57:27,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 456 transitions. [2022-04-28 05:57:27,766 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 456 transitions. Word has length 91 [2022-04-28 05:57:27,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:57:27,766 INFO L495 AbstractCegarLoop]: Abstraction has 342 states and 456 transitions. [2022-04-28 05:57:27,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 11 states have internal predecessors, (64), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-28 05:57:27,766 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 342 states and 456 transitions. [2022-04-28 05:57:30,623 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-28 05:57:30,623 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 456 transitions. [2022-04-28 05:57:30,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-04-28 05:57:30,624 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:57:30,624 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:57:30,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-04-28 05:57:30,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-04-28 05:57:30,828 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:57:30,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:57:30,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1660747519, now seen corresponding path program 7 times [2022-04-28 05:57:30,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:57:30,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1623328066] [2022-04-28 05:57:30,829 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:57:30,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1660747519, now seen corresponding path program 8 times [2022-04-28 05:57:30,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:57:30,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660879184] [2022-04-28 05:57:30,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:57:30,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:57:30,840 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:57:30,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [438696943] [2022-04-28 05:57:30,840 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:57:30,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:57:30,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:57:30,841 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:57:30,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-04-28 05:57:30,890 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:57:30,890 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:57:30,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 05:57:30,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:57:30,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:57:31,357 INFO L272 TraceCheckUtils]: 0: Hoare triple {31542#true} call ULTIMATE.init(); {31542#true} is VALID [2022-04-28 05:57:31,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {31542#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {31550#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:31,358 INFO L290 TraceCheckUtils]: 2: Hoare triple {31550#(<= ~counter~0 0)} assume true; {31550#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:31,358 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31550#(<= ~counter~0 0)} {31542#true} #102#return; {31550#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:31,358 INFO L272 TraceCheckUtils]: 4: Hoare triple {31550#(<= ~counter~0 0)} call #t~ret9 := main(); {31550#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:31,358 INFO L290 TraceCheckUtils]: 5: Hoare triple {31550#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {31550#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:31,359 INFO L272 TraceCheckUtils]: 6: Hoare triple {31550#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {31550#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:31,359 INFO L290 TraceCheckUtils]: 7: Hoare triple {31550#(<= ~counter~0 0)} ~cond := #in~cond; {31550#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:31,359 INFO L290 TraceCheckUtils]: 8: Hoare triple {31550#(<= ~counter~0 0)} assume !(0 == ~cond); {31550#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:31,360 INFO L290 TraceCheckUtils]: 9: Hoare triple {31550#(<= ~counter~0 0)} assume true; {31550#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:31,360 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {31550#(<= ~counter~0 0)} {31550#(<= ~counter~0 0)} #90#return; {31550#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:31,361 INFO L272 TraceCheckUtils]: 11: Hoare triple {31550#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {31550#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:31,361 INFO L290 TraceCheckUtils]: 12: Hoare triple {31550#(<= ~counter~0 0)} ~cond := #in~cond; {31550#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:31,361 INFO L290 TraceCheckUtils]: 13: Hoare triple {31550#(<= ~counter~0 0)} assume !(0 == ~cond); {31550#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:31,361 INFO L290 TraceCheckUtils]: 14: Hoare triple {31550#(<= ~counter~0 0)} assume true; {31550#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:31,362 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {31550#(<= ~counter~0 0)} {31550#(<= ~counter~0 0)} #92#return; {31550#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:31,362 INFO L290 TraceCheckUtils]: 16: Hoare triple {31550#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {31550#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:31,363 INFO L290 TraceCheckUtils]: 17: Hoare triple {31550#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31599#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:31,363 INFO L290 TraceCheckUtils]: 18: Hoare triple {31599#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {31599#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:31,364 INFO L272 TraceCheckUtils]: 19: Hoare triple {31599#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {31599#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:31,364 INFO L290 TraceCheckUtils]: 20: Hoare triple {31599#(<= ~counter~0 1)} ~cond := #in~cond; {31599#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:31,364 INFO L290 TraceCheckUtils]: 21: Hoare triple {31599#(<= ~counter~0 1)} assume !(0 == ~cond); {31599#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:31,365 INFO L290 TraceCheckUtils]: 22: Hoare triple {31599#(<= ~counter~0 1)} assume true; {31599#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:31,365 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {31599#(<= ~counter~0 1)} {31599#(<= ~counter~0 1)} #94#return; {31599#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:31,365 INFO L290 TraceCheckUtils]: 24: Hoare triple {31599#(<= ~counter~0 1)} assume !!(0 != ~r~0); {31599#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:31,366 INFO L290 TraceCheckUtils]: 25: Hoare triple {31599#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {31624#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:31,366 INFO L290 TraceCheckUtils]: 26: Hoare triple {31624#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {31624#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:31,367 INFO L272 TraceCheckUtils]: 27: Hoare triple {31624#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {31624#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:31,367 INFO L290 TraceCheckUtils]: 28: Hoare triple {31624#(<= ~counter~0 2)} ~cond := #in~cond; {31624#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:31,367 INFO L290 TraceCheckUtils]: 29: Hoare triple {31624#(<= ~counter~0 2)} assume !(0 == ~cond); {31624#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:31,367 INFO L290 TraceCheckUtils]: 30: Hoare triple {31624#(<= ~counter~0 2)} assume true; {31624#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:31,368 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {31624#(<= ~counter~0 2)} {31624#(<= ~counter~0 2)} #96#return; {31624#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:31,368 INFO L290 TraceCheckUtils]: 32: Hoare triple {31624#(<= ~counter~0 2)} assume !(~r~0 > 0); {31624#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:31,369 INFO L290 TraceCheckUtils]: 33: Hoare triple {31624#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {31649#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:31,369 INFO L290 TraceCheckUtils]: 34: Hoare triple {31649#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {31649#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:31,370 INFO L272 TraceCheckUtils]: 35: Hoare triple {31649#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {31649#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:31,370 INFO L290 TraceCheckUtils]: 36: Hoare triple {31649#(<= ~counter~0 3)} ~cond := #in~cond; {31649#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:31,370 INFO L290 TraceCheckUtils]: 37: Hoare triple {31649#(<= ~counter~0 3)} assume !(0 == ~cond); {31649#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:31,370 INFO L290 TraceCheckUtils]: 38: Hoare triple {31649#(<= ~counter~0 3)} assume true; {31649#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:31,371 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {31649#(<= ~counter~0 3)} {31649#(<= ~counter~0 3)} #98#return; {31649#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:31,371 INFO L290 TraceCheckUtils]: 40: Hoare triple {31649#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {31649#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:31,372 INFO L290 TraceCheckUtils]: 41: Hoare triple {31649#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {31674#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:31,372 INFO L290 TraceCheckUtils]: 42: Hoare triple {31674#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {31674#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:31,372 INFO L272 TraceCheckUtils]: 43: Hoare triple {31674#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {31674#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:31,373 INFO L290 TraceCheckUtils]: 44: Hoare triple {31674#(<= ~counter~0 4)} ~cond := #in~cond; {31674#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:31,373 INFO L290 TraceCheckUtils]: 45: Hoare triple {31674#(<= ~counter~0 4)} assume !(0 == ~cond); {31674#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:31,373 INFO L290 TraceCheckUtils]: 46: Hoare triple {31674#(<= ~counter~0 4)} assume true; {31674#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:31,374 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {31674#(<= ~counter~0 4)} {31674#(<= ~counter~0 4)} #98#return; {31674#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:31,374 INFO L290 TraceCheckUtils]: 48: Hoare triple {31674#(<= ~counter~0 4)} assume !(~r~0 < 0); {31674#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:31,375 INFO L290 TraceCheckUtils]: 49: Hoare triple {31674#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31699#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:31,375 INFO L290 TraceCheckUtils]: 50: Hoare triple {31699#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {31699#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:31,375 INFO L272 TraceCheckUtils]: 51: Hoare triple {31699#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {31699#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:31,376 INFO L290 TraceCheckUtils]: 52: Hoare triple {31699#(<= ~counter~0 5)} ~cond := #in~cond; {31699#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:31,376 INFO L290 TraceCheckUtils]: 53: Hoare triple {31699#(<= ~counter~0 5)} assume !(0 == ~cond); {31699#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:31,376 INFO L290 TraceCheckUtils]: 54: Hoare triple {31699#(<= ~counter~0 5)} assume true; {31699#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:31,377 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {31699#(<= ~counter~0 5)} {31699#(<= ~counter~0 5)} #94#return; {31699#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:31,377 INFO L290 TraceCheckUtils]: 56: Hoare triple {31699#(<= ~counter~0 5)} assume !!(0 != ~r~0); {31699#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:31,378 INFO L290 TraceCheckUtils]: 57: Hoare triple {31699#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {31724#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:31,378 INFO L290 TraceCheckUtils]: 58: Hoare triple {31724#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {31724#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:31,378 INFO L272 TraceCheckUtils]: 59: Hoare triple {31724#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {31724#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:31,379 INFO L290 TraceCheckUtils]: 60: Hoare triple {31724#(<= ~counter~0 6)} ~cond := #in~cond; {31724#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:31,379 INFO L290 TraceCheckUtils]: 61: Hoare triple {31724#(<= ~counter~0 6)} assume !(0 == ~cond); {31724#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:31,379 INFO L290 TraceCheckUtils]: 62: Hoare triple {31724#(<= ~counter~0 6)} assume true; {31724#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:31,380 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {31724#(<= ~counter~0 6)} {31724#(<= ~counter~0 6)} #96#return; {31724#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:31,380 INFO L290 TraceCheckUtils]: 64: Hoare triple {31724#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {31724#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:31,381 INFO L290 TraceCheckUtils]: 65: Hoare triple {31724#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {31749#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:31,381 INFO L290 TraceCheckUtils]: 66: Hoare triple {31749#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {31749#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:31,381 INFO L272 TraceCheckUtils]: 67: Hoare triple {31749#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {31749#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:31,382 INFO L290 TraceCheckUtils]: 68: Hoare triple {31749#(<= ~counter~0 7)} ~cond := #in~cond; {31749#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:31,382 INFO L290 TraceCheckUtils]: 69: Hoare triple {31749#(<= ~counter~0 7)} assume !(0 == ~cond); {31749#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:31,382 INFO L290 TraceCheckUtils]: 70: Hoare triple {31749#(<= ~counter~0 7)} assume true; {31749#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:31,383 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {31749#(<= ~counter~0 7)} {31749#(<= ~counter~0 7)} #96#return; {31749#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:31,383 INFO L290 TraceCheckUtils]: 72: Hoare triple {31749#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {31749#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:31,384 INFO L290 TraceCheckUtils]: 73: Hoare triple {31749#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {31774#(<= ~counter~0 8)} is VALID [2022-04-28 05:57:31,384 INFO L290 TraceCheckUtils]: 74: Hoare triple {31774#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {31774#(<= ~counter~0 8)} is VALID [2022-04-28 05:57:31,384 INFO L272 TraceCheckUtils]: 75: Hoare triple {31774#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {31774#(<= ~counter~0 8)} is VALID [2022-04-28 05:57:31,385 INFO L290 TraceCheckUtils]: 76: Hoare triple {31774#(<= ~counter~0 8)} ~cond := #in~cond; {31774#(<= ~counter~0 8)} is VALID [2022-04-28 05:57:31,385 INFO L290 TraceCheckUtils]: 77: Hoare triple {31774#(<= ~counter~0 8)} assume !(0 == ~cond); {31774#(<= ~counter~0 8)} is VALID [2022-04-28 05:57:31,385 INFO L290 TraceCheckUtils]: 78: Hoare triple {31774#(<= ~counter~0 8)} assume true; {31774#(<= ~counter~0 8)} is VALID [2022-04-28 05:57:31,386 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {31774#(<= ~counter~0 8)} {31774#(<= ~counter~0 8)} #96#return; {31774#(<= ~counter~0 8)} is VALID [2022-04-28 05:57:31,386 INFO L290 TraceCheckUtils]: 80: Hoare triple {31774#(<= ~counter~0 8)} assume !(~r~0 > 0); {31774#(<= ~counter~0 8)} is VALID [2022-04-28 05:57:31,387 INFO L290 TraceCheckUtils]: 81: Hoare triple {31774#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {31799#(<= ~counter~0 9)} is VALID [2022-04-28 05:57:31,387 INFO L290 TraceCheckUtils]: 82: Hoare triple {31799#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {31799#(<= ~counter~0 9)} is VALID [2022-04-28 05:57:31,387 INFO L272 TraceCheckUtils]: 83: Hoare triple {31799#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {31799#(<= ~counter~0 9)} is VALID [2022-04-28 05:57:31,388 INFO L290 TraceCheckUtils]: 84: Hoare triple {31799#(<= ~counter~0 9)} ~cond := #in~cond; {31799#(<= ~counter~0 9)} is VALID [2022-04-28 05:57:31,388 INFO L290 TraceCheckUtils]: 85: Hoare triple {31799#(<= ~counter~0 9)} assume !(0 == ~cond); {31799#(<= ~counter~0 9)} is VALID [2022-04-28 05:57:31,388 INFO L290 TraceCheckUtils]: 86: Hoare triple {31799#(<= ~counter~0 9)} assume true; {31799#(<= ~counter~0 9)} is VALID [2022-04-28 05:57:31,389 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {31799#(<= ~counter~0 9)} {31799#(<= ~counter~0 9)} #98#return; {31799#(<= ~counter~0 9)} is VALID [2022-04-28 05:57:31,389 INFO L290 TraceCheckUtils]: 88: Hoare triple {31799#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {31799#(<= ~counter~0 9)} is VALID [2022-04-28 05:57:31,389 INFO L290 TraceCheckUtils]: 89: Hoare triple {31799#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {31824#(<= |main_#t~post8| 9)} is VALID [2022-04-28 05:57:31,390 INFO L290 TraceCheckUtils]: 90: Hoare triple {31824#(<= |main_#t~post8| 9)} assume !(#t~post8 < 100);havoc #t~post8; {31543#false} is VALID [2022-04-28 05:57:31,390 INFO L290 TraceCheckUtils]: 91: Hoare triple {31543#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31543#false} is VALID [2022-04-28 05:57:31,390 INFO L290 TraceCheckUtils]: 92: Hoare triple {31543#false} assume !(#t~post6 < 100);havoc #t~post6; {31543#false} is VALID [2022-04-28 05:57:31,390 INFO L272 TraceCheckUtils]: 93: Hoare triple {31543#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {31543#false} is VALID [2022-04-28 05:57:31,390 INFO L290 TraceCheckUtils]: 94: Hoare triple {31543#false} ~cond := #in~cond; {31543#false} is VALID [2022-04-28 05:57:31,390 INFO L290 TraceCheckUtils]: 95: Hoare triple {31543#false} assume 0 == ~cond; {31543#false} is VALID [2022-04-28 05:57:31,390 INFO L290 TraceCheckUtils]: 96: Hoare triple {31543#false} assume !false; {31543#false} is VALID [2022-04-28 05:57:31,390 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 22 proven. 190 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:57:31,390 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:57:31,874 INFO L290 TraceCheckUtils]: 96: Hoare triple {31543#false} assume !false; {31543#false} is VALID [2022-04-28 05:57:31,874 INFO L290 TraceCheckUtils]: 95: Hoare triple {31543#false} assume 0 == ~cond; {31543#false} is VALID [2022-04-28 05:57:31,874 INFO L290 TraceCheckUtils]: 94: Hoare triple {31543#false} ~cond := #in~cond; {31543#false} is VALID [2022-04-28 05:57:31,874 INFO L272 TraceCheckUtils]: 93: Hoare triple {31543#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {31543#false} is VALID [2022-04-28 05:57:31,874 INFO L290 TraceCheckUtils]: 92: Hoare triple {31543#false} assume !(#t~post6 < 100);havoc #t~post6; {31543#false} is VALID [2022-04-28 05:57:31,874 INFO L290 TraceCheckUtils]: 91: Hoare triple {31543#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31543#false} is VALID [2022-04-28 05:57:31,875 INFO L290 TraceCheckUtils]: 90: Hoare triple {31864#(< |main_#t~post8| 100)} assume !(#t~post8 < 100);havoc #t~post8; {31543#false} is VALID [2022-04-28 05:57:31,875 INFO L290 TraceCheckUtils]: 89: Hoare triple {31868#(< ~counter~0 100)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {31864#(< |main_#t~post8| 100)} is VALID [2022-04-28 05:57:31,875 INFO L290 TraceCheckUtils]: 88: Hoare triple {31868#(< ~counter~0 100)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {31868#(< ~counter~0 100)} is VALID [2022-04-28 05:57:31,876 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {31542#true} {31868#(< ~counter~0 100)} #98#return; {31868#(< ~counter~0 100)} is VALID [2022-04-28 05:57:31,876 INFO L290 TraceCheckUtils]: 86: Hoare triple {31542#true} assume true; {31542#true} is VALID [2022-04-28 05:57:31,876 INFO L290 TraceCheckUtils]: 85: Hoare triple {31542#true} assume !(0 == ~cond); {31542#true} is VALID [2022-04-28 05:57:31,876 INFO L290 TraceCheckUtils]: 84: Hoare triple {31542#true} ~cond := #in~cond; {31542#true} is VALID [2022-04-28 05:57:31,876 INFO L272 TraceCheckUtils]: 83: Hoare triple {31868#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {31542#true} is VALID [2022-04-28 05:57:31,876 INFO L290 TraceCheckUtils]: 82: Hoare triple {31868#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {31868#(< ~counter~0 100)} is VALID [2022-04-28 05:57:31,877 INFO L290 TraceCheckUtils]: 81: Hoare triple {31893#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {31868#(< ~counter~0 100)} is VALID [2022-04-28 05:57:31,877 INFO L290 TraceCheckUtils]: 80: Hoare triple {31893#(< ~counter~0 99)} assume !(~r~0 > 0); {31893#(< ~counter~0 99)} is VALID [2022-04-28 05:57:31,878 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {31542#true} {31893#(< ~counter~0 99)} #96#return; {31893#(< ~counter~0 99)} is VALID [2022-04-28 05:57:31,878 INFO L290 TraceCheckUtils]: 78: Hoare triple {31542#true} assume true; {31542#true} is VALID [2022-04-28 05:57:31,878 INFO L290 TraceCheckUtils]: 77: Hoare triple {31542#true} assume !(0 == ~cond); {31542#true} is VALID [2022-04-28 05:57:31,878 INFO L290 TraceCheckUtils]: 76: Hoare triple {31542#true} ~cond := #in~cond; {31542#true} is VALID [2022-04-28 05:57:31,878 INFO L272 TraceCheckUtils]: 75: Hoare triple {31893#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {31542#true} is VALID [2022-04-28 05:57:31,878 INFO L290 TraceCheckUtils]: 74: Hoare triple {31893#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {31893#(< ~counter~0 99)} is VALID [2022-04-28 05:57:31,879 INFO L290 TraceCheckUtils]: 73: Hoare triple {31918#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {31893#(< ~counter~0 99)} is VALID [2022-04-28 05:57:31,879 INFO L290 TraceCheckUtils]: 72: Hoare triple {31918#(< ~counter~0 98)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {31918#(< ~counter~0 98)} is VALID [2022-04-28 05:57:31,880 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {31542#true} {31918#(< ~counter~0 98)} #96#return; {31918#(< ~counter~0 98)} is VALID [2022-04-28 05:57:31,880 INFO L290 TraceCheckUtils]: 70: Hoare triple {31542#true} assume true; {31542#true} is VALID [2022-04-28 05:57:31,880 INFO L290 TraceCheckUtils]: 69: Hoare triple {31542#true} assume !(0 == ~cond); {31542#true} is VALID [2022-04-28 05:57:31,880 INFO L290 TraceCheckUtils]: 68: Hoare triple {31542#true} ~cond := #in~cond; {31542#true} is VALID [2022-04-28 05:57:31,880 INFO L272 TraceCheckUtils]: 67: Hoare triple {31918#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {31542#true} is VALID [2022-04-28 05:57:31,880 INFO L290 TraceCheckUtils]: 66: Hoare triple {31918#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {31918#(< ~counter~0 98)} is VALID [2022-04-28 05:57:31,881 INFO L290 TraceCheckUtils]: 65: Hoare triple {31943#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {31918#(< ~counter~0 98)} is VALID [2022-04-28 05:57:31,881 INFO L290 TraceCheckUtils]: 64: Hoare triple {31943#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {31943#(< ~counter~0 97)} is VALID [2022-04-28 05:57:31,882 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {31542#true} {31943#(< ~counter~0 97)} #96#return; {31943#(< ~counter~0 97)} is VALID [2022-04-28 05:57:31,882 INFO L290 TraceCheckUtils]: 62: Hoare triple {31542#true} assume true; {31542#true} is VALID [2022-04-28 05:57:31,882 INFO L290 TraceCheckUtils]: 61: Hoare triple {31542#true} assume !(0 == ~cond); {31542#true} is VALID [2022-04-28 05:57:31,882 INFO L290 TraceCheckUtils]: 60: Hoare triple {31542#true} ~cond := #in~cond; {31542#true} is VALID [2022-04-28 05:57:31,882 INFO L272 TraceCheckUtils]: 59: Hoare triple {31943#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {31542#true} is VALID [2022-04-28 05:57:31,882 INFO L290 TraceCheckUtils]: 58: Hoare triple {31943#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {31943#(< ~counter~0 97)} is VALID [2022-04-28 05:57:31,883 INFO L290 TraceCheckUtils]: 57: Hoare triple {31968#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {31943#(< ~counter~0 97)} is VALID [2022-04-28 05:57:31,883 INFO L290 TraceCheckUtils]: 56: Hoare triple {31968#(< ~counter~0 96)} assume !!(0 != ~r~0); {31968#(< ~counter~0 96)} is VALID [2022-04-28 05:57:31,883 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {31542#true} {31968#(< ~counter~0 96)} #94#return; {31968#(< ~counter~0 96)} is VALID [2022-04-28 05:57:31,883 INFO L290 TraceCheckUtils]: 54: Hoare triple {31542#true} assume true; {31542#true} is VALID [2022-04-28 05:57:31,884 INFO L290 TraceCheckUtils]: 53: Hoare triple {31542#true} assume !(0 == ~cond); {31542#true} is VALID [2022-04-28 05:57:31,884 INFO L290 TraceCheckUtils]: 52: Hoare triple {31542#true} ~cond := #in~cond; {31542#true} is VALID [2022-04-28 05:57:31,884 INFO L272 TraceCheckUtils]: 51: Hoare triple {31968#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {31542#true} is VALID [2022-04-28 05:57:31,884 INFO L290 TraceCheckUtils]: 50: Hoare triple {31968#(< ~counter~0 96)} assume !!(#t~post6 < 100);havoc #t~post6; {31968#(< ~counter~0 96)} is VALID [2022-04-28 05:57:31,884 INFO L290 TraceCheckUtils]: 49: Hoare triple {31993#(< ~counter~0 95)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31968#(< ~counter~0 96)} is VALID [2022-04-28 05:57:31,885 INFO L290 TraceCheckUtils]: 48: Hoare triple {31993#(< ~counter~0 95)} assume !(~r~0 < 0); {31993#(< ~counter~0 95)} is VALID [2022-04-28 05:57:31,885 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {31542#true} {31993#(< ~counter~0 95)} #98#return; {31993#(< ~counter~0 95)} is VALID [2022-04-28 05:57:31,885 INFO L290 TraceCheckUtils]: 46: Hoare triple {31542#true} assume true; {31542#true} is VALID [2022-04-28 05:57:31,885 INFO L290 TraceCheckUtils]: 45: Hoare triple {31542#true} assume !(0 == ~cond); {31542#true} is VALID [2022-04-28 05:57:31,885 INFO L290 TraceCheckUtils]: 44: Hoare triple {31542#true} ~cond := #in~cond; {31542#true} is VALID [2022-04-28 05:57:31,885 INFO L272 TraceCheckUtils]: 43: Hoare triple {31993#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {31542#true} is VALID [2022-04-28 05:57:31,886 INFO L290 TraceCheckUtils]: 42: Hoare triple {31993#(< ~counter~0 95)} assume !!(#t~post8 < 100);havoc #t~post8; {31993#(< ~counter~0 95)} is VALID [2022-04-28 05:57:31,886 INFO L290 TraceCheckUtils]: 41: Hoare triple {32018#(< ~counter~0 94)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {31993#(< ~counter~0 95)} is VALID [2022-04-28 05:57:31,886 INFO L290 TraceCheckUtils]: 40: Hoare triple {32018#(< ~counter~0 94)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {32018#(< ~counter~0 94)} is VALID [2022-04-28 05:57:31,887 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {31542#true} {32018#(< ~counter~0 94)} #98#return; {32018#(< ~counter~0 94)} is VALID [2022-04-28 05:57:31,887 INFO L290 TraceCheckUtils]: 38: Hoare triple {31542#true} assume true; {31542#true} is VALID [2022-04-28 05:57:31,887 INFO L290 TraceCheckUtils]: 37: Hoare triple {31542#true} assume !(0 == ~cond); {31542#true} is VALID [2022-04-28 05:57:31,887 INFO L290 TraceCheckUtils]: 36: Hoare triple {31542#true} ~cond := #in~cond; {31542#true} is VALID [2022-04-28 05:57:31,887 INFO L272 TraceCheckUtils]: 35: Hoare triple {32018#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {31542#true} is VALID [2022-04-28 05:57:31,887 INFO L290 TraceCheckUtils]: 34: Hoare triple {32018#(< ~counter~0 94)} assume !!(#t~post8 < 100);havoc #t~post8; {32018#(< ~counter~0 94)} is VALID [2022-04-28 05:57:31,888 INFO L290 TraceCheckUtils]: 33: Hoare triple {32043#(< ~counter~0 93)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {32018#(< ~counter~0 94)} is VALID [2022-04-28 05:57:31,888 INFO L290 TraceCheckUtils]: 32: Hoare triple {32043#(< ~counter~0 93)} assume !(~r~0 > 0); {32043#(< ~counter~0 93)} is VALID [2022-04-28 05:57:31,889 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {31542#true} {32043#(< ~counter~0 93)} #96#return; {32043#(< ~counter~0 93)} is VALID [2022-04-28 05:57:31,889 INFO L290 TraceCheckUtils]: 30: Hoare triple {31542#true} assume true; {31542#true} is VALID [2022-04-28 05:57:31,889 INFO L290 TraceCheckUtils]: 29: Hoare triple {31542#true} assume !(0 == ~cond); {31542#true} is VALID [2022-04-28 05:57:31,889 INFO L290 TraceCheckUtils]: 28: Hoare triple {31542#true} ~cond := #in~cond; {31542#true} is VALID [2022-04-28 05:57:31,889 INFO L272 TraceCheckUtils]: 27: Hoare triple {32043#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {31542#true} is VALID [2022-04-28 05:57:31,889 INFO L290 TraceCheckUtils]: 26: Hoare triple {32043#(< ~counter~0 93)} assume !!(#t~post7 < 100);havoc #t~post7; {32043#(< ~counter~0 93)} is VALID [2022-04-28 05:57:31,890 INFO L290 TraceCheckUtils]: 25: Hoare triple {32068#(< ~counter~0 92)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32043#(< ~counter~0 93)} is VALID [2022-04-28 05:57:31,890 INFO L290 TraceCheckUtils]: 24: Hoare triple {32068#(< ~counter~0 92)} assume !!(0 != ~r~0); {32068#(< ~counter~0 92)} is VALID [2022-04-28 05:57:31,890 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {31542#true} {32068#(< ~counter~0 92)} #94#return; {32068#(< ~counter~0 92)} is VALID [2022-04-28 05:57:31,891 INFO L290 TraceCheckUtils]: 22: Hoare triple {31542#true} assume true; {31542#true} is VALID [2022-04-28 05:57:31,891 INFO L290 TraceCheckUtils]: 21: Hoare triple {31542#true} assume !(0 == ~cond); {31542#true} is VALID [2022-04-28 05:57:31,891 INFO L290 TraceCheckUtils]: 20: Hoare triple {31542#true} ~cond := #in~cond; {31542#true} is VALID [2022-04-28 05:57:31,891 INFO L272 TraceCheckUtils]: 19: Hoare triple {32068#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {31542#true} is VALID [2022-04-28 05:57:31,891 INFO L290 TraceCheckUtils]: 18: Hoare triple {32068#(< ~counter~0 92)} assume !!(#t~post6 < 100);havoc #t~post6; {32068#(< ~counter~0 92)} is VALID [2022-04-28 05:57:31,892 INFO L290 TraceCheckUtils]: 17: Hoare triple {32093#(< ~counter~0 91)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32068#(< ~counter~0 92)} is VALID [2022-04-28 05:57:31,892 INFO L290 TraceCheckUtils]: 16: Hoare triple {32093#(< ~counter~0 91)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {32093#(< ~counter~0 91)} is VALID [2022-04-28 05:57:31,892 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {31542#true} {32093#(< ~counter~0 91)} #92#return; {32093#(< ~counter~0 91)} is VALID [2022-04-28 05:57:31,892 INFO L290 TraceCheckUtils]: 14: Hoare triple {31542#true} assume true; {31542#true} is VALID [2022-04-28 05:57:31,892 INFO L290 TraceCheckUtils]: 13: Hoare triple {31542#true} assume !(0 == ~cond); {31542#true} is VALID [2022-04-28 05:57:31,892 INFO L290 TraceCheckUtils]: 12: Hoare triple {31542#true} ~cond := #in~cond; {31542#true} is VALID [2022-04-28 05:57:31,892 INFO L272 TraceCheckUtils]: 11: Hoare triple {32093#(< ~counter~0 91)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {31542#true} is VALID [2022-04-28 05:57:31,893 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {31542#true} {32093#(< ~counter~0 91)} #90#return; {32093#(< ~counter~0 91)} is VALID [2022-04-28 05:57:31,893 INFO L290 TraceCheckUtils]: 9: Hoare triple {31542#true} assume true; {31542#true} is VALID [2022-04-28 05:57:31,893 INFO L290 TraceCheckUtils]: 8: Hoare triple {31542#true} assume !(0 == ~cond); {31542#true} is VALID [2022-04-28 05:57:31,893 INFO L290 TraceCheckUtils]: 7: Hoare triple {31542#true} ~cond := #in~cond; {31542#true} is VALID [2022-04-28 05:57:31,893 INFO L272 TraceCheckUtils]: 6: Hoare triple {32093#(< ~counter~0 91)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {31542#true} is VALID [2022-04-28 05:57:31,893 INFO L290 TraceCheckUtils]: 5: Hoare triple {32093#(< ~counter~0 91)} 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 91)} is VALID [2022-04-28 05:57:31,894 INFO L272 TraceCheckUtils]: 4: Hoare triple {32093#(< ~counter~0 91)} call #t~ret9 := main(); {32093#(< ~counter~0 91)} is VALID [2022-04-28 05:57:31,894 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32093#(< ~counter~0 91)} {31542#true} #102#return; {32093#(< ~counter~0 91)} is VALID [2022-04-28 05:57:31,894 INFO L290 TraceCheckUtils]: 2: Hoare triple {32093#(< ~counter~0 91)} assume true; {32093#(< ~counter~0 91)} is VALID [2022-04-28 05:57:31,895 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 91)} is VALID [2022-04-28 05:57:31,895 INFO L272 TraceCheckUtils]: 0: Hoare triple {31542#true} call ULTIMATE.init(); {31542#true} is VALID [2022-04-28 05:57:31,895 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 22 proven. 46 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-04-28 05:57:31,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:57:31,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660879184] [2022-04-28 05:57:31,895 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:57:31,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438696943] [2022-04-28 05:57:31,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438696943] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:57:31,896 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:57:31,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-04-28 05:57:31,896 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:57:31,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1623328066] [2022-04-28 05:57:31,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1623328066] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:57:31,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:57:31,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 05:57:31,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274081013] [2022-04-28 05:57:31,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:57:31,896 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) Word has length 97 [2022-04-28 05:57:31,897 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:57:31,897 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-28 05:57:31,957 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:31,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 05:57:31,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:57:31,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 05:57:31,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-28 05:57:31,958 INFO L87 Difference]: Start difference. First operand 342 states and 456 transitions. Second operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-28 05:57:33,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:33,043 INFO L93 Difference]: Finished difference Result 467 states and 640 transitions. [2022-04-28 05:57:33,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 05:57:33,043 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) Word has length 97 [2022-04-28 05:57:33,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:57:33,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-28 05:57:33,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 218 transitions. [2022-04-28 05:57:33,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-28 05:57:33,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 218 transitions. [2022-04-28 05:57:33,048 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 218 transitions. [2022-04-28 05:57:33,216 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 218 edges. 218 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:33,222 INFO L225 Difference]: With dead ends: 467 [2022-04-28 05:57:33,222 INFO L226 Difference]: Without dead ends: 352 [2022-04-28 05:57:33,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=383, Invalid=547, Unknown=0, NotChecked=0, Total=930 [2022-04-28 05:57:33,223 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 112 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 05:57:33,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 249 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 05:57:33,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2022-04-28 05:57:33,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 344. [2022-04-28 05:57:33,713 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:57:33,713 INFO L82 GeneralOperation]: Start isEquivalent. First operand 352 states. Second operand has 344 states, 257 states have (on average 1.2101167315175096) internal successors, (311), 261 states have internal predecessors, (311), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-28 05:57:33,714 INFO L74 IsIncluded]: Start isIncluded. First operand 352 states. Second operand has 344 states, 257 states have (on average 1.2101167315175096) internal successors, (311), 261 states have internal predecessors, (311), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-28 05:57:33,714 INFO L87 Difference]: Start difference. First operand 352 states. Second operand has 344 states, 257 states have (on average 1.2101167315175096) internal successors, (311), 261 states have internal predecessors, (311), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-28 05:57:33,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:33,721 INFO L93 Difference]: Finished difference Result 352 states and 465 transitions. [2022-04-28 05:57:33,721 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 465 transitions. [2022-04-28 05:57:33,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:57:33,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:57:33,722 INFO L74 IsIncluded]: Start isIncluded. First operand has 344 states, 257 states have (on average 1.2101167315175096) internal successors, (311), 261 states have internal predecessors, (311), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) Second operand 352 states. [2022-04-28 05:57:33,722 INFO L87 Difference]: Start difference. First operand has 344 states, 257 states have (on average 1.2101167315175096) internal successors, (311), 261 states have internal predecessors, (311), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) Second operand 352 states. [2022-04-28 05:57:33,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:33,729 INFO L93 Difference]: Finished difference Result 352 states and 465 transitions. [2022-04-28 05:57:33,729 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 465 transitions. [2022-04-28 05:57:33,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:57:33,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:57:33,729 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:57:33,729 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:57:33,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 257 states have (on average 1.2101167315175096) internal successors, (311), 261 states have internal predecessors, (311), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-28 05:57:33,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 457 transitions. [2022-04-28 05:57:33,737 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 457 transitions. Word has length 97 [2022-04-28 05:57:33,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:57:33,737 INFO L495 AbstractCegarLoop]: Abstraction has 344 states and 457 transitions. [2022-04-28 05:57:33,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-28 05:57:33,737 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 344 states and 457 transitions. [2022-04-28 05:57:36,537 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-28 05:57:36,537 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 457 transitions. [2022-04-28 05:57:36,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-28 05:57:36,538 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:57:36,538 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:57:36,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-04-28 05:57:36,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-04-28 05:57:36,738 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:57:36,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:57:36,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1020733748, now seen corresponding path program 7 times [2022-04-28 05:57:36,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:57:36,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1619857249] [2022-04-28 05:57:36,739 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:57:36,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1020733748, now seen corresponding path program 8 times [2022-04-28 05:57:36,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:57:36,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749411225] [2022-04-28 05:57:36,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:57:36,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:57:36,749 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:57:36,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1755644859] [2022-04-28 05:57:36,749 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:57:36,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:57:36,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:57:36,750 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:57:36,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-04-28 05:57:36,802 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:57:36,802 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:57:36,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-28 05:57:36,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:57:36,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:57:37,085 INFO L272 TraceCheckUtils]: 0: Hoare triple {34487#true} call ULTIMATE.init(); {34487#true} is VALID [2022-04-28 05:57:37,085 INFO L290 TraceCheckUtils]: 1: Hoare triple {34487#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {34487#true} is VALID [2022-04-28 05:57:37,085 INFO L290 TraceCheckUtils]: 2: Hoare triple {34487#true} assume true; {34487#true} is VALID [2022-04-28 05:57:37,085 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34487#true} {34487#true} #102#return; {34487#true} is VALID [2022-04-28 05:57:37,085 INFO L272 TraceCheckUtils]: 4: Hoare triple {34487#true} call #t~ret9 := main(); {34487#true} is VALID [2022-04-28 05:57:37,085 INFO L290 TraceCheckUtils]: 5: Hoare triple {34487#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {34487#true} is VALID [2022-04-28 05:57:37,085 INFO L272 TraceCheckUtils]: 6: Hoare triple {34487#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {34487#true} is VALID [2022-04-28 05:57:37,086 INFO L290 TraceCheckUtils]: 7: Hoare triple {34487#true} ~cond := #in~cond; {34487#true} is VALID [2022-04-28 05:57:37,086 INFO L290 TraceCheckUtils]: 8: Hoare triple {34487#true} assume !(0 == ~cond); {34487#true} is VALID [2022-04-28 05:57:37,086 INFO L290 TraceCheckUtils]: 9: Hoare triple {34487#true} assume true; {34487#true} is VALID [2022-04-28 05:57:37,086 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {34487#true} {34487#true} #90#return; {34487#true} is VALID [2022-04-28 05:57:37,086 INFO L272 TraceCheckUtils]: 11: Hoare triple {34487#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {34487#true} is VALID [2022-04-28 05:57:37,086 INFO L290 TraceCheckUtils]: 12: Hoare triple {34487#true} ~cond := #in~cond; {34487#true} is VALID [2022-04-28 05:57:37,086 INFO L290 TraceCheckUtils]: 13: Hoare triple {34487#true} assume !(0 == ~cond); {34487#true} is VALID [2022-04-28 05:57:37,086 INFO L290 TraceCheckUtils]: 14: Hoare triple {34487#true} assume true; {34487#true} is VALID [2022-04-28 05:57:37,086 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {34487#true} {34487#true} #92#return; {34487#true} is VALID [2022-04-28 05:57:37,086 INFO L290 TraceCheckUtils]: 16: Hoare triple {34487#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {34487#true} is VALID [2022-04-28 05:57:37,086 INFO L290 TraceCheckUtils]: 17: Hoare triple {34487#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34487#true} is VALID [2022-04-28 05:57:37,086 INFO L290 TraceCheckUtils]: 18: Hoare triple {34487#true} assume !!(#t~post6 < 100);havoc #t~post6; {34487#true} is VALID [2022-04-28 05:57:37,086 INFO L272 TraceCheckUtils]: 19: Hoare triple {34487#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {34487#true} is VALID [2022-04-28 05:57:37,086 INFO L290 TraceCheckUtils]: 20: Hoare triple {34487#true} ~cond := #in~cond; {34487#true} is VALID [2022-04-28 05:57:37,086 INFO L290 TraceCheckUtils]: 21: Hoare triple {34487#true} assume !(0 == ~cond); {34487#true} is VALID [2022-04-28 05:57:37,087 INFO L290 TraceCheckUtils]: 22: Hoare triple {34487#true} assume true; {34487#true} is VALID [2022-04-28 05:57:37,087 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {34487#true} {34487#true} #94#return; {34487#true} is VALID [2022-04-28 05:57:37,087 INFO L290 TraceCheckUtils]: 24: Hoare triple {34487#true} assume !!(0 != ~r~0); {34487#true} is VALID [2022-04-28 05:57:37,087 INFO L290 TraceCheckUtils]: 25: Hoare triple {34487#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {34487#true} is VALID [2022-04-28 05:57:37,087 INFO L290 TraceCheckUtils]: 26: Hoare triple {34487#true} assume !!(#t~post7 < 100);havoc #t~post7; {34487#true} is VALID [2022-04-28 05:57:37,087 INFO L272 TraceCheckUtils]: 27: Hoare triple {34487#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {34487#true} is VALID [2022-04-28 05:57:37,087 INFO L290 TraceCheckUtils]: 28: Hoare triple {34487#true} ~cond := #in~cond; {34487#true} is VALID [2022-04-28 05:57:37,087 INFO L290 TraceCheckUtils]: 29: Hoare triple {34487#true} assume !(0 == ~cond); {34487#true} is VALID [2022-04-28 05:57:37,087 INFO L290 TraceCheckUtils]: 30: Hoare triple {34487#true} assume true; {34487#true} is VALID [2022-04-28 05:57:37,087 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {34487#true} {34487#true} #96#return; {34487#true} is VALID [2022-04-28 05:57:37,087 INFO L290 TraceCheckUtils]: 32: Hoare triple {34487#true} assume !(~r~0 > 0); {34487#true} is VALID [2022-04-28 05:57:37,087 INFO L290 TraceCheckUtils]: 33: Hoare triple {34487#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {34487#true} is VALID [2022-04-28 05:57:37,087 INFO L290 TraceCheckUtils]: 34: Hoare triple {34487#true} assume !!(#t~post8 < 100);havoc #t~post8; {34487#true} is VALID [2022-04-28 05:57:37,087 INFO L272 TraceCheckUtils]: 35: Hoare triple {34487#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {34487#true} is VALID [2022-04-28 05:57:37,088 INFO L290 TraceCheckUtils]: 36: Hoare triple {34487#true} ~cond := #in~cond; {34487#true} is VALID [2022-04-28 05:57:37,088 INFO L290 TraceCheckUtils]: 37: Hoare triple {34487#true} assume !(0 == ~cond); {34487#true} is VALID [2022-04-28 05:57:37,088 INFO L290 TraceCheckUtils]: 38: Hoare triple {34487#true} assume true; {34487#true} is VALID [2022-04-28 05:57:37,088 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {34487#true} {34487#true} #98#return; {34487#true} is VALID [2022-04-28 05:57:37,088 INFO L290 TraceCheckUtils]: 40: Hoare triple {34487#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {34487#true} is VALID [2022-04-28 05:57:37,088 INFO L290 TraceCheckUtils]: 41: Hoare triple {34487#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {34487#true} is VALID [2022-04-28 05:57:37,088 INFO L290 TraceCheckUtils]: 42: Hoare triple {34487#true} assume !!(#t~post8 < 100);havoc #t~post8; {34487#true} is VALID [2022-04-28 05:57:37,088 INFO L272 TraceCheckUtils]: 43: Hoare triple {34487#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {34487#true} is VALID [2022-04-28 05:57:37,088 INFO L290 TraceCheckUtils]: 44: Hoare triple {34487#true} ~cond := #in~cond; {34487#true} is VALID [2022-04-28 05:57:37,088 INFO L290 TraceCheckUtils]: 45: Hoare triple {34487#true} assume !(0 == ~cond); {34487#true} is VALID [2022-04-28 05:57:37,088 INFO L290 TraceCheckUtils]: 46: Hoare triple {34487#true} assume true; {34487#true} is VALID [2022-04-28 05:57:37,088 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {34487#true} {34487#true} #98#return; {34487#true} is VALID [2022-04-28 05:57:37,088 INFO L290 TraceCheckUtils]: 48: Hoare triple {34487#true} assume !(~r~0 < 0); {34487#true} is VALID [2022-04-28 05:57:37,088 INFO L290 TraceCheckUtils]: 49: Hoare triple {34487#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34487#true} is VALID [2022-04-28 05:57:37,089 INFO L290 TraceCheckUtils]: 50: Hoare triple {34487#true} assume !!(#t~post6 < 100);havoc #t~post6; {34487#true} is VALID [2022-04-28 05:57:37,089 INFO L272 TraceCheckUtils]: 51: Hoare triple {34487#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {34487#true} is VALID [2022-04-28 05:57:37,089 INFO L290 TraceCheckUtils]: 52: Hoare triple {34487#true} ~cond := #in~cond; {34487#true} is VALID [2022-04-28 05:57:37,089 INFO L290 TraceCheckUtils]: 53: Hoare triple {34487#true} assume !(0 == ~cond); {34487#true} is VALID [2022-04-28 05:57:37,089 INFO L290 TraceCheckUtils]: 54: Hoare triple {34487#true} assume true; {34487#true} is VALID [2022-04-28 05:57:37,089 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {34487#true} {34487#true} #94#return; {34487#true} is VALID [2022-04-28 05:57:37,089 INFO L290 TraceCheckUtils]: 56: Hoare triple {34487#true} assume !!(0 != ~r~0); {34487#true} is VALID [2022-04-28 05:57:37,089 INFO L290 TraceCheckUtils]: 57: Hoare triple {34487#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {34487#true} is VALID [2022-04-28 05:57:37,089 INFO L290 TraceCheckUtils]: 58: Hoare triple {34487#true} assume !!(#t~post7 < 100);havoc #t~post7; {34487#true} is VALID [2022-04-28 05:57:37,089 INFO L272 TraceCheckUtils]: 59: Hoare triple {34487#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {34487#true} is VALID [2022-04-28 05:57:37,089 INFO L290 TraceCheckUtils]: 60: Hoare triple {34487#true} ~cond := #in~cond; {34487#true} is VALID [2022-04-28 05:57:37,089 INFO L290 TraceCheckUtils]: 61: Hoare triple {34487#true} assume !(0 == ~cond); {34487#true} is VALID [2022-04-28 05:57:37,089 INFO L290 TraceCheckUtils]: 62: Hoare triple {34487#true} assume true; {34487#true} is VALID [2022-04-28 05:57:37,089 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {34487#true} {34487#true} #96#return; {34487#true} is VALID [2022-04-28 05:57:37,089 INFO L290 TraceCheckUtils]: 64: Hoare triple {34487#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {34487#true} is VALID [2022-04-28 05:57:37,090 INFO L290 TraceCheckUtils]: 65: Hoare triple {34487#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {34487#true} is VALID [2022-04-28 05:57:37,090 INFO L290 TraceCheckUtils]: 66: Hoare triple {34487#true} assume !!(#t~post7 < 100);havoc #t~post7; {34487#true} is VALID [2022-04-28 05:57:37,090 INFO L272 TraceCheckUtils]: 67: Hoare triple {34487#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {34487#true} is VALID [2022-04-28 05:57:37,090 INFO L290 TraceCheckUtils]: 68: Hoare triple {34487#true} ~cond := #in~cond; {34487#true} is VALID [2022-04-28 05:57:37,090 INFO L290 TraceCheckUtils]: 69: Hoare triple {34487#true} assume !(0 == ~cond); {34487#true} is VALID [2022-04-28 05:57:37,090 INFO L290 TraceCheckUtils]: 70: Hoare triple {34487#true} assume true; {34487#true} is VALID [2022-04-28 05:57:37,090 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {34487#true} {34487#true} #96#return; {34487#true} is VALID [2022-04-28 05:57:37,090 INFO L290 TraceCheckUtils]: 72: Hoare triple {34487#true} assume !(~r~0 > 0); {34708#(not (< 0 main_~r~0))} is VALID [2022-04-28 05:57:37,090 INFO L290 TraceCheckUtils]: 73: Hoare triple {34708#(not (< 0 main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {34708#(not (< 0 main_~r~0))} is VALID [2022-04-28 05:57:37,091 INFO L290 TraceCheckUtils]: 74: Hoare triple {34708#(not (< 0 main_~r~0))} assume !!(#t~post8 < 100);havoc #t~post8; {34708#(not (< 0 main_~r~0))} is VALID [2022-04-28 05:57:37,091 INFO L272 TraceCheckUtils]: 75: Hoare triple {34708#(not (< 0 main_~r~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {34487#true} is VALID [2022-04-28 05:57:37,091 INFO L290 TraceCheckUtils]: 76: Hoare triple {34487#true} ~cond := #in~cond; {34487#true} is VALID [2022-04-28 05:57:37,091 INFO L290 TraceCheckUtils]: 77: Hoare triple {34487#true} assume !(0 == ~cond); {34487#true} is VALID [2022-04-28 05:57:37,091 INFO L290 TraceCheckUtils]: 78: Hoare triple {34487#true} assume true; {34487#true} is VALID [2022-04-28 05:57:37,092 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {34487#true} {34708#(not (< 0 main_~r~0))} #98#return; {34708#(not (< 0 main_~r~0))} is VALID [2022-04-28 05:57:37,092 INFO L290 TraceCheckUtils]: 80: Hoare triple {34708#(not (< 0 main_~r~0))} assume !(~r~0 < 0); {34733#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} is VALID [2022-04-28 05:57:37,092 INFO L290 TraceCheckUtils]: 81: Hoare triple {34733#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34733#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} is VALID [2022-04-28 05:57:37,093 INFO L290 TraceCheckUtils]: 82: Hoare triple {34733#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} assume !!(#t~post6 < 100);havoc #t~post6; {34733#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} is VALID [2022-04-28 05:57:37,093 INFO L272 TraceCheckUtils]: 83: Hoare triple {34733#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {34487#true} is VALID [2022-04-28 05:57:37,093 INFO L290 TraceCheckUtils]: 84: Hoare triple {34487#true} ~cond := #in~cond; {34487#true} is VALID [2022-04-28 05:57:37,093 INFO L290 TraceCheckUtils]: 85: Hoare triple {34487#true} assume !(0 == ~cond); {34487#true} is VALID [2022-04-28 05:57:37,093 INFO L290 TraceCheckUtils]: 86: Hoare triple {34487#true} assume true; {34487#true} is VALID [2022-04-28 05:57:37,093 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {34487#true} {34733#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} #94#return; {34733#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} is VALID [2022-04-28 05:57:37,094 INFO L290 TraceCheckUtils]: 88: Hoare triple {34733#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} assume !!(0 != ~r~0); {34488#false} is VALID [2022-04-28 05:57:37,094 INFO L290 TraceCheckUtils]: 89: Hoare triple {34488#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {34488#false} is VALID [2022-04-28 05:57:37,094 INFO L290 TraceCheckUtils]: 90: Hoare triple {34488#false} assume !(#t~post7 < 100);havoc #t~post7; {34488#false} is VALID [2022-04-28 05:57:37,094 INFO L290 TraceCheckUtils]: 91: Hoare triple {34488#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {34488#false} is VALID [2022-04-28 05:57:37,094 INFO L290 TraceCheckUtils]: 92: Hoare triple {34488#false} assume !(#t~post8 < 100);havoc #t~post8; {34488#false} is VALID [2022-04-28 05:57:37,094 INFO L290 TraceCheckUtils]: 93: Hoare triple {34488#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34488#false} is VALID [2022-04-28 05:57:37,094 INFO L290 TraceCheckUtils]: 94: Hoare triple {34488#false} assume !(#t~post6 < 100);havoc #t~post6; {34488#false} is VALID [2022-04-28 05:57:37,094 INFO L272 TraceCheckUtils]: 95: Hoare triple {34488#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {34488#false} is VALID [2022-04-28 05:57:37,094 INFO L290 TraceCheckUtils]: 96: Hoare triple {34488#false} ~cond := #in~cond; {34488#false} is VALID [2022-04-28 05:57:37,094 INFO L290 TraceCheckUtils]: 97: Hoare triple {34488#false} assume 0 == ~cond; {34488#false} is VALID [2022-04-28 05:57:37,094 INFO L290 TraceCheckUtils]: 98: Hoare triple {34488#false} assume !false; {34488#false} is VALID [2022-04-28 05:57:37,095 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2022-04-28 05:57:37,095 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 05:57:37,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:57:37,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749411225] [2022-04-28 05:57:37,095 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:57:37,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755644859] [2022-04-28 05:57:37,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1755644859] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:57:37,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:57:37,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 05:57:37,095 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:57:37,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1619857249] [2022-04-28 05:57:37,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1619857249] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:57:37,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:57:37,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 05:57:37,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296733969] [2022-04-28 05:57:37,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:57:37,096 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 99 [2022-04-28 05:57:37,096 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:57:37,096 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 05:57:37,133 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:37,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 05:57:37,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:57:37,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 05:57:37,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-28 05:57:37,134 INFO L87 Difference]: Start difference. First operand 344 states and 457 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 05:57:37,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:37,823 INFO L93 Difference]: Finished difference Result 504 states and 675 transitions. [2022-04-28 05:57:37,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 05:57:37,823 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 99 [2022-04-28 05:57:37,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:57:37,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 05:57:37,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-04-28 05:57:37,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 05:57:37,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-04-28 05:57:37,832 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 94 transitions. [2022-04-28 05:57:37,906 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:37,912 INFO L225 Difference]: With dead ends: 504 [2022-04-28 05:57:37,912 INFO L226 Difference]: Without dead ends: 362 [2022-04-28 05:57:37,913 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-28 05:57:37,917 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 12 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 05:57:37,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 122 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 05:57:37,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2022-04-28 05:57:38,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 352. [2022-04-28 05:57:38,348 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:57:38,349 INFO L82 GeneralOperation]: Start isEquivalent. First operand 362 states. Second operand has 352 states, 265 states have (on average 1.2150943396226415) internal successors, (322), 269 states have internal predecessors, (322), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-28 05:57:38,349 INFO L74 IsIncluded]: Start isIncluded. First operand 362 states. Second operand has 352 states, 265 states have (on average 1.2150943396226415) internal successors, (322), 269 states have internal predecessors, (322), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-28 05:57:38,349 INFO L87 Difference]: Start difference. First operand 362 states. Second operand has 352 states, 265 states have (on average 1.2150943396226415) internal successors, (322), 269 states have internal predecessors, (322), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-28 05:57:38,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:38,369 INFO L93 Difference]: Finished difference Result 362 states and 481 transitions. [2022-04-28 05:57:38,369 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 481 transitions. [2022-04-28 05:57:38,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:57:38,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:57:38,370 INFO L74 IsIncluded]: Start isIncluded. First operand has 352 states, 265 states have (on average 1.2150943396226415) internal successors, (322), 269 states have internal predecessors, (322), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) Second operand 362 states. [2022-04-28 05:57:38,370 INFO L87 Difference]: Start difference. First operand has 352 states, 265 states have (on average 1.2150943396226415) internal successors, (322), 269 states have internal predecessors, (322), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) Second operand 362 states. [2022-04-28 05:57:38,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:38,376 INFO L93 Difference]: Finished difference Result 362 states and 481 transitions. [2022-04-28 05:57:38,376 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 481 transitions. [2022-04-28 05:57:38,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:57:38,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:57:38,377 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:57:38,377 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:57:38,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 265 states have (on average 1.2150943396226415) internal successors, (322), 269 states have internal predecessors, (322), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-28 05:57:38,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 468 transitions. [2022-04-28 05:57:38,384 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 468 transitions. Word has length 99 [2022-04-28 05:57:38,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:57:38,384 INFO L495 AbstractCegarLoop]: Abstraction has 352 states and 468 transitions. [2022-04-28 05:57:38,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 05:57:38,384 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 352 states and 468 transitions. [2022-04-28 05:57:40,360 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 468 edges. 468 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:40,360 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 468 transitions. [2022-04-28 05:57:40,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-28 05:57:40,361 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:57:40,361 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 6, 5, 5, 5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:57:40,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-04-28 05:57:40,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-28 05:57:40,562 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:57:40,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:57:40,562 INFO L85 PathProgramCache]: Analyzing trace with hash 359487094, now seen corresponding path program 9 times [2022-04-28 05:57:40,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:57:40,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1664913918] [2022-04-28 05:57:40,562 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:57:40,562 INFO L85 PathProgramCache]: Analyzing trace with hash 359487094, now seen corresponding path program 10 times [2022-04-28 05:57:40,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:57:40,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028656577] [2022-04-28 05:57:40,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:57:40,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:57:40,573 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:57:40,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1082950993] [2022-04-28 05:57:40,573 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 05:57:40,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:57:40,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:57:40,574 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:57:40,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-04-28 05:57:40,730 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 05:57:40,730 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:57:40,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 05:57:40,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:57:40,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:57:41,158 INFO L272 TraceCheckUtils]: 0: Hoare triple {37223#true} call ULTIMATE.init(); {37223#true} is VALID [2022-04-28 05:57:41,159 INFO L290 TraceCheckUtils]: 1: Hoare triple {37223#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {37231#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:41,159 INFO L290 TraceCheckUtils]: 2: Hoare triple {37231#(<= ~counter~0 0)} assume true; {37231#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:41,159 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37231#(<= ~counter~0 0)} {37223#true} #102#return; {37231#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:41,160 INFO L272 TraceCheckUtils]: 4: Hoare triple {37231#(<= ~counter~0 0)} call #t~ret9 := main(); {37231#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:41,160 INFO L290 TraceCheckUtils]: 5: Hoare triple {37231#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {37231#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:41,160 INFO L272 TraceCheckUtils]: 6: Hoare triple {37231#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {37231#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:41,161 INFO L290 TraceCheckUtils]: 7: Hoare triple {37231#(<= ~counter~0 0)} ~cond := #in~cond; {37231#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:41,161 INFO L290 TraceCheckUtils]: 8: Hoare triple {37231#(<= ~counter~0 0)} assume !(0 == ~cond); {37231#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:41,161 INFO L290 TraceCheckUtils]: 9: Hoare triple {37231#(<= ~counter~0 0)} assume true; {37231#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:41,161 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {37231#(<= ~counter~0 0)} {37231#(<= ~counter~0 0)} #90#return; {37231#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:41,162 INFO L272 TraceCheckUtils]: 11: Hoare triple {37231#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {37231#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:41,162 INFO L290 TraceCheckUtils]: 12: Hoare triple {37231#(<= ~counter~0 0)} ~cond := #in~cond; {37231#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:41,162 INFO L290 TraceCheckUtils]: 13: Hoare triple {37231#(<= ~counter~0 0)} assume !(0 == ~cond); {37231#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:41,163 INFO L290 TraceCheckUtils]: 14: Hoare triple {37231#(<= ~counter~0 0)} assume true; {37231#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:41,163 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {37231#(<= ~counter~0 0)} {37231#(<= ~counter~0 0)} #92#return; {37231#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:41,163 INFO L290 TraceCheckUtils]: 16: Hoare triple {37231#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {37231#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:41,164 INFO L290 TraceCheckUtils]: 17: Hoare triple {37231#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37280#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:41,164 INFO L290 TraceCheckUtils]: 18: Hoare triple {37280#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {37280#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:41,165 INFO L272 TraceCheckUtils]: 19: Hoare triple {37280#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37280#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:41,165 INFO L290 TraceCheckUtils]: 20: Hoare triple {37280#(<= ~counter~0 1)} ~cond := #in~cond; {37280#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:41,165 INFO L290 TraceCheckUtils]: 21: Hoare triple {37280#(<= ~counter~0 1)} assume !(0 == ~cond); {37280#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:41,166 INFO L290 TraceCheckUtils]: 22: Hoare triple {37280#(<= ~counter~0 1)} assume true; {37280#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:41,166 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {37280#(<= ~counter~0 1)} {37280#(<= ~counter~0 1)} #94#return; {37280#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:41,166 INFO L290 TraceCheckUtils]: 24: Hoare triple {37280#(<= ~counter~0 1)} assume !!(0 != ~r~0); {37280#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:41,167 INFO L290 TraceCheckUtils]: 25: Hoare triple {37280#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37305#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:41,167 INFO L290 TraceCheckUtils]: 26: Hoare triple {37305#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {37305#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:41,168 INFO L272 TraceCheckUtils]: 27: Hoare triple {37305#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37305#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:41,168 INFO L290 TraceCheckUtils]: 28: Hoare triple {37305#(<= ~counter~0 2)} ~cond := #in~cond; {37305#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:41,168 INFO L290 TraceCheckUtils]: 29: Hoare triple {37305#(<= ~counter~0 2)} assume !(0 == ~cond); {37305#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:41,168 INFO L290 TraceCheckUtils]: 30: Hoare triple {37305#(<= ~counter~0 2)} assume true; {37305#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:41,169 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {37305#(<= ~counter~0 2)} {37305#(<= ~counter~0 2)} #96#return; {37305#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:41,169 INFO L290 TraceCheckUtils]: 32: Hoare triple {37305#(<= ~counter~0 2)} assume !(~r~0 > 0); {37305#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:41,170 INFO L290 TraceCheckUtils]: 33: Hoare triple {37305#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {37330#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:41,170 INFO L290 TraceCheckUtils]: 34: Hoare triple {37330#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {37330#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:41,171 INFO L272 TraceCheckUtils]: 35: Hoare triple {37330#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37330#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:41,171 INFO L290 TraceCheckUtils]: 36: Hoare triple {37330#(<= ~counter~0 3)} ~cond := #in~cond; {37330#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:41,171 INFO L290 TraceCheckUtils]: 37: Hoare triple {37330#(<= ~counter~0 3)} assume !(0 == ~cond); {37330#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:41,171 INFO L290 TraceCheckUtils]: 38: Hoare triple {37330#(<= ~counter~0 3)} assume true; {37330#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:41,172 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {37330#(<= ~counter~0 3)} {37330#(<= ~counter~0 3)} #98#return; {37330#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:41,172 INFO L290 TraceCheckUtils]: 40: Hoare triple {37330#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {37330#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:41,173 INFO L290 TraceCheckUtils]: 41: Hoare triple {37330#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {37355#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:41,173 INFO L290 TraceCheckUtils]: 42: Hoare triple {37355#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {37355#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:41,174 INFO L272 TraceCheckUtils]: 43: Hoare triple {37355#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37355#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:41,174 INFO L290 TraceCheckUtils]: 44: Hoare triple {37355#(<= ~counter~0 4)} ~cond := #in~cond; {37355#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:41,174 INFO L290 TraceCheckUtils]: 45: Hoare triple {37355#(<= ~counter~0 4)} assume !(0 == ~cond); {37355#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:41,174 INFO L290 TraceCheckUtils]: 46: Hoare triple {37355#(<= ~counter~0 4)} assume true; {37355#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:41,175 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {37355#(<= ~counter~0 4)} {37355#(<= ~counter~0 4)} #98#return; {37355#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:41,175 INFO L290 TraceCheckUtils]: 48: Hoare triple {37355#(<= ~counter~0 4)} assume !(~r~0 < 0); {37355#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:41,176 INFO L290 TraceCheckUtils]: 49: Hoare triple {37355#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37380#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:41,176 INFO L290 TraceCheckUtils]: 50: Hoare triple {37380#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {37380#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:41,176 INFO L272 TraceCheckUtils]: 51: Hoare triple {37380#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37380#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:41,177 INFO L290 TraceCheckUtils]: 52: Hoare triple {37380#(<= ~counter~0 5)} ~cond := #in~cond; {37380#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:41,177 INFO L290 TraceCheckUtils]: 53: Hoare triple {37380#(<= ~counter~0 5)} assume !(0 == ~cond); {37380#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:41,177 INFO L290 TraceCheckUtils]: 54: Hoare triple {37380#(<= ~counter~0 5)} assume true; {37380#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:41,178 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {37380#(<= ~counter~0 5)} {37380#(<= ~counter~0 5)} #94#return; {37380#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:41,178 INFO L290 TraceCheckUtils]: 56: Hoare triple {37380#(<= ~counter~0 5)} assume !!(0 != ~r~0); {37380#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:41,178 INFO L290 TraceCheckUtils]: 57: Hoare triple {37380#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37405#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:41,179 INFO L290 TraceCheckUtils]: 58: Hoare triple {37405#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {37405#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:41,179 INFO L272 TraceCheckUtils]: 59: Hoare triple {37405#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37405#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:41,179 INFO L290 TraceCheckUtils]: 60: Hoare triple {37405#(<= ~counter~0 6)} ~cond := #in~cond; {37405#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:41,180 INFO L290 TraceCheckUtils]: 61: Hoare triple {37405#(<= ~counter~0 6)} assume !(0 == ~cond); {37405#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:41,180 INFO L290 TraceCheckUtils]: 62: Hoare triple {37405#(<= ~counter~0 6)} assume true; {37405#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:41,180 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {37405#(<= ~counter~0 6)} {37405#(<= ~counter~0 6)} #96#return; {37405#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:41,181 INFO L290 TraceCheckUtils]: 64: Hoare triple {37405#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {37405#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:41,181 INFO L290 TraceCheckUtils]: 65: Hoare triple {37405#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37430#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:41,181 INFO L290 TraceCheckUtils]: 66: Hoare triple {37430#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {37430#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:41,182 INFO L272 TraceCheckUtils]: 67: Hoare triple {37430#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37430#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:41,182 INFO L290 TraceCheckUtils]: 68: Hoare triple {37430#(<= ~counter~0 7)} ~cond := #in~cond; {37430#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:41,182 INFO L290 TraceCheckUtils]: 69: Hoare triple {37430#(<= ~counter~0 7)} assume !(0 == ~cond); {37430#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:41,183 INFO L290 TraceCheckUtils]: 70: Hoare triple {37430#(<= ~counter~0 7)} assume true; {37430#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:41,183 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {37430#(<= ~counter~0 7)} {37430#(<= ~counter~0 7)} #96#return; {37430#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:41,183 INFO L290 TraceCheckUtils]: 72: Hoare triple {37430#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {37430#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:41,184 INFO L290 TraceCheckUtils]: 73: Hoare triple {37430#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37455#(<= ~counter~0 8)} is VALID [2022-04-28 05:57:41,184 INFO L290 TraceCheckUtils]: 74: Hoare triple {37455#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {37455#(<= ~counter~0 8)} is VALID [2022-04-28 05:57:41,185 INFO L272 TraceCheckUtils]: 75: Hoare triple {37455#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37455#(<= ~counter~0 8)} is VALID [2022-04-28 05:57:41,185 INFO L290 TraceCheckUtils]: 76: Hoare triple {37455#(<= ~counter~0 8)} ~cond := #in~cond; {37455#(<= ~counter~0 8)} is VALID [2022-04-28 05:57:41,185 INFO L290 TraceCheckUtils]: 77: Hoare triple {37455#(<= ~counter~0 8)} assume !(0 == ~cond); {37455#(<= ~counter~0 8)} is VALID [2022-04-28 05:57:41,185 INFO L290 TraceCheckUtils]: 78: Hoare triple {37455#(<= ~counter~0 8)} assume true; {37455#(<= ~counter~0 8)} is VALID [2022-04-28 05:57:41,186 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {37455#(<= ~counter~0 8)} {37455#(<= ~counter~0 8)} #96#return; {37455#(<= ~counter~0 8)} is VALID [2022-04-28 05:57:41,186 INFO L290 TraceCheckUtils]: 80: Hoare triple {37455#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {37455#(<= ~counter~0 8)} is VALID [2022-04-28 05:57:41,186 INFO L290 TraceCheckUtils]: 81: Hoare triple {37455#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37480#(<= ~counter~0 9)} is VALID [2022-04-28 05:57:41,187 INFO L290 TraceCheckUtils]: 82: Hoare triple {37480#(<= ~counter~0 9)} assume !!(#t~post7 < 100);havoc #t~post7; {37480#(<= ~counter~0 9)} is VALID [2022-04-28 05:57:41,187 INFO L272 TraceCheckUtils]: 83: Hoare triple {37480#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37480#(<= ~counter~0 9)} is VALID [2022-04-28 05:57:41,187 INFO L290 TraceCheckUtils]: 84: Hoare triple {37480#(<= ~counter~0 9)} ~cond := #in~cond; {37480#(<= ~counter~0 9)} is VALID [2022-04-28 05:57:41,188 INFO L290 TraceCheckUtils]: 85: Hoare triple {37480#(<= ~counter~0 9)} assume !(0 == ~cond); {37480#(<= ~counter~0 9)} is VALID [2022-04-28 05:57:41,188 INFO L290 TraceCheckUtils]: 86: Hoare triple {37480#(<= ~counter~0 9)} assume true; {37480#(<= ~counter~0 9)} is VALID [2022-04-28 05:57:41,188 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {37480#(<= ~counter~0 9)} {37480#(<= ~counter~0 9)} #96#return; {37480#(<= ~counter~0 9)} is VALID [2022-04-28 05:57:41,195 INFO L290 TraceCheckUtils]: 88: Hoare triple {37480#(<= ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {37480#(<= ~counter~0 9)} is VALID [2022-04-28 05:57:41,195 INFO L290 TraceCheckUtils]: 89: Hoare triple {37480#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37505#(<= |main_#t~post7| 9)} is VALID [2022-04-28 05:57:41,196 INFO L290 TraceCheckUtils]: 90: Hoare triple {37505#(<= |main_#t~post7| 9)} assume !(#t~post7 < 100);havoc #t~post7; {37224#false} is VALID [2022-04-28 05:57:41,196 INFO L290 TraceCheckUtils]: 91: Hoare triple {37224#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {37224#false} is VALID [2022-04-28 05:57:41,196 INFO L290 TraceCheckUtils]: 92: Hoare triple {37224#false} assume !(#t~post8 < 100);havoc #t~post8; {37224#false} is VALID [2022-04-28 05:57:41,196 INFO L290 TraceCheckUtils]: 93: Hoare triple {37224#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37224#false} is VALID [2022-04-28 05:57:41,196 INFO L290 TraceCheckUtils]: 94: Hoare triple {37224#false} assume !(#t~post6 < 100);havoc #t~post6; {37224#false} is VALID [2022-04-28 05:57:41,196 INFO L272 TraceCheckUtils]: 95: Hoare triple {37224#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37224#false} is VALID [2022-04-28 05:57:41,196 INFO L290 TraceCheckUtils]: 96: Hoare triple {37224#false} ~cond := #in~cond; {37224#false} is VALID [2022-04-28 05:57:41,196 INFO L290 TraceCheckUtils]: 97: Hoare triple {37224#false} assume 0 == ~cond; {37224#false} is VALID [2022-04-28 05:57:41,196 INFO L290 TraceCheckUtils]: 98: Hoare triple {37224#false} assume !false; {37224#false} is VALID [2022-04-28 05:57:41,197 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 26 proven. 202 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:57:41,197 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:57:41,676 INFO L290 TraceCheckUtils]: 98: Hoare triple {37224#false} assume !false; {37224#false} is VALID [2022-04-28 05:57:41,676 INFO L290 TraceCheckUtils]: 97: Hoare triple {37224#false} assume 0 == ~cond; {37224#false} is VALID [2022-04-28 05:57:41,676 INFO L290 TraceCheckUtils]: 96: Hoare triple {37224#false} ~cond := #in~cond; {37224#false} is VALID [2022-04-28 05:57:41,676 INFO L272 TraceCheckUtils]: 95: Hoare triple {37224#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37224#false} is VALID [2022-04-28 05:57:41,676 INFO L290 TraceCheckUtils]: 94: Hoare triple {37224#false} assume !(#t~post6 < 100);havoc #t~post6; {37224#false} is VALID [2022-04-28 05:57:41,676 INFO L290 TraceCheckUtils]: 93: Hoare triple {37224#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37224#false} is VALID [2022-04-28 05:57:41,676 INFO L290 TraceCheckUtils]: 92: Hoare triple {37224#false} assume !(#t~post8 < 100);havoc #t~post8; {37224#false} is VALID [2022-04-28 05:57:41,676 INFO L290 TraceCheckUtils]: 91: Hoare triple {37224#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {37224#false} is VALID [2022-04-28 05:57:41,678 INFO L290 TraceCheckUtils]: 90: Hoare triple {37557#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {37224#false} is VALID [2022-04-28 05:57:41,678 INFO L290 TraceCheckUtils]: 89: Hoare triple {37561#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37557#(< |main_#t~post7| 100)} is VALID [2022-04-28 05:57:41,678 INFO L290 TraceCheckUtils]: 88: Hoare triple {37561#(< ~counter~0 100)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {37561#(< ~counter~0 100)} is VALID [2022-04-28 05:57:41,679 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {37223#true} {37561#(< ~counter~0 100)} #96#return; {37561#(< ~counter~0 100)} is VALID [2022-04-28 05:57:41,679 INFO L290 TraceCheckUtils]: 86: Hoare triple {37223#true} assume true; {37223#true} is VALID [2022-04-28 05:57:41,679 INFO L290 TraceCheckUtils]: 85: Hoare triple {37223#true} assume !(0 == ~cond); {37223#true} is VALID [2022-04-28 05:57:41,679 INFO L290 TraceCheckUtils]: 84: Hoare triple {37223#true} ~cond := #in~cond; {37223#true} is VALID [2022-04-28 05:57:41,679 INFO L272 TraceCheckUtils]: 83: Hoare triple {37561#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37223#true} is VALID [2022-04-28 05:57:41,679 INFO L290 TraceCheckUtils]: 82: Hoare triple {37561#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {37561#(< ~counter~0 100)} is VALID [2022-04-28 05:57:41,680 INFO L290 TraceCheckUtils]: 81: Hoare triple {37586#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37561#(< ~counter~0 100)} is VALID [2022-04-28 05:57:41,681 INFO L290 TraceCheckUtils]: 80: Hoare triple {37586#(< ~counter~0 99)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {37586#(< ~counter~0 99)} is VALID [2022-04-28 05:57:41,681 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {37223#true} {37586#(< ~counter~0 99)} #96#return; {37586#(< ~counter~0 99)} is VALID [2022-04-28 05:57:41,681 INFO L290 TraceCheckUtils]: 78: Hoare triple {37223#true} assume true; {37223#true} is VALID [2022-04-28 05:57:41,681 INFO L290 TraceCheckUtils]: 77: Hoare triple {37223#true} assume !(0 == ~cond); {37223#true} is VALID [2022-04-28 05:57:41,681 INFO L290 TraceCheckUtils]: 76: Hoare triple {37223#true} ~cond := #in~cond; {37223#true} is VALID [2022-04-28 05:57:41,681 INFO L272 TraceCheckUtils]: 75: Hoare triple {37586#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37223#true} is VALID [2022-04-28 05:57:41,682 INFO L290 TraceCheckUtils]: 74: Hoare triple {37586#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {37586#(< ~counter~0 99)} is VALID [2022-04-28 05:57:41,682 INFO L290 TraceCheckUtils]: 73: Hoare triple {37611#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37586#(< ~counter~0 99)} is VALID [2022-04-28 05:57:41,682 INFO L290 TraceCheckUtils]: 72: Hoare triple {37611#(< ~counter~0 98)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {37611#(< ~counter~0 98)} is VALID [2022-04-28 05:57:41,683 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {37223#true} {37611#(< ~counter~0 98)} #96#return; {37611#(< ~counter~0 98)} is VALID [2022-04-28 05:57:41,683 INFO L290 TraceCheckUtils]: 70: Hoare triple {37223#true} assume true; {37223#true} is VALID [2022-04-28 05:57:41,683 INFO L290 TraceCheckUtils]: 69: Hoare triple {37223#true} assume !(0 == ~cond); {37223#true} is VALID [2022-04-28 05:57:41,683 INFO L290 TraceCheckUtils]: 68: Hoare triple {37223#true} ~cond := #in~cond; {37223#true} is VALID [2022-04-28 05:57:41,683 INFO L272 TraceCheckUtils]: 67: Hoare triple {37611#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37223#true} is VALID [2022-04-28 05:57:41,683 INFO L290 TraceCheckUtils]: 66: Hoare triple {37611#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {37611#(< ~counter~0 98)} is VALID [2022-04-28 05:57:41,684 INFO L290 TraceCheckUtils]: 65: Hoare triple {37636#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37611#(< ~counter~0 98)} is VALID [2022-04-28 05:57:41,684 INFO L290 TraceCheckUtils]: 64: Hoare triple {37636#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {37636#(< ~counter~0 97)} is VALID [2022-04-28 05:57:41,685 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {37223#true} {37636#(< ~counter~0 97)} #96#return; {37636#(< ~counter~0 97)} is VALID [2022-04-28 05:57:41,685 INFO L290 TraceCheckUtils]: 62: Hoare triple {37223#true} assume true; {37223#true} is VALID [2022-04-28 05:57:41,685 INFO L290 TraceCheckUtils]: 61: Hoare triple {37223#true} assume !(0 == ~cond); {37223#true} is VALID [2022-04-28 05:57:41,685 INFO L290 TraceCheckUtils]: 60: Hoare triple {37223#true} ~cond := #in~cond; {37223#true} is VALID [2022-04-28 05:57:41,685 INFO L272 TraceCheckUtils]: 59: Hoare triple {37636#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37223#true} is VALID [2022-04-28 05:57:41,685 INFO L290 TraceCheckUtils]: 58: Hoare triple {37636#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {37636#(< ~counter~0 97)} is VALID [2022-04-28 05:57:41,686 INFO L290 TraceCheckUtils]: 57: Hoare triple {37661#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37636#(< ~counter~0 97)} is VALID [2022-04-28 05:57:41,686 INFO L290 TraceCheckUtils]: 56: Hoare triple {37661#(< ~counter~0 96)} assume !!(0 != ~r~0); {37661#(< ~counter~0 96)} is VALID [2022-04-28 05:57:41,687 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {37223#true} {37661#(< ~counter~0 96)} #94#return; {37661#(< ~counter~0 96)} is VALID [2022-04-28 05:57:41,687 INFO L290 TraceCheckUtils]: 54: Hoare triple {37223#true} assume true; {37223#true} is VALID [2022-04-28 05:57:41,687 INFO L290 TraceCheckUtils]: 53: Hoare triple {37223#true} assume !(0 == ~cond); {37223#true} is VALID [2022-04-28 05:57:41,687 INFO L290 TraceCheckUtils]: 52: Hoare triple {37223#true} ~cond := #in~cond; {37223#true} is VALID [2022-04-28 05:57:41,687 INFO L272 TraceCheckUtils]: 51: Hoare triple {37661#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37223#true} is VALID [2022-04-28 05:57:41,687 INFO L290 TraceCheckUtils]: 50: Hoare triple {37661#(< ~counter~0 96)} assume !!(#t~post6 < 100);havoc #t~post6; {37661#(< ~counter~0 96)} is VALID [2022-04-28 05:57:41,688 INFO L290 TraceCheckUtils]: 49: Hoare triple {37686#(< ~counter~0 95)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37661#(< ~counter~0 96)} is VALID [2022-04-28 05:57:41,688 INFO L290 TraceCheckUtils]: 48: Hoare triple {37686#(< ~counter~0 95)} assume !(~r~0 < 0); {37686#(< ~counter~0 95)} is VALID [2022-04-28 05:57:41,688 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {37223#true} {37686#(< ~counter~0 95)} #98#return; {37686#(< ~counter~0 95)} is VALID [2022-04-28 05:57:41,689 INFO L290 TraceCheckUtils]: 46: Hoare triple {37223#true} assume true; {37223#true} is VALID [2022-04-28 05:57:41,689 INFO L290 TraceCheckUtils]: 45: Hoare triple {37223#true} assume !(0 == ~cond); {37223#true} is VALID [2022-04-28 05:57:41,689 INFO L290 TraceCheckUtils]: 44: Hoare triple {37223#true} ~cond := #in~cond; {37223#true} is VALID [2022-04-28 05:57:41,689 INFO L272 TraceCheckUtils]: 43: Hoare triple {37686#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37223#true} is VALID [2022-04-28 05:57:41,689 INFO L290 TraceCheckUtils]: 42: Hoare triple {37686#(< ~counter~0 95)} assume !!(#t~post8 < 100);havoc #t~post8; {37686#(< ~counter~0 95)} is VALID [2022-04-28 05:57:41,690 INFO L290 TraceCheckUtils]: 41: Hoare triple {37711#(< ~counter~0 94)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {37686#(< ~counter~0 95)} is VALID [2022-04-28 05:57:41,690 INFO L290 TraceCheckUtils]: 40: Hoare triple {37711#(< ~counter~0 94)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {37711#(< ~counter~0 94)} is VALID [2022-04-28 05:57:41,690 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {37223#true} {37711#(< ~counter~0 94)} #98#return; {37711#(< ~counter~0 94)} is VALID [2022-04-28 05:57:41,690 INFO L290 TraceCheckUtils]: 38: Hoare triple {37223#true} assume true; {37223#true} is VALID [2022-04-28 05:57:41,690 INFO L290 TraceCheckUtils]: 37: Hoare triple {37223#true} assume !(0 == ~cond); {37223#true} is VALID [2022-04-28 05:57:41,691 INFO L290 TraceCheckUtils]: 36: Hoare triple {37223#true} ~cond := #in~cond; {37223#true} is VALID [2022-04-28 05:57:41,691 INFO L272 TraceCheckUtils]: 35: Hoare triple {37711#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37223#true} is VALID [2022-04-28 05:57:41,691 INFO L290 TraceCheckUtils]: 34: Hoare triple {37711#(< ~counter~0 94)} assume !!(#t~post8 < 100);havoc #t~post8; {37711#(< ~counter~0 94)} is VALID [2022-04-28 05:57:41,691 INFO L290 TraceCheckUtils]: 33: Hoare triple {37736#(< ~counter~0 93)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {37711#(< ~counter~0 94)} is VALID [2022-04-28 05:57:41,692 INFO L290 TraceCheckUtils]: 32: Hoare triple {37736#(< ~counter~0 93)} assume !(~r~0 > 0); {37736#(< ~counter~0 93)} is VALID [2022-04-28 05:57:41,692 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {37223#true} {37736#(< ~counter~0 93)} #96#return; {37736#(< ~counter~0 93)} is VALID [2022-04-28 05:57:41,692 INFO L290 TraceCheckUtils]: 30: Hoare triple {37223#true} assume true; {37223#true} is VALID [2022-04-28 05:57:41,692 INFO L290 TraceCheckUtils]: 29: Hoare triple {37223#true} assume !(0 == ~cond); {37223#true} is VALID [2022-04-28 05:57:41,692 INFO L290 TraceCheckUtils]: 28: Hoare triple {37223#true} ~cond := #in~cond; {37223#true} is VALID [2022-04-28 05:57:41,692 INFO L272 TraceCheckUtils]: 27: Hoare triple {37736#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37223#true} is VALID [2022-04-28 05:57:41,693 INFO L290 TraceCheckUtils]: 26: Hoare triple {37736#(< ~counter~0 93)} assume !!(#t~post7 < 100);havoc #t~post7; {37736#(< ~counter~0 93)} is VALID [2022-04-28 05:57:41,693 INFO L290 TraceCheckUtils]: 25: Hoare triple {37761#(< ~counter~0 92)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37736#(< ~counter~0 93)} is VALID [2022-04-28 05:57:41,693 INFO L290 TraceCheckUtils]: 24: Hoare triple {37761#(< ~counter~0 92)} assume !!(0 != ~r~0); {37761#(< ~counter~0 92)} is VALID [2022-04-28 05:57:41,694 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {37223#true} {37761#(< ~counter~0 92)} #94#return; {37761#(< ~counter~0 92)} is VALID [2022-04-28 05:57:41,694 INFO L290 TraceCheckUtils]: 22: Hoare triple {37223#true} assume true; {37223#true} is VALID [2022-04-28 05:57:41,694 INFO L290 TraceCheckUtils]: 21: Hoare triple {37223#true} assume !(0 == ~cond); {37223#true} is VALID [2022-04-28 05:57:41,694 INFO L290 TraceCheckUtils]: 20: Hoare triple {37223#true} ~cond := #in~cond; {37223#true} is VALID [2022-04-28 05:57:41,694 INFO L272 TraceCheckUtils]: 19: Hoare triple {37761#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37223#true} is VALID [2022-04-28 05:57:41,694 INFO L290 TraceCheckUtils]: 18: Hoare triple {37761#(< ~counter~0 92)} assume !!(#t~post6 < 100);havoc #t~post6; {37761#(< ~counter~0 92)} is VALID [2022-04-28 05:57:41,695 INFO L290 TraceCheckUtils]: 17: Hoare triple {37786#(< ~counter~0 91)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37761#(< ~counter~0 92)} is VALID [2022-04-28 05:57:41,695 INFO L290 TraceCheckUtils]: 16: Hoare triple {37786#(< ~counter~0 91)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {37786#(< ~counter~0 91)} is VALID [2022-04-28 05:57:41,696 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {37223#true} {37786#(< ~counter~0 91)} #92#return; {37786#(< ~counter~0 91)} is VALID [2022-04-28 05:57:41,696 INFO L290 TraceCheckUtils]: 14: Hoare triple {37223#true} assume true; {37223#true} is VALID [2022-04-28 05:57:41,696 INFO L290 TraceCheckUtils]: 13: Hoare triple {37223#true} assume !(0 == ~cond); {37223#true} is VALID [2022-04-28 05:57:41,696 INFO L290 TraceCheckUtils]: 12: Hoare triple {37223#true} ~cond := #in~cond; {37223#true} is VALID [2022-04-28 05:57:41,696 INFO L272 TraceCheckUtils]: 11: Hoare triple {37786#(< ~counter~0 91)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {37223#true} is VALID [2022-04-28 05:57:41,696 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {37223#true} {37786#(< ~counter~0 91)} #90#return; {37786#(< ~counter~0 91)} is VALID [2022-04-28 05:57:41,696 INFO L290 TraceCheckUtils]: 9: Hoare triple {37223#true} assume true; {37223#true} is VALID [2022-04-28 05:57:41,696 INFO L290 TraceCheckUtils]: 8: Hoare triple {37223#true} assume !(0 == ~cond); {37223#true} is VALID [2022-04-28 05:57:41,696 INFO L290 TraceCheckUtils]: 7: Hoare triple {37223#true} ~cond := #in~cond; {37223#true} is VALID [2022-04-28 05:57:41,697 INFO L272 TraceCheckUtils]: 6: Hoare triple {37786#(< ~counter~0 91)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {37223#true} is VALID [2022-04-28 05:57:41,697 INFO L290 TraceCheckUtils]: 5: Hoare triple {37786#(< ~counter~0 91)} 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 91)} is VALID [2022-04-28 05:57:41,697 INFO L272 TraceCheckUtils]: 4: Hoare triple {37786#(< ~counter~0 91)} call #t~ret9 := main(); {37786#(< ~counter~0 91)} is VALID [2022-04-28 05:57:41,697 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37786#(< ~counter~0 91)} {37223#true} #102#return; {37786#(< ~counter~0 91)} is VALID [2022-04-28 05:57:41,698 INFO L290 TraceCheckUtils]: 2: Hoare triple {37786#(< ~counter~0 91)} assume true; {37786#(< ~counter~0 91)} is VALID [2022-04-28 05:57:41,698 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 91)} is VALID [2022-04-28 05:57:41,698 INFO L272 TraceCheckUtils]: 0: Hoare triple {37223#true} call ULTIMATE.init(); {37223#true} is VALID [2022-04-28 05:57:41,698 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 26 proven. 58 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-04-28 05:57:41,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:57:41,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028656577] [2022-04-28 05:57:41,699 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:57:41,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082950993] [2022-04-28 05:57:41,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082950993] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:57:41,699 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:57:41,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-04-28 05:57:41,699 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:57:41,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1664913918] [2022-04-28 05:57:41,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1664913918] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:57:41,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:57:41,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 05:57:41,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410431444] [2022-04-28 05:57:41,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:57:41,700 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 12 states have internal predecessors, (70), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) Word has length 99 [2022-04-28 05:57:41,700 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:57:41,700 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 12 states have internal predecessors, (70), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-28 05:57:41,760 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:41,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 05:57:41,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:57:41,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 05:57:41,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-28 05:57:41,761 INFO L87 Difference]: Start difference. First operand 352 states and 468 transitions. Second operand has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 12 states have internal predecessors, (70), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-28 05:57:42,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:42,796 INFO L93 Difference]: Finished difference Result 471 states and 642 transitions. [2022-04-28 05:57:42,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 05:57:42,797 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 12 states have internal predecessors, (70), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) Word has length 99 [2022-04-28 05:57:42,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:57:42,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 12 states have internal predecessors, (70), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-28 05:57:42,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 216 transitions. [2022-04-28 05:57:42,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 12 states have internal predecessors, (70), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-28 05:57:42,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 216 transitions. [2022-04-28 05:57:42,800 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 216 transitions. [2022-04-28 05:57:42,965 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 216 edges. 216 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:42,971 INFO L225 Difference]: With dead ends: 471 [2022-04-28 05:57:42,971 INFO L226 Difference]: Without dead ends: 364 [2022-04-28 05:57:42,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=412, Invalid=580, Unknown=0, NotChecked=0, Total=992 [2022-04-28 05:57:42,972 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 110 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 05:57:42,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 238 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 05:57:42,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2022-04-28 05:57:43,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 364. [2022-04-28 05:57:43,474 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:57:43,486 INFO L82 GeneralOperation]: Start isEquivalent. First operand 364 states. Second operand has 364 states, 277 states have (on average 1.2057761732851986) internal successors, (334), 277 states have internal predecessors, (334), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-28 05:57:43,486 INFO L74 IsIncluded]: Start isIncluded. First operand 364 states. Second operand has 364 states, 277 states have (on average 1.2057761732851986) internal successors, (334), 277 states have internal predecessors, (334), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-28 05:57:43,487 INFO L87 Difference]: Start difference. First operand 364 states. Second operand has 364 states, 277 states have (on average 1.2057761732851986) internal successors, (334), 277 states have internal predecessors, (334), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-28 05:57:43,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:43,492 INFO L93 Difference]: Finished difference Result 364 states and 480 transitions. [2022-04-28 05:57:43,492 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 480 transitions. [2022-04-28 05:57:43,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:57:43,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:57:43,493 INFO L74 IsIncluded]: Start isIncluded. First operand has 364 states, 277 states have (on average 1.2057761732851986) internal successors, (334), 277 states have internal predecessors, (334), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) Second operand 364 states. [2022-04-28 05:57:43,494 INFO L87 Difference]: Start difference. First operand has 364 states, 277 states have (on average 1.2057761732851986) internal successors, (334), 277 states have internal predecessors, (334), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) Second operand 364 states. [2022-04-28 05:57:43,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:43,500 INFO L93 Difference]: Finished difference Result 364 states and 480 transitions. [2022-04-28 05:57:43,500 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 480 transitions. [2022-04-28 05:57:43,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:57:43,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:57:43,500 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:57:43,500 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:57:43,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 277 states have (on average 1.2057761732851986) internal successors, (334), 277 states have internal predecessors, (334), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-28 05:57:43,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 480 transitions. [2022-04-28 05:57:43,508 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 480 transitions. Word has length 99 [2022-04-28 05:57:43,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:57:43,509 INFO L495 AbstractCegarLoop]: Abstraction has 364 states and 480 transitions. [2022-04-28 05:57:43,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 12 states have internal predecessors, (70), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-28 05:57:43,509 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 364 states and 480 transitions. [2022-04-28 05:57:45,749 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 480 edges. 480 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:45,749 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 480 transitions. [2022-04-28 05:57:45,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-04-28 05:57:45,750 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:57:45,750 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:57:45,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-04-28 05:57:45,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:57:45,950 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:57:45,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:57:45,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1761003221, now seen corresponding path program 3 times [2022-04-28 05:57:45,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:57:45,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1608511000] [2022-04-28 05:57:45,951 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:57:45,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1761003221, now seen corresponding path program 4 times [2022-04-28 05:57:45,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:57:45,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506667655] [2022-04-28 05:57:45,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:57:45,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:57:45,963 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:57:45,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1188071593] [2022-04-28 05:57:45,963 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 05:57:45,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:57:45,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:57:45,964 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:57:45,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-04-28 05:57:46,069 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 05:57:46,069 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:57:46,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 05:57:46,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:57:46,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:57:46,562 INFO L272 TraceCheckUtils]: 0: Hoare triple {40254#true} call ULTIMATE.init(); {40254#true} is VALID [2022-04-28 05:57:46,562 INFO L290 TraceCheckUtils]: 1: Hoare triple {40254#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {40262#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:46,563 INFO L290 TraceCheckUtils]: 2: Hoare triple {40262#(<= ~counter~0 0)} assume true; {40262#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:46,563 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40262#(<= ~counter~0 0)} {40254#true} #102#return; {40262#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:46,563 INFO L272 TraceCheckUtils]: 4: Hoare triple {40262#(<= ~counter~0 0)} call #t~ret9 := main(); {40262#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:46,564 INFO L290 TraceCheckUtils]: 5: Hoare triple {40262#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {40262#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:46,564 INFO L272 TraceCheckUtils]: 6: Hoare triple {40262#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {40262#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:46,564 INFO L290 TraceCheckUtils]: 7: Hoare triple {40262#(<= ~counter~0 0)} ~cond := #in~cond; {40262#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:46,565 INFO L290 TraceCheckUtils]: 8: Hoare triple {40262#(<= ~counter~0 0)} assume !(0 == ~cond); {40262#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:46,565 INFO L290 TraceCheckUtils]: 9: Hoare triple {40262#(<= ~counter~0 0)} assume true; {40262#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:46,565 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {40262#(<= ~counter~0 0)} {40262#(<= ~counter~0 0)} #90#return; {40262#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:46,566 INFO L272 TraceCheckUtils]: 11: Hoare triple {40262#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {40262#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:46,566 INFO L290 TraceCheckUtils]: 12: Hoare triple {40262#(<= ~counter~0 0)} ~cond := #in~cond; {40262#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:46,566 INFO L290 TraceCheckUtils]: 13: Hoare triple {40262#(<= ~counter~0 0)} assume !(0 == ~cond); {40262#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:46,566 INFO L290 TraceCheckUtils]: 14: Hoare triple {40262#(<= ~counter~0 0)} assume true; {40262#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:46,567 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {40262#(<= ~counter~0 0)} {40262#(<= ~counter~0 0)} #92#return; {40262#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:46,567 INFO L290 TraceCheckUtils]: 16: Hoare triple {40262#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {40262#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:46,568 INFO L290 TraceCheckUtils]: 17: Hoare triple {40262#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {40311#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:46,568 INFO L290 TraceCheckUtils]: 18: Hoare triple {40311#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {40311#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:46,569 INFO L272 TraceCheckUtils]: 19: Hoare triple {40311#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {40311#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:46,569 INFO L290 TraceCheckUtils]: 20: Hoare triple {40311#(<= ~counter~0 1)} ~cond := #in~cond; {40311#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:46,570 INFO L290 TraceCheckUtils]: 21: Hoare triple {40311#(<= ~counter~0 1)} assume !(0 == ~cond); {40311#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:46,570 INFO L290 TraceCheckUtils]: 22: Hoare triple {40311#(<= ~counter~0 1)} assume true; {40311#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:46,570 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {40311#(<= ~counter~0 1)} {40311#(<= ~counter~0 1)} #94#return; {40311#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:46,571 INFO L290 TraceCheckUtils]: 24: Hoare triple {40311#(<= ~counter~0 1)} assume !!(0 != ~r~0); {40311#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:46,571 INFO L290 TraceCheckUtils]: 25: Hoare triple {40311#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {40336#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:46,572 INFO L290 TraceCheckUtils]: 26: Hoare triple {40336#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {40336#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:46,572 INFO L272 TraceCheckUtils]: 27: Hoare triple {40336#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {40336#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:46,572 INFO L290 TraceCheckUtils]: 28: Hoare triple {40336#(<= ~counter~0 2)} ~cond := #in~cond; {40336#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:46,573 INFO L290 TraceCheckUtils]: 29: Hoare triple {40336#(<= ~counter~0 2)} assume !(0 == ~cond); {40336#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:46,573 INFO L290 TraceCheckUtils]: 30: Hoare triple {40336#(<= ~counter~0 2)} assume true; {40336#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:46,573 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {40336#(<= ~counter~0 2)} {40336#(<= ~counter~0 2)} #96#return; {40336#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:46,574 INFO L290 TraceCheckUtils]: 32: Hoare triple {40336#(<= ~counter~0 2)} assume !(~r~0 > 0); {40336#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:46,574 INFO L290 TraceCheckUtils]: 33: Hoare triple {40336#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {40361#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:46,574 INFO L290 TraceCheckUtils]: 34: Hoare triple {40361#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {40361#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:46,575 INFO L272 TraceCheckUtils]: 35: Hoare triple {40361#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {40361#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:46,575 INFO L290 TraceCheckUtils]: 36: Hoare triple {40361#(<= ~counter~0 3)} ~cond := #in~cond; {40361#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:46,575 INFO L290 TraceCheckUtils]: 37: Hoare triple {40361#(<= ~counter~0 3)} assume !(0 == ~cond); {40361#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:46,576 INFO L290 TraceCheckUtils]: 38: Hoare triple {40361#(<= ~counter~0 3)} assume true; {40361#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:46,576 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {40361#(<= ~counter~0 3)} {40361#(<= ~counter~0 3)} #98#return; {40361#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:46,576 INFO L290 TraceCheckUtils]: 40: Hoare triple {40361#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {40361#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:46,577 INFO L290 TraceCheckUtils]: 41: Hoare triple {40361#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {40386#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:46,577 INFO L290 TraceCheckUtils]: 42: Hoare triple {40386#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {40386#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:46,578 INFO L272 TraceCheckUtils]: 43: Hoare triple {40386#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {40386#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:46,578 INFO L290 TraceCheckUtils]: 44: Hoare triple {40386#(<= ~counter~0 4)} ~cond := #in~cond; {40386#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:46,578 INFO L290 TraceCheckUtils]: 45: Hoare triple {40386#(<= ~counter~0 4)} assume !(0 == ~cond); {40386#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:46,578 INFO L290 TraceCheckUtils]: 46: Hoare triple {40386#(<= ~counter~0 4)} assume true; {40386#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:46,579 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {40386#(<= ~counter~0 4)} {40386#(<= ~counter~0 4)} #98#return; {40386#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:46,579 INFO L290 TraceCheckUtils]: 48: Hoare triple {40386#(<= ~counter~0 4)} assume !(~r~0 < 0); {40386#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:46,580 INFO L290 TraceCheckUtils]: 49: Hoare triple {40386#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {40411#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:46,580 INFO L290 TraceCheckUtils]: 50: Hoare triple {40411#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {40411#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:46,581 INFO L272 TraceCheckUtils]: 51: Hoare triple {40411#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {40411#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:46,581 INFO L290 TraceCheckUtils]: 52: Hoare triple {40411#(<= ~counter~0 5)} ~cond := #in~cond; {40411#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:46,581 INFO L290 TraceCheckUtils]: 53: Hoare triple {40411#(<= ~counter~0 5)} assume !(0 == ~cond); {40411#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:46,581 INFO L290 TraceCheckUtils]: 54: Hoare triple {40411#(<= ~counter~0 5)} assume true; {40411#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:46,582 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {40411#(<= ~counter~0 5)} {40411#(<= ~counter~0 5)} #94#return; {40411#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:46,582 INFO L290 TraceCheckUtils]: 56: Hoare triple {40411#(<= ~counter~0 5)} assume !!(0 != ~r~0); {40411#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:46,583 INFO L290 TraceCheckUtils]: 57: Hoare triple {40411#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {40436#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:46,583 INFO L290 TraceCheckUtils]: 58: Hoare triple {40436#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {40436#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:46,583 INFO L272 TraceCheckUtils]: 59: Hoare triple {40436#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {40436#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:46,584 INFO L290 TraceCheckUtils]: 60: Hoare triple {40436#(<= ~counter~0 6)} ~cond := #in~cond; {40436#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:46,584 INFO L290 TraceCheckUtils]: 61: Hoare triple {40436#(<= ~counter~0 6)} assume !(0 == ~cond); {40436#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:46,584 INFO L290 TraceCheckUtils]: 62: Hoare triple {40436#(<= ~counter~0 6)} assume true; {40436#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:46,585 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {40436#(<= ~counter~0 6)} {40436#(<= ~counter~0 6)} #96#return; {40436#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:46,585 INFO L290 TraceCheckUtils]: 64: Hoare triple {40436#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {40436#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:46,585 INFO L290 TraceCheckUtils]: 65: Hoare triple {40436#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {40461#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:46,586 INFO L290 TraceCheckUtils]: 66: Hoare triple {40461#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {40461#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:46,586 INFO L272 TraceCheckUtils]: 67: Hoare triple {40461#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {40461#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:46,586 INFO L290 TraceCheckUtils]: 68: Hoare triple {40461#(<= ~counter~0 7)} ~cond := #in~cond; {40461#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:46,587 INFO L290 TraceCheckUtils]: 69: Hoare triple {40461#(<= ~counter~0 7)} assume !(0 == ~cond); {40461#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:46,587 INFO L290 TraceCheckUtils]: 70: Hoare triple {40461#(<= ~counter~0 7)} assume true; {40461#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:46,587 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {40461#(<= ~counter~0 7)} {40461#(<= ~counter~0 7)} #96#return; {40461#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:46,588 INFO L290 TraceCheckUtils]: 72: Hoare triple {40461#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {40461#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:46,588 INFO L290 TraceCheckUtils]: 73: Hoare triple {40461#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {40486#(<= ~counter~0 8)} is VALID [2022-04-28 05:57:46,588 INFO L290 TraceCheckUtils]: 74: Hoare triple {40486#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {40486#(<= ~counter~0 8)} is VALID [2022-04-28 05:57:46,589 INFO L272 TraceCheckUtils]: 75: Hoare triple {40486#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {40486#(<= ~counter~0 8)} is VALID [2022-04-28 05:57:46,589 INFO L290 TraceCheckUtils]: 76: Hoare triple {40486#(<= ~counter~0 8)} ~cond := #in~cond; {40486#(<= ~counter~0 8)} is VALID [2022-04-28 05:57:46,589 INFO L290 TraceCheckUtils]: 77: Hoare triple {40486#(<= ~counter~0 8)} assume !(0 == ~cond); {40486#(<= ~counter~0 8)} is VALID [2022-04-28 05:57:46,590 INFO L290 TraceCheckUtils]: 78: Hoare triple {40486#(<= ~counter~0 8)} assume true; {40486#(<= ~counter~0 8)} is VALID [2022-04-28 05:57:46,590 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {40486#(<= ~counter~0 8)} {40486#(<= ~counter~0 8)} #96#return; {40486#(<= ~counter~0 8)} is VALID [2022-04-28 05:57:46,597 INFO L290 TraceCheckUtils]: 80: Hoare triple {40486#(<= ~counter~0 8)} assume !(~r~0 > 0); {40486#(<= ~counter~0 8)} is VALID [2022-04-28 05:57:46,597 INFO L290 TraceCheckUtils]: 81: Hoare triple {40486#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {40511#(<= ~counter~0 9)} is VALID [2022-04-28 05:57:46,598 INFO L290 TraceCheckUtils]: 82: Hoare triple {40511#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {40511#(<= ~counter~0 9)} is VALID [2022-04-28 05:57:46,598 INFO L272 TraceCheckUtils]: 83: Hoare triple {40511#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {40511#(<= ~counter~0 9)} is VALID [2022-04-28 05:57:46,599 INFO L290 TraceCheckUtils]: 84: Hoare triple {40511#(<= ~counter~0 9)} ~cond := #in~cond; {40511#(<= ~counter~0 9)} is VALID [2022-04-28 05:57:46,599 INFO L290 TraceCheckUtils]: 85: Hoare triple {40511#(<= ~counter~0 9)} assume !(0 == ~cond); {40511#(<= ~counter~0 9)} is VALID [2022-04-28 05:57:46,599 INFO L290 TraceCheckUtils]: 86: Hoare triple {40511#(<= ~counter~0 9)} assume true; {40511#(<= ~counter~0 9)} is VALID [2022-04-28 05:57:46,600 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {40511#(<= ~counter~0 9)} {40511#(<= ~counter~0 9)} #98#return; {40511#(<= ~counter~0 9)} is VALID [2022-04-28 05:57:46,600 INFO L290 TraceCheckUtils]: 88: Hoare triple {40511#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {40511#(<= ~counter~0 9)} is VALID [2022-04-28 05:57:46,600 INFO L290 TraceCheckUtils]: 89: Hoare triple {40511#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {40536#(<= ~counter~0 10)} is VALID [2022-04-28 05:57:46,601 INFO L290 TraceCheckUtils]: 90: Hoare triple {40536#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {40536#(<= ~counter~0 10)} is VALID [2022-04-28 05:57:46,601 INFO L272 TraceCheckUtils]: 91: Hoare triple {40536#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {40536#(<= ~counter~0 10)} is VALID [2022-04-28 05:57:46,601 INFO L290 TraceCheckUtils]: 92: Hoare triple {40536#(<= ~counter~0 10)} ~cond := #in~cond; {40536#(<= ~counter~0 10)} is VALID [2022-04-28 05:57:46,602 INFO L290 TraceCheckUtils]: 93: Hoare triple {40536#(<= ~counter~0 10)} assume !(0 == ~cond); {40536#(<= ~counter~0 10)} is VALID [2022-04-28 05:57:46,602 INFO L290 TraceCheckUtils]: 94: Hoare triple {40536#(<= ~counter~0 10)} assume true; {40536#(<= ~counter~0 10)} is VALID [2022-04-28 05:57:46,602 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {40536#(<= ~counter~0 10)} {40536#(<= ~counter~0 10)} #98#return; {40536#(<= ~counter~0 10)} is VALID [2022-04-28 05:57:46,603 INFO L290 TraceCheckUtils]: 96: Hoare triple {40536#(<= ~counter~0 10)} assume !(~r~0 < 0); {40536#(<= ~counter~0 10)} is VALID [2022-04-28 05:57:46,603 INFO L290 TraceCheckUtils]: 97: Hoare triple {40536#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {40561#(<= |main_#t~post6| 10)} is VALID [2022-04-28 05:57:46,603 INFO L290 TraceCheckUtils]: 98: Hoare triple {40561#(<= |main_#t~post6| 10)} assume !(#t~post6 < 100);havoc #t~post6; {40255#false} is VALID [2022-04-28 05:57:46,609 INFO L272 TraceCheckUtils]: 99: Hoare triple {40255#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {40255#false} is VALID [2022-04-28 05:57:46,609 INFO L290 TraceCheckUtils]: 100: Hoare triple {40255#false} ~cond := #in~cond; {40255#false} is VALID [2022-04-28 05:57:46,609 INFO L290 TraceCheckUtils]: 101: Hoare triple {40255#false} assume 0 == ~cond; {40255#false} is VALID [2022-04-28 05:57:46,609 INFO L290 TraceCheckUtils]: 102: Hoare triple {40255#false} assume !false; {40255#false} is VALID [2022-04-28 05:57:46,610 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 20 proven. 236 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:57:46,610 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:57:47,134 INFO L290 TraceCheckUtils]: 102: Hoare triple {40255#false} assume !false; {40255#false} is VALID [2022-04-28 05:57:47,135 INFO L290 TraceCheckUtils]: 101: Hoare triple {40255#false} assume 0 == ~cond; {40255#false} is VALID [2022-04-28 05:57:47,135 INFO L290 TraceCheckUtils]: 100: Hoare triple {40255#false} ~cond := #in~cond; {40255#false} is VALID [2022-04-28 05:57:47,135 INFO L272 TraceCheckUtils]: 99: Hoare triple {40255#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {40255#false} is VALID [2022-04-28 05:57:47,135 INFO L290 TraceCheckUtils]: 98: Hoare triple {40589#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {40255#false} is VALID [2022-04-28 05:57:47,135 INFO L290 TraceCheckUtils]: 97: Hoare triple {40593#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {40589#(< |main_#t~post6| 100)} is VALID [2022-04-28 05:57:47,136 INFO L290 TraceCheckUtils]: 96: Hoare triple {40593#(< ~counter~0 100)} assume !(~r~0 < 0); {40593#(< ~counter~0 100)} is VALID [2022-04-28 05:57:47,136 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {40254#true} {40593#(< ~counter~0 100)} #98#return; {40593#(< ~counter~0 100)} is VALID [2022-04-28 05:57:47,136 INFO L290 TraceCheckUtils]: 94: Hoare triple {40254#true} assume true; {40254#true} is VALID [2022-04-28 05:57:47,136 INFO L290 TraceCheckUtils]: 93: Hoare triple {40254#true} assume !(0 == ~cond); {40254#true} is VALID [2022-04-28 05:57:47,136 INFO L290 TraceCheckUtils]: 92: Hoare triple {40254#true} ~cond := #in~cond; {40254#true} is VALID [2022-04-28 05:57:47,136 INFO L272 TraceCheckUtils]: 91: Hoare triple {40593#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {40254#true} is VALID [2022-04-28 05:57:47,137 INFO L290 TraceCheckUtils]: 90: Hoare triple {40593#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {40593#(< ~counter~0 100)} is VALID [2022-04-28 05:57:47,138 INFO L290 TraceCheckUtils]: 89: Hoare triple {40618#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {40593#(< ~counter~0 100)} is VALID [2022-04-28 05:57:47,138 INFO L290 TraceCheckUtils]: 88: Hoare triple {40618#(< ~counter~0 99)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {40618#(< ~counter~0 99)} is VALID [2022-04-28 05:57:47,138 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {40254#true} {40618#(< ~counter~0 99)} #98#return; {40618#(< ~counter~0 99)} is VALID [2022-04-28 05:57:47,138 INFO L290 TraceCheckUtils]: 86: Hoare triple {40254#true} assume true; {40254#true} is VALID [2022-04-28 05:57:47,138 INFO L290 TraceCheckUtils]: 85: Hoare triple {40254#true} assume !(0 == ~cond); {40254#true} is VALID [2022-04-28 05:57:47,139 INFO L290 TraceCheckUtils]: 84: Hoare triple {40254#true} ~cond := #in~cond; {40254#true} is VALID [2022-04-28 05:57:47,139 INFO L272 TraceCheckUtils]: 83: Hoare triple {40618#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {40254#true} is VALID [2022-04-28 05:57:47,139 INFO L290 TraceCheckUtils]: 82: Hoare triple {40618#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {40618#(< ~counter~0 99)} is VALID [2022-04-28 05:57:47,139 INFO L290 TraceCheckUtils]: 81: Hoare triple {40643#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {40618#(< ~counter~0 99)} is VALID [2022-04-28 05:57:47,140 INFO L290 TraceCheckUtils]: 80: Hoare triple {40643#(< ~counter~0 98)} assume !(~r~0 > 0); {40643#(< ~counter~0 98)} is VALID [2022-04-28 05:57:47,140 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {40254#true} {40643#(< ~counter~0 98)} #96#return; {40643#(< ~counter~0 98)} is VALID [2022-04-28 05:57:47,140 INFO L290 TraceCheckUtils]: 78: Hoare triple {40254#true} assume true; {40254#true} is VALID [2022-04-28 05:57:47,140 INFO L290 TraceCheckUtils]: 77: Hoare triple {40254#true} assume !(0 == ~cond); {40254#true} is VALID [2022-04-28 05:57:47,140 INFO L290 TraceCheckUtils]: 76: Hoare triple {40254#true} ~cond := #in~cond; {40254#true} is VALID [2022-04-28 05:57:47,140 INFO L272 TraceCheckUtils]: 75: Hoare triple {40643#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {40254#true} is VALID [2022-04-28 05:57:47,141 INFO L290 TraceCheckUtils]: 74: Hoare triple {40643#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {40643#(< ~counter~0 98)} is VALID [2022-04-28 05:57:47,141 INFO L290 TraceCheckUtils]: 73: Hoare triple {40668#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {40643#(< ~counter~0 98)} is VALID [2022-04-28 05:57:47,142 INFO L290 TraceCheckUtils]: 72: Hoare triple {40668#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {40668#(< ~counter~0 97)} is VALID [2022-04-28 05:57:47,142 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {40254#true} {40668#(< ~counter~0 97)} #96#return; {40668#(< ~counter~0 97)} is VALID [2022-04-28 05:57:47,142 INFO L290 TraceCheckUtils]: 70: Hoare triple {40254#true} assume true; {40254#true} is VALID [2022-04-28 05:57:47,142 INFO L290 TraceCheckUtils]: 69: Hoare triple {40254#true} assume !(0 == ~cond); {40254#true} is VALID [2022-04-28 05:57:47,142 INFO L290 TraceCheckUtils]: 68: Hoare triple {40254#true} ~cond := #in~cond; {40254#true} is VALID [2022-04-28 05:57:47,142 INFO L272 TraceCheckUtils]: 67: Hoare triple {40668#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {40254#true} is VALID [2022-04-28 05:57:47,143 INFO L290 TraceCheckUtils]: 66: Hoare triple {40668#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {40668#(< ~counter~0 97)} is VALID [2022-04-28 05:57:47,143 INFO L290 TraceCheckUtils]: 65: Hoare triple {40693#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {40668#(< ~counter~0 97)} is VALID [2022-04-28 05:57:47,143 INFO L290 TraceCheckUtils]: 64: Hoare triple {40693#(< ~counter~0 96)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {40693#(< ~counter~0 96)} is VALID [2022-04-28 05:57:47,144 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {40254#true} {40693#(< ~counter~0 96)} #96#return; {40693#(< ~counter~0 96)} is VALID [2022-04-28 05:57:47,144 INFO L290 TraceCheckUtils]: 62: Hoare triple {40254#true} assume true; {40254#true} is VALID [2022-04-28 05:57:47,144 INFO L290 TraceCheckUtils]: 61: Hoare triple {40254#true} assume !(0 == ~cond); {40254#true} is VALID [2022-04-28 05:57:47,144 INFO L290 TraceCheckUtils]: 60: Hoare triple {40254#true} ~cond := #in~cond; {40254#true} is VALID [2022-04-28 05:57:47,144 INFO L272 TraceCheckUtils]: 59: Hoare triple {40693#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {40254#true} is VALID [2022-04-28 05:57:47,144 INFO L290 TraceCheckUtils]: 58: Hoare triple {40693#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {40693#(< ~counter~0 96)} is VALID [2022-04-28 05:57:47,145 INFO L290 TraceCheckUtils]: 57: Hoare triple {40718#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {40693#(< ~counter~0 96)} is VALID [2022-04-28 05:57:47,145 INFO L290 TraceCheckUtils]: 56: Hoare triple {40718#(< ~counter~0 95)} assume !!(0 != ~r~0); {40718#(< ~counter~0 95)} is VALID [2022-04-28 05:57:47,146 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {40254#true} {40718#(< ~counter~0 95)} #94#return; {40718#(< ~counter~0 95)} is VALID [2022-04-28 05:57:47,146 INFO L290 TraceCheckUtils]: 54: Hoare triple {40254#true} assume true; {40254#true} is VALID [2022-04-28 05:57:47,146 INFO L290 TraceCheckUtils]: 53: Hoare triple {40254#true} assume !(0 == ~cond); {40254#true} is VALID [2022-04-28 05:57:47,146 INFO L290 TraceCheckUtils]: 52: Hoare triple {40254#true} ~cond := #in~cond; {40254#true} is VALID [2022-04-28 05:57:47,146 INFO L272 TraceCheckUtils]: 51: Hoare triple {40718#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {40254#true} is VALID [2022-04-28 05:57:47,146 INFO L290 TraceCheckUtils]: 50: Hoare triple {40718#(< ~counter~0 95)} assume !!(#t~post6 < 100);havoc #t~post6; {40718#(< ~counter~0 95)} is VALID [2022-04-28 05:57:47,147 INFO L290 TraceCheckUtils]: 49: Hoare triple {40743#(< ~counter~0 94)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {40718#(< ~counter~0 95)} is VALID [2022-04-28 05:57:47,147 INFO L290 TraceCheckUtils]: 48: Hoare triple {40743#(< ~counter~0 94)} assume !(~r~0 < 0); {40743#(< ~counter~0 94)} is VALID [2022-04-28 05:57:47,148 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {40254#true} {40743#(< ~counter~0 94)} #98#return; {40743#(< ~counter~0 94)} is VALID [2022-04-28 05:57:47,148 INFO L290 TraceCheckUtils]: 46: Hoare triple {40254#true} assume true; {40254#true} is VALID [2022-04-28 05:57:47,148 INFO L290 TraceCheckUtils]: 45: Hoare triple {40254#true} assume !(0 == ~cond); {40254#true} is VALID [2022-04-28 05:57:47,148 INFO L290 TraceCheckUtils]: 44: Hoare triple {40254#true} ~cond := #in~cond; {40254#true} is VALID [2022-04-28 05:57:47,148 INFO L272 TraceCheckUtils]: 43: Hoare triple {40743#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {40254#true} is VALID [2022-04-28 05:57:47,148 INFO L290 TraceCheckUtils]: 42: Hoare triple {40743#(< ~counter~0 94)} assume !!(#t~post8 < 100);havoc #t~post8; {40743#(< ~counter~0 94)} is VALID [2022-04-28 05:57:47,149 INFO L290 TraceCheckUtils]: 41: Hoare triple {40768#(< ~counter~0 93)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {40743#(< ~counter~0 94)} is VALID [2022-04-28 05:57:47,149 INFO L290 TraceCheckUtils]: 40: Hoare triple {40768#(< ~counter~0 93)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {40768#(< ~counter~0 93)} is VALID [2022-04-28 05:57:47,149 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {40254#true} {40768#(< ~counter~0 93)} #98#return; {40768#(< ~counter~0 93)} is VALID [2022-04-28 05:57:47,150 INFO L290 TraceCheckUtils]: 38: Hoare triple {40254#true} assume true; {40254#true} is VALID [2022-04-28 05:57:47,150 INFO L290 TraceCheckUtils]: 37: Hoare triple {40254#true} assume !(0 == ~cond); {40254#true} is VALID [2022-04-28 05:57:47,150 INFO L290 TraceCheckUtils]: 36: Hoare triple {40254#true} ~cond := #in~cond; {40254#true} is VALID [2022-04-28 05:57:47,150 INFO L272 TraceCheckUtils]: 35: Hoare triple {40768#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {40254#true} is VALID [2022-04-28 05:57:47,150 INFO L290 TraceCheckUtils]: 34: Hoare triple {40768#(< ~counter~0 93)} assume !!(#t~post8 < 100);havoc #t~post8; {40768#(< ~counter~0 93)} is VALID [2022-04-28 05:57:47,151 INFO L290 TraceCheckUtils]: 33: Hoare triple {40793#(< ~counter~0 92)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {40768#(< ~counter~0 93)} is VALID [2022-04-28 05:57:47,151 INFO L290 TraceCheckUtils]: 32: Hoare triple {40793#(< ~counter~0 92)} assume !(~r~0 > 0); {40793#(< ~counter~0 92)} is VALID [2022-04-28 05:57:47,151 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {40254#true} {40793#(< ~counter~0 92)} #96#return; {40793#(< ~counter~0 92)} is VALID [2022-04-28 05:57:47,151 INFO L290 TraceCheckUtils]: 30: Hoare triple {40254#true} assume true; {40254#true} is VALID [2022-04-28 05:57:47,151 INFO L290 TraceCheckUtils]: 29: Hoare triple {40254#true} assume !(0 == ~cond); {40254#true} is VALID [2022-04-28 05:57:47,152 INFO L290 TraceCheckUtils]: 28: Hoare triple {40254#true} ~cond := #in~cond; {40254#true} is VALID [2022-04-28 05:57:47,152 INFO L272 TraceCheckUtils]: 27: Hoare triple {40793#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {40254#true} is VALID [2022-04-28 05:57:47,152 INFO L290 TraceCheckUtils]: 26: Hoare triple {40793#(< ~counter~0 92)} assume !!(#t~post7 < 100);havoc #t~post7; {40793#(< ~counter~0 92)} is VALID [2022-04-28 05:57:47,152 INFO L290 TraceCheckUtils]: 25: Hoare triple {40818#(< ~counter~0 91)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {40793#(< ~counter~0 92)} is VALID [2022-04-28 05:57:47,153 INFO L290 TraceCheckUtils]: 24: Hoare triple {40818#(< ~counter~0 91)} assume !!(0 != ~r~0); {40818#(< ~counter~0 91)} is VALID [2022-04-28 05:57:47,153 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {40254#true} {40818#(< ~counter~0 91)} #94#return; {40818#(< ~counter~0 91)} is VALID [2022-04-28 05:57:47,153 INFO L290 TraceCheckUtils]: 22: Hoare triple {40254#true} assume true; {40254#true} is VALID [2022-04-28 05:57:47,153 INFO L290 TraceCheckUtils]: 21: Hoare triple {40254#true} assume !(0 == ~cond); {40254#true} is VALID [2022-04-28 05:57:47,153 INFO L290 TraceCheckUtils]: 20: Hoare triple {40254#true} ~cond := #in~cond; {40254#true} is VALID [2022-04-28 05:57:47,153 INFO L272 TraceCheckUtils]: 19: Hoare triple {40818#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {40254#true} is VALID [2022-04-28 05:57:47,154 INFO L290 TraceCheckUtils]: 18: Hoare triple {40818#(< ~counter~0 91)} assume !!(#t~post6 < 100);havoc #t~post6; {40818#(< ~counter~0 91)} is VALID [2022-04-28 05:57:47,154 INFO L290 TraceCheckUtils]: 17: Hoare triple {40843#(< ~counter~0 90)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {40818#(< ~counter~0 91)} is VALID [2022-04-28 05:57:47,155 INFO L290 TraceCheckUtils]: 16: Hoare triple {40843#(< ~counter~0 90)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {40843#(< ~counter~0 90)} is VALID [2022-04-28 05:57:47,155 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {40254#true} {40843#(< ~counter~0 90)} #92#return; {40843#(< ~counter~0 90)} is VALID [2022-04-28 05:57:47,155 INFO L290 TraceCheckUtils]: 14: Hoare triple {40254#true} assume true; {40254#true} is VALID [2022-04-28 05:57:47,155 INFO L290 TraceCheckUtils]: 13: Hoare triple {40254#true} assume !(0 == ~cond); {40254#true} is VALID [2022-04-28 05:57:47,155 INFO L290 TraceCheckUtils]: 12: Hoare triple {40254#true} ~cond := #in~cond; {40254#true} is VALID [2022-04-28 05:57:47,155 INFO L272 TraceCheckUtils]: 11: Hoare triple {40843#(< ~counter~0 90)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {40254#true} is VALID [2022-04-28 05:57:47,156 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {40254#true} {40843#(< ~counter~0 90)} #90#return; {40843#(< ~counter~0 90)} is VALID [2022-04-28 05:57:47,156 INFO L290 TraceCheckUtils]: 9: Hoare triple {40254#true} assume true; {40254#true} is VALID [2022-04-28 05:57:47,156 INFO L290 TraceCheckUtils]: 8: Hoare triple {40254#true} assume !(0 == ~cond); {40254#true} is VALID [2022-04-28 05:57:47,156 INFO L290 TraceCheckUtils]: 7: Hoare triple {40254#true} ~cond := #in~cond; {40254#true} is VALID [2022-04-28 05:57:47,156 INFO L272 TraceCheckUtils]: 6: Hoare triple {40843#(< ~counter~0 90)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {40254#true} is VALID [2022-04-28 05:57:47,156 INFO L290 TraceCheckUtils]: 5: Hoare triple {40843#(< ~counter~0 90)} 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; {40843#(< ~counter~0 90)} is VALID [2022-04-28 05:57:47,156 INFO L272 TraceCheckUtils]: 4: Hoare triple {40843#(< ~counter~0 90)} call #t~ret9 := main(); {40843#(< ~counter~0 90)} is VALID [2022-04-28 05:57:47,157 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40843#(< ~counter~0 90)} {40254#true} #102#return; {40843#(< ~counter~0 90)} is VALID [2022-04-28 05:57:47,157 INFO L290 TraceCheckUtils]: 2: Hoare triple {40843#(< ~counter~0 90)} assume true; {40843#(< ~counter~0 90)} is VALID [2022-04-28 05:57:47,157 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; {40843#(< ~counter~0 90)} is VALID [2022-04-28 05:57:47,158 INFO L272 TraceCheckUtils]: 0: Hoare triple {40254#true} call ULTIMATE.init(); {40254#true} is VALID [2022-04-28 05:57:47,158 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 20 proven. 56 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-04-28 05:57:47,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:57:47,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506667655] [2022-04-28 05:57:47,158 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:57:47,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188071593] [2022-04-28 05:57:47,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1188071593] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:57:47,158 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:57:47,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-04-28 05:57:47,158 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:57:47,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1608511000] [2022-04-28 05:57:47,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1608511000] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:57:47,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:57:47,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 05:57:47,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196828644] [2022-04-28 05:57:47,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:57:47,159 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 13 states have internal predecessors, (72), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) Word has length 103 [2022-04-28 05:57:47,159 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:57:47,160 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 13 states have internal predecessors, (72), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-28 05:57:47,242 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:47,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 05:57:47,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:57:47,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 05:57:47,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2022-04-28 05:57:47,243 INFO L87 Difference]: Start difference. First operand 364 states and 480 transitions. Second operand has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 13 states have internal predecessors, (72), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-28 05:57:48,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:48,495 INFO L93 Difference]: Finished difference Result 407 states and 538 transitions. [2022-04-28 05:57:48,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 05:57:48,495 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 13 states have internal predecessors, (72), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) Word has length 103 [2022-04-28 05:57:48,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:57:48,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 13 states have internal predecessors, (72), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-28 05:57:48,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 214 transitions. [2022-04-28 05:57:48,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 13 states have internal predecessors, (72), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-28 05:57:48,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 214 transitions. [2022-04-28 05:57:48,502 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 214 transitions. [2022-04-28 05:57:48,648 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 214 edges. 214 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:48,655 INFO L225 Difference]: With dead ends: 407 [2022-04-28 05:57:48,655 INFO L226 Difference]: Without dead ends: 396 [2022-04-28 05:57:48,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=438, Invalid=618, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 05:57:48,656 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 146 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 05:57:48,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 250 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 05:57:48,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2022-04-28 05:57:49,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 377. [2022-04-28 05:57:49,225 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:57:49,226 INFO L82 GeneralOperation]: Start isEquivalent. First operand 396 states. Second operand has 377 states, 281 states have (on average 1.206405693950178) internal successors, (339), 288 states have internal predecessors, (339), 82 states have call successors, (82), 15 states have call predecessors, (82), 13 states have return successors, (80), 73 states have call predecessors, (80), 80 states have call successors, (80) [2022-04-28 05:57:49,226 INFO L74 IsIncluded]: Start isIncluded. First operand 396 states. Second operand has 377 states, 281 states have (on average 1.206405693950178) internal successors, (339), 288 states have internal predecessors, (339), 82 states have call successors, (82), 15 states have call predecessors, (82), 13 states have return successors, (80), 73 states have call predecessors, (80), 80 states have call successors, (80) [2022-04-28 05:57:49,227 INFO L87 Difference]: Start difference. First operand 396 states. Second operand has 377 states, 281 states have (on average 1.206405693950178) internal successors, (339), 288 states have internal predecessors, (339), 82 states have call successors, (82), 15 states have call predecessors, (82), 13 states have return successors, (80), 73 states have call predecessors, (80), 80 states have call successors, (80) [2022-04-28 05:57:49,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:49,233 INFO L93 Difference]: Finished difference Result 396 states and 523 transitions. [2022-04-28 05:57:49,234 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 523 transitions. [2022-04-28 05:57:49,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:57:49,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:57:49,235 INFO L74 IsIncluded]: Start isIncluded. First operand has 377 states, 281 states have (on average 1.206405693950178) internal successors, (339), 288 states have internal predecessors, (339), 82 states have call successors, (82), 15 states have call predecessors, (82), 13 states have return successors, (80), 73 states have call predecessors, (80), 80 states have call successors, (80) Second operand 396 states. [2022-04-28 05:57:49,235 INFO L87 Difference]: Start difference. First operand has 377 states, 281 states have (on average 1.206405693950178) internal successors, (339), 288 states have internal predecessors, (339), 82 states have call successors, (82), 15 states have call predecessors, (82), 13 states have return successors, (80), 73 states have call predecessors, (80), 80 states have call successors, (80) Second operand 396 states. [2022-04-28 05:57:49,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:49,242 INFO L93 Difference]: Finished difference Result 396 states and 523 transitions. [2022-04-28 05:57:49,242 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 523 transitions. [2022-04-28 05:57:49,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:57:49,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:57:49,242 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:57:49,242 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:57:49,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 281 states have (on average 1.206405693950178) internal successors, (339), 288 states have internal predecessors, (339), 82 states have call successors, (82), 15 states have call predecessors, (82), 13 states have return successors, (80), 73 states have call predecessors, (80), 80 states have call successors, (80) [2022-04-28 05:57:49,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 501 transitions. [2022-04-28 05:57:49,250 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 501 transitions. Word has length 103 [2022-04-28 05:57:49,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:57:49,250 INFO L495 AbstractCegarLoop]: Abstraction has 377 states and 501 transitions. [2022-04-28 05:57:49,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 13 states have internal predecessors, (72), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-28 05:57:49,251 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 377 states and 501 transitions. [2022-04-28 05:57:52,297 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 501 edges. 500 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:52,297 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 501 transitions. [2022-04-28 05:57:52,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-04-28 05:57:52,298 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:57:52,299 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:57:52,319 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2022-04-28 05:57:52,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:57:52,502 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:57:52,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:57:52,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1733340336, now seen corresponding path program 9 times [2022-04-28 05:57:52,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:57:52,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [399023455] [2022-04-28 05:57:52,503 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:57:52,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1733340336, now seen corresponding path program 10 times [2022-04-28 05:57:52,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:57:52,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131193001] [2022-04-28 05:57:52,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:57:52,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:57:52,514 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:57:52,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1279721671] [2022-04-28 05:57:52,514 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 05:57:52,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:57:52,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:57:52,515 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:57:52,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-04-28 05:57:52,573 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 05:57:52,573 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:57:52,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 05:57:52,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:57:52,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:57:53,349 INFO L272 TraceCheckUtils]: 0: Hoare triple {43271#true} call ULTIMATE.init(); {43271#true} is VALID [2022-04-28 05:57:53,349 INFO L290 TraceCheckUtils]: 1: Hoare triple {43271#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; {43271#true} is VALID [2022-04-28 05:57:53,349 INFO L290 TraceCheckUtils]: 2: Hoare triple {43271#true} assume true; {43271#true} is VALID [2022-04-28 05:57:53,349 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43271#true} {43271#true} #102#return; {43271#true} is VALID [2022-04-28 05:57:53,349 INFO L272 TraceCheckUtils]: 4: Hoare triple {43271#true} call #t~ret9 := main(); {43271#true} is VALID [2022-04-28 05:57:53,349 INFO L290 TraceCheckUtils]: 5: Hoare triple {43271#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; {43271#true} is VALID [2022-04-28 05:57:53,350 INFO L272 TraceCheckUtils]: 6: Hoare triple {43271#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {43271#true} is VALID [2022-04-28 05:57:53,350 INFO L290 TraceCheckUtils]: 7: Hoare triple {43271#true} ~cond := #in~cond; {43271#true} is VALID [2022-04-28 05:57:53,350 INFO L290 TraceCheckUtils]: 8: Hoare triple {43271#true} assume !(0 == ~cond); {43271#true} is VALID [2022-04-28 05:57:53,350 INFO L290 TraceCheckUtils]: 9: Hoare triple {43271#true} assume true; {43271#true} is VALID [2022-04-28 05:57:53,350 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {43271#true} {43271#true} #90#return; {43271#true} is VALID [2022-04-28 05:57:53,350 INFO L272 TraceCheckUtils]: 11: Hoare triple {43271#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)); {43271#true} is VALID [2022-04-28 05:57:53,350 INFO L290 TraceCheckUtils]: 12: Hoare triple {43271#true} ~cond := #in~cond; {43271#true} is VALID [2022-04-28 05:57:53,350 INFO L290 TraceCheckUtils]: 13: Hoare triple {43271#true} assume !(0 == ~cond); {43271#true} is VALID [2022-04-28 05:57:53,350 INFO L290 TraceCheckUtils]: 14: Hoare triple {43271#true} assume true; {43271#true} is VALID [2022-04-28 05:57:53,350 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {43271#true} {43271#true} #92#return; {43271#true} is VALID [2022-04-28 05:57:53,350 INFO L290 TraceCheckUtils]: 16: Hoare triple {43271#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {43271#true} is VALID [2022-04-28 05:57:53,350 INFO L290 TraceCheckUtils]: 17: Hoare triple {43271#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43271#true} is VALID [2022-04-28 05:57:53,350 INFO L290 TraceCheckUtils]: 18: Hoare triple {43271#true} assume !!(#t~post6 < 100);havoc #t~post6; {43271#true} is VALID [2022-04-28 05:57:53,350 INFO L272 TraceCheckUtils]: 19: Hoare triple {43271#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)); {43271#true} is VALID [2022-04-28 05:57:53,350 INFO L290 TraceCheckUtils]: 20: Hoare triple {43271#true} ~cond := #in~cond; {43271#true} is VALID [2022-04-28 05:57:53,351 INFO L290 TraceCheckUtils]: 21: Hoare triple {43271#true} assume !(0 == ~cond); {43271#true} is VALID [2022-04-28 05:57:53,351 INFO L290 TraceCheckUtils]: 22: Hoare triple {43271#true} assume true; {43271#true} is VALID [2022-04-28 05:57:53,351 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {43271#true} {43271#true} #94#return; {43271#true} is VALID [2022-04-28 05:57:53,351 INFO L290 TraceCheckUtils]: 24: Hoare triple {43271#true} assume !!(0 != ~r~0); {43271#true} is VALID [2022-04-28 05:57:53,351 INFO L290 TraceCheckUtils]: 25: Hoare triple {43271#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43271#true} is VALID [2022-04-28 05:57:53,351 INFO L290 TraceCheckUtils]: 26: Hoare triple {43271#true} assume !!(#t~post7 < 100);havoc #t~post7; {43271#true} is VALID [2022-04-28 05:57:53,351 INFO L272 TraceCheckUtils]: 27: Hoare triple {43271#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)); {43271#true} is VALID [2022-04-28 05:57:53,351 INFO L290 TraceCheckUtils]: 28: Hoare triple {43271#true} ~cond := #in~cond; {43271#true} is VALID [2022-04-28 05:57:53,351 INFO L290 TraceCheckUtils]: 29: Hoare triple {43271#true} assume !(0 == ~cond); {43271#true} is VALID [2022-04-28 05:57:53,351 INFO L290 TraceCheckUtils]: 30: Hoare triple {43271#true} assume true; {43271#true} is VALID [2022-04-28 05:57:53,351 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {43271#true} {43271#true} #96#return; {43271#true} is VALID [2022-04-28 05:57:53,351 INFO L290 TraceCheckUtils]: 32: Hoare triple {43271#true} assume !(~r~0 > 0); {43271#true} is VALID [2022-04-28 05:57:53,351 INFO L290 TraceCheckUtils]: 33: Hoare triple {43271#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43271#true} is VALID [2022-04-28 05:57:53,351 INFO L290 TraceCheckUtils]: 34: Hoare triple {43271#true} assume !!(#t~post8 < 100);havoc #t~post8; {43271#true} is VALID [2022-04-28 05:57:53,352 INFO L272 TraceCheckUtils]: 35: Hoare triple {43271#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)); {43271#true} is VALID [2022-04-28 05:57:53,352 INFO L290 TraceCheckUtils]: 36: Hoare triple {43271#true} ~cond := #in~cond; {43271#true} is VALID [2022-04-28 05:57:53,352 INFO L290 TraceCheckUtils]: 37: Hoare triple {43271#true} assume !(0 == ~cond); {43271#true} is VALID [2022-04-28 05:57:53,352 INFO L290 TraceCheckUtils]: 38: Hoare triple {43271#true} assume true; {43271#true} is VALID [2022-04-28 05:57:53,352 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {43271#true} {43271#true} #98#return; {43271#true} is VALID [2022-04-28 05:57:53,353 INFO L290 TraceCheckUtils]: 40: Hoare triple {43271#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {43396#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-28 05:57:53,353 INFO L290 TraceCheckUtils]: 41: Hoare triple {43396#(< (+ main_~r~0 2) main_~u~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43396#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-28 05:57:53,354 INFO L290 TraceCheckUtils]: 42: Hoare triple {43396#(< (+ main_~r~0 2) main_~u~0)} assume !!(#t~post8 < 100);havoc #t~post8; {43396#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-28 05:57:53,354 INFO L272 TraceCheckUtils]: 43: Hoare triple {43396#(< (+ 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)); {43271#true} is VALID [2022-04-28 05:57:53,354 INFO L290 TraceCheckUtils]: 44: Hoare triple {43271#true} ~cond := #in~cond; {43271#true} is VALID [2022-04-28 05:57:53,354 INFO L290 TraceCheckUtils]: 45: Hoare triple {43271#true} assume !(0 == ~cond); {43271#true} is VALID [2022-04-28 05:57:53,354 INFO L290 TraceCheckUtils]: 46: Hoare triple {43271#true} assume true; {43271#true} is VALID [2022-04-28 05:57:53,354 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {43271#true} {43396#(< (+ main_~r~0 2) main_~u~0)} #98#return; {43396#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-28 05:57:53,355 INFO L290 TraceCheckUtils]: 48: Hoare triple {43396#(< (+ main_~r~0 2) main_~u~0)} assume !(~r~0 < 0); {43396#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-28 05:57:53,356 INFO L290 TraceCheckUtils]: 49: Hoare triple {43396#(< (+ main_~r~0 2) main_~u~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43396#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-28 05:57:53,357 INFO L290 TraceCheckUtils]: 50: Hoare triple {43396#(< (+ main_~r~0 2) main_~u~0)} assume !!(#t~post6 < 100);havoc #t~post6; {43396#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-28 05:57:53,357 INFO L272 TraceCheckUtils]: 51: Hoare triple {43396#(< (+ 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)); {43271#true} is VALID [2022-04-28 05:57:53,357 INFO L290 TraceCheckUtils]: 52: Hoare triple {43271#true} ~cond := #in~cond; {43271#true} is VALID [2022-04-28 05:57:53,357 INFO L290 TraceCheckUtils]: 53: Hoare triple {43271#true} assume !(0 == ~cond); {43271#true} is VALID [2022-04-28 05:57:53,357 INFO L290 TraceCheckUtils]: 54: Hoare triple {43271#true} assume true; {43271#true} is VALID [2022-04-28 05:57:53,357 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {43271#true} {43396#(< (+ main_~r~0 2) main_~u~0)} #94#return; {43396#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-28 05:57:53,358 INFO L290 TraceCheckUtils]: 56: Hoare triple {43396#(< (+ main_~r~0 2) main_~u~0)} assume !!(0 != ~r~0); {43396#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-28 05:57:53,358 INFO L290 TraceCheckUtils]: 57: Hoare triple {43396#(< (+ main_~r~0 2) main_~u~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43396#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-28 05:57:53,358 INFO L290 TraceCheckUtils]: 58: Hoare triple {43396#(< (+ main_~r~0 2) main_~u~0)} assume !!(#t~post7 < 100);havoc #t~post7; {43396#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-28 05:57:53,358 INFO L272 TraceCheckUtils]: 59: Hoare triple {43396#(< (+ 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)); {43271#true} is VALID [2022-04-28 05:57:53,359 INFO L290 TraceCheckUtils]: 60: Hoare triple {43271#true} ~cond := #in~cond; {43271#true} is VALID [2022-04-28 05:57:53,359 INFO L290 TraceCheckUtils]: 61: Hoare triple {43271#true} assume !(0 == ~cond); {43271#true} is VALID [2022-04-28 05:57:53,359 INFO L290 TraceCheckUtils]: 62: Hoare triple {43271#true} assume true; {43271#true} is VALID [2022-04-28 05:57:53,359 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {43271#true} {43396#(< (+ main_~r~0 2) main_~u~0)} #96#return; {43396#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-28 05:57:53,360 INFO L290 TraceCheckUtils]: 64: Hoare triple {43396#(< (+ main_~r~0 2) main_~u~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {43469#(< (+ main_~v~0 main_~r~0) main_~u~0)} is VALID [2022-04-28 05:57:53,360 INFO L290 TraceCheckUtils]: 65: Hoare triple {43469#(< (+ main_~v~0 main_~r~0) main_~u~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43469#(< (+ main_~v~0 main_~r~0) main_~u~0)} is VALID [2022-04-28 05:57:53,360 INFO L290 TraceCheckUtils]: 66: Hoare triple {43469#(< (+ main_~v~0 main_~r~0) main_~u~0)} assume !!(#t~post7 < 100);havoc #t~post7; {43469#(< (+ main_~v~0 main_~r~0) main_~u~0)} is VALID [2022-04-28 05:57:53,360 INFO L272 TraceCheckUtils]: 67: Hoare triple {43469#(< (+ 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)); {43271#true} is VALID [2022-04-28 05:57:53,360 INFO L290 TraceCheckUtils]: 68: Hoare triple {43271#true} ~cond := #in~cond; {43271#true} is VALID [2022-04-28 05:57:53,361 INFO L290 TraceCheckUtils]: 69: Hoare triple {43271#true} assume !(0 == ~cond); {43271#true} is VALID [2022-04-28 05:57:53,361 INFO L290 TraceCheckUtils]: 70: Hoare triple {43271#true} assume true; {43271#true} is VALID [2022-04-28 05:57:53,361 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {43271#true} {43469#(< (+ main_~v~0 main_~r~0) main_~u~0)} #96#return; {43469#(< (+ main_~v~0 main_~r~0) main_~u~0)} is VALID [2022-04-28 05:57:53,362 INFO L290 TraceCheckUtils]: 72: Hoare triple {43469#(< (+ main_~v~0 main_~r~0) main_~u~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {43494#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} is VALID [2022-04-28 05:57:53,362 INFO L290 TraceCheckUtils]: 73: Hoare triple {43494#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43494#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} is VALID [2022-04-28 05:57:53,362 INFO L290 TraceCheckUtils]: 74: Hoare triple {43494#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} assume !!(#t~post7 < 100);havoc #t~post7; {43494#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} is VALID [2022-04-28 05:57:53,362 INFO L272 TraceCheckUtils]: 75: Hoare triple {43494#(< 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)); {43271#true} is VALID [2022-04-28 05:57:53,362 INFO L290 TraceCheckUtils]: 76: Hoare triple {43271#true} ~cond := #in~cond; {43271#true} is VALID [2022-04-28 05:57:53,362 INFO L290 TraceCheckUtils]: 77: Hoare triple {43271#true} assume !(0 == ~cond); {43271#true} is VALID [2022-04-28 05:57:53,362 INFO L290 TraceCheckUtils]: 78: Hoare triple {43271#true} assume true; {43271#true} is VALID [2022-04-28 05:57:53,363 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {43271#true} {43494#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} #96#return; {43494#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} is VALID [2022-04-28 05:57:53,363 INFO L290 TraceCheckUtils]: 80: Hoare triple {43494#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} assume !(~r~0 > 0); {43494#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} is VALID [2022-04-28 05:57:53,363 INFO L290 TraceCheckUtils]: 81: Hoare triple {43494#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43494#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} is VALID [2022-04-28 05:57:53,364 INFO L290 TraceCheckUtils]: 82: Hoare triple {43494#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} assume !!(#t~post8 < 100);havoc #t~post8; {43494#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} is VALID [2022-04-28 05:57:53,364 INFO L272 TraceCheckUtils]: 83: Hoare triple {43494#(< 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)); {43271#true} is VALID [2022-04-28 05:57:53,364 INFO L290 TraceCheckUtils]: 84: Hoare triple {43271#true} ~cond := #in~cond; {43271#true} is VALID [2022-04-28 05:57:53,364 INFO L290 TraceCheckUtils]: 85: Hoare triple {43271#true} assume !(0 == ~cond); {43271#true} is VALID [2022-04-28 05:57:53,364 INFO L290 TraceCheckUtils]: 86: Hoare triple {43271#true} assume true; {43271#true} is VALID [2022-04-28 05:57:53,364 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {43271#true} {43494#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} #98#return; {43494#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} is VALID [2022-04-28 05:57:53,365 INFO L290 TraceCheckUtils]: 88: Hoare triple {43494#(< 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; {43543#(< 0 (div (+ (- 1) main_~r~0) 2))} is VALID [2022-04-28 05:57:53,365 INFO L290 TraceCheckUtils]: 89: Hoare triple {43543#(< 0 (div (+ (- 1) main_~r~0) 2))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43543#(< 0 (div (+ (- 1) main_~r~0) 2))} is VALID [2022-04-28 05:57:53,366 INFO L290 TraceCheckUtils]: 90: Hoare triple {43543#(< 0 (div (+ (- 1) main_~r~0) 2))} assume !!(#t~post8 < 100);havoc #t~post8; {43543#(< 0 (div (+ (- 1) main_~r~0) 2))} is VALID [2022-04-28 05:57:53,366 INFO L272 TraceCheckUtils]: 91: Hoare triple {43543#(< 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)); {43271#true} is VALID [2022-04-28 05:57:53,366 INFO L290 TraceCheckUtils]: 92: Hoare triple {43271#true} ~cond := #in~cond; {43271#true} is VALID [2022-04-28 05:57:53,366 INFO L290 TraceCheckUtils]: 93: Hoare triple {43271#true} assume !(0 == ~cond); {43271#true} is VALID [2022-04-28 05:57:53,366 INFO L290 TraceCheckUtils]: 94: Hoare triple {43271#true} assume true; {43271#true} is VALID [2022-04-28 05:57:53,366 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {43271#true} {43543#(< 0 (div (+ (- 1) main_~r~0) 2))} #98#return; {43543#(< 0 (div (+ (- 1) main_~r~0) 2))} is VALID [2022-04-28 05:57:53,367 INFO L290 TraceCheckUtils]: 96: Hoare triple {43543#(< 0 (div (+ (- 1) main_~r~0) 2))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {43272#false} is VALID [2022-04-28 05:57:53,367 INFO L290 TraceCheckUtils]: 97: Hoare triple {43272#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43272#false} is VALID [2022-04-28 05:57:53,367 INFO L290 TraceCheckUtils]: 98: Hoare triple {43272#false} assume !(#t~post8 < 100);havoc #t~post8; {43272#false} is VALID [2022-04-28 05:57:53,367 INFO L290 TraceCheckUtils]: 99: Hoare triple {43272#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43272#false} is VALID [2022-04-28 05:57:53,367 INFO L290 TraceCheckUtils]: 100: Hoare triple {43272#false} assume !(#t~post6 < 100);havoc #t~post6; {43272#false} is VALID [2022-04-28 05:57:53,367 INFO L272 TraceCheckUtils]: 101: Hoare triple {43272#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)); {43272#false} is VALID [2022-04-28 05:57:53,367 INFO L290 TraceCheckUtils]: 102: Hoare triple {43272#false} ~cond := #in~cond; {43272#false} is VALID [2022-04-28 05:57:53,368 INFO L290 TraceCheckUtils]: 103: Hoare triple {43272#false} assume 0 == ~cond; {43272#false} is VALID [2022-04-28 05:57:53,368 INFO L290 TraceCheckUtils]: 104: Hoare triple {43272#false} assume !false; {43272#false} is VALID [2022-04-28 05:57:53,368 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 60 proven. 24 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-04-28 05:57:53,368 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:57:53,761 INFO L290 TraceCheckUtils]: 104: Hoare triple {43272#false} assume !false; {43272#false} is VALID [2022-04-28 05:57:53,761 INFO L290 TraceCheckUtils]: 103: Hoare triple {43272#false} assume 0 == ~cond; {43272#false} is VALID [2022-04-28 05:57:53,761 INFO L290 TraceCheckUtils]: 102: Hoare triple {43272#false} ~cond := #in~cond; {43272#false} is VALID [2022-04-28 05:57:53,761 INFO L272 TraceCheckUtils]: 101: Hoare triple {43272#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)); {43272#false} is VALID [2022-04-28 05:57:53,761 INFO L290 TraceCheckUtils]: 100: Hoare triple {43272#false} assume !(#t~post6 < 100);havoc #t~post6; {43272#false} is VALID [2022-04-28 05:57:53,761 INFO L290 TraceCheckUtils]: 99: Hoare triple {43272#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43272#false} is VALID [2022-04-28 05:57:53,761 INFO L290 TraceCheckUtils]: 98: Hoare triple {43272#false} assume !(#t~post8 < 100);havoc #t~post8; {43272#false} is VALID [2022-04-28 05:57:53,761 INFO L290 TraceCheckUtils]: 97: Hoare triple {43272#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43272#false} is VALID [2022-04-28 05:57:53,762 INFO L290 TraceCheckUtils]: 96: Hoare triple {43616#(not (< main_~r~0 0))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {43272#false} is VALID [2022-04-28 05:57:53,762 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {43271#true} {43616#(not (< main_~r~0 0))} #98#return; {43616#(not (< main_~r~0 0))} is VALID [2022-04-28 05:57:53,762 INFO L290 TraceCheckUtils]: 94: Hoare triple {43271#true} assume true; {43271#true} is VALID [2022-04-28 05:57:53,762 INFO L290 TraceCheckUtils]: 93: Hoare triple {43271#true} assume !(0 == ~cond); {43271#true} is VALID [2022-04-28 05:57:53,762 INFO L290 TraceCheckUtils]: 92: Hoare triple {43271#true} ~cond := #in~cond; {43271#true} is VALID [2022-04-28 05:57:53,763 INFO L272 TraceCheckUtils]: 91: Hoare triple {43616#(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)); {43271#true} is VALID [2022-04-28 05:57:53,763 INFO L290 TraceCheckUtils]: 90: Hoare triple {43616#(not (< main_~r~0 0))} assume !!(#t~post8 < 100);havoc #t~post8; {43616#(not (< main_~r~0 0))} is VALID [2022-04-28 05:57:53,763 INFO L290 TraceCheckUtils]: 89: Hoare triple {43616#(not (< main_~r~0 0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43616#(not (< main_~r~0 0))} is VALID [2022-04-28 05:57:53,764 INFO L290 TraceCheckUtils]: 88: Hoare triple {43641#(<= 0 (+ main_~u~0 main_~r~0))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {43616#(not (< main_~r~0 0))} is VALID [2022-04-28 05:57:53,764 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {43271#true} {43641#(<= 0 (+ main_~u~0 main_~r~0))} #98#return; {43641#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-28 05:57:53,764 INFO L290 TraceCheckUtils]: 86: Hoare triple {43271#true} assume true; {43271#true} is VALID [2022-04-28 05:57:53,764 INFO L290 TraceCheckUtils]: 85: Hoare triple {43271#true} assume !(0 == ~cond); {43271#true} is VALID [2022-04-28 05:57:53,764 INFO L290 TraceCheckUtils]: 84: Hoare triple {43271#true} ~cond := #in~cond; {43271#true} is VALID [2022-04-28 05:57:53,765 INFO L272 TraceCheckUtils]: 83: Hoare triple {43641#(<= 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)); {43271#true} is VALID [2022-04-28 05:57:53,765 INFO L290 TraceCheckUtils]: 82: Hoare triple {43641#(<= 0 (+ main_~u~0 main_~r~0))} assume !!(#t~post8 < 100);havoc #t~post8; {43641#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-28 05:57:53,765 INFO L290 TraceCheckUtils]: 81: Hoare triple {43641#(<= 0 (+ main_~u~0 main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43641#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-28 05:57:53,766 INFO L290 TraceCheckUtils]: 80: Hoare triple {43641#(<= 0 (+ main_~u~0 main_~r~0))} assume !(~r~0 > 0); {43641#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-28 05:57:53,766 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {43271#true} {43641#(<= 0 (+ main_~u~0 main_~r~0))} #96#return; {43641#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-28 05:57:53,766 INFO L290 TraceCheckUtils]: 78: Hoare triple {43271#true} assume true; {43271#true} is VALID [2022-04-28 05:57:53,766 INFO L290 TraceCheckUtils]: 77: Hoare triple {43271#true} assume !(0 == ~cond); {43271#true} is VALID [2022-04-28 05:57:53,766 INFO L290 TraceCheckUtils]: 76: Hoare triple {43271#true} ~cond := #in~cond; {43271#true} is VALID [2022-04-28 05:57:53,766 INFO L272 TraceCheckUtils]: 75: Hoare triple {43641#(<= 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)); {43271#true} is VALID [2022-04-28 05:57:53,767 INFO L290 TraceCheckUtils]: 74: Hoare triple {43641#(<= 0 (+ main_~u~0 main_~r~0))} assume !!(#t~post7 < 100);havoc #t~post7; {43641#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-28 05:57:53,767 INFO L290 TraceCheckUtils]: 73: Hoare triple {43641#(<= 0 (+ main_~u~0 main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43641#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-28 05:57:53,768 INFO L290 TraceCheckUtils]: 72: Hoare triple {43690#(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; {43641#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-28 05:57:53,768 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {43271#true} {43690#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} #96#return; {43690#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} is VALID [2022-04-28 05:57:53,769 INFO L290 TraceCheckUtils]: 70: Hoare triple {43271#true} assume true; {43271#true} is VALID [2022-04-28 05:57:53,769 INFO L290 TraceCheckUtils]: 69: Hoare triple {43271#true} assume !(0 == ~cond); {43271#true} is VALID [2022-04-28 05:57:53,769 INFO L290 TraceCheckUtils]: 68: Hoare triple {43271#true} ~cond := #in~cond; {43271#true} is VALID [2022-04-28 05:57:53,769 INFO L272 TraceCheckUtils]: 67: Hoare triple {43690#(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)); {43271#true} is VALID [2022-04-28 05:57:53,769 INFO L290 TraceCheckUtils]: 66: Hoare triple {43690#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} assume !!(#t~post7 < 100);havoc #t~post7; {43690#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} is VALID [2022-04-28 05:57:53,769 INFO L290 TraceCheckUtils]: 65: Hoare triple {43690#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43690#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} is VALID [2022-04-28 05:57:53,771 INFO L290 TraceCheckUtils]: 64: Hoare triple {43715#(<= main_~r~0 main_~u~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {43690#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} is VALID [2022-04-28 05:57:53,771 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {43271#true} {43715#(<= main_~r~0 main_~u~0)} #96#return; {43715#(<= main_~r~0 main_~u~0)} is VALID [2022-04-28 05:57:53,771 INFO L290 TraceCheckUtils]: 62: Hoare triple {43271#true} assume true; {43271#true} is VALID [2022-04-28 05:57:53,771 INFO L290 TraceCheckUtils]: 61: Hoare triple {43271#true} assume !(0 == ~cond); {43271#true} is VALID [2022-04-28 05:57:53,772 INFO L290 TraceCheckUtils]: 60: Hoare triple {43271#true} ~cond := #in~cond; {43271#true} is VALID [2022-04-28 05:57:53,772 INFO L272 TraceCheckUtils]: 59: Hoare triple {43715#(<= 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)); {43271#true} is VALID [2022-04-28 05:57:53,772 INFO L290 TraceCheckUtils]: 58: Hoare triple {43715#(<= main_~r~0 main_~u~0)} assume !!(#t~post7 < 100);havoc #t~post7; {43715#(<= main_~r~0 main_~u~0)} is VALID [2022-04-28 05:57:53,772 INFO L290 TraceCheckUtils]: 57: Hoare triple {43715#(<= main_~r~0 main_~u~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43715#(<= main_~r~0 main_~u~0)} is VALID [2022-04-28 05:57:53,773 INFO L290 TraceCheckUtils]: 56: Hoare triple {43715#(<= main_~r~0 main_~u~0)} assume !!(0 != ~r~0); {43715#(<= main_~r~0 main_~u~0)} is VALID [2022-04-28 05:57:53,773 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {43271#true} {43715#(<= main_~r~0 main_~u~0)} #94#return; {43715#(<= main_~r~0 main_~u~0)} is VALID [2022-04-28 05:57:53,773 INFO L290 TraceCheckUtils]: 54: Hoare triple {43271#true} assume true; {43271#true} is VALID [2022-04-28 05:57:53,773 INFO L290 TraceCheckUtils]: 53: Hoare triple {43271#true} assume !(0 == ~cond); {43271#true} is VALID [2022-04-28 05:57:53,773 INFO L290 TraceCheckUtils]: 52: Hoare triple {43271#true} ~cond := #in~cond; {43271#true} is VALID [2022-04-28 05:57:53,774 INFO L272 TraceCheckUtils]: 51: Hoare triple {43715#(<= 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)); {43271#true} is VALID [2022-04-28 05:57:53,774 INFO L290 TraceCheckUtils]: 50: Hoare triple {43715#(<= main_~r~0 main_~u~0)} assume !!(#t~post6 < 100);havoc #t~post6; {43715#(<= main_~r~0 main_~u~0)} is VALID [2022-04-28 05:57:53,774 INFO L290 TraceCheckUtils]: 49: Hoare triple {43715#(<= main_~r~0 main_~u~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43715#(<= main_~r~0 main_~u~0)} is VALID [2022-04-28 05:57:53,774 INFO L290 TraceCheckUtils]: 48: Hoare triple {43715#(<= main_~r~0 main_~u~0)} assume !(~r~0 < 0); {43715#(<= main_~r~0 main_~u~0)} is VALID [2022-04-28 05:57:53,775 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {43271#true} {43715#(<= main_~r~0 main_~u~0)} #98#return; {43715#(<= main_~r~0 main_~u~0)} is VALID [2022-04-28 05:57:53,775 INFO L290 TraceCheckUtils]: 46: Hoare triple {43271#true} assume true; {43271#true} is VALID [2022-04-28 05:57:53,775 INFO L290 TraceCheckUtils]: 45: Hoare triple {43271#true} assume !(0 == ~cond); {43271#true} is VALID [2022-04-28 05:57:53,775 INFO L290 TraceCheckUtils]: 44: Hoare triple {43271#true} ~cond := #in~cond; {43271#true} is VALID [2022-04-28 05:57:53,775 INFO L272 TraceCheckUtils]: 43: Hoare triple {43715#(<= 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)); {43271#true} is VALID [2022-04-28 05:57:53,776 INFO L290 TraceCheckUtils]: 42: Hoare triple {43715#(<= main_~r~0 main_~u~0)} assume !!(#t~post8 < 100);havoc #t~post8; {43715#(<= main_~r~0 main_~u~0)} is VALID [2022-04-28 05:57:53,776 INFO L290 TraceCheckUtils]: 41: Hoare triple {43715#(<= main_~r~0 main_~u~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43715#(<= main_~r~0 main_~u~0)} is VALID [2022-04-28 05:57:53,777 INFO L290 TraceCheckUtils]: 40: Hoare triple {43271#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {43715#(<= main_~r~0 main_~u~0)} is VALID [2022-04-28 05:57:53,778 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {43271#true} {43271#true} #98#return; {43271#true} is VALID [2022-04-28 05:57:53,778 INFO L290 TraceCheckUtils]: 38: Hoare triple {43271#true} assume true; {43271#true} is VALID [2022-04-28 05:57:53,778 INFO L290 TraceCheckUtils]: 37: Hoare triple {43271#true} assume !(0 == ~cond); {43271#true} is VALID [2022-04-28 05:57:53,778 INFO L290 TraceCheckUtils]: 36: Hoare triple {43271#true} ~cond := #in~cond; {43271#true} is VALID [2022-04-28 05:57:53,778 INFO L272 TraceCheckUtils]: 35: Hoare triple {43271#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)); {43271#true} is VALID [2022-04-28 05:57:53,778 INFO L290 TraceCheckUtils]: 34: Hoare triple {43271#true} assume !!(#t~post8 < 100);havoc #t~post8; {43271#true} is VALID [2022-04-28 05:57:53,778 INFO L290 TraceCheckUtils]: 33: Hoare triple {43271#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43271#true} is VALID [2022-04-28 05:57:53,778 INFO L290 TraceCheckUtils]: 32: Hoare triple {43271#true} assume !(~r~0 > 0); {43271#true} is VALID [2022-04-28 05:57:53,778 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {43271#true} {43271#true} #96#return; {43271#true} is VALID [2022-04-28 05:57:53,778 INFO L290 TraceCheckUtils]: 30: Hoare triple {43271#true} assume true; {43271#true} is VALID [2022-04-28 05:57:53,778 INFO L290 TraceCheckUtils]: 29: Hoare triple {43271#true} assume !(0 == ~cond); {43271#true} is VALID [2022-04-28 05:57:53,779 INFO L290 TraceCheckUtils]: 28: Hoare triple {43271#true} ~cond := #in~cond; {43271#true} is VALID [2022-04-28 05:57:53,779 INFO L272 TraceCheckUtils]: 27: Hoare triple {43271#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)); {43271#true} is VALID [2022-04-28 05:57:53,779 INFO L290 TraceCheckUtils]: 26: Hoare triple {43271#true} assume !!(#t~post7 < 100);havoc #t~post7; {43271#true} is VALID [2022-04-28 05:57:53,779 INFO L290 TraceCheckUtils]: 25: Hoare triple {43271#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43271#true} is VALID [2022-04-28 05:57:53,779 INFO L290 TraceCheckUtils]: 24: Hoare triple {43271#true} assume !!(0 != ~r~0); {43271#true} is VALID [2022-04-28 05:57:53,779 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {43271#true} {43271#true} #94#return; {43271#true} is VALID [2022-04-28 05:57:53,779 INFO L290 TraceCheckUtils]: 22: Hoare triple {43271#true} assume true; {43271#true} is VALID [2022-04-28 05:57:53,779 INFO L290 TraceCheckUtils]: 21: Hoare triple {43271#true} assume !(0 == ~cond); {43271#true} is VALID [2022-04-28 05:57:53,779 INFO L290 TraceCheckUtils]: 20: Hoare triple {43271#true} ~cond := #in~cond; {43271#true} is VALID [2022-04-28 05:57:53,779 INFO L272 TraceCheckUtils]: 19: Hoare triple {43271#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)); {43271#true} is VALID [2022-04-28 05:57:53,779 INFO L290 TraceCheckUtils]: 18: Hoare triple {43271#true} assume !!(#t~post6 < 100);havoc #t~post6; {43271#true} is VALID [2022-04-28 05:57:53,779 INFO L290 TraceCheckUtils]: 17: Hoare triple {43271#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43271#true} is VALID [2022-04-28 05:57:53,780 INFO L290 TraceCheckUtils]: 16: Hoare triple {43271#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {43271#true} is VALID [2022-04-28 05:57:53,780 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {43271#true} {43271#true} #92#return; {43271#true} is VALID [2022-04-28 05:57:53,780 INFO L290 TraceCheckUtils]: 14: Hoare triple {43271#true} assume true; {43271#true} is VALID [2022-04-28 05:57:53,780 INFO L290 TraceCheckUtils]: 13: Hoare triple {43271#true} assume !(0 == ~cond); {43271#true} is VALID [2022-04-28 05:57:53,780 INFO L290 TraceCheckUtils]: 12: Hoare triple {43271#true} ~cond := #in~cond; {43271#true} is VALID [2022-04-28 05:57:53,780 INFO L272 TraceCheckUtils]: 11: Hoare triple {43271#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)); {43271#true} is VALID [2022-04-28 05:57:53,780 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {43271#true} {43271#true} #90#return; {43271#true} is VALID [2022-04-28 05:57:53,780 INFO L290 TraceCheckUtils]: 9: Hoare triple {43271#true} assume true; {43271#true} is VALID [2022-04-28 05:57:53,780 INFO L290 TraceCheckUtils]: 8: Hoare triple {43271#true} assume !(0 == ~cond); {43271#true} is VALID [2022-04-28 05:57:53,780 INFO L290 TraceCheckUtils]: 7: Hoare triple {43271#true} ~cond := #in~cond; {43271#true} is VALID [2022-04-28 05:57:53,780 INFO L272 TraceCheckUtils]: 6: Hoare triple {43271#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {43271#true} is VALID [2022-04-28 05:57:53,781 INFO L290 TraceCheckUtils]: 5: Hoare triple {43271#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; {43271#true} is VALID [2022-04-28 05:57:53,781 INFO L272 TraceCheckUtils]: 4: Hoare triple {43271#true} call #t~ret9 := main(); {43271#true} is VALID [2022-04-28 05:57:53,781 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43271#true} {43271#true} #102#return; {43271#true} is VALID [2022-04-28 05:57:53,781 INFO L290 TraceCheckUtils]: 2: Hoare triple {43271#true} assume true; {43271#true} is VALID [2022-04-28 05:57:53,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {43271#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; {43271#true} is VALID [2022-04-28 05:57:53,781 INFO L272 TraceCheckUtils]: 0: Hoare triple {43271#true} call ULTIMATE.init(); {43271#true} is VALID [2022-04-28 05:57:53,781 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 60 proven. 24 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-04-28 05:57:53,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:57:53,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131193001] [2022-04-28 05:57:53,782 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:57:53,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1279721671] [2022-04-28 05:57:53,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1279721671] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:57:53,782 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:57:53,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-28 05:57:53,782 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:57:53,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [399023455] [2022-04-28 05:57:53,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [399023455] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:57:53,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:57:53,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 05:57:53,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446445377] [2022-04-28 05:57:53,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:57:53,785 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 6 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 105 [2022-04-28 05:57:53,785 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:57:53,785 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 6 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-28 05:57:53,853 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:53,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 05:57:53,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:57:53,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 05:57:53,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-28 05:57:53,854 INFO L87 Difference]: Start difference. First operand 377 states and 501 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 6 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-28 05:57:55,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:55,706 INFO L93 Difference]: Finished difference Result 649 states and 907 transitions. [2022-04-28 05:57:55,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 05:57:55,706 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 6 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 105 [2022-04-28 05:57:55,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:57:55,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 6 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-28 05:57:55,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 171 transitions. [2022-04-28 05:57:55,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 6 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-28 05:57:55,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 171 transitions. [2022-04-28 05:57:55,708 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 171 transitions. [2022-04-28 05:57:55,846 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:55,860 INFO L225 Difference]: With dead ends: 649 [2022-04-28 05:57:55,860 INFO L226 Difference]: Without dead ends: 588 [2022-04-28 05:57:55,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-28 05:57:55,861 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 38 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 05:57:55,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 280 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 05:57:55,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2022-04-28 05:57:56,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 504. [2022-04-28 05:57:56,798 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:57:56,799 INFO L82 GeneralOperation]: Start isEquivalent. First operand 588 states. Second operand has 504 states, 376 states have (on average 1.247340425531915) internal successors, (469), 386 states have internal predecessors, (469), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 102 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-28 05:57:56,800 INFO L74 IsIncluded]: Start isIncluded. First operand 588 states. Second operand has 504 states, 376 states have (on average 1.247340425531915) internal successors, (469), 386 states have internal predecessors, (469), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 102 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-28 05:57:56,800 INFO L87 Difference]: Start difference. First operand 588 states. Second operand has 504 states, 376 states have (on average 1.247340425531915) internal successors, (469), 386 states have internal predecessors, (469), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 102 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-28 05:57:56,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:56,814 INFO L93 Difference]: Finished difference Result 588 states and 816 transitions. [2022-04-28 05:57:56,814 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 816 transitions. [2022-04-28 05:57:56,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:57:56,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:57:56,815 INFO L74 IsIncluded]: Start isIncluded. First operand has 504 states, 376 states have (on average 1.247340425531915) internal successors, (469), 386 states have internal predecessors, (469), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 102 states have call predecessors, (112), 112 states have call successors, (112) Second operand 588 states. [2022-04-28 05:57:56,815 INFO L87 Difference]: Start difference. First operand has 504 states, 376 states have (on average 1.247340425531915) internal successors, (469), 386 states have internal predecessors, (469), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 102 states have call predecessors, (112), 112 states have call successors, (112) Second operand 588 states. [2022-04-28 05:57:56,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:56,829 INFO L93 Difference]: Finished difference Result 588 states and 816 transitions. [2022-04-28 05:57:56,829 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 816 transitions. [2022-04-28 05:57:56,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:57:56,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:57:56,830 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:57:56,830 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:57:56,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 376 states have (on average 1.247340425531915) internal successors, (469), 386 states have internal predecessors, (469), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 102 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-28 05:57:56,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 695 transitions. [2022-04-28 05:57:56,844 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 695 transitions. Word has length 105 [2022-04-28 05:57:56,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:57:56,844 INFO L495 AbstractCegarLoop]: Abstraction has 504 states and 695 transitions. [2022-04-28 05:57:56,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 6 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-28 05:57:56,844 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 504 states and 695 transitions. [2022-04-28 05:58:00,165 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 695 edges. 694 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 05:58:00,166 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 695 transitions. [2022-04-28 05:58:00,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-04-28 05:58:00,167 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:58:00,167 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:58:00,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-04-28 05:58:00,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:58:00,367 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:58:00,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:58:00,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1666981150, now seen corresponding path program 11 times [2022-04-28 05:58:00,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:58:00,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1472695384] [2022-04-28 05:58:00,368 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:58:00,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1666981150, now seen corresponding path program 12 times [2022-04-28 05:58:00,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:58:00,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902887554] [2022-04-28 05:58:00,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:58:00,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:58:00,379 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:58:00,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [397437920] [2022-04-28 05:58:00,379 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 05:58:00,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:58:00,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:58:00,380 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:58:00,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-04-28 05:58:00,497 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 05:58:00,497 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:58:00,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 05:58:00,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:58:00,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:58:00,992 INFO L272 TraceCheckUtils]: 0: Hoare triple {47398#true} call ULTIMATE.init(); {47398#true} is VALID [2022-04-28 05:58:00,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {47398#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; {47406#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:00,993 INFO L290 TraceCheckUtils]: 2: Hoare triple {47406#(<= ~counter~0 0)} assume true; {47406#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:00,994 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47406#(<= ~counter~0 0)} {47398#true} #102#return; {47406#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:00,994 INFO L272 TraceCheckUtils]: 4: Hoare triple {47406#(<= ~counter~0 0)} call #t~ret9 := main(); {47406#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:00,994 INFO L290 TraceCheckUtils]: 5: Hoare triple {47406#(<= ~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; {47406#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:00,995 INFO L272 TraceCheckUtils]: 6: Hoare triple {47406#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {47406#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:00,995 INFO L290 TraceCheckUtils]: 7: Hoare triple {47406#(<= ~counter~0 0)} ~cond := #in~cond; {47406#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:00,995 INFO L290 TraceCheckUtils]: 8: Hoare triple {47406#(<= ~counter~0 0)} assume !(0 == ~cond); {47406#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:00,995 INFO L290 TraceCheckUtils]: 9: Hoare triple {47406#(<= ~counter~0 0)} assume true; {47406#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:00,996 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {47406#(<= ~counter~0 0)} {47406#(<= ~counter~0 0)} #90#return; {47406#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:00,996 INFO L272 TraceCheckUtils]: 11: Hoare triple {47406#(<= ~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)); {47406#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:00,996 INFO L290 TraceCheckUtils]: 12: Hoare triple {47406#(<= ~counter~0 0)} ~cond := #in~cond; {47406#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:00,997 INFO L290 TraceCheckUtils]: 13: Hoare triple {47406#(<= ~counter~0 0)} assume !(0 == ~cond); {47406#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:00,997 INFO L290 TraceCheckUtils]: 14: Hoare triple {47406#(<= ~counter~0 0)} assume true; {47406#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:00,997 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {47406#(<= ~counter~0 0)} {47406#(<= ~counter~0 0)} #92#return; {47406#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:00,998 INFO L290 TraceCheckUtils]: 16: Hoare triple {47406#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {47406#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:00,999 INFO L290 TraceCheckUtils]: 17: Hoare triple {47406#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47455#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:00,999 INFO L290 TraceCheckUtils]: 18: Hoare triple {47455#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {47455#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:00,999 INFO L272 TraceCheckUtils]: 19: Hoare triple {47455#(<= ~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)); {47455#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:01,000 INFO L290 TraceCheckUtils]: 20: Hoare triple {47455#(<= ~counter~0 1)} ~cond := #in~cond; {47455#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:01,000 INFO L290 TraceCheckUtils]: 21: Hoare triple {47455#(<= ~counter~0 1)} assume !(0 == ~cond); {47455#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:01,000 INFO L290 TraceCheckUtils]: 22: Hoare triple {47455#(<= ~counter~0 1)} assume true; {47455#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:01,001 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {47455#(<= ~counter~0 1)} {47455#(<= ~counter~0 1)} #94#return; {47455#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:01,001 INFO L290 TraceCheckUtils]: 24: Hoare triple {47455#(<= ~counter~0 1)} assume !!(0 != ~r~0); {47455#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:01,002 INFO L290 TraceCheckUtils]: 25: Hoare triple {47455#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {47480#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:01,002 INFO L290 TraceCheckUtils]: 26: Hoare triple {47480#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {47480#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:01,002 INFO L272 TraceCheckUtils]: 27: Hoare triple {47480#(<= ~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)); {47480#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:01,003 INFO L290 TraceCheckUtils]: 28: Hoare triple {47480#(<= ~counter~0 2)} ~cond := #in~cond; {47480#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:01,003 INFO L290 TraceCheckUtils]: 29: Hoare triple {47480#(<= ~counter~0 2)} assume !(0 == ~cond); {47480#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:01,003 INFO L290 TraceCheckUtils]: 30: Hoare triple {47480#(<= ~counter~0 2)} assume true; {47480#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:01,004 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {47480#(<= ~counter~0 2)} {47480#(<= ~counter~0 2)} #96#return; {47480#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:01,004 INFO L290 TraceCheckUtils]: 32: Hoare triple {47480#(<= ~counter~0 2)} assume !(~r~0 > 0); {47480#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:01,004 INFO L290 TraceCheckUtils]: 33: Hoare triple {47480#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {47505#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:01,005 INFO L290 TraceCheckUtils]: 34: Hoare triple {47505#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {47505#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:01,005 INFO L272 TraceCheckUtils]: 35: Hoare triple {47505#(<= ~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)); {47505#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:01,005 INFO L290 TraceCheckUtils]: 36: Hoare triple {47505#(<= ~counter~0 3)} ~cond := #in~cond; {47505#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:01,006 INFO L290 TraceCheckUtils]: 37: Hoare triple {47505#(<= ~counter~0 3)} assume !(0 == ~cond); {47505#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:01,006 INFO L290 TraceCheckUtils]: 38: Hoare triple {47505#(<= ~counter~0 3)} assume true; {47505#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:01,006 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {47505#(<= ~counter~0 3)} {47505#(<= ~counter~0 3)} #98#return; {47505#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:01,007 INFO L290 TraceCheckUtils]: 40: Hoare triple {47505#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {47505#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:01,007 INFO L290 TraceCheckUtils]: 41: Hoare triple {47505#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {47530#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:01,008 INFO L290 TraceCheckUtils]: 42: Hoare triple {47530#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {47530#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:01,008 INFO L272 TraceCheckUtils]: 43: Hoare triple {47530#(<= ~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)); {47530#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:01,008 INFO L290 TraceCheckUtils]: 44: Hoare triple {47530#(<= ~counter~0 4)} ~cond := #in~cond; {47530#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:01,009 INFO L290 TraceCheckUtils]: 45: Hoare triple {47530#(<= ~counter~0 4)} assume !(0 == ~cond); {47530#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:01,009 INFO L290 TraceCheckUtils]: 46: Hoare triple {47530#(<= ~counter~0 4)} assume true; {47530#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:01,009 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {47530#(<= ~counter~0 4)} {47530#(<= ~counter~0 4)} #98#return; {47530#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:01,009 INFO L290 TraceCheckUtils]: 48: Hoare triple {47530#(<= ~counter~0 4)} assume !(~r~0 < 0); {47530#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:01,010 INFO L290 TraceCheckUtils]: 49: Hoare triple {47530#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47555#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:01,010 INFO L290 TraceCheckUtils]: 50: Hoare triple {47555#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {47555#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:01,011 INFO L272 TraceCheckUtils]: 51: Hoare triple {47555#(<= ~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)); {47555#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:01,011 INFO L290 TraceCheckUtils]: 52: Hoare triple {47555#(<= ~counter~0 5)} ~cond := #in~cond; {47555#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:01,011 INFO L290 TraceCheckUtils]: 53: Hoare triple {47555#(<= ~counter~0 5)} assume !(0 == ~cond); {47555#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:01,012 INFO L290 TraceCheckUtils]: 54: Hoare triple {47555#(<= ~counter~0 5)} assume true; {47555#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:01,012 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {47555#(<= ~counter~0 5)} {47555#(<= ~counter~0 5)} #94#return; {47555#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:01,012 INFO L290 TraceCheckUtils]: 56: Hoare triple {47555#(<= ~counter~0 5)} assume !!(0 != ~r~0); {47555#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:01,013 INFO L290 TraceCheckUtils]: 57: Hoare triple {47555#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {47580#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:01,013 INFO L290 TraceCheckUtils]: 58: Hoare triple {47580#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {47580#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:01,014 INFO L272 TraceCheckUtils]: 59: Hoare triple {47580#(<= ~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)); {47580#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:01,014 INFO L290 TraceCheckUtils]: 60: Hoare triple {47580#(<= ~counter~0 6)} ~cond := #in~cond; {47580#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:01,014 INFO L290 TraceCheckUtils]: 61: Hoare triple {47580#(<= ~counter~0 6)} assume !(0 == ~cond); {47580#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:01,015 INFO L290 TraceCheckUtils]: 62: Hoare triple {47580#(<= ~counter~0 6)} assume true; {47580#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:01,015 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {47580#(<= ~counter~0 6)} {47580#(<= ~counter~0 6)} #96#return; {47580#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:01,015 INFO L290 TraceCheckUtils]: 64: Hoare triple {47580#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {47580#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:01,016 INFO L290 TraceCheckUtils]: 65: Hoare triple {47580#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {47605#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:01,016 INFO L290 TraceCheckUtils]: 66: Hoare triple {47605#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {47605#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:01,017 INFO L272 TraceCheckUtils]: 67: Hoare triple {47605#(<= ~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)); {47605#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:01,017 INFO L290 TraceCheckUtils]: 68: Hoare triple {47605#(<= ~counter~0 7)} ~cond := #in~cond; {47605#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:01,017 INFO L290 TraceCheckUtils]: 69: Hoare triple {47605#(<= ~counter~0 7)} assume !(0 == ~cond); {47605#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:01,018 INFO L290 TraceCheckUtils]: 70: Hoare triple {47605#(<= ~counter~0 7)} assume true; {47605#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:01,018 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {47605#(<= ~counter~0 7)} {47605#(<= ~counter~0 7)} #96#return; {47605#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:01,018 INFO L290 TraceCheckUtils]: 72: Hoare triple {47605#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {47605#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:01,019 INFO L290 TraceCheckUtils]: 73: Hoare triple {47605#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {47630#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:01,019 INFO L290 TraceCheckUtils]: 74: Hoare triple {47630#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {47630#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:01,020 INFO L272 TraceCheckUtils]: 75: Hoare triple {47630#(<= ~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)); {47630#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:01,020 INFO L290 TraceCheckUtils]: 76: Hoare triple {47630#(<= ~counter~0 8)} ~cond := #in~cond; {47630#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:01,020 INFO L290 TraceCheckUtils]: 77: Hoare triple {47630#(<= ~counter~0 8)} assume !(0 == ~cond); {47630#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:01,021 INFO L290 TraceCheckUtils]: 78: Hoare triple {47630#(<= ~counter~0 8)} assume true; {47630#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:01,021 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {47630#(<= ~counter~0 8)} {47630#(<= ~counter~0 8)} #96#return; {47630#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:01,021 INFO L290 TraceCheckUtils]: 80: Hoare triple {47630#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {47630#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:01,022 INFO L290 TraceCheckUtils]: 81: Hoare triple {47630#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {47655#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:01,022 INFO L290 TraceCheckUtils]: 82: Hoare triple {47655#(<= ~counter~0 9)} assume !!(#t~post7 < 100);havoc #t~post7; {47655#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:01,023 INFO L272 TraceCheckUtils]: 83: Hoare triple {47655#(<= ~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)); {47655#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:01,023 INFO L290 TraceCheckUtils]: 84: Hoare triple {47655#(<= ~counter~0 9)} ~cond := #in~cond; {47655#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:01,024 INFO L290 TraceCheckUtils]: 85: Hoare triple {47655#(<= ~counter~0 9)} assume !(0 == ~cond); {47655#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:01,024 INFO L290 TraceCheckUtils]: 86: Hoare triple {47655#(<= ~counter~0 9)} assume true; {47655#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:01,024 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {47655#(<= ~counter~0 9)} {47655#(<= ~counter~0 9)} #96#return; {47655#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:01,025 INFO L290 TraceCheckUtils]: 88: Hoare triple {47655#(<= ~counter~0 9)} assume !(~r~0 > 0); {47655#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:01,025 INFO L290 TraceCheckUtils]: 89: Hoare triple {47655#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {47680#(<= ~counter~0 10)} is VALID [2022-04-28 05:58:01,026 INFO L290 TraceCheckUtils]: 90: Hoare triple {47680#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {47680#(<= ~counter~0 10)} is VALID [2022-04-28 05:58:01,026 INFO L272 TraceCheckUtils]: 91: Hoare triple {47680#(<= ~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)); {47680#(<= ~counter~0 10)} is VALID [2022-04-28 05:58:01,026 INFO L290 TraceCheckUtils]: 92: Hoare triple {47680#(<= ~counter~0 10)} ~cond := #in~cond; {47680#(<= ~counter~0 10)} is VALID [2022-04-28 05:58:01,027 INFO L290 TraceCheckUtils]: 93: Hoare triple {47680#(<= ~counter~0 10)} assume !(0 == ~cond); {47680#(<= ~counter~0 10)} is VALID [2022-04-28 05:58:01,027 INFO L290 TraceCheckUtils]: 94: Hoare triple {47680#(<= ~counter~0 10)} assume true; {47680#(<= ~counter~0 10)} is VALID [2022-04-28 05:58:01,027 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {47680#(<= ~counter~0 10)} {47680#(<= ~counter~0 10)} #98#return; {47680#(<= ~counter~0 10)} is VALID [2022-04-28 05:58:01,028 INFO L290 TraceCheckUtils]: 96: Hoare triple {47680#(<= ~counter~0 10)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {47680#(<= ~counter~0 10)} is VALID [2022-04-28 05:58:01,028 INFO L290 TraceCheckUtils]: 97: Hoare triple {47680#(<= ~counter~0 10)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {47705#(<= |main_#t~post8| 10)} is VALID [2022-04-28 05:58:01,028 INFO L290 TraceCheckUtils]: 98: Hoare triple {47705#(<= |main_#t~post8| 10)} assume !(#t~post8 < 100);havoc #t~post8; {47399#false} is VALID [2022-04-28 05:58:01,029 INFO L290 TraceCheckUtils]: 99: Hoare triple {47399#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47399#false} is VALID [2022-04-28 05:58:01,029 INFO L290 TraceCheckUtils]: 100: Hoare triple {47399#false} assume !(#t~post6 < 100);havoc #t~post6; {47399#false} is VALID [2022-04-28 05:58:01,029 INFO L272 TraceCheckUtils]: 101: Hoare triple {47399#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)); {47399#false} is VALID [2022-04-28 05:58:01,029 INFO L290 TraceCheckUtils]: 102: Hoare triple {47399#false} ~cond := #in~cond; {47399#false} is VALID [2022-04-28 05:58:01,029 INFO L290 TraceCheckUtils]: 103: Hoare triple {47399#false} assume 0 == ~cond; {47399#false} is VALID [2022-04-28 05:58:01,029 INFO L290 TraceCheckUtils]: 104: Hoare triple {47399#false} assume !false; {47399#false} is VALID [2022-04-28 05:58:01,029 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 24 proven. 242 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:58:01,030 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:58:01,576 INFO L290 TraceCheckUtils]: 104: Hoare triple {47399#false} assume !false; {47399#false} is VALID [2022-04-28 05:58:01,576 INFO L290 TraceCheckUtils]: 103: Hoare triple {47399#false} assume 0 == ~cond; {47399#false} is VALID [2022-04-28 05:58:01,576 INFO L290 TraceCheckUtils]: 102: Hoare triple {47399#false} ~cond := #in~cond; {47399#false} is VALID [2022-04-28 05:58:01,576 INFO L272 TraceCheckUtils]: 101: Hoare triple {47399#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)); {47399#false} is VALID [2022-04-28 05:58:01,576 INFO L290 TraceCheckUtils]: 100: Hoare triple {47399#false} assume !(#t~post6 < 100);havoc #t~post6; {47399#false} is VALID [2022-04-28 05:58:01,577 INFO L290 TraceCheckUtils]: 99: Hoare triple {47399#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47399#false} is VALID [2022-04-28 05:58:01,577 INFO L290 TraceCheckUtils]: 98: Hoare triple {47745#(< |main_#t~post8| 100)} assume !(#t~post8 < 100);havoc #t~post8; {47399#false} is VALID [2022-04-28 05:58:01,577 INFO L290 TraceCheckUtils]: 97: Hoare triple {47749#(< ~counter~0 100)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {47745#(< |main_#t~post8| 100)} is VALID [2022-04-28 05:58:01,577 INFO L290 TraceCheckUtils]: 96: Hoare triple {47749#(< ~counter~0 100)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {47749#(< ~counter~0 100)} is VALID [2022-04-28 05:58:01,578 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {47398#true} {47749#(< ~counter~0 100)} #98#return; {47749#(< ~counter~0 100)} is VALID [2022-04-28 05:58:01,578 INFO L290 TraceCheckUtils]: 94: Hoare triple {47398#true} assume true; {47398#true} is VALID [2022-04-28 05:58:01,578 INFO L290 TraceCheckUtils]: 93: Hoare triple {47398#true} assume !(0 == ~cond); {47398#true} is VALID [2022-04-28 05:58:01,578 INFO L290 TraceCheckUtils]: 92: Hoare triple {47398#true} ~cond := #in~cond; {47398#true} is VALID [2022-04-28 05:58:01,578 INFO L272 TraceCheckUtils]: 91: Hoare triple {47749#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47398#true} is VALID [2022-04-28 05:58:01,578 INFO L290 TraceCheckUtils]: 90: Hoare triple {47749#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {47749#(< ~counter~0 100)} is VALID [2022-04-28 05:58:01,580 INFO L290 TraceCheckUtils]: 89: Hoare triple {47774#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {47749#(< ~counter~0 100)} is VALID [2022-04-28 05:58:01,580 INFO L290 TraceCheckUtils]: 88: Hoare triple {47774#(< ~counter~0 99)} assume !(~r~0 > 0); {47774#(< ~counter~0 99)} is VALID [2022-04-28 05:58:01,580 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {47398#true} {47774#(< ~counter~0 99)} #96#return; {47774#(< ~counter~0 99)} is VALID [2022-04-28 05:58:01,580 INFO L290 TraceCheckUtils]: 86: Hoare triple {47398#true} assume true; {47398#true} is VALID [2022-04-28 05:58:01,581 INFO L290 TraceCheckUtils]: 85: Hoare triple {47398#true} assume !(0 == ~cond); {47398#true} is VALID [2022-04-28 05:58:01,581 INFO L290 TraceCheckUtils]: 84: Hoare triple {47398#true} ~cond := #in~cond; {47398#true} is VALID [2022-04-28 05:58:01,581 INFO L272 TraceCheckUtils]: 83: Hoare triple {47774#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47398#true} is VALID [2022-04-28 05:58:01,581 INFO L290 TraceCheckUtils]: 82: Hoare triple {47774#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {47774#(< ~counter~0 99)} is VALID [2022-04-28 05:58:01,582 INFO L290 TraceCheckUtils]: 81: Hoare triple {47799#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {47774#(< ~counter~0 99)} is VALID [2022-04-28 05:58:01,582 INFO L290 TraceCheckUtils]: 80: Hoare triple {47799#(< ~counter~0 98)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {47799#(< ~counter~0 98)} is VALID [2022-04-28 05:58:01,582 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {47398#true} {47799#(< ~counter~0 98)} #96#return; {47799#(< ~counter~0 98)} is VALID [2022-04-28 05:58:01,582 INFO L290 TraceCheckUtils]: 78: Hoare triple {47398#true} assume true; {47398#true} is VALID [2022-04-28 05:58:01,582 INFO L290 TraceCheckUtils]: 77: Hoare triple {47398#true} assume !(0 == ~cond); {47398#true} is VALID [2022-04-28 05:58:01,583 INFO L290 TraceCheckUtils]: 76: Hoare triple {47398#true} ~cond := #in~cond; {47398#true} is VALID [2022-04-28 05:58:01,583 INFO L272 TraceCheckUtils]: 75: Hoare triple {47799#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47398#true} is VALID [2022-04-28 05:58:01,583 INFO L290 TraceCheckUtils]: 74: Hoare triple {47799#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {47799#(< ~counter~0 98)} is VALID [2022-04-28 05:58:01,583 INFO L290 TraceCheckUtils]: 73: Hoare triple {47824#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {47799#(< ~counter~0 98)} is VALID [2022-04-28 05:58:01,584 INFO L290 TraceCheckUtils]: 72: Hoare triple {47824#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {47824#(< ~counter~0 97)} is VALID [2022-04-28 05:58:01,584 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {47398#true} {47824#(< ~counter~0 97)} #96#return; {47824#(< ~counter~0 97)} is VALID [2022-04-28 05:58:01,584 INFO L290 TraceCheckUtils]: 70: Hoare triple {47398#true} assume true; {47398#true} is VALID [2022-04-28 05:58:01,584 INFO L290 TraceCheckUtils]: 69: Hoare triple {47398#true} assume !(0 == ~cond); {47398#true} is VALID [2022-04-28 05:58:01,584 INFO L290 TraceCheckUtils]: 68: Hoare triple {47398#true} ~cond := #in~cond; {47398#true} is VALID [2022-04-28 05:58:01,584 INFO L272 TraceCheckUtils]: 67: Hoare triple {47824#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47398#true} is VALID [2022-04-28 05:58:01,585 INFO L290 TraceCheckUtils]: 66: Hoare triple {47824#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {47824#(< ~counter~0 97)} is VALID [2022-04-28 05:58:01,585 INFO L290 TraceCheckUtils]: 65: Hoare triple {47849#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {47824#(< ~counter~0 97)} is VALID [2022-04-28 05:58:01,586 INFO L290 TraceCheckUtils]: 64: Hoare triple {47849#(< ~counter~0 96)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {47849#(< ~counter~0 96)} is VALID [2022-04-28 05:58:01,586 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {47398#true} {47849#(< ~counter~0 96)} #96#return; {47849#(< ~counter~0 96)} is VALID [2022-04-28 05:58:01,586 INFO L290 TraceCheckUtils]: 62: Hoare triple {47398#true} assume true; {47398#true} is VALID [2022-04-28 05:58:01,586 INFO L290 TraceCheckUtils]: 61: Hoare triple {47398#true} assume !(0 == ~cond); {47398#true} is VALID [2022-04-28 05:58:01,586 INFO L290 TraceCheckUtils]: 60: Hoare triple {47398#true} ~cond := #in~cond; {47398#true} is VALID [2022-04-28 05:58:01,586 INFO L272 TraceCheckUtils]: 59: Hoare triple {47849#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47398#true} is VALID [2022-04-28 05:58:01,587 INFO L290 TraceCheckUtils]: 58: Hoare triple {47849#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {47849#(< ~counter~0 96)} is VALID [2022-04-28 05:58:01,587 INFO L290 TraceCheckUtils]: 57: Hoare triple {47874#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {47849#(< ~counter~0 96)} is VALID [2022-04-28 05:58:01,588 INFO L290 TraceCheckUtils]: 56: Hoare triple {47874#(< ~counter~0 95)} assume !!(0 != ~r~0); {47874#(< ~counter~0 95)} is VALID [2022-04-28 05:58:01,588 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {47398#true} {47874#(< ~counter~0 95)} #94#return; {47874#(< ~counter~0 95)} is VALID [2022-04-28 05:58:01,588 INFO L290 TraceCheckUtils]: 54: Hoare triple {47398#true} assume true; {47398#true} is VALID [2022-04-28 05:58:01,588 INFO L290 TraceCheckUtils]: 53: Hoare triple {47398#true} assume !(0 == ~cond); {47398#true} is VALID [2022-04-28 05:58:01,588 INFO L290 TraceCheckUtils]: 52: Hoare triple {47398#true} ~cond := #in~cond; {47398#true} is VALID [2022-04-28 05:58:01,588 INFO L272 TraceCheckUtils]: 51: Hoare triple {47874#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47398#true} is VALID [2022-04-28 05:58:01,589 INFO L290 TraceCheckUtils]: 50: Hoare triple {47874#(< ~counter~0 95)} assume !!(#t~post6 < 100);havoc #t~post6; {47874#(< ~counter~0 95)} is VALID [2022-04-28 05:58:01,589 INFO L290 TraceCheckUtils]: 49: Hoare triple {47899#(< ~counter~0 94)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47874#(< ~counter~0 95)} is VALID [2022-04-28 05:58:01,589 INFO L290 TraceCheckUtils]: 48: Hoare triple {47899#(< ~counter~0 94)} assume !(~r~0 < 0); {47899#(< ~counter~0 94)} is VALID [2022-04-28 05:58:01,590 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {47398#true} {47899#(< ~counter~0 94)} #98#return; {47899#(< ~counter~0 94)} is VALID [2022-04-28 05:58:01,590 INFO L290 TraceCheckUtils]: 46: Hoare triple {47398#true} assume true; {47398#true} is VALID [2022-04-28 05:58:01,590 INFO L290 TraceCheckUtils]: 45: Hoare triple {47398#true} assume !(0 == ~cond); {47398#true} is VALID [2022-04-28 05:58:01,590 INFO L290 TraceCheckUtils]: 44: Hoare triple {47398#true} ~cond := #in~cond; {47398#true} is VALID [2022-04-28 05:58:01,590 INFO L272 TraceCheckUtils]: 43: Hoare triple {47899#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47398#true} is VALID [2022-04-28 05:58:01,592 INFO L290 TraceCheckUtils]: 42: Hoare triple {47899#(< ~counter~0 94)} assume !!(#t~post8 < 100);havoc #t~post8; {47899#(< ~counter~0 94)} is VALID [2022-04-28 05:58:01,592 INFO L290 TraceCheckUtils]: 41: Hoare triple {47924#(< ~counter~0 93)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {47899#(< ~counter~0 94)} is VALID [2022-04-28 05:58:01,592 INFO L290 TraceCheckUtils]: 40: Hoare triple {47924#(< ~counter~0 93)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {47924#(< ~counter~0 93)} is VALID [2022-04-28 05:58:01,593 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {47398#true} {47924#(< ~counter~0 93)} #98#return; {47924#(< ~counter~0 93)} is VALID [2022-04-28 05:58:01,593 INFO L290 TraceCheckUtils]: 38: Hoare triple {47398#true} assume true; {47398#true} is VALID [2022-04-28 05:58:01,593 INFO L290 TraceCheckUtils]: 37: Hoare triple {47398#true} assume !(0 == ~cond); {47398#true} is VALID [2022-04-28 05:58:01,593 INFO L290 TraceCheckUtils]: 36: Hoare triple {47398#true} ~cond := #in~cond; {47398#true} is VALID [2022-04-28 05:58:01,593 INFO L272 TraceCheckUtils]: 35: Hoare triple {47924#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47398#true} is VALID [2022-04-28 05:58:01,593 INFO L290 TraceCheckUtils]: 34: Hoare triple {47924#(< ~counter~0 93)} assume !!(#t~post8 < 100);havoc #t~post8; {47924#(< ~counter~0 93)} is VALID [2022-04-28 05:58:01,594 INFO L290 TraceCheckUtils]: 33: Hoare triple {47949#(< ~counter~0 92)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {47924#(< ~counter~0 93)} is VALID [2022-04-28 05:58:01,594 INFO L290 TraceCheckUtils]: 32: Hoare triple {47949#(< ~counter~0 92)} assume !(~r~0 > 0); {47949#(< ~counter~0 92)} is VALID [2022-04-28 05:58:01,595 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {47398#true} {47949#(< ~counter~0 92)} #96#return; {47949#(< ~counter~0 92)} is VALID [2022-04-28 05:58:01,595 INFO L290 TraceCheckUtils]: 30: Hoare triple {47398#true} assume true; {47398#true} is VALID [2022-04-28 05:58:01,595 INFO L290 TraceCheckUtils]: 29: Hoare triple {47398#true} assume !(0 == ~cond); {47398#true} is VALID [2022-04-28 05:58:01,595 INFO L290 TraceCheckUtils]: 28: Hoare triple {47398#true} ~cond := #in~cond; {47398#true} is VALID [2022-04-28 05:58:01,595 INFO L272 TraceCheckUtils]: 27: Hoare triple {47949#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47398#true} is VALID [2022-04-28 05:58:01,595 INFO L290 TraceCheckUtils]: 26: Hoare triple {47949#(< ~counter~0 92)} assume !!(#t~post7 < 100);havoc #t~post7; {47949#(< ~counter~0 92)} is VALID [2022-04-28 05:58:01,596 INFO L290 TraceCheckUtils]: 25: Hoare triple {47974#(< ~counter~0 91)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {47949#(< ~counter~0 92)} is VALID [2022-04-28 05:58:01,596 INFO L290 TraceCheckUtils]: 24: Hoare triple {47974#(< ~counter~0 91)} assume !!(0 != ~r~0); {47974#(< ~counter~0 91)} is VALID [2022-04-28 05:58:01,597 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {47398#true} {47974#(< ~counter~0 91)} #94#return; {47974#(< ~counter~0 91)} is VALID [2022-04-28 05:58:01,597 INFO L290 TraceCheckUtils]: 22: Hoare triple {47398#true} assume true; {47398#true} is VALID [2022-04-28 05:58:01,597 INFO L290 TraceCheckUtils]: 21: Hoare triple {47398#true} assume !(0 == ~cond); {47398#true} is VALID [2022-04-28 05:58:01,597 INFO L290 TraceCheckUtils]: 20: Hoare triple {47398#true} ~cond := #in~cond; {47398#true} is VALID [2022-04-28 05:58:01,597 INFO L272 TraceCheckUtils]: 19: Hoare triple {47974#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47398#true} is VALID [2022-04-28 05:58:01,597 INFO L290 TraceCheckUtils]: 18: Hoare triple {47974#(< ~counter~0 91)} assume !!(#t~post6 < 100);havoc #t~post6; {47974#(< ~counter~0 91)} is VALID [2022-04-28 05:58:01,598 INFO L290 TraceCheckUtils]: 17: Hoare triple {47999#(< ~counter~0 90)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47974#(< ~counter~0 91)} is VALID [2022-04-28 05:58:01,598 INFO L290 TraceCheckUtils]: 16: Hoare triple {47999#(< ~counter~0 90)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {47999#(< ~counter~0 90)} is VALID [2022-04-28 05:58:01,599 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {47398#true} {47999#(< ~counter~0 90)} #92#return; {47999#(< ~counter~0 90)} is VALID [2022-04-28 05:58:01,599 INFO L290 TraceCheckUtils]: 14: Hoare triple {47398#true} assume true; {47398#true} is VALID [2022-04-28 05:58:01,599 INFO L290 TraceCheckUtils]: 13: Hoare triple {47398#true} assume !(0 == ~cond); {47398#true} is VALID [2022-04-28 05:58:01,599 INFO L290 TraceCheckUtils]: 12: Hoare triple {47398#true} ~cond := #in~cond; {47398#true} is VALID [2022-04-28 05:58:01,599 INFO L272 TraceCheckUtils]: 11: Hoare triple {47999#(< ~counter~0 90)} 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)); {47398#true} is VALID [2022-04-28 05:58:01,599 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {47398#true} {47999#(< ~counter~0 90)} #90#return; {47999#(< ~counter~0 90)} is VALID [2022-04-28 05:58:01,599 INFO L290 TraceCheckUtils]: 9: Hoare triple {47398#true} assume true; {47398#true} is VALID [2022-04-28 05:58:01,599 INFO L290 TraceCheckUtils]: 8: Hoare triple {47398#true} assume !(0 == ~cond); {47398#true} is VALID [2022-04-28 05:58:01,599 INFO L290 TraceCheckUtils]: 7: Hoare triple {47398#true} ~cond := #in~cond; {47398#true} is VALID [2022-04-28 05:58:01,600 INFO L272 TraceCheckUtils]: 6: Hoare triple {47999#(< ~counter~0 90)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {47398#true} is VALID [2022-04-28 05:58:01,600 INFO L290 TraceCheckUtils]: 5: Hoare triple {47999#(< ~counter~0 90)} 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; {47999#(< ~counter~0 90)} is VALID [2022-04-28 05:58:01,600 INFO L272 TraceCheckUtils]: 4: Hoare triple {47999#(< ~counter~0 90)} call #t~ret9 := main(); {47999#(< ~counter~0 90)} is VALID [2022-04-28 05:58:01,600 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47999#(< ~counter~0 90)} {47398#true} #102#return; {47999#(< ~counter~0 90)} is VALID [2022-04-28 05:58:01,601 INFO L290 TraceCheckUtils]: 2: Hoare triple {47999#(< ~counter~0 90)} assume true; {47999#(< ~counter~0 90)} is VALID [2022-04-28 05:58:01,601 INFO L290 TraceCheckUtils]: 1: Hoare triple {47398#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; {47999#(< ~counter~0 90)} is VALID [2022-04-28 05:58:01,601 INFO L272 TraceCheckUtils]: 0: Hoare triple {47398#true} call ULTIMATE.init(); {47398#true} is VALID [2022-04-28 05:58:01,601 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 24 proven. 62 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-04-28 05:58:01,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:58:01,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902887554] [2022-04-28 05:58:01,602 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:58:01,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [397437920] [2022-04-28 05:58:01,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [397437920] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:58:01,602 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:58:01,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-04-28 05:58:01,602 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:58:01,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1472695384] [2022-04-28 05:58:01,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1472695384] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:58:01,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:58:01,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 05:58:01,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253769578] [2022-04-28 05:58:01,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:58:01,603 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 13 states have internal predecessors, (74), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) Word has length 105 [2022-04-28 05:58:01,603 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:58:01,603 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 13 states have internal predecessors, (74), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-28 05:58:01,672 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:58:01,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 05:58:01,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:58:01,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 05:58:01,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2022-04-28 05:58:01,673 INFO L87 Difference]: Start difference. First operand 504 states and 695 transitions. Second operand has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 13 states have internal predecessors, (74), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-28 05:58:03,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:03,363 INFO L93 Difference]: Finished difference Result 753 states and 1073 transitions. [2022-04-28 05:58:03,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 05:58:03,364 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 13 states have internal predecessors, (74), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) Word has length 105 [2022-04-28 05:58:03,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:58:03,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 13 states have internal predecessors, (74), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-28 05:58:03,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 236 transitions. [2022-04-28 05:58:03,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 13 states have internal predecessors, (74), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-28 05:58:03,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 236 transitions. [2022-04-28 05:58:03,367 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 236 transitions. [2022-04-28 05:58:03,533 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 236 edges. 236 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:58:03,553 INFO L225 Difference]: With dead ends: 753 [2022-04-28 05:58:03,554 INFO L226 Difference]: Without dead ends: 532 [2022-04-28 05:58:03,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=465, Invalid=657, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 05:58:03,555 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 143 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 05:58:03,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 249 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 05:58:03,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2022-04-28 05:58:04,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 522. [2022-04-28 05:58:04,586 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:58:04,587 INFO L82 GeneralOperation]: Start isEquivalent. First operand 532 states. Second operand has 522 states, 394 states have (on average 1.2461928934010151) internal successors, (491), 398 states have internal predecessors, (491), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 108 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-28 05:58:04,587 INFO L74 IsIncluded]: Start isIncluded. First operand 532 states. Second operand has 522 states, 394 states have (on average 1.2461928934010151) internal successors, (491), 398 states have internal predecessors, (491), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 108 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-28 05:58:04,587 INFO L87 Difference]: Start difference. First operand 532 states. Second operand has 522 states, 394 states have (on average 1.2461928934010151) internal successors, (491), 398 states have internal predecessors, (491), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 108 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-28 05:58:04,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:04,598 INFO L93 Difference]: Finished difference Result 532 states and 727 transitions. [2022-04-28 05:58:04,598 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 727 transitions. [2022-04-28 05:58:04,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:58:04,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:58:04,600 INFO L74 IsIncluded]: Start isIncluded. First operand has 522 states, 394 states have (on average 1.2461928934010151) internal successors, (491), 398 states have internal predecessors, (491), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 108 states have call predecessors, (112), 112 states have call successors, (112) Second operand 532 states. [2022-04-28 05:58:04,600 INFO L87 Difference]: Start difference. First operand has 522 states, 394 states have (on average 1.2461928934010151) internal successors, (491), 398 states have internal predecessors, (491), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 108 states have call predecessors, (112), 112 states have call successors, (112) Second operand 532 states. [2022-04-28 05:58:04,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:04,611 INFO L93 Difference]: Finished difference Result 532 states and 727 transitions. [2022-04-28 05:58:04,611 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 727 transitions. [2022-04-28 05:58:04,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:58:04,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:58:04,612 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:58:04,612 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:58:04,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 394 states have (on average 1.2461928934010151) internal successors, (491), 398 states have internal predecessors, (491), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 108 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-28 05:58:04,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 717 transitions. [2022-04-28 05:58:04,626 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 717 transitions. Word has length 105 [2022-04-28 05:58:04,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:58:04,626 INFO L495 AbstractCegarLoop]: Abstraction has 522 states and 717 transitions. [2022-04-28 05:58:04,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 13 states have internal predecessors, (74), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-28 05:58:04,626 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 522 states and 717 transitions. [2022-04-28 05:58:06,727 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 717 edges. 717 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:58:06,728 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 717 transitions. [2022-04-28 05:58:06,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-04-28 05:58:06,729 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:58:06,729 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 7, 6, 6, 6, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:58:06,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2022-04-28 05:58:06,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-04-28 05:58:06,939 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:58:06,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:58:06,940 INFO L85 PathProgramCache]: Analyzing trace with hash -2132095591, now seen corresponding path program 11 times [2022-04-28 05:58:06,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:58:06,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1788422176] [2022-04-28 05:58:06,940 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:58:06,940 INFO L85 PathProgramCache]: Analyzing trace with hash -2132095591, now seen corresponding path program 12 times [2022-04-28 05:58:06,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:58:06,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788795833] [2022-04-28 05:58:06,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:58:06,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:58:06,951 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:58:06,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [745113906] [2022-04-28 05:58:06,951 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 05:58:06,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:58:06,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:58:06,952 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:58:06,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-04-28 05:58:07,068 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 05:58:07,068 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:58:07,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 05:58:07,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:58:07,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:58:07,598 INFO L272 TraceCheckUtils]: 0: Hoare triple {51683#true} call ULTIMATE.init(); {51683#true} is VALID [2022-04-28 05:58:07,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {51683#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; {51691#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:07,598 INFO L290 TraceCheckUtils]: 2: Hoare triple {51691#(<= ~counter~0 0)} assume true; {51691#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:07,599 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51691#(<= ~counter~0 0)} {51683#true} #102#return; {51691#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:07,599 INFO L272 TraceCheckUtils]: 4: Hoare triple {51691#(<= ~counter~0 0)} call #t~ret9 := main(); {51691#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:07,599 INFO L290 TraceCheckUtils]: 5: Hoare triple {51691#(<= ~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; {51691#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:07,600 INFO L272 TraceCheckUtils]: 6: Hoare triple {51691#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {51691#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:07,600 INFO L290 TraceCheckUtils]: 7: Hoare triple {51691#(<= ~counter~0 0)} ~cond := #in~cond; {51691#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:07,600 INFO L290 TraceCheckUtils]: 8: Hoare triple {51691#(<= ~counter~0 0)} assume !(0 == ~cond); {51691#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:07,600 INFO L290 TraceCheckUtils]: 9: Hoare triple {51691#(<= ~counter~0 0)} assume true; {51691#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:07,601 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {51691#(<= ~counter~0 0)} {51691#(<= ~counter~0 0)} #90#return; {51691#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:07,601 INFO L272 TraceCheckUtils]: 11: Hoare triple {51691#(<= ~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)); {51691#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:07,601 INFO L290 TraceCheckUtils]: 12: Hoare triple {51691#(<= ~counter~0 0)} ~cond := #in~cond; {51691#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:07,602 INFO L290 TraceCheckUtils]: 13: Hoare triple {51691#(<= ~counter~0 0)} assume !(0 == ~cond); {51691#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:07,602 INFO L290 TraceCheckUtils]: 14: Hoare triple {51691#(<= ~counter~0 0)} assume true; {51691#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:07,602 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {51691#(<= ~counter~0 0)} {51691#(<= ~counter~0 0)} #92#return; {51691#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:07,603 INFO L290 TraceCheckUtils]: 16: Hoare triple {51691#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {51691#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:07,604 INFO L290 TraceCheckUtils]: 17: Hoare triple {51691#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51740#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:07,604 INFO L290 TraceCheckUtils]: 18: Hoare triple {51740#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {51740#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:07,604 INFO L272 TraceCheckUtils]: 19: Hoare triple {51740#(<= ~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)); {51740#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:07,605 INFO L290 TraceCheckUtils]: 20: Hoare triple {51740#(<= ~counter~0 1)} ~cond := #in~cond; {51740#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:07,605 INFO L290 TraceCheckUtils]: 21: Hoare triple {51740#(<= ~counter~0 1)} assume !(0 == ~cond); {51740#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:07,605 INFO L290 TraceCheckUtils]: 22: Hoare triple {51740#(<= ~counter~0 1)} assume true; {51740#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:07,606 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {51740#(<= ~counter~0 1)} {51740#(<= ~counter~0 1)} #94#return; {51740#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:07,606 INFO L290 TraceCheckUtils]: 24: Hoare triple {51740#(<= ~counter~0 1)} assume !!(0 != ~r~0); {51740#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:07,607 INFO L290 TraceCheckUtils]: 25: Hoare triple {51740#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {51765#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:07,607 INFO L290 TraceCheckUtils]: 26: Hoare triple {51765#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {51765#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:07,607 INFO L272 TraceCheckUtils]: 27: Hoare triple {51765#(<= ~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)); {51765#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:07,608 INFO L290 TraceCheckUtils]: 28: Hoare triple {51765#(<= ~counter~0 2)} ~cond := #in~cond; {51765#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:07,608 INFO L290 TraceCheckUtils]: 29: Hoare triple {51765#(<= ~counter~0 2)} assume !(0 == ~cond); {51765#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:07,608 INFO L290 TraceCheckUtils]: 30: Hoare triple {51765#(<= ~counter~0 2)} assume true; {51765#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:07,609 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {51765#(<= ~counter~0 2)} {51765#(<= ~counter~0 2)} #96#return; {51765#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:07,609 INFO L290 TraceCheckUtils]: 32: Hoare triple {51765#(<= ~counter~0 2)} assume !(~r~0 > 0); {51765#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:07,609 INFO L290 TraceCheckUtils]: 33: Hoare triple {51765#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {51790#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:07,610 INFO L290 TraceCheckUtils]: 34: Hoare triple {51790#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {51790#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:07,610 INFO L272 TraceCheckUtils]: 35: Hoare triple {51790#(<= ~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)); {51790#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:07,610 INFO L290 TraceCheckUtils]: 36: Hoare triple {51790#(<= ~counter~0 3)} ~cond := #in~cond; {51790#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:07,611 INFO L290 TraceCheckUtils]: 37: Hoare triple {51790#(<= ~counter~0 3)} assume !(0 == ~cond); {51790#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:07,611 INFO L290 TraceCheckUtils]: 38: Hoare triple {51790#(<= ~counter~0 3)} assume true; {51790#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:07,611 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {51790#(<= ~counter~0 3)} {51790#(<= ~counter~0 3)} #98#return; {51790#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:07,612 INFO L290 TraceCheckUtils]: 40: Hoare triple {51790#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {51790#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:07,612 INFO L290 TraceCheckUtils]: 41: Hoare triple {51790#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {51815#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:07,613 INFO L290 TraceCheckUtils]: 42: Hoare triple {51815#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {51815#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:07,613 INFO L272 TraceCheckUtils]: 43: Hoare triple {51815#(<= ~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)); {51815#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:07,613 INFO L290 TraceCheckUtils]: 44: Hoare triple {51815#(<= ~counter~0 4)} ~cond := #in~cond; {51815#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:07,613 INFO L290 TraceCheckUtils]: 45: Hoare triple {51815#(<= ~counter~0 4)} assume !(0 == ~cond); {51815#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:07,614 INFO L290 TraceCheckUtils]: 46: Hoare triple {51815#(<= ~counter~0 4)} assume true; {51815#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:07,614 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {51815#(<= ~counter~0 4)} {51815#(<= ~counter~0 4)} #98#return; {51815#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:07,614 INFO L290 TraceCheckUtils]: 48: Hoare triple {51815#(<= ~counter~0 4)} assume !(~r~0 < 0); {51815#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:07,615 INFO L290 TraceCheckUtils]: 49: Hoare triple {51815#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51840#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:07,615 INFO L290 TraceCheckUtils]: 50: Hoare triple {51840#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {51840#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:07,616 INFO L272 TraceCheckUtils]: 51: Hoare triple {51840#(<= ~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)); {51840#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:07,616 INFO L290 TraceCheckUtils]: 52: Hoare triple {51840#(<= ~counter~0 5)} ~cond := #in~cond; {51840#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:07,616 INFO L290 TraceCheckUtils]: 53: Hoare triple {51840#(<= ~counter~0 5)} assume !(0 == ~cond); {51840#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:07,617 INFO L290 TraceCheckUtils]: 54: Hoare triple {51840#(<= ~counter~0 5)} assume true; {51840#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:07,617 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {51840#(<= ~counter~0 5)} {51840#(<= ~counter~0 5)} #94#return; {51840#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:07,617 INFO L290 TraceCheckUtils]: 56: Hoare triple {51840#(<= ~counter~0 5)} assume !!(0 != ~r~0); {51840#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:07,618 INFO L290 TraceCheckUtils]: 57: Hoare triple {51840#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {51865#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:07,618 INFO L290 TraceCheckUtils]: 58: Hoare triple {51865#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {51865#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:07,619 INFO L272 TraceCheckUtils]: 59: Hoare triple {51865#(<= ~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)); {51865#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:07,619 INFO L290 TraceCheckUtils]: 60: Hoare triple {51865#(<= ~counter~0 6)} ~cond := #in~cond; {51865#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:07,619 INFO L290 TraceCheckUtils]: 61: Hoare triple {51865#(<= ~counter~0 6)} assume !(0 == ~cond); {51865#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:07,619 INFO L290 TraceCheckUtils]: 62: Hoare triple {51865#(<= ~counter~0 6)} assume true; {51865#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:07,620 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {51865#(<= ~counter~0 6)} {51865#(<= ~counter~0 6)} #96#return; {51865#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:07,620 INFO L290 TraceCheckUtils]: 64: Hoare triple {51865#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {51865#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:07,621 INFO L290 TraceCheckUtils]: 65: Hoare triple {51865#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {51890#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:07,621 INFO L290 TraceCheckUtils]: 66: Hoare triple {51890#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {51890#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:07,621 INFO L272 TraceCheckUtils]: 67: Hoare triple {51890#(<= ~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)); {51890#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:07,622 INFO L290 TraceCheckUtils]: 68: Hoare triple {51890#(<= ~counter~0 7)} ~cond := #in~cond; {51890#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:07,622 INFO L290 TraceCheckUtils]: 69: Hoare triple {51890#(<= ~counter~0 7)} assume !(0 == ~cond); {51890#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:07,622 INFO L290 TraceCheckUtils]: 70: Hoare triple {51890#(<= ~counter~0 7)} assume true; {51890#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:07,623 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {51890#(<= ~counter~0 7)} {51890#(<= ~counter~0 7)} #96#return; {51890#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:07,623 INFO L290 TraceCheckUtils]: 72: Hoare triple {51890#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {51890#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:07,624 INFO L290 TraceCheckUtils]: 73: Hoare triple {51890#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {51915#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:07,624 INFO L290 TraceCheckUtils]: 74: Hoare triple {51915#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {51915#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:07,624 INFO L272 TraceCheckUtils]: 75: Hoare triple {51915#(<= ~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)); {51915#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:07,625 INFO L290 TraceCheckUtils]: 76: Hoare triple {51915#(<= ~counter~0 8)} ~cond := #in~cond; {51915#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:07,625 INFO L290 TraceCheckUtils]: 77: Hoare triple {51915#(<= ~counter~0 8)} assume !(0 == ~cond); {51915#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:07,625 INFO L290 TraceCheckUtils]: 78: Hoare triple {51915#(<= ~counter~0 8)} assume true; {51915#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:07,626 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {51915#(<= ~counter~0 8)} {51915#(<= ~counter~0 8)} #96#return; {51915#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:07,626 INFO L290 TraceCheckUtils]: 80: Hoare triple {51915#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {51915#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:07,626 INFO L290 TraceCheckUtils]: 81: Hoare triple {51915#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {51940#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:07,627 INFO L290 TraceCheckUtils]: 82: Hoare triple {51940#(<= ~counter~0 9)} assume !!(#t~post7 < 100);havoc #t~post7; {51940#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:07,627 INFO L272 TraceCheckUtils]: 83: Hoare triple {51940#(<= ~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)); {51940#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:07,627 INFO L290 TraceCheckUtils]: 84: Hoare triple {51940#(<= ~counter~0 9)} ~cond := #in~cond; {51940#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:07,628 INFO L290 TraceCheckUtils]: 85: Hoare triple {51940#(<= ~counter~0 9)} assume !(0 == ~cond); {51940#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:07,628 INFO L290 TraceCheckUtils]: 86: Hoare triple {51940#(<= ~counter~0 9)} assume true; {51940#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:07,628 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {51940#(<= ~counter~0 9)} {51940#(<= ~counter~0 9)} #96#return; {51940#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:07,629 INFO L290 TraceCheckUtils]: 88: Hoare triple {51940#(<= ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {51940#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:07,629 INFO L290 TraceCheckUtils]: 89: Hoare triple {51940#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {51965#(<= ~counter~0 10)} is VALID [2022-04-28 05:58:07,630 INFO L290 TraceCheckUtils]: 90: Hoare triple {51965#(<= ~counter~0 10)} assume !!(#t~post7 < 100);havoc #t~post7; {51965#(<= ~counter~0 10)} is VALID [2022-04-28 05:58:07,630 INFO L272 TraceCheckUtils]: 91: Hoare triple {51965#(<= ~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)); {51965#(<= ~counter~0 10)} is VALID [2022-04-28 05:58:07,630 INFO L290 TraceCheckUtils]: 92: Hoare triple {51965#(<= ~counter~0 10)} ~cond := #in~cond; {51965#(<= ~counter~0 10)} is VALID [2022-04-28 05:58:07,630 INFO L290 TraceCheckUtils]: 93: Hoare triple {51965#(<= ~counter~0 10)} assume !(0 == ~cond); {51965#(<= ~counter~0 10)} is VALID [2022-04-28 05:58:07,631 INFO L290 TraceCheckUtils]: 94: Hoare triple {51965#(<= ~counter~0 10)} assume true; {51965#(<= ~counter~0 10)} is VALID [2022-04-28 05:58:07,631 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {51965#(<= ~counter~0 10)} {51965#(<= ~counter~0 10)} #96#return; {51965#(<= ~counter~0 10)} is VALID [2022-04-28 05:58:07,631 INFO L290 TraceCheckUtils]: 96: Hoare triple {51965#(<= ~counter~0 10)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {51965#(<= ~counter~0 10)} is VALID [2022-04-28 05:58:07,632 INFO L290 TraceCheckUtils]: 97: Hoare triple {51965#(<= ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {51990#(<= |main_#t~post7| 10)} is VALID [2022-04-28 05:58:07,647 INFO L290 TraceCheckUtils]: 98: Hoare triple {51990#(<= |main_#t~post7| 10)} assume !(#t~post7 < 100);havoc #t~post7; {51684#false} is VALID [2022-04-28 05:58:07,647 INFO L290 TraceCheckUtils]: 99: Hoare triple {51684#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {51684#false} is VALID [2022-04-28 05:58:07,647 INFO L290 TraceCheckUtils]: 100: Hoare triple {51684#false} assume !(#t~post8 < 100);havoc #t~post8; {51684#false} is VALID [2022-04-28 05:58:07,647 INFO L290 TraceCheckUtils]: 101: Hoare triple {51684#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51684#false} is VALID [2022-04-28 05:58:07,648 INFO L290 TraceCheckUtils]: 102: Hoare triple {51684#false} assume !(#t~post6 < 100);havoc #t~post6; {51684#false} is VALID [2022-04-28 05:58:07,648 INFO L272 TraceCheckUtils]: 103: Hoare triple {51684#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)); {51684#false} is VALID [2022-04-28 05:58:07,648 INFO L290 TraceCheckUtils]: 104: Hoare triple {51684#false} ~cond := #in~cond; {51684#false} is VALID [2022-04-28 05:58:07,648 INFO L290 TraceCheckUtils]: 105: Hoare triple {51684#false} assume 0 == ~cond; {51684#false} is VALID [2022-04-28 05:58:07,648 INFO L290 TraceCheckUtils]: 106: Hoare triple {51684#false} assume !false; {51684#false} is VALID [2022-04-28 05:58:07,648 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 28 proven. 260 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:58:07,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:58:08,240 INFO L290 TraceCheckUtils]: 106: Hoare triple {51684#false} assume !false; {51684#false} is VALID [2022-04-28 05:58:08,241 INFO L290 TraceCheckUtils]: 105: Hoare triple {51684#false} assume 0 == ~cond; {51684#false} is VALID [2022-04-28 05:58:08,241 INFO L290 TraceCheckUtils]: 104: Hoare triple {51684#false} ~cond := #in~cond; {51684#false} is VALID [2022-04-28 05:58:08,241 INFO L272 TraceCheckUtils]: 103: Hoare triple {51684#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)); {51684#false} is VALID [2022-04-28 05:58:08,241 INFO L290 TraceCheckUtils]: 102: Hoare triple {51684#false} assume !(#t~post6 < 100);havoc #t~post6; {51684#false} is VALID [2022-04-28 05:58:08,241 INFO L290 TraceCheckUtils]: 101: Hoare triple {51684#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51684#false} is VALID [2022-04-28 05:58:08,241 INFO L290 TraceCheckUtils]: 100: Hoare triple {51684#false} assume !(#t~post8 < 100);havoc #t~post8; {51684#false} is VALID [2022-04-28 05:58:08,241 INFO L290 TraceCheckUtils]: 99: Hoare triple {51684#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {51684#false} is VALID [2022-04-28 05:58:08,241 INFO L290 TraceCheckUtils]: 98: Hoare triple {52042#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {51684#false} is VALID [2022-04-28 05:58:08,242 INFO L290 TraceCheckUtils]: 97: Hoare triple {52046#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {52042#(< |main_#t~post7| 100)} is VALID [2022-04-28 05:58:08,242 INFO L290 TraceCheckUtils]: 96: Hoare triple {52046#(< ~counter~0 100)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {52046#(< ~counter~0 100)} is VALID [2022-04-28 05:58:08,242 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {51683#true} {52046#(< ~counter~0 100)} #96#return; {52046#(< ~counter~0 100)} is VALID [2022-04-28 05:58:08,242 INFO L290 TraceCheckUtils]: 94: Hoare triple {51683#true} assume true; {51683#true} is VALID [2022-04-28 05:58:08,243 INFO L290 TraceCheckUtils]: 93: Hoare triple {51683#true} assume !(0 == ~cond); {51683#true} is VALID [2022-04-28 05:58:08,243 INFO L290 TraceCheckUtils]: 92: Hoare triple {51683#true} ~cond := #in~cond; {51683#true} is VALID [2022-04-28 05:58:08,243 INFO L272 TraceCheckUtils]: 91: Hoare triple {52046#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51683#true} is VALID [2022-04-28 05:58:08,243 INFO L290 TraceCheckUtils]: 90: Hoare triple {52046#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {52046#(< ~counter~0 100)} is VALID [2022-04-28 05:58:08,244 INFO L290 TraceCheckUtils]: 89: Hoare triple {52071#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {52046#(< ~counter~0 100)} is VALID [2022-04-28 05:58:08,244 INFO L290 TraceCheckUtils]: 88: Hoare triple {52071#(< ~counter~0 99)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {52071#(< ~counter~0 99)} is VALID [2022-04-28 05:58:08,245 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {51683#true} {52071#(< ~counter~0 99)} #96#return; {52071#(< ~counter~0 99)} is VALID [2022-04-28 05:58:08,245 INFO L290 TraceCheckUtils]: 86: Hoare triple {51683#true} assume true; {51683#true} is VALID [2022-04-28 05:58:08,245 INFO L290 TraceCheckUtils]: 85: Hoare triple {51683#true} assume !(0 == ~cond); {51683#true} is VALID [2022-04-28 05:58:08,245 INFO L290 TraceCheckUtils]: 84: Hoare triple {51683#true} ~cond := #in~cond; {51683#true} is VALID [2022-04-28 05:58:08,245 INFO L272 TraceCheckUtils]: 83: Hoare triple {52071#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51683#true} is VALID [2022-04-28 05:58:08,245 INFO L290 TraceCheckUtils]: 82: Hoare triple {52071#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {52071#(< ~counter~0 99)} is VALID [2022-04-28 05:58:08,246 INFO L290 TraceCheckUtils]: 81: Hoare triple {52096#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {52071#(< ~counter~0 99)} is VALID [2022-04-28 05:58:08,246 INFO L290 TraceCheckUtils]: 80: Hoare triple {52096#(< ~counter~0 98)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {52096#(< ~counter~0 98)} is VALID [2022-04-28 05:58:08,247 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {51683#true} {52096#(< ~counter~0 98)} #96#return; {52096#(< ~counter~0 98)} is VALID [2022-04-28 05:58:08,247 INFO L290 TraceCheckUtils]: 78: Hoare triple {51683#true} assume true; {51683#true} is VALID [2022-04-28 05:58:08,247 INFO L290 TraceCheckUtils]: 77: Hoare triple {51683#true} assume !(0 == ~cond); {51683#true} is VALID [2022-04-28 05:58:08,247 INFO L290 TraceCheckUtils]: 76: Hoare triple {51683#true} ~cond := #in~cond; {51683#true} is VALID [2022-04-28 05:58:08,247 INFO L272 TraceCheckUtils]: 75: Hoare triple {52096#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51683#true} is VALID [2022-04-28 05:58:08,247 INFO L290 TraceCheckUtils]: 74: Hoare triple {52096#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {52096#(< ~counter~0 98)} is VALID [2022-04-28 05:58:08,248 INFO L290 TraceCheckUtils]: 73: Hoare triple {52121#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {52096#(< ~counter~0 98)} is VALID [2022-04-28 05:58:08,248 INFO L290 TraceCheckUtils]: 72: Hoare triple {52121#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {52121#(< ~counter~0 97)} is VALID [2022-04-28 05:58:08,249 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {51683#true} {52121#(< ~counter~0 97)} #96#return; {52121#(< ~counter~0 97)} is VALID [2022-04-28 05:58:08,249 INFO L290 TraceCheckUtils]: 70: Hoare triple {51683#true} assume true; {51683#true} is VALID [2022-04-28 05:58:08,249 INFO L290 TraceCheckUtils]: 69: Hoare triple {51683#true} assume !(0 == ~cond); {51683#true} is VALID [2022-04-28 05:58:08,249 INFO L290 TraceCheckUtils]: 68: Hoare triple {51683#true} ~cond := #in~cond; {51683#true} is VALID [2022-04-28 05:58:08,249 INFO L272 TraceCheckUtils]: 67: Hoare triple {52121#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51683#true} is VALID [2022-04-28 05:58:08,249 INFO L290 TraceCheckUtils]: 66: Hoare triple {52121#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {52121#(< ~counter~0 97)} is VALID [2022-04-28 05:58:08,250 INFO L290 TraceCheckUtils]: 65: Hoare triple {52146#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {52121#(< ~counter~0 97)} is VALID [2022-04-28 05:58:08,250 INFO L290 TraceCheckUtils]: 64: Hoare triple {52146#(< ~counter~0 96)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {52146#(< ~counter~0 96)} is VALID [2022-04-28 05:58:08,251 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {51683#true} {52146#(< ~counter~0 96)} #96#return; {52146#(< ~counter~0 96)} is VALID [2022-04-28 05:58:08,251 INFO L290 TraceCheckUtils]: 62: Hoare triple {51683#true} assume true; {51683#true} is VALID [2022-04-28 05:58:08,251 INFO L290 TraceCheckUtils]: 61: Hoare triple {51683#true} assume !(0 == ~cond); {51683#true} is VALID [2022-04-28 05:58:08,251 INFO L290 TraceCheckUtils]: 60: Hoare triple {51683#true} ~cond := #in~cond; {51683#true} is VALID [2022-04-28 05:58:08,251 INFO L272 TraceCheckUtils]: 59: Hoare triple {52146#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51683#true} is VALID [2022-04-28 05:58:08,251 INFO L290 TraceCheckUtils]: 58: Hoare triple {52146#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {52146#(< ~counter~0 96)} is VALID [2022-04-28 05:58:08,252 INFO L290 TraceCheckUtils]: 57: Hoare triple {52171#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {52146#(< ~counter~0 96)} is VALID [2022-04-28 05:58:08,252 INFO L290 TraceCheckUtils]: 56: Hoare triple {52171#(< ~counter~0 95)} assume !!(0 != ~r~0); {52171#(< ~counter~0 95)} is VALID [2022-04-28 05:58:08,253 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {51683#true} {52171#(< ~counter~0 95)} #94#return; {52171#(< ~counter~0 95)} is VALID [2022-04-28 05:58:08,253 INFO L290 TraceCheckUtils]: 54: Hoare triple {51683#true} assume true; {51683#true} is VALID [2022-04-28 05:58:08,253 INFO L290 TraceCheckUtils]: 53: Hoare triple {51683#true} assume !(0 == ~cond); {51683#true} is VALID [2022-04-28 05:58:08,253 INFO L290 TraceCheckUtils]: 52: Hoare triple {51683#true} ~cond := #in~cond; {51683#true} is VALID [2022-04-28 05:58:08,253 INFO L272 TraceCheckUtils]: 51: Hoare triple {52171#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51683#true} is VALID [2022-04-28 05:58:08,253 INFO L290 TraceCheckUtils]: 50: Hoare triple {52171#(< ~counter~0 95)} assume !!(#t~post6 < 100);havoc #t~post6; {52171#(< ~counter~0 95)} is VALID [2022-04-28 05:58:08,254 INFO L290 TraceCheckUtils]: 49: Hoare triple {52196#(< ~counter~0 94)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {52171#(< ~counter~0 95)} is VALID [2022-04-28 05:58:08,254 INFO L290 TraceCheckUtils]: 48: Hoare triple {52196#(< ~counter~0 94)} assume !(~r~0 < 0); {52196#(< ~counter~0 94)} is VALID [2022-04-28 05:58:08,255 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {51683#true} {52196#(< ~counter~0 94)} #98#return; {52196#(< ~counter~0 94)} is VALID [2022-04-28 05:58:08,255 INFO L290 TraceCheckUtils]: 46: Hoare triple {51683#true} assume true; {51683#true} is VALID [2022-04-28 05:58:08,255 INFO L290 TraceCheckUtils]: 45: Hoare triple {51683#true} assume !(0 == ~cond); {51683#true} is VALID [2022-04-28 05:58:08,255 INFO L290 TraceCheckUtils]: 44: Hoare triple {51683#true} ~cond := #in~cond; {51683#true} is VALID [2022-04-28 05:58:08,255 INFO L272 TraceCheckUtils]: 43: Hoare triple {52196#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51683#true} is VALID [2022-04-28 05:58:08,255 INFO L290 TraceCheckUtils]: 42: Hoare triple {52196#(< ~counter~0 94)} assume !!(#t~post8 < 100);havoc #t~post8; {52196#(< ~counter~0 94)} is VALID [2022-04-28 05:58:08,256 INFO L290 TraceCheckUtils]: 41: Hoare triple {52221#(< ~counter~0 93)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {52196#(< ~counter~0 94)} is VALID [2022-04-28 05:58:08,256 INFO L290 TraceCheckUtils]: 40: Hoare triple {52221#(< ~counter~0 93)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {52221#(< ~counter~0 93)} is VALID [2022-04-28 05:58:08,257 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {51683#true} {52221#(< ~counter~0 93)} #98#return; {52221#(< ~counter~0 93)} is VALID [2022-04-28 05:58:08,257 INFO L290 TraceCheckUtils]: 38: Hoare triple {51683#true} assume true; {51683#true} is VALID [2022-04-28 05:58:08,257 INFO L290 TraceCheckUtils]: 37: Hoare triple {51683#true} assume !(0 == ~cond); {51683#true} is VALID [2022-04-28 05:58:08,257 INFO L290 TraceCheckUtils]: 36: Hoare triple {51683#true} ~cond := #in~cond; {51683#true} is VALID [2022-04-28 05:58:08,257 INFO L272 TraceCheckUtils]: 35: Hoare triple {52221#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51683#true} is VALID [2022-04-28 05:58:08,257 INFO L290 TraceCheckUtils]: 34: Hoare triple {52221#(< ~counter~0 93)} assume !!(#t~post8 < 100);havoc #t~post8; {52221#(< ~counter~0 93)} is VALID [2022-04-28 05:58:08,258 INFO L290 TraceCheckUtils]: 33: Hoare triple {52246#(< ~counter~0 92)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {52221#(< ~counter~0 93)} is VALID [2022-04-28 05:58:08,258 INFO L290 TraceCheckUtils]: 32: Hoare triple {52246#(< ~counter~0 92)} assume !(~r~0 > 0); {52246#(< ~counter~0 92)} is VALID [2022-04-28 05:58:08,258 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {51683#true} {52246#(< ~counter~0 92)} #96#return; {52246#(< ~counter~0 92)} is VALID [2022-04-28 05:58:08,259 INFO L290 TraceCheckUtils]: 30: Hoare triple {51683#true} assume true; {51683#true} is VALID [2022-04-28 05:58:08,259 INFO L290 TraceCheckUtils]: 29: Hoare triple {51683#true} assume !(0 == ~cond); {51683#true} is VALID [2022-04-28 05:58:08,259 INFO L290 TraceCheckUtils]: 28: Hoare triple {51683#true} ~cond := #in~cond; {51683#true} is VALID [2022-04-28 05:58:08,259 INFO L272 TraceCheckUtils]: 27: Hoare triple {52246#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51683#true} is VALID [2022-04-28 05:58:08,259 INFO L290 TraceCheckUtils]: 26: Hoare triple {52246#(< ~counter~0 92)} assume !!(#t~post7 < 100);havoc #t~post7; {52246#(< ~counter~0 92)} is VALID [2022-04-28 05:58:08,260 INFO L290 TraceCheckUtils]: 25: Hoare triple {52271#(< ~counter~0 91)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {52246#(< ~counter~0 92)} is VALID [2022-04-28 05:58:08,260 INFO L290 TraceCheckUtils]: 24: Hoare triple {52271#(< ~counter~0 91)} assume !!(0 != ~r~0); {52271#(< ~counter~0 91)} is VALID [2022-04-28 05:58:08,260 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {51683#true} {52271#(< ~counter~0 91)} #94#return; {52271#(< ~counter~0 91)} is VALID [2022-04-28 05:58:08,261 INFO L290 TraceCheckUtils]: 22: Hoare triple {51683#true} assume true; {51683#true} is VALID [2022-04-28 05:58:08,261 INFO L290 TraceCheckUtils]: 21: Hoare triple {51683#true} assume !(0 == ~cond); {51683#true} is VALID [2022-04-28 05:58:08,261 INFO L290 TraceCheckUtils]: 20: Hoare triple {51683#true} ~cond := #in~cond; {51683#true} is VALID [2022-04-28 05:58:08,261 INFO L272 TraceCheckUtils]: 19: Hoare triple {52271#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51683#true} is VALID [2022-04-28 05:58:08,261 INFO L290 TraceCheckUtils]: 18: Hoare triple {52271#(< ~counter~0 91)} assume !!(#t~post6 < 100);havoc #t~post6; {52271#(< ~counter~0 91)} is VALID [2022-04-28 05:58:08,262 INFO L290 TraceCheckUtils]: 17: Hoare triple {52296#(< ~counter~0 90)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {52271#(< ~counter~0 91)} is VALID [2022-04-28 05:58:08,262 INFO L290 TraceCheckUtils]: 16: Hoare triple {52296#(< ~counter~0 90)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {52296#(< ~counter~0 90)} is VALID [2022-04-28 05:58:08,262 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {51683#true} {52296#(< ~counter~0 90)} #92#return; {52296#(< ~counter~0 90)} is VALID [2022-04-28 05:58:08,262 INFO L290 TraceCheckUtils]: 14: Hoare triple {51683#true} assume true; {51683#true} is VALID [2022-04-28 05:58:08,262 INFO L290 TraceCheckUtils]: 13: Hoare triple {51683#true} assume !(0 == ~cond); {51683#true} is VALID [2022-04-28 05:58:08,262 INFO L290 TraceCheckUtils]: 12: Hoare triple {51683#true} ~cond := #in~cond; {51683#true} is VALID [2022-04-28 05:58:08,263 INFO L272 TraceCheckUtils]: 11: Hoare triple {52296#(< ~counter~0 90)} 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)); {51683#true} is VALID [2022-04-28 05:58:08,263 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {51683#true} {52296#(< ~counter~0 90)} #90#return; {52296#(< ~counter~0 90)} is VALID [2022-04-28 05:58:08,263 INFO L290 TraceCheckUtils]: 9: Hoare triple {51683#true} assume true; {51683#true} is VALID [2022-04-28 05:58:08,263 INFO L290 TraceCheckUtils]: 8: Hoare triple {51683#true} assume !(0 == ~cond); {51683#true} is VALID [2022-04-28 05:58:08,263 INFO L290 TraceCheckUtils]: 7: Hoare triple {51683#true} ~cond := #in~cond; {51683#true} is VALID [2022-04-28 05:58:08,263 INFO L272 TraceCheckUtils]: 6: Hoare triple {52296#(< ~counter~0 90)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {51683#true} is VALID [2022-04-28 05:58:08,264 INFO L290 TraceCheckUtils]: 5: Hoare triple {52296#(< ~counter~0 90)} 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; {52296#(< ~counter~0 90)} is VALID [2022-04-28 05:58:08,264 INFO L272 TraceCheckUtils]: 4: Hoare triple {52296#(< ~counter~0 90)} call #t~ret9 := main(); {52296#(< ~counter~0 90)} is VALID [2022-04-28 05:58:08,264 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52296#(< ~counter~0 90)} {51683#true} #102#return; {52296#(< ~counter~0 90)} is VALID [2022-04-28 05:58:08,264 INFO L290 TraceCheckUtils]: 2: Hoare triple {52296#(< ~counter~0 90)} assume true; {52296#(< ~counter~0 90)} is VALID [2022-04-28 05:58:08,265 INFO L290 TraceCheckUtils]: 1: Hoare triple {51683#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; {52296#(< ~counter~0 90)} is VALID [2022-04-28 05:58:08,265 INFO L272 TraceCheckUtils]: 0: Hoare triple {51683#true} call ULTIMATE.init(); {51683#true} is VALID [2022-04-28 05:58:08,270 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 28 proven. 80 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-04-28 05:58:08,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:58:08,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788795833] [2022-04-28 05:58:08,270 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:58:08,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745113906] [2022-04-28 05:58:08,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745113906] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:58:08,271 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:58:08,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-04-28 05:58:08,271 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:58:08,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1788422176] [2022-04-28 05:58:08,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1788422176] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:58:08,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:58:08,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 05:58:08,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382272327] [2022-04-28 05:58:08,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:58:08,272 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 13 states have internal predecessors, (76), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) Word has length 107 [2022-04-28 05:58:08,272 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:58:08,272 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 13 states have internal predecessors, (76), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-28 05:58:08,347 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:58:08,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 05:58:08,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:58:08,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 05:58:08,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2022-04-28 05:58:08,348 INFO L87 Difference]: Start difference. First operand 522 states and 717 transitions. Second operand has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 13 states have internal predecessors, (76), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-28 05:58:10,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:10,280 INFO L93 Difference]: Finished difference Result 735 states and 1041 transitions. [2022-04-28 05:58:10,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-28 05:58:10,281 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 13 states have internal predecessors, (76), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) Word has length 107 [2022-04-28 05:58:10,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:58:10,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 13 states have internal predecessors, (76), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-28 05:58:10,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 236 transitions. [2022-04-28 05:58:10,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 13 states have internal predecessors, (76), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-28 05:58:10,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 236 transitions. [2022-04-28 05:58:10,284 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 236 transitions. [2022-04-28 05:58:10,470 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 236 edges. 236 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:58:10,485 INFO L225 Difference]: With dead ends: 735 [2022-04-28 05:58:10,485 INFO L226 Difference]: Without dead ends: 538 [2022-04-28 05:58:10,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=497, Invalid=693, Unknown=0, NotChecked=0, Total=1190 [2022-04-28 05:58:10,487 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 129 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 05:58:10,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 255 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 05:58:10,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2022-04-28 05:58:11,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2022-04-28 05:58:11,538 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:58:11,539 INFO L82 GeneralOperation]: Start isEquivalent. First operand 538 states. Second operand has 538 states, 410 states have (on average 1.2365853658536585) internal successors, (507), 410 states have internal predecessors, (507), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-28 05:58:11,539 INFO L74 IsIncluded]: Start isIncluded. First operand 538 states. Second operand has 538 states, 410 states have (on average 1.2365853658536585) internal successors, (507), 410 states have internal predecessors, (507), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-28 05:58:11,540 INFO L87 Difference]: Start difference. First operand 538 states. Second operand has 538 states, 410 states have (on average 1.2365853658536585) internal successors, (507), 410 states have internal predecessors, (507), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-28 05:58:11,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:11,551 INFO L93 Difference]: Finished difference Result 538 states and 733 transitions. [2022-04-28 05:58:11,551 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 733 transitions. [2022-04-28 05:58:11,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:58:11,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:58:11,552 INFO L74 IsIncluded]: Start isIncluded. First operand has 538 states, 410 states have (on average 1.2365853658536585) internal successors, (507), 410 states have internal predecessors, (507), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) Second operand 538 states. [2022-04-28 05:58:11,552 INFO L87 Difference]: Start difference. First operand has 538 states, 410 states have (on average 1.2365853658536585) internal successors, (507), 410 states have internal predecessors, (507), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) Second operand 538 states. [2022-04-28 05:58:11,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:11,563 INFO L93 Difference]: Finished difference Result 538 states and 733 transitions. [2022-04-28 05:58:11,563 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 733 transitions. [2022-04-28 05:58:11,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:58:11,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:58:11,564 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:58:11,564 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:58:11,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 410 states have (on average 1.2365853658536585) internal successors, (507), 410 states have internal predecessors, (507), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-28 05:58:11,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 733 transitions. [2022-04-28 05:58:11,579 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 733 transitions. Word has length 107 [2022-04-28 05:58:11,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:58:11,579 INFO L495 AbstractCegarLoop]: Abstraction has 538 states and 733 transitions. [2022-04-28 05:58:11,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 13 states have internal predecessors, (76), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-28 05:58:11,579 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 538 states and 733 transitions. [2022-04-28 05:58:13,606 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-28 05:58:13,606 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 733 transitions. [2022-04-28 05:58:13,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-04-28 05:58:13,607 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:58:13,607 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:58:13,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-04-28 05:58:13,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:58:13,807 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:58:13,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:58:13,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1965005106, now seen corresponding path program 5 times [2022-04-28 05:58:13,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:58:13,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [692953212] [2022-04-28 05:58:13,808 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:58:13,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1965005106, now seen corresponding path program 6 times [2022-04-28 05:58:13,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:58:13,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826913710] [2022-04-28 05:58:13,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:58:13,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:58:13,826 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:58:13,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [151858007] [2022-04-28 05:58:13,827 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 05:58:13,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:58:13,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:58:13,827 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:58:13,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-04-28 05:58:13,965 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-28 05:58:13,965 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:58:13,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 05:58:13,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:58:13,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:58:14,500 INFO L272 TraceCheckUtils]: 0: Hoare triple {55990#true} call ULTIMATE.init(); {55990#true} is VALID [2022-04-28 05:58:14,500 INFO L290 TraceCheckUtils]: 1: Hoare triple {55990#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; {55998#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:14,500 INFO L290 TraceCheckUtils]: 2: Hoare triple {55998#(<= ~counter~0 0)} assume true; {55998#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:14,501 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55998#(<= ~counter~0 0)} {55990#true} #102#return; {55998#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:14,501 INFO L272 TraceCheckUtils]: 4: Hoare triple {55998#(<= ~counter~0 0)} call #t~ret9 := main(); {55998#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:14,501 INFO L290 TraceCheckUtils]: 5: Hoare triple {55998#(<= ~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; {55998#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:14,502 INFO L272 TraceCheckUtils]: 6: Hoare triple {55998#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {55998#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:14,502 INFO L290 TraceCheckUtils]: 7: Hoare triple {55998#(<= ~counter~0 0)} ~cond := #in~cond; {55998#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:14,502 INFO L290 TraceCheckUtils]: 8: Hoare triple {55998#(<= ~counter~0 0)} assume !(0 == ~cond); {55998#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:14,502 INFO L290 TraceCheckUtils]: 9: Hoare triple {55998#(<= ~counter~0 0)} assume true; {55998#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:14,503 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {55998#(<= ~counter~0 0)} {55998#(<= ~counter~0 0)} #90#return; {55998#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:14,503 INFO L272 TraceCheckUtils]: 11: Hoare triple {55998#(<= ~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)); {55998#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:14,503 INFO L290 TraceCheckUtils]: 12: Hoare triple {55998#(<= ~counter~0 0)} ~cond := #in~cond; {55998#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:14,504 INFO L290 TraceCheckUtils]: 13: Hoare triple {55998#(<= ~counter~0 0)} assume !(0 == ~cond); {55998#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:14,504 INFO L290 TraceCheckUtils]: 14: Hoare triple {55998#(<= ~counter~0 0)} assume true; {55998#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:14,504 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {55998#(<= ~counter~0 0)} {55998#(<= ~counter~0 0)} #92#return; {55998#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:14,505 INFO L290 TraceCheckUtils]: 16: Hoare triple {55998#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {55998#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:14,506 INFO L290 TraceCheckUtils]: 17: Hoare triple {55998#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {56047#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:14,506 INFO L290 TraceCheckUtils]: 18: Hoare triple {56047#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {56047#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:14,507 INFO L272 TraceCheckUtils]: 19: Hoare triple {56047#(<= ~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)); {56047#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:14,507 INFO L290 TraceCheckUtils]: 20: Hoare triple {56047#(<= ~counter~0 1)} ~cond := #in~cond; {56047#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:14,507 INFO L290 TraceCheckUtils]: 21: Hoare triple {56047#(<= ~counter~0 1)} assume !(0 == ~cond); {56047#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:14,507 INFO L290 TraceCheckUtils]: 22: Hoare triple {56047#(<= ~counter~0 1)} assume true; {56047#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:14,508 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {56047#(<= ~counter~0 1)} {56047#(<= ~counter~0 1)} #94#return; {56047#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:14,508 INFO L290 TraceCheckUtils]: 24: Hoare triple {56047#(<= ~counter~0 1)} assume !!(0 != ~r~0); {56047#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:14,509 INFO L290 TraceCheckUtils]: 25: Hoare triple {56047#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56072#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:14,509 INFO L290 TraceCheckUtils]: 26: Hoare triple {56072#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {56072#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:14,510 INFO L272 TraceCheckUtils]: 27: Hoare triple {56072#(<= ~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)); {56072#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:14,510 INFO L290 TraceCheckUtils]: 28: Hoare triple {56072#(<= ~counter~0 2)} ~cond := #in~cond; {56072#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:14,510 INFO L290 TraceCheckUtils]: 29: Hoare triple {56072#(<= ~counter~0 2)} assume !(0 == ~cond); {56072#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:14,510 INFO L290 TraceCheckUtils]: 30: Hoare triple {56072#(<= ~counter~0 2)} assume true; {56072#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:14,511 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {56072#(<= ~counter~0 2)} {56072#(<= ~counter~0 2)} #96#return; {56072#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:14,511 INFO L290 TraceCheckUtils]: 32: Hoare triple {56072#(<= ~counter~0 2)} assume !(~r~0 > 0); {56072#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:14,512 INFO L290 TraceCheckUtils]: 33: Hoare triple {56072#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {56097#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:14,512 INFO L290 TraceCheckUtils]: 34: Hoare triple {56097#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {56097#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:14,512 INFO L272 TraceCheckUtils]: 35: Hoare triple {56097#(<= ~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)); {56097#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:14,513 INFO L290 TraceCheckUtils]: 36: Hoare triple {56097#(<= ~counter~0 3)} ~cond := #in~cond; {56097#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:14,513 INFO L290 TraceCheckUtils]: 37: Hoare triple {56097#(<= ~counter~0 3)} assume !(0 == ~cond); {56097#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:14,513 INFO L290 TraceCheckUtils]: 38: Hoare triple {56097#(<= ~counter~0 3)} assume true; {56097#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:14,514 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {56097#(<= ~counter~0 3)} {56097#(<= ~counter~0 3)} #98#return; {56097#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:14,514 INFO L290 TraceCheckUtils]: 40: Hoare triple {56097#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {56097#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:14,515 INFO L290 TraceCheckUtils]: 41: Hoare triple {56097#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {56122#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:14,515 INFO L290 TraceCheckUtils]: 42: Hoare triple {56122#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {56122#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:14,515 INFO L272 TraceCheckUtils]: 43: Hoare triple {56122#(<= ~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)); {56122#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:14,516 INFO L290 TraceCheckUtils]: 44: Hoare triple {56122#(<= ~counter~0 4)} ~cond := #in~cond; {56122#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:14,516 INFO L290 TraceCheckUtils]: 45: Hoare triple {56122#(<= ~counter~0 4)} assume !(0 == ~cond); {56122#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:14,516 INFO L290 TraceCheckUtils]: 46: Hoare triple {56122#(<= ~counter~0 4)} assume true; {56122#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:14,517 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {56122#(<= ~counter~0 4)} {56122#(<= ~counter~0 4)} #98#return; {56122#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:14,517 INFO L290 TraceCheckUtils]: 48: Hoare triple {56122#(<= ~counter~0 4)} assume !(~r~0 < 0); {56122#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:14,517 INFO L290 TraceCheckUtils]: 49: Hoare triple {56122#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {56147#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:14,518 INFO L290 TraceCheckUtils]: 50: Hoare triple {56147#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {56147#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:14,518 INFO L272 TraceCheckUtils]: 51: Hoare triple {56147#(<= ~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)); {56147#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:14,518 INFO L290 TraceCheckUtils]: 52: Hoare triple {56147#(<= ~counter~0 5)} ~cond := #in~cond; {56147#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:14,519 INFO L290 TraceCheckUtils]: 53: Hoare triple {56147#(<= ~counter~0 5)} assume !(0 == ~cond); {56147#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:14,519 INFO L290 TraceCheckUtils]: 54: Hoare triple {56147#(<= ~counter~0 5)} assume true; {56147#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:14,519 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {56147#(<= ~counter~0 5)} {56147#(<= ~counter~0 5)} #94#return; {56147#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:14,520 INFO L290 TraceCheckUtils]: 56: Hoare triple {56147#(<= ~counter~0 5)} assume !!(0 != ~r~0); {56147#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:14,520 INFO L290 TraceCheckUtils]: 57: Hoare triple {56147#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56172#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:14,521 INFO L290 TraceCheckUtils]: 58: Hoare triple {56172#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {56172#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:14,531 INFO L272 TraceCheckUtils]: 59: Hoare triple {56172#(<= ~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)); {56172#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:14,532 INFO L290 TraceCheckUtils]: 60: Hoare triple {56172#(<= ~counter~0 6)} ~cond := #in~cond; {56172#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:14,532 INFO L290 TraceCheckUtils]: 61: Hoare triple {56172#(<= ~counter~0 6)} assume !(0 == ~cond); {56172#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:14,532 INFO L290 TraceCheckUtils]: 62: Hoare triple {56172#(<= ~counter~0 6)} assume true; {56172#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:14,533 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {56172#(<= ~counter~0 6)} {56172#(<= ~counter~0 6)} #96#return; {56172#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:14,533 INFO L290 TraceCheckUtils]: 64: Hoare triple {56172#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {56172#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:14,534 INFO L290 TraceCheckUtils]: 65: Hoare triple {56172#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56197#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:14,534 INFO L290 TraceCheckUtils]: 66: Hoare triple {56197#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {56197#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:14,535 INFO L272 TraceCheckUtils]: 67: Hoare triple {56197#(<= ~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)); {56197#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:14,535 INFO L290 TraceCheckUtils]: 68: Hoare triple {56197#(<= ~counter~0 7)} ~cond := #in~cond; {56197#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:14,535 INFO L290 TraceCheckUtils]: 69: Hoare triple {56197#(<= ~counter~0 7)} assume !(0 == ~cond); {56197#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:14,535 INFO L290 TraceCheckUtils]: 70: Hoare triple {56197#(<= ~counter~0 7)} assume true; {56197#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:14,536 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {56197#(<= ~counter~0 7)} {56197#(<= ~counter~0 7)} #96#return; {56197#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:14,536 INFO L290 TraceCheckUtils]: 72: Hoare triple {56197#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {56197#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:14,537 INFO L290 TraceCheckUtils]: 73: Hoare triple {56197#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56222#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:14,537 INFO L290 TraceCheckUtils]: 74: Hoare triple {56222#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {56222#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:14,538 INFO L272 TraceCheckUtils]: 75: Hoare triple {56222#(<= ~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)); {56222#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:14,538 INFO L290 TraceCheckUtils]: 76: Hoare triple {56222#(<= ~counter~0 8)} ~cond := #in~cond; {56222#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:14,538 INFO L290 TraceCheckUtils]: 77: Hoare triple {56222#(<= ~counter~0 8)} assume !(0 == ~cond); {56222#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:14,538 INFO L290 TraceCheckUtils]: 78: Hoare triple {56222#(<= ~counter~0 8)} assume true; {56222#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:14,539 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {56222#(<= ~counter~0 8)} {56222#(<= ~counter~0 8)} #96#return; {56222#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:14,539 INFO L290 TraceCheckUtils]: 80: Hoare triple {56222#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {56222#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:14,540 INFO L290 TraceCheckUtils]: 81: Hoare triple {56222#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56247#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:14,540 INFO L290 TraceCheckUtils]: 82: Hoare triple {56247#(<= ~counter~0 9)} assume !!(#t~post7 < 100);havoc #t~post7; {56247#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:14,540 INFO L272 TraceCheckUtils]: 83: Hoare triple {56247#(<= ~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)); {56247#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:14,541 INFO L290 TraceCheckUtils]: 84: Hoare triple {56247#(<= ~counter~0 9)} ~cond := #in~cond; {56247#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:14,541 INFO L290 TraceCheckUtils]: 85: Hoare triple {56247#(<= ~counter~0 9)} assume !(0 == ~cond); {56247#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:14,541 INFO L290 TraceCheckUtils]: 86: Hoare triple {56247#(<= ~counter~0 9)} assume true; {56247#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:14,542 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {56247#(<= ~counter~0 9)} {56247#(<= ~counter~0 9)} #96#return; {56247#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:14,542 INFO L290 TraceCheckUtils]: 88: Hoare triple {56247#(<= ~counter~0 9)} assume !(~r~0 > 0); {56247#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:14,543 INFO L290 TraceCheckUtils]: 89: Hoare triple {56247#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {56272#(<= ~counter~0 10)} is VALID [2022-04-28 05:58:14,543 INFO L290 TraceCheckUtils]: 90: Hoare triple {56272#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {56272#(<= ~counter~0 10)} is VALID [2022-04-28 05:58:14,543 INFO L272 TraceCheckUtils]: 91: Hoare triple {56272#(<= ~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)); {56272#(<= ~counter~0 10)} is VALID [2022-04-28 05:58:14,544 INFO L290 TraceCheckUtils]: 92: Hoare triple {56272#(<= ~counter~0 10)} ~cond := #in~cond; {56272#(<= ~counter~0 10)} is VALID [2022-04-28 05:58:14,544 INFO L290 TraceCheckUtils]: 93: Hoare triple {56272#(<= ~counter~0 10)} assume !(0 == ~cond); {56272#(<= ~counter~0 10)} is VALID [2022-04-28 05:58:14,544 INFO L290 TraceCheckUtils]: 94: Hoare triple {56272#(<= ~counter~0 10)} assume true; {56272#(<= ~counter~0 10)} is VALID [2022-04-28 05:58:14,545 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {56272#(<= ~counter~0 10)} {56272#(<= ~counter~0 10)} #98#return; {56272#(<= ~counter~0 10)} is VALID [2022-04-28 05:58:14,545 INFO L290 TraceCheckUtils]: 96: Hoare triple {56272#(<= ~counter~0 10)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {56272#(<= ~counter~0 10)} is VALID [2022-04-28 05:58:14,545 INFO L290 TraceCheckUtils]: 97: Hoare triple {56272#(<= ~counter~0 10)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {56297#(<= ~counter~0 11)} is VALID [2022-04-28 05:58:14,546 INFO L290 TraceCheckUtils]: 98: Hoare triple {56297#(<= ~counter~0 11)} assume !!(#t~post8 < 100);havoc #t~post8; {56297#(<= ~counter~0 11)} is VALID [2022-04-28 05:58:14,546 INFO L272 TraceCheckUtils]: 99: Hoare triple {56297#(<= ~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)); {56297#(<= ~counter~0 11)} is VALID [2022-04-28 05:58:14,546 INFO L290 TraceCheckUtils]: 100: Hoare triple {56297#(<= ~counter~0 11)} ~cond := #in~cond; {56297#(<= ~counter~0 11)} is VALID [2022-04-28 05:58:14,547 INFO L290 TraceCheckUtils]: 101: Hoare triple {56297#(<= ~counter~0 11)} assume !(0 == ~cond); {56297#(<= ~counter~0 11)} is VALID [2022-04-28 05:58:14,547 INFO L290 TraceCheckUtils]: 102: Hoare triple {56297#(<= ~counter~0 11)} assume true; {56297#(<= ~counter~0 11)} is VALID [2022-04-28 05:58:14,547 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {56297#(<= ~counter~0 11)} {56297#(<= ~counter~0 11)} #98#return; {56297#(<= ~counter~0 11)} is VALID [2022-04-28 05:58:14,548 INFO L290 TraceCheckUtils]: 104: Hoare triple {56297#(<= ~counter~0 11)} assume !(~r~0 < 0); {56297#(<= ~counter~0 11)} is VALID [2022-04-28 05:58:14,548 INFO L290 TraceCheckUtils]: 105: Hoare triple {56297#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {56322#(<= |main_#t~post6| 11)} is VALID [2022-04-28 05:58:14,548 INFO L290 TraceCheckUtils]: 106: Hoare triple {56322#(<= |main_#t~post6| 11)} assume !(#t~post6 < 100);havoc #t~post6; {55991#false} is VALID [2022-04-28 05:58:14,548 INFO L272 TraceCheckUtils]: 107: Hoare triple {55991#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)); {55991#false} is VALID [2022-04-28 05:58:14,548 INFO L290 TraceCheckUtils]: 108: Hoare triple {55991#false} ~cond := #in~cond; {55991#false} is VALID [2022-04-28 05:58:14,549 INFO L290 TraceCheckUtils]: 109: Hoare triple {55991#false} assume 0 == ~cond; {55991#false} is VALID [2022-04-28 05:58:14,549 INFO L290 TraceCheckUtils]: 110: Hoare triple {55991#false} assume !false; {55991#false} is VALID [2022-04-28 05:58:14,549 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 22 proven. 292 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:58:14,549 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:58:15,162 INFO L290 TraceCheckUtils]: 110: Hoare triple {55991#false} assume !false; {55991#false} is VALID [2022-04-28 05:58:15,163 INFO L290 TraceCheckUtils]: 109: Hoare triple {55991#false} assume 0 == ~cond; {55991#false} is VALID [2022-04-28 05:58:15,163 INFO L290 TraceCheckUtils]: 108: Hoare triple {55991#false} ~cond := #in~cond; {55991#false} is VALID [2022-04-28 05:58:15,163 INFO L272 TraceCheckUtils]: 107: Hoare triple {55991#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)); {55991#false} is VALID [2022-04-28 05:58:15,163 INFO L290 TraceCheckUtils]: 106: Hoare triple {56350#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {55991#false} is VALID [2022-04-28 05:58:15,163 INFO L290 TraceCheckUtils]: 105: Hoare triple {56354#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {56350#(< |main_#t~post6| 100)} is VALID [2022-04-28 05:58:15,164 INFO L290 TraceCheckUtils]: 104: Hoare triple {56354#(< ~counter~0 100)} assume !(~r~0 < 0); {56354#(< ~counter~0 100)} is VALID [2022-04-28 05:58:15,164 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {55990#true} {56354#(< ~counter~0 100)} #98#return; {56354#(< ~counter~0 100)} is VALID [2022-04-28 05:58:15,164 INFO L290 TraceCheckUtils]: 102: Hoare triple {55990#true} assume true; {55990#true} is VALID [2022-04-28 05:58:15,164 INFO L290 TraceCheckUtils]: 101: Hoare triple {55990#true} assume !(0 == ~cond); {55990#true} is VALID [2022-04-28 05:58:15,164 INFO L290 TraceCheckUtils]: 100: Hoare triple {55990#true} ~cond := #in~cond; {55990#true} is VALID [2022-04-28 05:58:15,164 INFO L272 TraceCheckUtils]: 99: Hoare triple {56354#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {55990#true} is VALID [2022-04-28 05:58:15,165 INFO L290 TraceCheckUtils]: 98: Hoare triple {56354#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {56354#(< ~counter~0 100)} is VALID [2022-04-28 05:58:15,166 INFO L290 TraceCheckUtils]: 97: Hoare triple {56379#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {56354#(< ~counter~0 100)} is VALID [2022-04-28 05:58:15,166 INFO L290 TraceCheckUtils]: 96: Hoare triple {56379#(< ~counter~0 99)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {56379#(< ~counter~0 99)} is VALID [2022-04-28 05:58:15,167 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {55990#true} {56379#(< ~counter~0 99)} #98#return; {56379#(< ~counter~0 99)} is VALID [2022-04-28 05:58:15,167 INFO L290 TraceCheckUtils]: 94: Hoare triple {55990#true} assume true; {55990#true} is VALID [2022-04-28 05:58:15,167 INFO L290 TraceCheckUtils]: 93: Hoare triple {55990#true} assume !(0 == ~cond); {55990#true} is VALID [2022-04-28 05:58:15,167 INFO L290 TraceCheckUtils]: 92: Hoare triple {55990#true} ~cond := #in~cond; {55990#true} is VALID [2022-04-28 05:58:15,167 INFO L272 TraceCheckUtils]: 91: Hoare triple {56379#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {55990#true} is VALID [2022-04-28 05:58:15,167 INFO L290 TraceCheckUtils]: 90: Hoare triple {56379#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {56379#(< ~counter~0 99)} is VALID [2022-04-28 05:58:15,168 INFO L290 TraceCheckUtils]: 89: Hoare triple {56404#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {56379#(< ~counter~0 99)} is VALID [2022-04-28 05:58:15,168 INFO L290 TraceCheckUtils]: 88: Hoare triple {56404#(< ~counter~0 98)} assume !(~r~0 > 0); {56404#(< ~counter~0 98)} is VALID [2022-04-28 05:58:15,169 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {55990#true} {56404#(< ~counter~0 98)} #96#return; {56404#(< ~counter~0 98)} is VALID [2022-04-28 05:58:15,169 INFO L290 TraceCheckUtils]: 86: Hoare triple {55990#true} assume true; {55990#true} is VALID [2022-04-28 05:58:15,169 INFO L290 TraceCheckUtils]: 85: Hoare triple {55990#true} assume !(0 == ~cond); {55990#true} is VALID [2022-04-28 05:58:15,169 INFO L290 TraceCheckUtils]: 84: Hoare triple {55990#true} ~cond := #in~cond; {55990#true} is VALID [2022-04-28 05:58:15,169 INFO L272 TraceCheckUtils]: 83: Hoare triple {56404#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {55990#true} is VALID [2022-04-28 05:58:15,169 INFO L290 TraceCheckUtils]: 82: Hoare triple {56404#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {56404#(< ~counter~0 98)} is VALID [2022-04-28 05:58:15,170 INFO L290 TraceCheckUtils]: 81: Hoare triple {56429#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56404#(< ~counter~0 98)} is VALID [2022-04-28 05:58:15,170 INFO L290 TraceCheckUtils]: 80: Hoare triple {56429#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {56429#(< ~counter~0 97)} is VALID [2022-04-28 05:58:15,171 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {55990#true} {56429#(< ~counter~0 97)} #96#return; {56429#(< ~counter~0 97)} is VALID [2022-04-28 05:58:15,171 INFO L290 TraceCheckUtils]: 78: Hoare triple {55990#true} assume true; {55990#true} is VALID [2022-04-28 05:58:15,171 INFO L290 TraceCheckUtils]: 77: Hoare triple {55990#true} assume !(0 == ~cond); {55990#true} is VALID [2022-04-28 05:58:15,171 INFO L290 TraceCheckUtils]: 76: Hoare triple {55990#true} ~cond := #in~cond; {55990#true} is VALID [2022-04-28 05:58:15,171 INFO L272 TraceCheckUtils]: 75: Hoare triple {56429#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {55990#true} is VALID [2022-04-28 05:58:15,171 INFO L290 TraceCheckUtils]: 74: Hoare triple {56429#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {56429#(< ~counter~0 97)} is VALID [2022-04-28 05:58:15,172 INFO L290 TraceCheckUtils]: 73: Hoare triple {56454#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56429#(< ~counter~0 97)} is VALID [2022-04-28 05:58:15,172 INFO L290 TraceCheckUtils]: 72: Hoare triple {56454#(< ~counter~0 96)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {56454#(< ~counter~0 96)} is VALID [2022-04-28 05:58:15,173 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {55990#true} {56454#(< ~counter~0 96)} #96#return; {56454#(< ~counter~0 96)} is VALID [2022-04-28 05:58:15,173 INFO L290 TraceCheckUtils]: 70: Hoare triple {55990#true} assume true; {55990#true} is VALID [2022-04-28 05:58:15,173 INFO L290 TraceCheckUtils]: 69: Hoare triple {55990#true} assume !(0 == ~cond); {55990#true} is VALID [2022-04-28 05:58:15,173 INFO L290 TraceCheckUtils]: 68: Hoare triple {55990#true} ~cond := #in~cond; {55990#true} is VALID [2022-04-28 05:58:15,173 INFO L272 TraceCheckUtils]: 67: Hoare triple {56454#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {55990#true} is VALID [2022-04-28 05:58:15,173 INFO L290 TraceCheckUtils]: 66: Hoare triple {56454#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {56454#(< ~counter~0 96)} is VALID [2022-04-28 05:58:15,174 INFO L290 TraceCheckUtils]: 65: Hoare triple {56479#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56454#(< ~counter~0 96)} is VALID [2022-04-28 05:58:15,174 INFO L290 TraceCheckUtils]: 64: Hoare triple {56479#(< ~counter~0 95)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {56479#(< ~counter~0 95)} is VALID [2022-04-28 05:58:15,174 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {55990#true} {56479#(< ~counter~0 95)} #96#return; {56479#(< ~counter~0 95)} is VALID [2022-04-28 05:58:15,175 INFO L290 TraceCheckUtils]: 62: Hoare triple {55990#true} assume true; {55990#true} is VALID [2022-04-28 05:58:15,175 INFO L290 TraceCheckUtils]: 61: Hoare triple {55990#true} assume !(0 == ~cond); {55990#true} is VALID [2022-04-28 05:58:15,175 INFO L290 TraceCheckUtils]: 60: Hoare triple {55990#true} ~cond := #in~cond; {55990#true} is VALID [2022-04-28 05:58:15,175 INFO L272 TraceCheckUtils]: 59: Hoare triple {56479#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {55990#true} is VALID [2022-04-28 05:58:15,175 INFO L290 TraceCheckUtils]: 58: Hoare triple {56479#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {56479#(< ~counter~0 95)} is VALID [2022-04-28 05:58:15,176 INFO L290 TraceCheckUtils]: 57: Hoare triple {56504#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56479#(< ~counter~0 95)} is VALID [2022-04-28 05:58:15,176 INFO L290 TraceCheckUtils]: 56: Hoare triple {56504#(< ~counter~0 94)} assume !!(0 != ~r~0); {56504#(< ~counter~0 94)} is VALID [2022-04-28 05:58:15,176 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {55990#true} {56504#(< ~counter~0 94)} #94#return; {56504#(< ~counter~0 94)} is VALID [2022-04-28 05:58:15,176 INFO L290 TraceCheckUtils]: 54: Hoare triple {55990#true} assume true; {55990#true} is VALID [2022-04-28 05:58:15,177 INFO L290 TraceCheckUtils]: 53: Hoare triple {55990#true} assume !(0 == ~cond); {55990#true} is VALID [2022-04-28 05:58:15,177 INFO L290 TraceCheckUtils]: 52: Hoare triple {55990#true} ~cond := #in~cond; {55990#true} is VALID [2022-04-28 05:58:15,177 INFO L272 TraceCheckUtils]: 51: Hoare triple {56504#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {55990#true} is VALID [2022-04-28 05:58:15,177 INFO L290 TraceCheckUtils]: 50: Hoare triple {56504#(< ~counter~0 94)} assume !!(#t~post6 < 100);havoc #t~post6; {56504#(< ~counter~0 94)} is VALID [2022-04-28 05:58:15,178 INFO L290 TraceCheckUtils]: 49: Hoare triple {56529#(< ~counter~0 93)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {56504#(< ~counter~0 94)} is VALID [2022-04-28 05:58:15,178 INFO L290 TraceCheckUtils]: 48: Hoare triple {56529#(< ~counter~0 93)} assume !(~r~0 < 0); {56529#(< ~counter~0 93)} is VALID [2022-04-28 05:58:15,178 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {55990#true} {56529#(< ~counter~0 93)} #98#return; {56529#(< ~counter~0 93)} is VALID [2022-04-28 05:58:15,178 INFO L290 TraceCheckUtils]: 46: Hoare triple {55990#true} assume true; {55990#true} is VALID [2022-04-28 05:58:15,178 INFO L290 TraceCheckUtils]: 45: Hoare triple {55990#true} assume !(0 == ~cond); {55990#true} is VALID [2022-04-28 05:58:15,179 INFO L290 TraceCheckUtils]: 44: Hoare triple {55990#true} ~cond := #in~cond; {55990#true} is VALID [2022-04-28 05:58:15,179 INFO L272 TraceCheckUtils]: 43: Hoare triple {56529#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {55990#true} is VALID [2022-04-28 05:58:15,179 INFO L290 TraceCheckUtils]: 42: Hoare triple {56529#(< ~counter~0 93)} assume !!(#t~post8 < 100);havoc #t~post8; {56529#(< ~counter~0 93)} is VALID [2022-04-28 05:58:15,180 INFO L290 TraceCheckUtils]: 41: Hoare triple {56554#(< ~counter~0 92)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {56529#(< ~counter~0 93)} is VALID [2022-04-28 05:58:15,180 INFO L290 TraceCheckUtils]: 40: Hoare triple {56554#(< ~counter~0 92)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {56554#(< ~counter~0 92)} is VALID [2022-04-28 05:58:15,180 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {55990#true} {56554#(< ~counter~0 92)} #98#return; {56554#(< ~counter~0 92)} is VALID [2022-04-28 05:58:15,180 INFO L290 TraceCheckUtils]: 38: Hoare triple {55990#true} assume true; {55990#true} is VALID [2022-04-28 05:58:15,180 INFO L290 TraceCheckUtils]: 37: Hoare triple {55990#true} assume !(0 == ~cond); {55990#true} is VALID [2022-04-28 05:58:15,180 INFO L290 TraceCheckUtils]: 36: Hoare triple {55990#true} ~cond := #in~cond; {55990#true} is VALID [2022-04-28 05:58:15,181 INFO L272 TraceCheckUtils]: 35: Hoare triple {56554#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {55990#true} is VALID [2022-04-28 05:58:15,181 INFO L290 TraceCheckUtils]: 34: Hoare triple {56554#(< ~counter~0 92)} assume !!(#t~post8 < 100);havoc #t~post8; {56554#(< ~counter~0 92)} is VALID [2022-04-28 05:58:15,181 INFO L290 TraceCheckUtils]: 33: Hoare triple {56579#(< ~counter~0 91)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {56554#(< ~counter~0 92)} is VALID [2022-04-28 05:58:15,182 INFO L290 TraceCheckUtils]: 32: Hoare triple {56579#(< ~counter~0 91)} assume !(~r~0 > 0); {56579#(< ~counter~0 91)} is VALID [2022-04-28 05:58:15,182 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {55990#true} {56579#(< ~counter~0 91)} #96#return; {56579#(< ~counter~0 91)} is VALID [2022-04-28 05:58:15,182 INFO L290 TraceCheckUtils]: 30: Hoare triple {55990#true} assume true; {55990#true} is VALID [2022-04-28 05:58:15,182 INFO L290 TraceCheckUtils]: 29: Hoare triple {55990#true} assume !(0 == ~cond); {55990#true} is VALID [2022-04-28 05:58:15,182 INFO L290 TraceCheckUtils]: 28: Hoare triple {55990#true} ~cond := #in~cond; {55990#true} is VALID [2022-04-28 05:58:15,182 INFO L272 TraceCheckUtils]: 27: Hoare triple {56579#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {55990#true} is VALID [2022-04-28 05:58:15,183 INFO L290 TraceCheckUtils]: 26: Hoare triple {56579#(< ~counter~0 91)} assume !!(#t~post7 < 100);havoc #t~post7; {56579#(< ~counter~0 91)} is VALID [2022-04-28 05:58:15,183 INFO L290 TraceCheckUtils]: 25: Hoare triple {56604#(< ~counter~0 90)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56579#(< ~counter~0 91)} is VALID [2022-04-28 05:58:15,184 INFO L290 TraceCheckUtils]: 24: Hoare triple {56604#(< ~counter~0 90)} assume !!(0 != ~r~0); {56604#(< ~counter~0 90)} is VALID [2022-04-28 05:58:15,184 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {55990#true} {56604#(< ~counter~0 90)} #94#return; {56604#(< ~counter~0 90)} is VALID [2022-04-28 05:58:15,184 INFO L290 TraceCheckUtils]: 22: Hoare triple {55990#true} assume true; {55990#true} is VALID [2022-04-28 05:58:15,184 INFO L290 TraceCheckUtils]: 21: Hoare triple {55990#true} assume !(0 == ~cond); {55990#true} is VALID [2022-04-28 05:58:15,184 INFO L290 TraceCheckUtils]: 20: Hoare triple {55990#true} ~cond := #in~cond; {55990#true} is VALID [2022-04-28 05:58:15,184 INFO L272 TraceCheckUtils]: 19: Hoare triple {56604#(< ~counter~0 90)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {55990#true} is VALID [2022-04-28 05:58:15,185 INFO L290 TraceCheckUtils]: 18: Hoare triple {56604#(< ~counter~0 90)} assume !!(#t~post6 < 100);havoc #t~post6; {56604#(< ~counter~0 90)} is VALID [2022-04-28 05:58:15,185 INFO L290 TraceCheckUtils]: 17: Hoare triple {56629#(< ~counter~0 89)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {56604#(< ~counter~0 90)} is VALID [2022-04-28 05:58:15,186 INFO L290 TraceCheckUtils]: 16: Hoare triple {56629#(< ~counter~0 89)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {56629#(< ~counter~0 89)} is VALID [2022-04-28 05:58:15,186 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {55990#true} {56629#(< ~counter~0 89)} #92#return; {56629#(< ~counter~0 89)} is VALID [2022-04-28 05:58:15,186 INFO L290 TraceCheckUtils]: 14: Hoare triple {55990#true} assume true; {55990#true} is VALID [2022-04-28 05:58:15,186 INFO L290 TraceCheckUtils]: 13: Hoare triple {55990#true} assume !(0 == ~cond); {55990#true} is VALID [2022-04-28 05:58:15,186 INFO L290 TraceCheckUtils]: 12: Hoare triple {55990#true} ~cond := #in~cond; {55990#true} is VALID [2022-04-28 05:58:15,186 INFO L272 TraceCheckUtils]: 11: Hoare triple {56629#(< ~counter~0 89)} 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)); {55990#true} is VALID [2022-04-28 05:58:15,187 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {55990#true} {56629#(< ~counter~0 89)} #90#return; {56629#(< ~counter~0 89)} is VALID [2022-04-28 05:58:15,187 INFO L290 TraceCheckUtils]: 9: Hoare triple {55990#true} assume true; {55990#true} is VALID [2022-04-28 05:58:15,187 INFO L290 TraceCheckUtils]: 8: Hoare triple {55990#true} assume !(0 == ~cond); {55990#true} is VALID [2022-04-28 05:58:15,187 INFO L290 TraceCheckUtils]: 7: Hoare triple {55990#true} ~cond := #in~cond; {55990#true} is VALID [2022-04-28 05:58:15,187 INFO L272 TraceCheckUtils]: 6: Hoare triple {56629#(< ~counter~0 89)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {55990#true} is VALID [2022-04-28 05:58:15,187 INFO L290 TraceCheckUtils]: 5: Hoare triple {56629#(< ~counter~0 89)} 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; {56629#(< ~counter~0 89)} is VALID [2022-04-28 05:58:15,187 INFO L272 TraceCheckUtils]: 4: Hoare triple {56629#(< ~counter~0 89)} call #t~ret9 := main(); {56629#(< ~counter~0 89)} is VALID [2022-04-28 05:58:15,188 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56629#(< ~counter~0 89)} {55990#true} #102#return; {56629#(< ~counter~0 89)} is VALID [2022-04-28 05:58:15,188 INFO L290 TraceCheckUtils]: 2: Hoare triple {56629#(< ~counter~0 89)} assume true; {56629#(< ~counter~0 89)} is VALID [2022-04-28 05:58:15,188 INFO L290 TraceCheckUtils]: 1: Hoare triple {55990#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; {56629#(< ~counter~0 89)} is VALID [2022-04-28 05:58:15,188 INFO L272 TraceCheckUtils]: 0: Hoare triple {55990#true} call ULTIMATE.init(); {55990#true} is VALID [2022-04-28 05:58:15,189 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 22 proven. 72 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-04-28 05:58:15,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:58:15,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826913710] [2022-04-28 05:58:15,189 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:58:15,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151858007] [2022-04-28 05:58:15,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151858007] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:58:15,189 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:58:15,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2022-04-28 05:58:15,189 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:58:15,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [692953212] [2022-04-28 05:58:15,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [692953212] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:58:15,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:58:15,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 05:58:15,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406909279] [2022-04-28 05:58:15,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:58:15,190 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.2) internal successors, (78), 14 states have internal predecessors, (78), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) Word has length 111 [2022-04-28 05:58:15,190 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:58:15,190 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 5.2) internal successors, (78), 14 states have internal predecessors, (78), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-28 05:58:15,264 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:58:15,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 05:58:15,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:58:15,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 05:58:15,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=426, Unknown=0, NotChecked=0, Total=756 [2022-04-28 05:58:15,265 INFO L87 Difference]: Start difference. First operand 538 states and 733 transitions. Second operand has 15 states, 15 states have (on average 5.2) internal successors, (78), 14 states have internal predecessors, (78), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-28 05:58:17,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:17,261 INFO L93 Difference]: Finished difference Result 593 states and 810 transitions. [2022-04-28 05:58:17,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-28 05:58:17,262 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.2) internal successors, (78), 14 states have internal predecessors, (78), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) Word has length 111 [2022-04-28 05:58:17,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:58:17,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 5.2) internal successors, (78), 14 states have internal predecessors, (78), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-28 05:58:17,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 234 transitions. [2022-04-28 05:58:17,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 5.2) internal successors, (78), 14 states have internal predecessors, (78), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-28 05:58:17,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 234 transitions. [2022-04-28 05:58:17,265 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 234 transitions. [2022-04-28 05:58:17,445 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 234 edges. 234 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:58:17,459 INFO L225 Difference]: With dead ends: 593 [2022-04-28 05:58:17,459 INFO L226 Difference]: Without dead ends: 582 [2022-04-28 05:58:17,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=525, Invalid=735, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 05:58:17,460 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 173 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 05:58:17,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 262 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 05:58:17,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2022-04-28 05:58:18,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 560. [2022-04-28 05:58:18,552 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:58:18,553 INFO L82 GeneralOperation]: Start isEquivalent. First operand 582 states. Second operand has 560 states, 418 states have (on average 1.2344497607655502) internal successors, (516), 428 states have internal predecessors, (516), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-28 05:58:18,553 INFO L74 IsIncluded]: Start isIncluded. First operand 582 states. Second operand has 560 states, 418 states have (on average 1.2344497607655502) internal successors, (516), 428 states have internal predecessors, (516), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-28 05:58:18,553 INFO L87 Difference]: Start difference. First operand 582 states. Second operand has 560 states, 418 states have (on average 1.2344497607655502) internal successors, (516), 428 states have internal predecessors, (516), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-28 05:58:18,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:18,566 INFO L93 Difference]: Finished difference Result 582 states and 794 transitions. [2022-04-28 05:58:18,566 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 794 transitions. [2022-04-28 05:58:18,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:58:18,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:58:18,567 INFO L74 IsIncluded]: Start isIncluded. First operand has 560 states, 418 states have (on average 1.2344497607655502) internal successors, (516), 428 states have internal predecessors, (516), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) Second operand 582 states. [2022-04-28 05:58:18,567 INFO L87 Difference]: Start difference. First operand has 560 states, 418 states have (on average 1.2344497607655502) internal successors, (516), 428 states have internal predecessors, (516), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) Second operand 582 states. [2022-04-28 05:58:18,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:18,580 INFO L93 Difference]: Finished difference Result 582 states and 794 transitions. [2022-04-28 05:58:18,580 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 794 transitions. [2022-04-28 05:58:18,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:58:18,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:58:18,580 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:58:18,581 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:58:18,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 418 states have (on average 1.2344497607655502) internal successors, (516), 428 states have internal predecessors, (516), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-28 05:58:18,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 768 transitions. [2022-04-28 05:58:18,596 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 768 transitions. Word has length 111 [2022-04-28 05:58:18,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:58:18,596 INFO L495 AbstractCegarLoop]: Abstraction has 560 states and 768 transitions. [2022-04-28 05:58:18,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.2) internal successors, (78), 14 states have internal predecessors, (78), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-28 05:58:18,596 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 560 states and 768 transitions. [2022-04-28 05:58:22,428 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 768 edges. 767 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 05:58:22,428 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 768 transitions. [2022-04-28 05:58:22,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-04-28 05:58:22,429 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:58:22,429 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:58:22,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2022-04-28 05:58:22,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-04-28 05:58:22,633 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:58:22,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:58:22,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1038942829, now seen corresponding path program 13 times [2022-04-28 05:58:22,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:58:22,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [863765837] [2022-04-28 05:58:22,634 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:58:22,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1038942829, now seen corresponding path program 14 times [2022-04-28 05:58:22,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:58:22,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547622690] [2022-04-28 05:58:22,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:58:22,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:58:22,650 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:58:22,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [938295684] [2022-04-28 05:58:22,650 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:58:22,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:58:22,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:58:22,652 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:58:22,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-04-28 05:58:22,702 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:58:22,702 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:58:22,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 05:58:22,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:58:22,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:58:23,541 INFO L272 TraceCheckUtils]: 0: Hoare triple {60169#true} call ULTIMATE.init(); {60169#true} is VALID [2022-04-28 05:58:23,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {60169#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; {60169#true} is VALID [2022-04-28 05:58:23,542 INFO L290 TraceCheckUtils]: 2: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-28 05:58:23,542 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60169#true} {60169#true} #102#return; {60169#true} is VALID [2022-04-28 05:58:23,542 INFO L272 TraceCheckUtils]: 4: Hoare triple {60169#true} call #t~ret9 := main(); {60169#true} is VALID [2022-04-28 05:58:23,542 INFO L290 TraceCheckUtils]: 5: Hoare triple {60169#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; {60169#true} is VALID [2022-04-28 05:58:23,542 INFO L272 TraceCheckUtils]: 6: Hoare triple {60169#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {60169#true} is VALID [2022-04-28 05:58:23,542 INFO L290 TraceCheckUtils]: 7: Hoare triple {60169#true} ~cond := #in~cond; {60169#true} is VALID [2022-04-28 05:58:23,542 INFO L290 TraceCheckUtils]: 8: Hoare triple {60169#true} assume !(0 == ~cond); {60169#true} is VALID [2022-04-28 05:58:23,542 INFO L290 TraceCheckUtils]: 9: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-28 05:58:23,542 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {60169#true} {60169#true} #90#return; {60169#true} is VALID [2022-04-28 05:58:23,543 INFO L272 TraceCheckUtils]: 11: Hoare triple {60169#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)); {60169#true} is VALID [2022-04-28 05:58:23,543 INFO L290 TraceCheckUtils]: 12: Hoare triple {60169#true} ~cond := #in~cond; {60169#true} is VALID [2022-04-28 05:58:23,543 INFO L290 TraceCheckUtils]: 13: Hoare triple {60169#true} assume !(0 == ~cond); {60169#true} is VALID [2022-04-28 05:58:23,543 INFO L290 TraceCheckUtils]: 14: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-28 05:58:23,543 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {60169#true} {60169#true} #92#return; {60169#true} is VALID [2022-04-28 05:58:23,543 INFO L290 TraceCheckUtils]: 16: Hoare triple {60169#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {60222#(<= 1 main_~v~0)} is VALID [2022-04-28 05:58:23,544 INFO L290 TraceCheckUtils]: 17: Hoare triple {60222#(<= 1 main_~v~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {60222#(<= 1 main_~v~0)} is VALID [2022-04-28 05:58:23,544 INFO L290 TraceCheckUtils]: 18: Hoare triple {60222#(<= 1 main_~v~0)} assume !!(#t~post6 < 100);havoc #t~post6; {60222#(<= 1 main_~v~0)} is VALID [2022-04-28 05:58:23,544 INFO L272 TraceCheckUtils]: 19: Hoare triple {60222#(<= 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)); {60169#true} is VALID [2022-04-28 05:58:23,544 INFO L290 TraceCheckUtils]: 20: Hoare triple {60169#true} ~cond := #in~cond; {60169#true} is VALID [2022-04-28 05:58:23,544 INFO L290 TraceCheckUtils]: 21: Hoare triple {60169#true} assume !(0 == ~cond); {60169#true} is VALID [2022-04-28 05:58:23,544 INFO L290 TraceCheckUtils]: 22: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-28 05:58:23,545 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {60169#true} {60222#(<= 1 main_~v~0)} #94#return; {60222#(<= 1 main_~v~0)} is VALID [2022-04-28 05:58:23,545 INFO L290 TraceCheckUtils]: 24: Hoare triple {60222#(<= 1 main_~v~0)} assume !!(0 != ~r~0); {60222#(<= 1 main_~v~0)} is VALID [2022-04-28 05:58:23,545 INFO L290 TraceCheckUtils]: 25: Hoare triple {60222#(<= 1 main_~v~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {60222#(<= 1 main_~v~0)} is VALID [2022-04-28 05:58:23,546 INFO L290 TraceCheckUtils]: 26: Hoare triple {60222#(<= 1 main_~v~0)} assume !!(#t~post7 < 100);havoc #t~post7; {60222#(<= 1 main_~v~0)} is VALID [2022-04-28 05:58:23,546 INFO L272 TraceCheckUtils]: 27: Hoare triple {60222#(<= 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)); {60169#true} is VALID [2022-04-28 05:58:23,546 INFO L290 TraceCheckUtils]: 28: Hoare triple {60169#true} ~cond := #in~cond; {60169#true} is VALID [2022-04-28 05:58:23,546 INFO L290 TraceCheckUtils]: 29: Hoare triple {60169#true} assume !(0 == ~cond); {60169#true} is VALID [2022-04-28 05:58:23,546 INFO L290 TraceCheckUtils]: 30: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-28 05:58:23,546 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {60169#true} {60222#(<= 1 main_~v~0)} #96#return; {60222#(<= 1 main_~v~0)} is VALID [2022-04-28 05:58:23,547 INFO L290 TraceCheckUtils]: 32: Hoare triple {60222#(<= 1 main_~v~0)} assume !(~r~0 > 0); {60222#(<= 1 main_~v~0)} is VALID [2022-04-28 05:58:23,547 INFO L290 TraceCheckUtils]: 33: Hoare triple {60222#(<= 1 main_~v~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {60222#(<= 1 main_~v~0)} is VALID [2022-04-28 05:58:23,547 INFO L290 TraceCheckUtils]: 34: Hoare triple {60222#(<= 1 main_~v~0)} assume !!(#t~post8 < 100);havoc #t~post8; {60222#(<= 1 main_~v~0)} is VALID [2022-04-28 05:58:23,547 INFO L272 TraceCheckUtils]: 35: Hoare triple {60222#(<= 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)); {60169#true} is VALID [2022-04-28 05:58:23,547 INFO L290 TraceCheckUtils]: 36: Hoare triple {60169#true} ~cond := #in~cond; {60169#true} is VALID [2022-04-28 05:58:23,547 INFO L290 TraceCheckUtils]: 37: Hoare triple {60169#true} assume !(0 == ~cond); {60169#true} is VALID [2022-04-28 05:58:23,548 INFO L290 TraceCheckUtils]: 38: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-28 05:58:23,548 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {60169#true} {60222#(<= 1 main_~v~0)} #98#return; {60222#(<= 1 main_~v~0)} is VALID [2022-04-28 05:58:23,550 INFO L290 TraceCheckUtils]: 40: Hoare triple {60222#(<= 1 main_~v~0)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {60295#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-28 05:58:23,550 INFO L290 TraceCheckUtils]: 41: Hoare triple {60295#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {60295#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-28 05:58:23,551 INFO L290 TraceCheckUtils]: 42: Hoare triple {60295#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} assume !!(#t~post8 < 100);havoc #t~post8; {60295#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-28 05:58:23,551 INFO L272 TraceCheckUtils]: 43: Hoare triple {60295#(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)); {60169#true} is VALID [2022-04-28 05:58:23,551 INFO L290 TraceCheckUtils]: 44: Hoare triple {60169#true} ~cond := #in~cond; {60169#true} is VALID [2022-04-28 05:58:23,551 INFO L290 TraceCheckUtils]: 45: Hoare triple {60169#true} assume !(0 == ~cond); {60169#true} is VALID [2022-04-28 05:58:23,551 INFO L290 TraceCheckUtils]: 46: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-28 05:58:23,551 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {60169#true} {60295#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} #98#return; {60295#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-28 05:58:23,552 INFO L290 TraceCheckUtils]: 48: Hoare triple {60295#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} assume !(~r~0 < 0); {60295#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-28 05:58:23,552 INFO L290 TraceCheckUtils]: 49: Hoare triple {60295#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {60295#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-28 05:58:23,552 INFO L290 TraceCheckUtils]: 50: Hoare triple {60295#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} assume !!(#t~post6 < 100);havoc #t~post6; {60295#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-28 05:58:23,553 INFO L272 TraceCheckUtils]: 51: Hoare triple {60295#(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)); {60169#true} is VALID [2022-04-28 05:58:23,553 INFO L290 TraceCheckUtils]: 52: Hoare triple {60169#true} ~cond := #in~cond; {60169#true} is VALID [2022-04-28 05:58:23,553 INFO L290 TraceCheckUtils]: 53: Hoare triple {60169#true} assume !(0 == ~cond); {60169#true} is VALID [2022-04-28 05:58:23,553 INFO L290 TraceCheckUtils]: 54: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-28 05:58:23,553 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {60169#true} {60295#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} #94#return; {60295#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-28 05:58:23,554 INFO L290 TraceCheckUtils]: 56: Hoare triple {60295#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} assume !!(0 != ~r~0); {60295#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-28 05:58:23,554 INFO L290 TraceCheckUtils]: 57: Hoare triple {60295#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {60295#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-28 05:58:23,554 INFO L290 TraceCheckUtils]: 58: Hoare triple {60295#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} assume !!(#t~post7 < 100);havoc #t~post7; {60295#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-28 05:58:23,554 INFO L272 TraceCheckUtils]: 59: Hoare triple {60295#(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)); {60169#true} is VALID [2022-04-28 05:58:23,555 INFO L290 TraceCheckUtils]: 60: Hoare triple {60169#true} ~cond := #in~cond; {60169#true} is VALID [2022-04-28 05:58:23,555 INFO L290 TraceCheckUtils]: 61: Hoare triple {60169#true} assume !(0 == ~cond); {60169#true} is VALID [2022-04-28 05:58:23,555 INFO L290 TraceCheckUtils]: 62: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-28 05:58:23,555 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {60169#true} {60295#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} #96#return; {60295#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-28 05:58:23,556 INFO L290 TraceCheckUtils]: 64: Hoare triple {60295#(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; {60368#(< (+ main_~r~0 3) main_~u~0)} is VALID [2022-04-28 05:58:23,557 INFO L290 TraceCheckUtils]: 65: Hoare triple {60368#(< (+ main_~r~0 3) main_~u~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {60368#(< (+ main_~r~0 3) main_~u~0)} is VALID [2022-04-28 05:58:23,557 INFO L290 TraceCheckUtils]: 66: Hoare triple {60368#(< (+ main_~r~0 3) main_~u~0)} assume !!(#t~post7 < 100);havoc #t~post7; {60368#(< (+ main_~r~0 3) main_~u~0)} is VALID [2022-04-28 05:58:23,557 INFO L272 TraceCheckUtils]: 67: Hoare triple {60368#(< (+ 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)); {60169#true} is VALID [2022-04-28 05:58:23,557 INFO L290 TraceCheckUtils]: 68: Hoare triple {60169#true} ~cond := #in~cond; {60169#true} is VALID [2022-04-28 05:58:23,557 INFO L290 TraceCheckUtils]: 69: Hoare triple {60169#true} assume !(0 == ~cond); {60169#true} is VALID [2022-04-28 05:58:23,557 INFO L290 TraceCheckUtils]: 70: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-28 05:58:23,558 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {60169#true} {60368#(< (+ main_~r~0 3) main_~u~0)} #96#return; {60368#(< (+ main_~r~0 3) main_~u~0)} is VALID [2022-04-28 05:58:23,559 INFO L290 TraceCheckUtils]: 72: Hoare triple {60368#(< (+ main_~r~0 3) main_~u~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {60393#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} is VALID [2022-04-28 05:58:23,559 INFO L290 TraceCheckUtils]: 73: Hoare triple {60393#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {60393#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} is VALID [2022-04-28 05:58:23,559 INFO L290 TraceCheckUtils]: 74: Hoare triple {60393#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} assume !!(#t~post7 < 100);havoc #t~post7; {60393#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} is VALID [2022-04-28 05:58:23,559 INFO L272 TraceCheckUtils]: 75: Hoare triple {60393#(< (+ 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)); {60169#true} is VALID [2022-04-28 05:58:23,559 INFO L290 TraceCheckUtils]: 76: Hoare triple {60169#true} ~cond := #in~cond; {60169#true} is VALID [2022-04-28 05:58:23,559 INFO L290 TraceCheckUtils]: 77: Hoare triple {60169#true} assume !(0 == ~cond); {60169#true} is VALID [2022-04-28 05:58:23,559 INFO L290 TraceCheckUtils]: 78: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-28 05:58:23,560 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {60169#true} {60393#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} #96#return; {60393#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} is VALID [2022-04-28 05:58:23,561 INFO L290 TraceCheckUtils]: 80: Hoare triple {60393#(< (+ 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; {60418#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} is VALID [2022-04-28 05:58:23,561 INFO L290 TraceCheckUtils]: 81: Hoare triple {60418#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {60418#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} is VALID [2022-04-28 05:58:23,561 INFO L290 TraceCheckUtils]: 82: Hoare triple {60418#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} assume !!(#t~post7 < 100);havoc #t~post7; {60418#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} is VALID [2022-04-28 05:58:23,561 INFO L272 TraceCheckUtils]: 83: Hoare triple {60418#(< 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)); {60169#true} is VALID [2022-04-28 05:58:23,561 INFO L290 TraceCheckUtils]: 84: Hoare triple {60169#true} ~cond := #in~cond; {60169#true} is VALID [2022-04-28 05:58:23,561 INFO L290 TraceCheckUtils]: 85: Hoare triple {60169#true} assume !(0 == ~cond); {60169#true} is VALID [2022-04-28 05:58:23,561 INFO L290 TraceCheckUtils]: 86: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-28 05:58:23,562 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {60169#true} {60418#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} #96#return; {60418#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} is VALID [2022-04-28 05:58:23,562 INFO L290 TraceCheckUtils]: 88: Hoare triple {60418#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} assume !(~r~0 > 0); {60418#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} is VALID [2022-04-28 05:58:23,562 INFO L290 TraceCheckUtils]: 89: Hoare triple {60418#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {60418#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} is VALID [2022-04-28 05:58:23,563 INFO L290 TraceCheckUtils]: 90: Hoare triple {60418#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} assume !!(#t~post8 < 100);havoc #t~post8; {60418#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} is VALID [2022-04-28 05:58:23,563 INFO L272 TraceCheckUtils]: 91: Hoare triple {60418#(< 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)); {60169#true} is VALID [2022-04-28 05:58:23,563 INFO L290 TraceCheckUtils]: 92: Hoare triple {60169#true} ~cond := #in~cond; {60169#true} is VALID [2022-04-28 05:58:23,563 INFO L290 TraceCheckUtils]: 93: Hoare triple {60169#true} assume !(0 == ~cond); {60169#true} is VALID [2022-04-28 05:58:23,563 INFO L290 TraceCheckUtils]: 94: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-28 05:58:23,563 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {60169#true} {60418#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} #98#return; {60418#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} is VALID [2022-04-28 05:58:23,565 INFO L290 TraceCheckUtils]: 96: Hoare triple {60418#(< 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; {60467#(< 0 (div (+ (- 2) main_~r~0) 2))} is VALID [2022-04-28 05:58:23,565 INFO L290 TraceCheckUtils]: 97: Hoare triple {60467#(< 0 (div (+ (- 2) main_~r~0) 2))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {60467#(< 0 (div (+ (- 2) main_~r~0) 2))} is VALID [2022-04-28 05:58:23,565 INFO L290 TraceCheckUtils]: 98: Hoare triple {60467#(< 0 (div (+ (- 2) main_~r~0) 2))} assume !!(#t~post8 < 100);havoc #t~post8; {60467#(< 0 (div (+ (- 2) main_~r~0) 2))} is VALID [2022-04-28 05:58:23,565 INFO L272 TraceCheckUtils]: 99: Hoare triple {60467#(< 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)); {60169#true} is VALID [2022-04-28 05:58:23,565 INFO L290 TraceCheckUtils]: 100: Hoare triple {60169#true} ~cond := #in~cond; {60169#true} is VALID [2022-04-28 05:58:23,566 INFO L290 TraceCheckUtils]: 101: Hoare triple {60169#true} assume !(0 == ~cond); {60169#true} is VALID [2022-04-28 05:58:23,566 INFO L290 TraceCheckUtils]: 102: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-28 05:58:23,566 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {60169#true} {60467#(< 0 (div (+ (- 2) main_~r~0) 2))} #98#return; {60467#(< 0 (div (+ (- 2) main_~r~0) 2))} is VALID [2022-04-28 05:58:23,567 INFO L290 TraceCheckUtils]: 104: Hoare triple {60467#(< 0 (div (+ (- 2) main_~r~0) 2))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {60170#false} is VALID [2022-04-28 05:58:23,567 INFO L290 TraceCheckUtils]: 105: Hoare triple {60170#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {60170#false} is VALID [2022-04-28 05:58:23,567 INFO L290 TraceCheckUtils]: 106: Hoare triple {60170#false} assume !(#t~post8 < 100);havoc #t~post8; {60170#false} is VALID [2022-04-28 05:58:23,567 INFO L290 TraceCheckUtils]: 107: Hoare triple {60170#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {60170#false} is VALID [2022-04-28 05:58:23,567 INFO L290 TraceCheckUtils]: 108: Hoare triple {60170#false} assume !(#t~post6 < 100);havoc #t~post6; {60170#false} is VALID [2022-04-28 05:58:23,567 INFO L272 TraceCheckUtils]: 109: Hoare triple {60170#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)); {60170#false} is VALID [2022-04-28 05:58:23,567 INFO L290 TraceCheckUtils]: 110: Hoare triple {60170#false} ~cond := #in~cond; {60170#false} is VALID [2022-04-28 05:58:23,567 INFO L290 TraceCheckUtils]: 111: Hoare triple {60170#false} assume 0 == ~cond; {60170#false} is VALID [2022-04-28 05:58:23,567 INFO L290 TraceCheckUtils]: 112: Hoare triple {60170#false} assume !false; {60170#false} is VALID [2022-04-28 05:58:23,568 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 46 proven. 56 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-04-28 05:58:23,568 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:58:24,068 INFO L290 TraceCheckUtils]: 112: Hoare triple {60170#false} assume !false; {60170#false} is VALID [2022-04-28 05:58:24,068 INFO L290 TraceCheckUtils]: 111: Hoare triple {60170#false} assume 0 == ~cond; {60170#false} is VALID [2022-04-28 05:58:24,068 INFO L290 TraceCheckUtils]: 110: Hoare triple {60170#false} ~cond := #in~cond; {60170#false} is VALID [2022-04-28 05:58:24,068 INFO L272 TraceCheckUtils]: 109: Hoare triple {60170#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)); {60170#false} is VALID [2022-04-28 05:58:24,068 INFO L290 TraceCheckUtils]: 108: Hoare triple {60170#false} assume !(#t~post6 < 100);havoc #t~post6; {60170#false} is VALID [2022-04-28 05:58:24,068 INFO L290 TraceCheckUtils]: 107: Hoare triple {60170#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {60170#false} is VALID [2022-04-28 05:58:24,069 INFO L290 TraceCheckUtils]: 106: Hoare triple {60170#false} assume !(#t~post8 < 100);havoc #t~post8; {60170#false} is VALID [2022-04-28 05:58:24,069 INFO L290 TraceCheckUtils]: 105: Hoare triple {60170#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {60170#false} is VALID [2022-04-28 05:58:24,069 INFO L290 TraceCheckUtils]: 104: Hoare triple {60540#(not (< main_~r~0 0))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {60170#false} is VALID [2022-04-28 05:58:24,070 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {60169#true} {60540#(not (< main_~r~0 0))} #98#return; {60540#(not (< main_~r~0 0))} is VALID [2022-04-28 05:58:24,070 INFO L290 TraceCheckUtils]: 102: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-28 05:58:24,070 INFO L290 TraceCheckUtils]: 101: Hoare triple {60169#true} assume !(0 == ~cond); {60169#true} is VALID [2022-04-28 05:58:24,070 INFO L290 TraceCheckUtils]: 100: Hoare triple {60169#true} ~cond := #in~cond; {60169#true} is VALID [2022-04-28 05:58:24,070 INFO L272 TraceCheckUtils]: 99: Hoare triple {60540#(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)); {60169#true} is VALID [2022-04-28 05:58:24,070 INFO L290 TraceCheckUtils]: 98: Hoare triple {60540#(not (< main_~r~0 0))} assume !!(#t~post8 < 100);havoc #t~post8; {60540#(not (< main_~r~0 0))} is VALID [2022-04-28 05:58:24,071 INFO L290 TraceCheckUtils]: 97: Hoare triple {60540#(not (< main_~r~0 0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {60540#(not (< main_~r~0 0))} is VALID [2022-04-28 05:58:24,071 INFO L290 TraceCheckUtils]: 96: Hoare triple {60565#(<= 0 (+ main_~u~0 main_~r~0))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {60540#(not (< main_~r~0 0))} is VALID [2022-04-28 05:58:24,072 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {60169#true} {60565#(<= 0 (+ main_~u~0 main_~r~0))} #98#return; {60565#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-28 05:58:24,072 INFO L290 TraceCheckUtils]: 94: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-28 05:58:24,072 INFO L290 TraceCheckUtils]: 93: Hoare triple {60169#true} assume !(0 == ~cond); {60169#true} is VALID [2022-04-28 05:58:24,072 INFO L290 TraceCheckUtils]: 92: Hoare triple {60169#true} ~cond := #in~cond; {60169#true} is VALID [2022-04-28 05:58:24,072 INFO L272 TraceCheckUtils]: 91: Hoare triple {60565#(<= 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)); {60169#true} is VALID [2022-04-28 05:58:24,073 INFO L290 TraceCheckUtils]: 90: Hoare triple {60565#(<= 0 (+ main_~u~0 main_~r~0))} assume !!(#t~post8 < 100);havoc #t~post8; {60565#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-28 05:58:24,073 INFO L290 TraceCheckUtils]: 89: Hoare triple {60565#(<= 0 (+ main_~u~0 main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {60565#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-28 05:58:24,073 INFO L290 TraceCheckUtils]: 88: Hoare triple {60565#(<= 0 (+ main_~u~0 main_~r~0))} assume !(~r~0 > 0); {60565#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-28 05:58:24,074 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {60169#true} {60565#(<= 0 (+ main_~u~0 main_~r~0))} #96#return; {60565#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-28 05:58:24,074 INFO L290 TraceCheckUtils]: 86: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-28 05:58:24,074 INFO L290 TraceCheckUtils]: 85: Hoare triple {60169#true} assume !(0 == ~cond); {60169#true} is VALID [2022-04-28 05:58:24,074 INFO L290 TraceCheckUtils]: 84: Hoare triple {60169#true} ~cond := #in~cond; {60169#true} is VALID [2022-04-28 05:58:24,074 INFO L272 TraceCheckUtils]: 83: Hoare triple {60565#(<= 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)); {60169#true} is VALID [2022-04-28 05:58:24,074 INFO L290 TraceCheckUtils]: 82: Hoare triple {60565#(<= 0 (+ main_~u~0 main_~r~0))} assume !!(#t~post7 < 100);havoc #t~post7; {60565#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-28 05:58:24,075 INFO L290 TraceCheckUtils]: 81: Hoare triple {60565#(<= 0 (+ main_~u~0 main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {60565#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-28 05:58:24,076 INFO L290 TraceCheckUtils]: 80: Hoare triple {60614#(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; {60565#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-28 05:58:24,076 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {60169#true} {60614#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} #96#return; {60614#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} is VALID [2022-04-28 05:58:24,076 INFO L290 TraceCheckUtils]: 78: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-28 05:58:24,076 INFO L290 TraceCheckUtils]: 77: Hoare triple {60169#true} assume !(0 == ~cond); {60169#true} is VALID [2022-04-28 05:58:24,076 INFO L290 TraceCheckUtils]: 76: Hoare triple {60169#true} ~cond := #in~cond; {60169#true} is VALID [2022-04-28 05:58:24,076 INFO L272 TraceCheckUtils]: 75: Hoare triple {60614#(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)); {60169#true} is VALID [2022-04-28 05:58:24,077 INFO L290 TraceCheckUtils]: 74: Hoare triple {60614#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} assume !!(#t~post7 < 100);havoc #t~post7; {60614#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} is VALID [2022-04-28 05:58:24,077 INFO L290 TraceCheckUtils]: 73: Hoare triple {60614#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {60614#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} is VALID [2022-04-28 05:58:24,079 INFO L290 TraceCheckUtils]: 72: Hoare triple {60639#(<= main_~r~0 main_~u~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {60614#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} is VALID [2022-04-28 05:58:24,079 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {60169#true} {60639#(<= main_~r~0 main_~u~0)} #96#return; {60639#(<= main_~r~0 main_~u~0)} is VALID [2022-04-28 05:58:24,079 INFO L290 TraceCheckUtils]: 70: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-28 05:58:24,079 INFO L290 TraceCheckUtils]: 69: Hoare triple {60169#true} assume !(0 == ~cond); {60169#true} is VALID [2022-04-28 05:58:24,079 INFO L290 TraceCheckUtils]: 68: Hoare triple {60169#true} ~cond := #in~cond; {60169#true} is VALID [2022-04-28 05:58:24,080 INFO L272 TraceCheckUtils]: 67: Hoare triple {60639#(<= 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)); {60169#true} is VALID [2022-04-28 05:58:24,086 INFO L290 TraceCheckUtils]: 66: Hoare triple {60639#(<= main_~r~0 main_~u~0)} assume !!(#t~post7 < 100);havoc #t~post7; {60639#(<= main_~r~0 main_~u~0)} is VALID [2022-04-28 05:58:24,087 INFO L290 TraceCheckUtils]: 65: Hoare triple {60639#(<= main_~r~0 main_~u~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {60639#(<= main_~r~0 main_~u~0)} is VALID [2022-04-28 05:58:24,088 INFO L290 TraceCheckUtils]: 64: Hoare triple {60664#(<= main_~r~0 (+ main_~v~0 main_~u~0))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {60639#(<= main_~r~0 main_~u~0)} is VALID [2022-04-28 05:58:24,089 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {60169#true} {60664#(<= main_~r~0 (+ main_~v~0 main_~u~0))} #96#return; {60664#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-28 05:58:24,089 INFO L290 TraceCheckUtils]: 62: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-28 05:58:24,089 INFO L290 TraceCheckUtils]: 61: Hoare triple {60169#true} assume !(0 == ~cond); {60169#true} is VALID [2022-04-28 05:58:24,089 INFO L290 TraceCheckUtils]: 60: Hoare triple {60169#true} ~cond := #in~cond; {60169#true} is VALID [2022-04-28 05:58:24,090 INFO L272 TraceCheckUtils]: 59: Hoare triple {60664#(<= 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)); {60169#true} is VALID [2022-04-28 05:58:24,090 INFO L290 TraceCheckUtils]: 58: Hoare triple {60664#(<= main_~r~0 (+ main_~v~0 main_~u~0))} assume !!(#t~post7 < 100);havoc #t~post7; {60664#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-28 05:58:24,090 INFO L290 TraceCheckUtils]: 57: Hoare triple {60664#(<= main_~r~0 (+ main_~v~0 main_~u~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {60664#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-28 05:58:24,091 INFO L290 TraceCheckUtils]: 56: Hoare triple {60664#(<= main_~r~0 (+ main_~v~0 main_~u~0))} assume !!(0 != ~r~0); {60664#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-28 05:58:24,091 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {60169#true} {60664#(<= main_~r~0 (+ main_~v~0 main_~u~0))} #94#return; {60664#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-28 05:58:24,091 INFO L290 TraceCheckUtils]: 54: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-28 05:58:24,091 INFO L290 TraceCheckUtils]: 53: Hoare triple {60169#true} assume !(0 == ~cond); {60169#true} is VALID [2022-04-28 05:58:24,092 INFO L290 TraceCheckUtils]: 52: Hoare triple {60169#true} ~cond := #in~cond; {60169#true} is VALID [2022-04-28 05:58:24,092 INFO L272 TraceCheckUtils]: 51: Hoare triple {60664#(<= 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)); {60169#true} is VALID [2022-04-28 05:58:24,092 INFO L290 TraceCheckUtils]: 50: Hoare triple {60664#(<= main_~r~0 (+ main_~v~0 main_~u~0))} assume !!(#t~post6 < 100);havoc #t~post6; {60664#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-28 05:58:24,092 INFO L290 TraceCheckUtils]: 49: Hoare triple {60664#(<= main_~r~0 (+ main_~v~0 main_~u~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {60664#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-28 05:58:24,093 INFO L290 TraceCheckUtils]: 48: Hoare triple {60664#(<= main_~r~0 (+ main_~v~0 main_~u~0))} assume !(~r~0 < 0); {60664#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-28 05:58:24,093 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {60169#true} {60664#(<= main_~r~0 (+ main_~v~0 main_~u~0))} #98#return; {60664#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-28 05:58:24,093 INFO L290 TraceCheckUtils]: 46: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-28 05:58:24,093 INFO L290 TraceCheckUtils]: 45: Hoare triple {60169#true} assume !(0 == ~cond); {60169#true} is VALID [2022-04-28 05:58:24,094 INFO L290 TraceCheckUtils]: 44: Hoare triple {60169#true} ~cond := #in~cond; {60169#true} is VALID [2022-04-28 05:58:24,094 INFO L272 TraceCheckUtils]: 43: Hoare triple {60664#(<= 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)); {60169#true} is VALID [2022-04-28 05:58:24,094 INFO L290 TraceCheckUtils]: 42: Hoare triple {60664#(<= main_~r~0 (+ main_~v~0 main_~u~0))} assume !!(#t~post8 < 100);havoc #t~post8; {60664#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-28 05:58:24,094 INFO L290 TraceCheckUtils]: 41: Hoare triple {60664#(<= main_~r~0 (+ main_~v~0 main_~u~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {60664#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-28 05:58:24,095 INFO L290 TraceCheckUtils]: 40: Hoare triple {60737#(<= 0 (+ main_~v~0 3))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {60664#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-28 05:58:24,096 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {60169#true} {60737#(<= 0 (+ main_~v~0 3))} #98#return; {60737#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-28 05:58:24,096 INFO L290 TraceCheckUtils]: 38: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-28 05:58:24,096 INFO L290 TraceCheckUtils]: 37: Hoare triple {60169#true} assume !(0 == ~cond); {60169#true} is VALID [2022-04-28 05:58:24,096 INFO L290 TraceCheckUtils]: 36: Hoare triple {60169#true} ~cond := #in~cond; {60169#true} is VALID [2022-04-28 05:58:24,096 INFO L272 TraceCheckUtils]: 35: Hoare triple {60737#(<= 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)); {60169#true} is VALID [2022-04-28 05:58:24,096 INFO L290 TraceCheckUtils]: 34: Hoare triple {60737#(<= 0 (+ main_~v~0 3))} assume !!(#t~post8 < 100);havoc #t~post8; {60737#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-28 05:58:24,097 INFO L290 TraceCheckUtils]: 33: Hoare triple {60737#(<= 0 (+ main_~v~0 3))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {60737#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-28 05:58:24,097 INFO L290 TraceCheckUtils]: 32: Hoare triple {60737#(<= 0 (+ main_~v~0 3))} assume !(~r~0 > 0); {60737#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-28 05:58:24,098 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {60169#true} {60737#(<= 0 (+ main_~v~0 3))} #96#return; {60737#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-28 05:58:24,098 INFO L290 TraceCheckUtils]: 30: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-28 05:58:24,098 INFO L290 TraceCheckUtils]: 29: Hoare triple {60169#true} assume !(0 == ~cond); {60169#true} is VALID [2022-04-28 05:58:24,098 INFO L290 TraceCheckUtils]: 28: Hoare triple {60169#true} ~cond := #in~cond; {60169#true} is VALID [2022-04-28 05:58:24,098 INFO L272 TraceCheckUtils]: 27: Hoare triple {60737#(<= 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)); {60169#true} is VALID [2022-04-28 05:58:24,098 INFO L290 TraceCheckUtils]: 26: Hoare triple {60737#(<= 0 (+ main_~v~0 3))} assume !!(#t~post7 < 100);havoc #t~post7; {60737#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-28 05:58:24,099 INFO L290 TraceCheckUtils]: 25: Hoare triple {60737#(<= 0 (+ main_~v~0 3))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {60737#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-28 05:58:24,099 INFO L290 TraceCheckUtils]: 24: Hoare triple {60737#(<= 0 (+ main_~v~0 3))} assume !!(0 != ~r~0); {60737#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-28 05:58:24,099 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {60169#true} {60737#(<= 0 (+ main_~v~0 3))} #94#return; {60737#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-28 05:58:24,099 INFO L290 TraceCheckUtils]: 22: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-28 05:58:24,100 INFO L290 TraceCheckUtils]: 21: Hoare triple {60169#true} assume !(0 == ~cond); {60169#true} is VALID [2022-04-28 05:58:24,100 INFO L290 TraceCheckUtils]: 20: Hoare triple {60169#true} ~cond := #in~cond; {60169#true} is VALID [2022-04-28 05:58:24,100 INFO L272 TraceCheckUtils]: 19: Hoare triple {60737#(<= 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)); {60169#true} is VALID [2022-04-28 05:58:24,100 INFO L290 TraceCheckUtils]: 18: Hoare triple {60737#(<= 0 (+ main_~v~0 3))} assume !!(#t~post6 < 100);havoc #t~post6; {60737#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-28 05:58:24,100 INFO L290 TraceCheckUtils]: 17: Hoare triple {60737#(<= 0 (+ main_~v~0 3))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {60737#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-28 05:58:24,101 INFO L290 TraceCheckUtils]: 16: Hoare triple {60169#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {60737#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-28 05:58:24,101 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {60169#true} {60169#true} #92#return; {60169#true} is VALID [2022-04-28 05:58:24,101 INFO L290 TraceCheckUtils]: 14: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-28 05:58:24,101 INFO L290 TraceCheckUtils]: 13: Hoare triple {60169#true} assume !(0 == ~cond); {60169#true} is VALID [2022-04-28 05:58:24,101 INFO L290 TraceCheckUtils]: 12: Hoare triple {60169#true} ~cond := #in~cond; {60169#true} is VALID [2022-04-28 05:58:24,101 INFO L272 TraceCheckUtils]: 11: Hoare triple {60169#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)); {60169#true} is VALID [2022-04-28 05:58:24,101 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {60169#true} {60169#true} #90#return; {60169#true} is VALID [2022-04-28 05:58:24,101 INFO L290 TraceCheckUtils]: 9: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-28 05:58:24,101 INFO L290 TraceCheckUtils]: 8: Hoare triple {60169#true} assume !(0 == ~cond); {60169#true} is VALID [2022-04-28 05:58:24,101 INFO L290 TraceCheckUtils]: 7: Hoare triple {60169#true} ~cond := #in~cond; {60169#true} is VALID [2022-04-28 05:58:24,101 INFO L272 TraceCheckUtils]: 6: Hoare triple {60169#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {60169#true} is VALID [2022-04-28 05:58:24,102 INFO L290 TraceCheckUtils]: 5: Hoare triple {60169#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; {60169#true} is VALID [2022-04-28 05:58:24,102 INFO L272 TraceCheckUtils]: 4: Hoare triple {60169#true} call #t~ret9 := main(); {60169#true} is VALID [2022-04-28 05:58:24,102 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60169#true} {60169#true} #102#return; {60169#true} is VALID [2022-04-28 05:58:24,102 INFO L290 TraceCheckUtils]: 2: Hoare triple {60169#true} assume true; {60169#true} is VALID [2022-04-28 05:58:24,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {60169#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; {60169#true} is VALID [2022-04-28 05:58:24,102 INFO L272 TraceCheckUtils]: 0: Hoare triple {60169#true} call ULTIMATE.init(); {60169#true} is VALID [2022-04-28 05:58:24,102 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 34 proven. 68 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-04-28 05:58:24,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:58:24,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547622690] [2022-04-28 05:58:24,103 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:58:24,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938295684] [2022-04-28 05:58:24,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [938295684] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:58:24,103 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:58:24,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-28 05:58:24,103 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:58:24,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [863765837] [2022-04-28 05:58:24,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [863765837] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:58:24,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:58:24,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 05:58:24,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345986680] [2022-04-28 05:58:24,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:58:24,104 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 8 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) Word has length 113 [2022-04-28 05:58:24,104 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:58:24,104 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 8 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-28 05:58:24,180 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:58:24,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 05:58:24,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:58:24,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 05:58:24,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-04-28 05:58:24,181 INFO L87 Difference]: Start difference. First operand 560 states and 768 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 8 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-28 05:58:27,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:27,204 INFO L93 Difference]: Finished difference Result 862 states and 1224 transitions. [2022-04-28 05:58:27,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 05:58:27,204 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 8 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) Word has length 113 [2022-04-28 05:58:27,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:58:27,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 8 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-28 05:58:27,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 190 transitions. [2022-04-28 05:58:27,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 8 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-28 05:58:27,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 190 transitions. [2022-04-28 05:58:27,208 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 190 transitions. [2022-04-28 05:58:27,382 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 190 edges. 190 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:58:27,402 INFO L225 Difference]: With dead ends: 862 [2022-04-28 05:58:27,402 INFO L226 Difference]: Without dead ends: 711 [2022-04-28 05:58:27,402 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2022-04-28 05:58:27,403 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 83 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 05:58:27,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 328 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 05:58:27,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2022-04-28 05:58:28,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 560. [2022-04-28 05:58:28,930 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:58:28,930 INFO L82 GeneralOperation]: Start isEquivalent. First operand 711 states. Second operand has 560 states, 418 states have (on average 1.2344497607655502) internal successors, (516), 428 states have internal predecessors, (516), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-28 05:58:28,931 INFO L74 IsIncluded]: Start isIncluded. First operand 711 states. Second operand has 560 states, 418 states have (on average 1.2344497607655502) internal successors, (516), 428 states have internal predecessors, (516), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-28 05:58:28,931 INFO L87 Difference]: Start difference. First operand 711 states. Second operand has 560 states, 418 states have (on average 1.2344497607655502) internal successors, (516), 428 states have internal predecessors, (516), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-28 05:58:28,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:28,961 INFO L93 Difference]: Finished difference Result 711 states and 989 transitions. [2022-04-28 05:58:28,962 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 989 transitions. [2022-04-28 05:58:28,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:58:28,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:58:28,963 INFO L74 IsIncluded]: Start isIncluded. First operand has 560 states, 418 states have (on average 1.2344497607655502) internal successors, (516), 428 states have internal predecessors, (516), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) Second operand 711 states. [2022-04-28 05:58:28,964 INFO L87 Difference]: Start difference. First operand has 560 states, 418 states have (on average 1.2344497607655502) internal successors, (516), 428 states have internal predecessors, (516), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) Second operand 711 states. [2022-04-28 05:58:28,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:28,993 INFO L93 Difference]: Finished difference Result 711 states and 989 transitions. [2022-04-28 05:58:28,993 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 989 transitions. [2022-04-28 05:58:28,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:58:28,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:58:28,994 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:58:28,994 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:58:28,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 418 states have (on average 1.2344497607655502) internal successors, (516), 428 states have internal predecessors, (516), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-28 05:58:29,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 768 transitions. [2022-04-28 05:58:29,018 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 768 transitions. Word has length 113 [2022-04-28 05:58:29,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:58:29,018 INFO L495 AbstractCegarLoop]: Abstraction has 560 states and 768 transitions. [2022-04-28 05:58:29,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 8 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-28 05:58:29,018 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 560 states and 768 transitions. [2022-04-28 05:58:32,028 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 768 edges. 768 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:58:32,028 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 768 transitions. [2022-04-28 05:58:32,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-04-28 05:58:32,029 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:58:32,029 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:58:32,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-04-28 05:58:32,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:58:32,230 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:58:32,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:58:32,230 INFO L85 PathProgramCache]: Analyzing trace with hash -144297019, now seen corresponding path program 15 times [2022-04-28 05:58:32,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:58:32,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [37406190] [2022-04-28 05:58:32,231 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:58:32,231 INFO L85 PathProgramCache]: Analyzing trace with hash -144297019, now seen corresponding path program 16 times [2022-04-28 05:58:32,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:58:32,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499842240] [2022-04-28 05:58:32,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:58:32,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:58:32,254 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:58:32,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [510563821] [2022-04-28 05:58:32,254 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 05:58:32,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:58:32,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:58:32,256 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:58:32,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-04-28 05:58:32,739 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 05:58:32,739 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:58:32,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 05:58:32,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:58:32,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:58:33,382 INFO L272 TraceCheckUtils]: 0: Hoare triple {65136#true} call ULTIMATE.init(); {65136#true} is VALID [2022-04-28 05:58:33,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {65136#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; {65144#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:33,383 INFO L290 TraceCheckUtils]: 2: Hoare triple {65144#(<= ~counter~0 0)} assume true; {65144#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:33,384 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65144#(<= ~counter~0 0)} {65136#true} #102#return; {65144#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:33,384 INFO L272 TraceCheckUtils]: 4: Hoare triple {65144#(<= ~counter~0 0)} call #t~ret9 := main(); {65144#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:33,384 INFO L290 TraceCheckUtils]: 5: Hoare triple {65144#(<= ~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; {65144#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:33,385 INFO L272 TraceCheckUtils]: 6: Hoare triple {65144#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {65144#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:33,385 INFO L290 TraceCheckUtils]: 7: Hoare triple {65144#(<= ~counter~0 0)} ~cond := #in~cond; {65144#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:33,385 INFO L290 TraceCheckUtils]: 8: Hoare triple {65144#(<= ~counter~0 0)} assume !(0 == ~cond); {65144#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:33,386 INFO L290 TraceCheckUtils]: 9: Hoare triple {65144#(<= ~counter~0 0)} assume true; {65144#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:33,386 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {65144#(<= ~counter~0 0)} {65144#(<= ~counter~0 0)} #90#return; {65144#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:33,387 INFO L272 TraceCheckUtils]: 11: Hoare triple {65144#(<= ~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)); {65144#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:33,387 INFO L290 TraceCheckUtils]: 12: Hoare triple {65144#(<= ~counter~0 0)} ~cond := #in~cond; {65144#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:33,387 INFO L290 TraceCheckUtils]: 13: Hoare triple {65144#(<= ~counter~0 0)} assume !(0 == ~cond); {65144#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:33,387 INFO L290 TraceCheckUtils]: 14: Hoare triple {65144#(<= ~counter~0 0)} assume true; {65144#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:33,388 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {65144#(<= ~counter~0 0)} {65144#(<= ~counter~0 0)} #92#return; {65144#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:33,388 INFO L290 TraceCheckUtils]: 16: Hoare triple {65144#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {65144#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:33,390 INFO L290 TraceCheckUtils]: 17: Hoare triple {65144#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {65193#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:33,390 INFO L290 TraceCheckUtils]: 18: Hoare triple {65193#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {65193#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:33,391 INFO L272 TraceCheckUtils]: 19: Hoare triple {65193#(<= ~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)); {65193#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:33,391 INFO L290 TraceCheckUtils]: 20: Hoare triple {65193#(<= ~counter~0 1)} ~cond := #in~cond; {65193#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:33,391 INFO L290 TraceCheckUtils]: 21: Hoare triple {65193#(<= ~counter~0 1)} assume !(0 == ~cond); {65193#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:33,392 INFO L290 TraceCheckUtils]: 22: Hoare triple {65193#(<= ~counter~0 1)} assume true; {65193#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:33,392 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {65193#(<= ~counter~0 1)} {65193#(<= ~counter~0 1)} #94#return; {65193#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:33,392 INFO L290 TraceCheckUtils]: 24: Hoare triple {65193#(<= ~counter~0 1)} assume !!(0 != ~r~0); {65193#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:33,393 INFO L290 TraceCheckUtils]: 25: Hoare triple {65193#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65218#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:33,394 INFO L290 TraceCheckUtils]: 26: Hoare triple {65218#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {65218#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:33,394 INFO L272 TraceCheckUtils]: 27: Hoare triple {65218#(<= ~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)); {65218#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:33,394 INFO L290 TraceCheckUtils]: 28: Hoare triple {65218#(<= ~counter~0 2)} ~cond := #in~cond; {65218#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:33,395 INFO L290 TraceCheckUtils]: 29: Hoare triple {65218#(<= ~counter~0 2)} assume !(0 == ~cond); {65218#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:33,395 INFO L290 TraceCheckUtils]: 30: Hoare triple {65218#(<= ~counter~0 2)} assume true; {65218#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:33,396 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {65218#(<= ~counter~0 2)} {65218#(<= ~counter~0 2)} #96#return; {65218#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:33,396 INFO L290 TraceCheckUtils]: 32: Hoare triple {65218#(<= ~counter~0 2)} assume !(~r~0 > 0); {65218#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:33,397 INFO L290 TraceCheckUtils]: 33: Hoare triple {65218#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {65243#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:33,397 INFO L290 TraceCheckUtils]: 34: Hoare triple {65243#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {65243#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:33,398 INFO L272 TraceCheckUtils]: 35: Hoare triple {65243#(<= ~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)); {65243#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:33,398 INFO L290 TraceCheckUtils]: 36: Hoare triple {65243#(<= ~counter~0 3)} ~cond := #in~cond; {65243#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:33,398 INFO L290 TraceCheckUtils]: 37: Hoare triple {65243#(<= ~counter~0 3)} assume !(0 == ~cond); {65243#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:33,398 INFO L290 TraceCheckUtils]: 38: Hoare triple {65243#(<= ~counter~0 3)} assume true; {65243#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:33,399 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {65243#(<= ~counter~0 3)} {65243#(<= ~counter~0 3)} #98#return; {65243#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:33,399 INFO L290 TraceCheckUtils]: 40: Hoare triple {65243#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {65243#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:33,400 INFO L290 TraceCheckUtils]: 41: Hoare triple {65243#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {65268#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:33,400 INFO L290 TraceCheckUtils]: 42: Hoare triple {65268#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {65268#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:33,401 INFO L272 TraceCheckUtils]: 43: Hoare triple {65268#(<= ~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)); {65268#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:33,401 INFO L290 TraceCheckUtils]: 44: Hoare triple {65268#(<= ~counter~0 4)} ~cond := #in~cond; {65268#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:33,402 INFO L290 TraceCheckUtils]: 45: Hoare triple {65268#(<= ~counter~0 4)} assume !(0 == ~cond); {65268#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:33,402 INFO L290 TraceCheckUtils]: 46: Hoare triple {65268#(<= ~counter~0 4)} assume true; {65268#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:33,402 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {65268#(<= ~counter~0 4)} {65268#(<= ~counter~0 4)} #98#return; {65268#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:33,403 INFO L290 TraceCheckUtils]: 48: Hoare triple {65268#(<= ~counter~0 4)} assume !(~r~0 < 0); {65268#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:33,404 INFO L290 TraceCheckUtils]: 49: Hoare triple {65268#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {65293#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:33,404 INFO L290 TraceCheckUtils]: 50: Hoare triple {65293#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {65293#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:33,404 INFO L272 TraceCheckUtils]: 51: Hoare triple {65293#(<= ~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)); {65293#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:33,405 INFO L290 TraceCheckUtils]: 52: Hoare triple {65293#(<= ~counter~0 5)} ~cond := #in~cond; {65293#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:33,405 INFO L290 TraceCheckUtils]: 53: Hoare triple {65293#(<= ~counter~0 5)} assume !(0 == ~cond); {65293#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:33,405 INFO L290 TraceCheckUtils]: 54: Hoare triple {65293#(<= ~counter~0 5)} assume true; {65293#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:33,406 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {65293#(<= ~counter~0 5)} {65293#(<= ~counter~0 5)} #94#return; {65293#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:33,406 INFO L290 TraceCheckUtils]: 56: Hoare triple {65293#(<= ~counter~0 5)} assume !!(0 != ~r~0); {65293#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:33,407 INFO L290 TraceCheckUtils]: 57: Hoare triple {65293#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65318#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:33,407 INFO L290 TraceCheckUtils]: 58: Hoare triple {65318#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {65318#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:33,408 INFO L272 TraceCheckUtils]: 59: Hoare triple {65318#(<= ~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)); {65318#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:33,408 INFO L290 TraceCheckUtils]: 60: Hoare triple {65318#(<= ~counter~0 6)} ~cond := #in~cond; {65318#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:33,408 INFO L290 TraceCheckUtils]: 61: Hoare triple {65318#(<= ~counter~0 6)} assume !(0 == ~cond); {65318#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:33,409 INFO L290 TraceCheckUtils]: 62: Hoare triple {65318#(<= ~counter~0 6)} assume true; {65318#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:33,409 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {65318#(<= ~counter~0 6)} {65318#(<= ~counter~0 6)} #96#return; {65318#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:33,410 INFO L290 TraceCheckUtils]: 64: Hoare triple {65318#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {65318#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:33,410 INFO L290 TraceCheckUtils]: 65: Hoare triple {65318#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65343#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:33,411 INFO L290 TraceCheckUtils]: 66: Hoare triple {65343#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {65343#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:33,411 INFO L272 TraceCheckUtils]: 67: Hoare triple {65343#(<= ~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)); {65343#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:33,412 INFO L290 TraceCheckUtils]: 68: Hoare triple {65343#(<= ~counter~0 7)} ~cond := #in~cond; {65343#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:33,412 INFO L290 TraceCheckUtils]: 69: Hoare triple {65343#(<= ~counter~0 7)} assume !(0 == ~cond); {65343#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:33,412 INFO L290 TraceCheckUtils]: 70: Hoare triple {65343#(<= ~counter~0 7)} assume true; {65343#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:33,413 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {65343#(<= ~counter~0 7)} {65343#(<= ~counter~0 7)} #96#return; {65343#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:33,413 INFO L290 TraceCheckUtils]: 72: Hoare triple {65343#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {65343#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:33,414 INFO L290 TraceCheckUtils]: 73: Hoare triple {65343#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65368#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:33,414 INFO L290 TraceCheckUtils]: 74: Hoare triple {65368#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {65368#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:33,415 INFO L272 TraceCheckUtils]: 75: Hoare triple {65368#(<= ~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)); {65368#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:33,415 INFO L290 TraceCheckUtils]: 76: Hoare triple {65368#(<= ~counter~0 8)} ~cond := #in~cond; {65368#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:33,415 INFO L290 TraceCheckUtils]: 77: Hoare triple {65368#(<= ~counter~0 8)} assume !(0 == ~cond); {65368#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:33,416 INFO L290 TraceCheckUtils]: 78: Hoare triple {65368#(<= ~counter~0 8)} assume true; {65368#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:33,416 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {65368#(<= ~counter~0 8)} {65368#(<= ~counter~0 8)} #96#return; {65368#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:33,416 INFO L290 TraceCheckUtils]: 80: Hoare triple {65368#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {65368#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:33,417 INFO L290 TraceCheckUtils]: 81: Hoare triple {65368#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65393#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:33,417 INFO L290 TraceCheckUtils]: 82: Hoare triple {65393#(<= ~counter~0 9)} assume !!(#t~post7 < 100);havoc #t~post7; {65393#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:33,418 INFO L272 TraceCheckUtils]: 83: Hoare triple {65393#(<= ~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)); {65393#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:33,418 INFO L290 TraceCheckUtils]: 84: Hoare triple {65393#(<= ~counter~0 9)} ~cond := #in~cond; {65393#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:33,419 INFO L290 TraceCheckUtils]: 85: Hoare triple {65393#(<= ~counter~0 9)} assume !(0 == ~cond); {65393#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:33,419 INFO L290 TraceCheckUtils]: 86: Hoare triple {65393#(<= ~counter~0 9)} assume true; {65393#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:33,419 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {65393#(<= ~counter~0 9)} {65393#(<= ~counter~0 9)} #96#return; {65393#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:33,420 INFO L290 TraceCheckUtils]: 88: Hoare triple {65393#(<= ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {65393#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:33,421 INFO L290 TraceCheckUtils]: 89: Hoare triple {65393#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65418#(<= ~counter~0 10)} is VALID [2022-04-28 05:58:33,421 INFO L290 TraceCheckUtils]: 90: Hoare triple {65418#(<= ~counter~0 10)} assume !!(#t~post7 < 100);havoc #t~post7; {65418#(<= ~counter~0 10)} is VALID [2022-04-28 05:58:33,421 INFO L272 TraceCheckUtils]: 91: Hoare triple {65418#(<= ~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)); {65418#(<= ~counter~0 10)} is VALID [2022-04-28 05:58:33,422 INFO L290 TraceCheckUtils]: 92: Hoare triple {65418#(<= ~counter~0 10)} ~cond := #in~cond; {65418#(<= ~counter~0 10)} is VALID [2022-04-28 05:58:33,422 INFO L290 TraceCheckUtils]: 93: Hoare triple {65418#(<= ~counter~0 10)} assume !(0 == ~cond); {65418#(<= ~counter~0 10)} is VALID [2022-04-28 05:58:33,422 INFO L290 TraceCheckUtils]: 94: Hoare triple {65418#(<= ~counter~0 10)} assume true; {65418#(<= ~counter~0 10)} is VALID [2022-04-28 05:58:33,423 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {65418#(<= ~counter~0 10)} {65418#(<= ~counter~0 10)} #96#return; {65418#(<= ~counter~0 10)} is VALID [2022-04-28 05:58:33,423 INFO L290 TraceCheckUtils]: 96: Hoare triple {65418#(<= ~counter~0 10)} assume !(~r~0 > 0); {65418#(<= ~counter~0 10)} is VALID [2022-04-28 05:58:33,424 INFO L290 TraceCheckUtils]: 97: Hoare triple {65418#(<= ~counter~0 10)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {65443#(<= ~counter~0 11)} is VALID [2022-04-28 05:58:33,424 INFO L290 TraceCheckUtils]: 98: Hoare triple {65443#(<= ~counter~0 11)} assume !!(#t~post8 < 100);havoc #t~post8; {65443#(<= ~counter~0 11)} is VALID [2022-04-28 05:58:33,425 INFO L272 TraceCheckUtils]: 99: Hoare triple {65443#(<= ~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)); {65443#(<= ~counter~0 11)} is VALID [2022-04-28 05:58:33,425 INFO L290 TraceCheckUtils]: 100: Hoare triple {65443#(<= ~counter~0 11)} ~cond := #in~cond; {65443#(<= ~counter~0 11)} is VALID [2022-04-28 05:58:33,425 INFO L290 TraceCheckUtils]: 101: Hoare triple {65443#(<= ~counter~0 11)} assume !(0 == ~cond); {65443#(<= ~counter~0 11)} is VALID [2022-04-28 05:58:33,426 INFO L290 TraceCheckUtils]: 102: Hoare triple {65443#(<= ~counter~0 11)} assume true; {65443#(<= ~counter~0 11)} is VALID [2022-04-28 05:58:33,426 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {65443#(<= ~counter~0 11)} {65443#(<= ~counter~0 11)} #98#return; {65443#(<= ~counter~0 11)} is VALID [2022-04-28 05:58:33,427 INFO L290 TraceCheckUtils]: 104: Hoare triple {65443#(<= ~counter~0 11)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {65443#(<= ~counter~0 11)} is VALID [2022-04-28 05:58:33,427 INFO L290 TraceCheckUtils]: 105: Hoare triple {65443#(<= ~counter~0 11)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {65468#(<= |main_#t~post8| 11)} is VALID [2022-04-28 05:58:33,427 INFO L290 TraceCheckUtils]: 106: Hoare triple {65468#(<= |main_#t~post8| 11)} assume !(#t~post8 < 100);havoc #t~post8; {65137#false} is VALID [2022-04-28 05:58:33,427 INFO L290 TraceCheckUtils]: 107: Hoare triple {65137#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {65137#false} is VALID [2022-04-28 05:58:33,428 INFO L290 TraceCheckUtils]: 108: Hoare triple {65137#false} assume !(#t~post6 < 100);havoc #t~post6; {65137#false} is VALID [2022-04-28 05:58:33,428 INFO L272 TraceCheckUtils]: 109: Hoare triple {65137#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)); {65137#false} is VALID [2022-04-28 05:58:33,428 INFO L290 TraceCheckUtils]: 110: Hoare triple {65137#false} ~cond := #in~cond; {65137#false} is VALID [2022-04-28 05:58:33,428 INFO L290 TraceCheckUtils]: 111: Hoare triple {65137#false} assume 0 == ~cond; {65137#false} is VALID [2022-04-28 05:58:33,428 INFO L290 TraceCheckUtils]: 112: Hoare triple {65137#false} assume !false; {65137#false} is VALID [2022-04-28 05:58:33,428 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 26 proven. 302 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:58:33,428 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:58:34,112 INFO L290 TraceCheckUtils]: 112: Hoare triple {65137#false} assume !false; {65137#false} is VALID [2022-04-28 05:58:34,113 INFO L290 TraceCheckUtils]: 111: Hoare triple {65137#false} assume 0 == ~cond; {65137#false} is VALID [2022-04-28 05:58:34,113 INFO L290 TraceCheckUtils]: 110: Hoare triple {65137#false} ~cond := #in~cond; {65137#false} is VALID [2022-04-28 05:58:34,113 INFO L272 TraceCheckUtils]: 109: Hoare triple {65137#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)); {65137#false} is VALID [2022-04-28 05:58:34,113 INFO L290 TraceCheckUtils]: 108: Hoare triple {65137#false} assume !(#t~post6 < 100);havoc #t~post6; {65137#false} is VALID [2022-04-28 05:58:34,113 INFO L290 TraceCheckUtils]: 107: Hoare triple {65137#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {65137#false} is VALID [2022-04-28 05:58:34,113 INFO L290 TraceCheckUtils]: 106: Hoare triple {65508#(< |main_#t~post8| 100)} assume !(#t~post8 < 100);havoc #t~post8; {65137#false} is VALID [2022-04-28 05:58:34,114 INFO L290 TraceCheckUtils]: 105: Hoare triple {65512#(< ~counter~0 100)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {65508#(< |main_#t~post8| 100)} is VALID [2022-04-28 05:58:34,114 INFO L290 TraceCheckUtils]: 104: Hoare triple {65512#(< ~counter~0 100)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {65512#(< ~counter~0 100)} is VALID [2022-04-28 05:58:34,115 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {65136#true} {65512#(< ~counter~0 100)} #98#return; {65512#(< ~counter~0 100)} is VALID [2022-04-28 05:58:34,115 INFO L290 TraceCheckUtils]: 102: Hoare triple {65136#true} assume true; {65136#true} is VALID [2022-04-28 05:58:34,115 INFO L290 TraceCheckUtils]: 101: Hoare triple {65136#true} assume !(0 == ~cond); {65136#true} is VALID [2022-04-28 05:58:34,115 INFO L290 TraceCheckUtils]: 100: Hoare triple {65136#true} ~cond := #in~cond; {65136#true} is VALID [2022-04-28 05:58:34,115 INFO L272 TraceCheckUtils]: 99: Hoare triple {65512#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65136#true} is VALID [2022-04-28 05:58:34,115 INFO L290 TraceCheckUtils]: 98: Hoare triple {65512#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {65512#(< ~counter~0 100)} is VALID [2022-04-28 05:58:34,117 INFO L290 TraceCheckUtils]: 97: Hoare triple {65537#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {65512#(< ~counter~0 100)} is VALID [2022-04-28 05:58:34,117 INFO L290 TraceCheckUtils]: 96: Hoare triple {65537#(< ~counter~0 99)} assume !(~r~0 > 0); {65537#(< ~counter~0 99)} is VALID [2022-04-28 05:58:34,118 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {65136#true} {65537#(< ~counter~0 99)} #96#return; {65537#(< ~counter~0 99)} is VALID [2022-04-28 05:58:34,118 INFO L290 TraceCheckUtils]: 94: Hoare triple {65136#true} assume true; {65136#true} is VALID [2022-04-28 05:58:34,118 INFO L290 TraceCheckUtils]: 93: Hoare triple {65136#true} assume !(0 == ~cond); {65136#true} is VALID [2022-04-28 05:58:34,118 INFO L290 TraceCheckUtils]: 92: Hoare triple {65136#true} ~cond := #in~cond; {65136#true} is VALID [2022-04-28 05:58:34,118 INFO L272 TraceCheckUtils]: 91: Hoare triple {65537#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65136#true} is VALID [2022-04-28 05:58:34,118 INFO L290 TraceCheckUtils]: 90: Hoare triple {65537#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {65537#(< ~counter~0 99)} is VALID [2022-04-28 05:58:34,119 INFO L290 TraceCheckUtils]: 89: Hoare triple {65562#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65537#(< ~counter~0 99)} is VALID [2022-04-28 05:58:34,119 INFO L290 TraceCheckUtils]: 88: Hoare triple {65562#(< ~counter~0 98)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {65562#(< ~counter~0 98)} is VALID [2022-04-28 05:58:34,120 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {65136#true} {65562#(< ~counter~0 98)} #96#return; {65562#(< ~counter~0 98)} is VALID [2022-04-28 05:58:34,120 INFO L290 TraceCheckUtils]: 86: Hoare triple {65136#true} assume true; {65136#true} is VALID [2022-04-28 05:58:34,120 INFO L290 TraceCheckUtils]: 85: Hoare triple {65136#true} assume !(0 == ~cond); {65136#true} is VALID [2022-04-28 05:58:34,120 INFO L290 TraceCheckUtils]: 84: Hoare triple {65136#true} ~cond := #in~cond; {65136#true} is VALID [2022-04-28 05:58:34,120 INFO L272 TraceCheckUtils]: 83: Hoare triple {65562#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65136#true} is VALID [2022-04-28 05:58:34,121 INFO L290 TraceCheckUtils]: 82: Hoare triple {65562#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {65562#(< ~counter~0 98)} is VALID [2022-04-28 05:58:34,121 INFO L290 TraceCheckUtils]: 81: Hoare triple {65587#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65562#(< ~counter~0 98)} is VALID [2022-04-28 05:58:34,122 INFO L290 TraceCheckUtils]: 80: Hoare triple {65587#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {65587#(< ~counter~0 97)} is VALID [2022-04-28 05:58:34,122 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {65136#true} {65587#(< ~counter~0 97)} #96#return; {65587#(< ~counter~0 97)} is VALID [2022-04-28 05:58:34,122 INFO L290 TraceCheckUtils]: 78: Hoare triple {65136#true} assume true; {65136#true} is VALID [2022-04-28 05:58:34,123 INFO L290 TraceCheckUtils]: 77: Hoare triple {65136#true} assume !(0 == ~cond); {65136#true} is VALID [2022-04-28 05:58:34,123 INFO L290 TraceCheckUtils]: 76: Hoare triple {65136#true} ~cond := #in~cond; {65136#true} is VALID [2022-04-28 05:58:34,123 INFO L272 TraceCheckUtils]: 75: Hoare triple {65587#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65136#true} is VALID [2022-04-28 05:58:34,123 INFO L290 TraceCheckUtils]: 74: Hoare triple {65587#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {65587#(< ~counter~0 97)} is VALID [2022-04-28 05:58:34,124 INFO L290 TraceCheckUtils]: 73: Hoare triple {65612#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65587#(< ~counter~0 97)} is VALID [2022-04-28 05:58:34,124 INFO L290 TraceCheckUtils]: 72: Hoare triple {65612#(< ~counter~0 96)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {65612#(< ~counter~0 96)} is VALID [2022-04-28 05:58:34,125 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {65136#true} {65612#(< ~counter~0 96)} #96#return; {65612#(< ~counter~0 96)} is VALID [2022-04-28 05:58:34,125 INFO L290 TraceCheckUtils]: 70: Hoare triple {65136#true} assume true; {65136#true} is VALID [2022-04-28 05:58:34,125 INFO L290 TraceCheckUtils]: 69: Hoare triple {65136#true} assume !(0 == ~cond); {65136#true} is VALID [2022-04-28 05:58:34,125 INFO L290 TraceCheckUtils]: 68: Hoare triple {65136#true} ~cond := #in~cond; {65136#true} is VALID [2022-04-28 05:58:34,125 INFO L272 TraceCheckUtils]: 67: Hoare triple {65612#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65136#true} is VALID [2022-04-28 05:58:34,125 INFO L290 TraceCheckUtils]: 66: Hoare triple {65612#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {65612#(< ~counter~0 96)} is VALID [2022-04-28 05:58:34,126 INFO L290 TraceCheckUtils]: 65: Hoare triple {65637#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65612#(< ~counter~0 96)} is VALID [2022-04-28 05:58:34,126 INFO L290 TraceCheckUtils]: 64: Hoare triple {65637#(< ~counter~0 95)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {65637#(< ~counter~0 95)} is VALID [2022-04-28 05:58:34,127 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {65136#true} {65637#(< ~counter~0 95)} #96#return; {65637#(< ~counter~0 95)} is VALID [2022-04-28 05:58:34,127 INFO L290 TraceCheckUtils]: 62: Hoare triple {65136#true} assume true; {65136#true} is VALID [2022-04-28 05:58:34,127 INFO L290 TraceCheckUtils]: 61: Hoare triple {65136#true} assume !(0 == ~cond); {65136#true} is VALID [2022-04-28 05:58:34,127 INFO L290 TraceCheckUtils]: 60: Hoare triple {65136#true} ~cond := #in~cond; {65136#true} is VALID [2022-04-28 05:58:34,127 INFO L272 TraceCheckUtils]: 59: Hoare triple {65637#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65136#true} is VALID [2022-04-28 05:58:34,128 INFO L290 TraceCheckUtils]: 58: Hoare triple {65637#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {65637#(< ~counter~0 95)} is VALID [2022-04-28 05:58:34,128 INFO L290 TraceCheckUtils]: 57: Hoare triple {65662#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65637#(< ~counter~0 95)} is VALID [2022-04-28 05:58:34,129 INFO L290 TraceCheckUtils]: 56: Hoare triple {65662#(< ~counter~0 94)} assume !!(0 != ~r~0); {65662#(< ~counter~0 94)} is VALID [2022-04-28 05:58:34,129 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {65136#true} {65662#(< ~counter~0 94)} #94#return; {65662#(< ~counter~0 94)} is VALID [2022-04-28 05:58:34,129 INFO L290 TraceCheckUtils]: 54: Hoare triple {65136#true} assume true; {65136#true} is VALID [2022-04-28 05:58:34,129 INFO L290 TraceCheckUtils]: 53: Hoare triple {65136#true} assume !(0 == ~cond); {65136#true} is VALID [2022-04-28 05:58:34,129 INFO L290 TraceCheckUtils]: 52: Hoare triple {65136#true} ~cond := #in~cond; {65136#true} is VALID [2022-04-28 05:58:34,130 INFO L272 TraceCheckUtils]: 51: Hoare triple {65662#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65136#true} is VALID [2022-04-28 05:58:34,130 INFO L290 TraceCheckUtils]: 50: Hoare triple {65662#(< ~counter~0 94)} assume !!(#t~post6 < 100);havoc #t~post6; {65662#(< ~counter~0 94)} is VALID [2022-04-28 05:58:34,131 INFO L290 TraceCheckUtils]: 49: Hoare triple {65687#(< ~counter~0 93)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {65662#(< ~counter~0 94)} is VALID [2022-04-28 05:58:34,131 INFO L290 TraceCheckUtils]: 48: Hoare triple {65687#(< ~counter~0 93)} assume !(~r~0 < 0); {65687#(< ~counter~0 93)} is VALID [2022-04-28 05:58:34,132 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {65136#true} {65687#(< ~counter~0 93)} #98#return; {65687#(< ~counter~0 93)} is VALID [2022-04-28 05:58:34,132 INFO L290 TraceCheckUtils]: 46: Hoare triple {65136#true} assume true; {65136#true} is VALID [2022-04-28 05:58:34,132 INFO L290 TraceCheckUtils]: 45: Hoare triple {65136#true} assume !(0 == ~cond); {65136#true} is VALID [2022-04-28 05:58:34,132 INFO L290 TraceCheckUtils]: 44: Hoare triple {65136#true} ~cond := #in~cond; {65136#true} is VALID [2022-04-28 05:58:34,132 INFO L272 TraceCheckUtils]: 43: Hoare triple {65687#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65136#true} is VALID [2022-04-28 05:58:34,132 INFO L290 TraceCheckUtils]: 42: Hoare triple {65687#(< ~counter~0 93)} assume !!(#t~post8 < 100);havoc #t~post8; {65687#(< ~counter~0 93)} is VALID [2022-04-28 05:58:34,133 INFO L290 TraceCheckUtils]: 41: Hoare triple {65712#(< ~counter~0 92)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {65687#(< ~counter~0 93)} is VALID [2022-04-28 05:58:34,133 INFO L290 TraceCheckUtils]: 40: Hoare triple {65712#(< ~counter~0 92)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {65712#(< ~counter~0 92)} is VALID [2022-04-28 05:58:34,134 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {65136#true} {65712#(< ~counter~0 92)} #98#return; {65712#(< ~counter~0 92)} is VALID [2022-04-28 05:58:34,134 INFO L290 TraceCheckUtils]: 38: Hoare triple {65136#true} assume true; {65136#true} is VALID [2022-04-28 05:58:34,134 INFO L290 TraceCheckUtils]: 37: Hoare triple {65136#true} assume !(0 == ~cond); {65136#true} is VALID [2022-04-28 05:58:34,134 INFO L290 TraceCheckUtils]: 36: Hoare triple {65136#true} ~cond := #in~cond; {65136#true} is VALID [2022-04-28 05:58:34,134 INFO L272 TraceCheckUtils]: 35: Hoare triple {65712#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65136#true} is VALID [2022-04-28 05:58:34,134 INFO L290 TraceCheckUtils]: 34: Hoare triple {65712#(< ~counter~0 92)} assume !!(#t~post8 < 100);havoc #t~post8; {65712#(< ~counter~0 92)} is VALID [2022-04-28 05:58:34,135 INFO L290 TraceCheckUtils]: 33: Hoare triple {65737#(< ~counter~0 91)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {65712#(< ~counter~0 92)} is VALID [2022-04-28 05:58:34,136 INFO L290 TraceCheckUtils]: 32: Hoare triple {65737#(< ~counter~0 91)} assume !(~r~0 > 0); {65737#(< ~counter~0 91)} is VALID [2022-04-28 05:58:34,136 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {65136#true} {65737#(< ~counter~0 91)} #96#return; {65737#(< ~counter~0 91)} is VALID [2022-04-28 05:58:34,136 INFO L290 TraceCheckUtils]: 30: Hoare triple {65136#true} assume true; {65136#true} is VALID [2022-04-28 05:58:34,136 INFO L290 TraceCheckUtils]: 29: Hoare triple {65136#true} assume !(0 == ~cond); {65136#true} is VALID [2022-04-28 05:58:34,136 INFO L290 TraceCheckUtils]: 28: Hoare triple {65136#true} ~cond := #in~cond; {65136#true} is VALID [2022-04-28 05:58:34,137 INFO L272 TraceCheckUtils]: 27: Hoare triple {65737#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65136#true} is VALID [2022-04-28 05:58:34,137 INFO L290 TraceCheckUtils]: 26: Hoare triple {65737#(< ~counter~0 91)} assume !!(#t~post7 < 100);havoc #t~post7; {65737#(< ~counter~0 91)} is VALID [2022-04-28 05:58:34,138 INFO L290 TraceCheckUtils]: 25: Hoare triple {65762#(< ~counter~0 90)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65737#(< ~counter~0 91)} is VALID [2022-04-28 05:58:34,138 INFO L290 TraceCheckUtils]: 24: Hoare triple {65762#(< ~counter~0 90)} assume !!(0 != ~r~0); {65762#(< ~counter~0 90)} is VALID [2022-04-28 05:58:34,138 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {65136#true} {65762#(< ~counter~0 90)} #94#return; {65762#(< ~counter~0 90)} is VALID [2022-04-28 05:58:34,139 INFO L290 TraceCheckUtils]: 22: Hoare triple {65136#true} assume true; {65136#true} is VALID [2022-04-28 05:58:34,139 INFO L290 TraceCheckUtils]: 21: Hoare triple {65136#true} assume !(0 == ~cond); {65136#true} is VALID [2022-04-28 05:58:34,139 INFO L290 TraceCheckUtils]: 20: Hoare triple {65136#true} ~cond := #in~cond; {65136#true} is VALID [2022-04-28 05:58:34,139 INFO L272 TraceCheckUtils]: 19: Hoare triple {65762#(< ~counter~0 90)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65136#true} is VALID [2022-04-28 05:58:34,139 INFO L290 TraceCheckUtils]: 18: Hoare triple {65762#(< ~counter~0 90)} assume !!(#t~post6 < 100);havoc #t~post6; {65762#(< ~counter~0 90)} is VALID [2022-04-28 05:58:34,140 INFO L290 TraceCheckUtils]: 17: Hoare triple {65787#(< ~counter~0 89)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {65762#(< ~counter~0 90)} is VALID [2022-04-28 05:58:34,140 INFO L290 TraceCheckUtils]: 16: Hoare triple {65787#(< ~counter~0 89)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {65787#(< ~counter~0 89)} is VALID [2022-04-28 05:58:34,141 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {65136#true} {65787#(< ~counter~0 89)} #92#return; {65787#(< ~counter~0 89)} is VALID [2022-04-28 05:58:34,141 INFO L290 TraceCheckUtils]: 14: Hoare triple {65136#true} assume true; {65136#true} is VALID [2022-04-28 05:58:34,141 INFO L290 TraceCheckUtils]: 13: Hoare triple {65136#true} assume !(0 == ~cond); {65136#true} is VALID [2022-04-28 05:58:34,141 INFO L290 TraceCheckUtils]: 12: Hoare triple {65136#true} ~cond := #in~cond; {65136#true} is VALID [2022-04-28 05:58:34,141 INFO L272 TraceCheckUtils]: 11: Hoare triple {65787#(< ~counter~0 89)} 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)); {65136#true} is VALID [2022-04-28 05:58:34,142 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {65136#true} {65787#(< ~counter~0 89)} #90#return; {65787#(< ~counter~0 89)} is VALID [2022-04-28 05:58:34,142 INFO L290 TraceCheckUtils]: 9: Hoare triple {65136#true} assume true; {65136#true} is VALID [2022-04-28 05:58:34,142 INFO L290 TraceCheckUtils]: 8: Hoare triple {65136#true} assume !(0 == ~cond); {65136#true} is VALID [2022-04-28 05:58:34,142 INFO L290 TraceCheckUtils]: 7: Hoare triple {65136#true} ~cond := #in~cond; {65136#true} is VALID [2022-04-28 05:58:34,142 INFO L272 TraceCheckUtils]: 6: Hoare triple {65787#(< ~counter~0 89)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {65136#true} is VALID [2022-04-28 05:58:34,142 INFO L290 TraceCheckUtils]: 5: Hoare triple {65787#(< ~counter~0 89)} 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; {65787#(< ~counter~0 89)} is VALID [2022-04-28 05:58:34,142 INFO L272 TraceCheckUtils]: 4: Hoare triple {65787#(< ~counter~0 89)} call #t~ret9 := main(); {65787#(< ~counter~0 89)} is VALID [2022-04-28 05:58:34,143 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65787#(< ~counter~0 89)} {65136#true} #102#return; {65787#(< ~counter~0 89)} is VALID [2022-04-28 05:58:34,143 INFO L290 TraceCheckUtils]: 2: Hoare triple {65787#(< ~counter~0 89)} assume true; {65787#(< ~counter~0 89)} is VALID [2022-04-28 05:58:34,144 INFO L290 TraceCheckUtils]: 1: Hoare triple {65136#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; {65787#(< ~counter~0 89)} is VALID [2022-04-28 05:58:34,144 INFO L272 TraceCheckUtils]: 0: Hoare triple {65136#true} call ULTIMATE.init(); {65136#true} is VALID [2022-04-28 05:58:34,144 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 26 proven. 82 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-04-28 05:58:34,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:58:34,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499842240] [2022-04-28 05:58:34,144 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:58:34,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [510563821] [2022-04-28 05:58:34,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [510563821] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:58:34,145 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:58:34,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2022-04-28 05:58:34,145 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:58:34,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [37406190] [2022-04-28 05:58:34,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [37406190] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:58:34,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:58:34,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 05:58:34,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453416234] [2022-04-28 05:58:34,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:58:34,146 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) Word has length 113 [2022-04-28 05:58:34,146 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:58:34,146 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-28 05:58:34,261 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:58:34,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 05:58:34,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:58:34,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 05:58:34,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=426, Unknown=0, NotChecked=0, Total=756 [2022-04-28 05:58:34,262 INFO L87 Difference]: Start difference. First operand 560 states and 768 transitions. Second operand has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-28 05:58:37,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:37,162 INFO L93 Difference]: Finished difference Result 781 states and 1101 transitions. [2022-04-28 05:58:37,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-28 05:58:37,162 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) Word has length 113 [2022-04-28 05:58:37,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:58:37,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-28 05:58:37,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 256 transitions. [2022-04-28 05:58:37,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-28 05:58:37,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 256 transitions. [2022-04-28 05:58:37,166 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 256 transitions. [2022-04-28 05:58:37,376 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 256 edges. 256 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:58:37,391 INFO L225 Difference]: With dead ends: 781 [2022-04-28 05:58:37,391 INFO L226 Difference]: Without dead ends: 588 [2022-04-28 05:58:37,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=555, Invalid=777, Unknown=0, NotChecked=0, Total=1332 [2022-04-28 05:58:37,392 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 163 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 05:58:37,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 262 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 05:58:37,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2022-04-28 05:58:38,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 578. [2022-04-28 05:58:38,952 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:58:38,952 INFO L82 GeneralOperation]: Start isEquivalent. First operand 588 states. Second operand has 578 states, 436 states have (on average 1.2339449541284404) internal successors, (538), 440 states have internal predecessors, (538), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 121 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-28 05:58:38,953 INFO L74 IsIncluded]: Start isIncluded. First operand 588 states. Second operand has 578 states, 436 states have (on average 1.2339449541284404) internal successors, (538), 440 states have internal predecessors, (538), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 121 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-28 05:58:38,953 INFO L87 Difference]: Start difference. First operand 588 states. Second operand has 578 states, 436 states have (on average 1.2339449541284404) internal successors, (538), 440 states have internal predecessors, (538), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 121 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-28 05:58:38,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:38,970 INFO L93 Difference]: Finished difference Result 588 states and 800 transitions. [2022-04-28 05:58:38,970 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 800 transitions. [2022-04-28 05:58:38,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:58:38,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:58:38,971 INFO L74 IsIncluded]: Start isIncluded. First operand has 578 states, 436 states have (on average 1.2339449541284404) internal successors, (538), 440 states have internal predecessors, (538), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 121 states have call predecessors, (125), 125 states have call successors, (125) Second operand 588 states. [2022-04-28 05:58:38,972 INFO L87 Difference]: Start difference. First operand has 578 states, 436 states have (on average 1.2339449541284404) internal successors, (538), 440 states have internal predecessors, (538), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 121 states have call predecessors, (125), 125 states have call successors, (125) Second operand 588 states. [2022-04-28 05:58:38,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:38,985 INFO L93 Difference]: Finished difference Result 588 states and 800 transitions. [2022-04-28 05:58:38,985 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 800 transitions. [2022-04-28 05:58:38,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:58:38,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:58:38,986 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:58:38,986 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:58:38,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 436 states have (on average 1.2339449541284404) internal successors, (538), 440 states have internal predecessors, (538), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 121 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-28 05:58:39,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 790 transitions. [2022-04-28 05:58:39,004 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 790 transitions. Word has length 113 [2022-04-28 05:58:39,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:58:39,004 INFO L495 AbstractCegarLoop]: Abstraction has 578 states and 790 transitions. [2022-04-28 05:58:39,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-28 05:58:39,004 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 578 states and 790 transitions. [2022-04-28 05:58:42,243 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 790 edges. 790 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:58:42,243 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 790 transitions. [2022-04-28 05:58:42,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-04-28 05:58:42,244 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:58:42,244 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:58:42,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-04-28 05:58:42,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-04-28 05:58:42,445 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:58:42,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:58:42,445 INFO L85 PathProgramCache]: Analyzing trace with hash 533963976, now seen corresponding path program 13 times [2022-04-28 05:58:42,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:58:42,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [664589973] [2022-04-28 05:58:42,446 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:58:42,446 INFO L85 PathProgramCache]: Analyzing trace with hash 533963976, now seen corresponding path program 14 times [2022-04-28 05:58:42,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:58:42,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848963564] [2022-04-28 05:58:42,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:58:42,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:58:42,467 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:58:42,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [516496114] [2022-04-28 05:58:42,468 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:58:42,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:58:42,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:58:42,476 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:58:42,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-04-28 05:58:42,548 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:58:42,548 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:58:42,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 05:58:42,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:58:42,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:58:43,072 INFO L272 TraceCheckUtils]: 0: Hoare triple {69753#true} call ULTIMATE.init(); {69753#true} is VALID [2022-04-28 05:58:43,072 INFO L290 TraceCheckUtils]: 1: Hoare triple {69753#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; {69761#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:43,073 INFO L290 TraceCheckUtils]: 2: Hoare triple {69761#(<= ~counter~0 0)} assume true; {69761#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:43,073 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {69761#(<= ~counter~0 0)} {69753#true} #102#return; {69761#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:43,073 INFO L272 TraceCheckUtils]: 4: Hoare triple {69761#(<= ~counter~0 0)} call #t~ret9 := main(); {69761#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:43,074 INFO L290 TraceCheckUtils]: 5: Hoare triple {69761#(<= ~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; {69761#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:43,074 INFO L272 TraceCheckUtils]: 6: Hoare triple {69761#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {69761#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:43,074 INFO L290 TraceCheckUtils]: 7: Hoare triple {69761#(<= ~counter~0 0)} ~cond := #in~cond; {69761#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:43,075 INFO L290 TraceCheckUtils]: 8: Hoare triple {69761#(<= ~counter~0 0)} assume !(0 == ~cond); {69761#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:43,075 INFO L290 TraceCheckUtils]: 9: Hoare triple {69761#(<= ~counter~0 0)} assume true; {69761#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:43,075 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {69761#(<= ~counter~0 0)} {69761#(<= ~counter~0 0)} #90#return; {69761#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:43,076 INFO L272 TraceCheckUtils]: 11: Hoare triple {69761#(<= ~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)); {69761#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:43,076 INFO L290 TraceCheckUtils]: 12: Hoare triple {69761#(<= ~counter~0 0)} ~cond := #in~cond; {69761#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:43,076 INFO L290 TraceCheckUtils]: 13: Hoare triple {69761#(<= ~counter~0 0)} assume !(0 == ~cond); {69761#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:43,076 INFO L290 TraceCheckUtils]: 14: Hoare triple {69761#(<= ~counter~0 0)} assume true; {69761#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:43,077 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {69761#(<= ~counter~0 0)} {69761#(<= ~counter~0 0)} #92#return; {69761#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:43,077 INFO L290 TraceCheckUtils]: 16: Hoare triple {69761#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {69761#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:43,079 INFO L290 TraceCheckUtils]: 17: Hoare triple {69761#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {69810#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:43,079 INFO L290 TraceCheckUtils]: 18: Hoare triple {69810#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {69810#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:43,079 INFO L272 TraceCheckUtils]: 19: Hoare triple {69810#(<= ~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)); {69810#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:43,080 INFO L290 TraceCheckUtils]: 20: Hoare triple {69810#(<= ~counter~0 1)} ~cond := #in~cond; {69810#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:43,080 INFO L290 TraceCheckUtils]: 21: Hoare triple {69810#(<= ~counter~0 1)} assume !(0 == ~cond); {69810#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:43,080 INFO L290 TraceCheckUtils]: 22: Hoare triple {69810#(<= ~counter~0 1)} assume true; {69810#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:43,081 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {69810#(<= ~counter~0 1)} {69810#(<= ~counter~0 1)} #94#return; {69810#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:43,081 INFO L290 TraceCheckUtils]: 24: Hoare triple {69810#(<= ~counter~0 1)} assume !!(0 != ~r~0); {69810#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:43,082 INFO L290 TraceCheckUtils]: 25: Hoare triple {69810#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {69835#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:43,082 INFO L290 TraceCheckUtils]: 26: Hoare triple {69835#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {69835#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:43,082 INFO L272 TraceCheckUtils]: 27: Hoare triple {69835#(<= ~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)); {69835#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:43,083 INFO L290 TraceCheckUtils]: 28: Hoare triple {69835#(<= ~counter~0 2)} ~cond := #in~cond; {69835#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:43,083 INFO L290 TraceCheckUtils]: 29: Hoare triple {69835#(<= ~counter~0 2)} assume !(0 == ~cond); {69835#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:43,083 INFO L290 TraceCheckUtils]: 30: Hoare triple {69835#(<= ~counter~0 2)} assume true; {69835#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:43,084 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {69835#(<= ~counter~0 2)} {69835#(<= ~counter~0 2)} #96#return; {69835#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:43,084 INFO L290 TraceCheckUtils]: 32: Hoare triple {69835#(<= ~counter~0 2)} assume !(~r~0 > 0); {69835#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:43,085 INFO L290 TraceCheckUtils]: 33: Hoare triple {69835#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {69860#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:43,085 INFO L290 TraceCheckUtils]: 34: Hoare triple {69860#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {69860#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:43,085 INFO L272 TraceCheckUtils]: 35: Hoare triple {69860#(<= ~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)); {69860#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:43,086 INFO L290 TraceCheckUtils]: 36: Hoare triple {69860#(<= ~counter~0 3)} ~cond := #in~cond; {69860#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:43,086 INFO L290 TraceCheckUtils]: 37: Hoare triple {69860#(<= ~counter~0 3)} assume !(0 == ~cond); {69860#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:43,086 INFO L290 TraceCheckUtils]: 38: Hoare triple {69860#(<= ~counter~0 3)} assume true; {69860#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:43,087 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {69860#(<= ~counter~0 3)} {69860#(<= ~counter~0 3)} #98#return; {69860#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:43,087 INFO L290 TraceCheckUtils]: 40: Hoare triple {69860#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {69860#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:43,088 INFO L290 TraceCheckUtils]: 41: Hoare triple {69860#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {69885#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:43,088 INFO L290 TraceCheckUtils]: 42: Hoare triple {69885#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {69885#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:43,088 INFO L272 TraceCheckUtils]: 43: Hoare triple {69885#(<= ~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)); {69885#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:43,089 INFO L290 TraceCheckUtils]: 44: Hoare triple {69885#(<= ~counter~0 4)} ~cond := #in~cond; {69885#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:43,089 INFO L290 TraceCheckUtils]: 45: Hoare triple {69885#(<= ~counter~0 4)} assume !(0 == ~cond); {69885#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:43,089 INFO L290 TraceCheckUtils]: 46: Hoare triple {69885#(<= ~counter~0 4)} assume true; {69885#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:43,090 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {69885#(<= ~counter~0 4)} {69885#(<= ~counter~0 4)} #98#return; {69885#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:43,090 INFO L290 TraceCheckUtils]: 48: Hoare triple {69885#(<= ~counter~0 4)} assume !(~r~0 < 0); {69885#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:43,091 INFO L290 TraceCheckUtils]: 49: Hoare triple {69885#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {69910#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:43,091 INFO L290 TraceCheckUtils]: 50: Hoare triple {69910#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {69910#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:43,092 INFO L272 TraceCheckUtils]: 51: Hoare triple {69910#(<= ~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)); {69910#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:43,092 INFO L290 TraceCheckUtils]: 52: Hoare triple {69910#(<= ~counter~0 5)} ~cond := #in~cond; {69910#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:43,092 INFO L290 TraceCheckUtils]: 53: Hoare triple {69910#(<= ~counter~0 5)} assume !(0 == ~cond); {69910#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:43,092 INFO L290 TraceCheckUtils]: 54: Hoare triple {69910#(<= ~counter~0 5)} assume true; {69910#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:43,093 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {69910#(<= ~counter~0 5)} {69910#(<= ~counter~0 5)} #94#return; {69910#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:43,093 INFO L290 TraceCheckUtils]: 56: Hoare triple {69910#(<= ~counter~0 5)} assume !!(0 != ~r~0); {69910#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:43,094 INFO L290 TraceCheckUtils]: 57: Hoare triple {69910#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {69935#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:43,094 INFO L290 TraceCheckUtils]: 58: Hoare triple {69935#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {69935#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:43,095 INFO L272 TraceCheckUtils]: 59: Hoare triple {69935#(<= ~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)); {69935#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:43,095 INFO L290 TraceCheckUtils]: 60: Hoare triple {69935#(<= ~counter~0 6)} ~cond := #in~cond; {69935#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:43,095 INFO L290 TraceCheckUtils]: 61: Hoare triple {69935#(<= ~counter~0 6)} assume !(0 == ~cond); {69935#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:43,095 INFO L290 TraceCheckUtils]: 62: Hoare triple {69935#(<= ~counter~0 6)} assume true; {69935#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:43,096 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {69935#(<= ~counter~0 6)} {69935#(<= ~counter~0 6)} #96#return; {69935#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:43,096 INFO L290 TraceCheckUtils]: 64: Hoare triple {69935#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {69935#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:43,097 INFO L290 TraceCheckUtils]: 65: Hoare triple {69935#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {69960#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:43,097 INFO L290 TraceCheckUtils]: 66: Hoare triple {69960#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {69960#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:43,098 INFO L272 TraceCheckUtils]: 67: Hoare triple {69960#(<= ~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)); {69960#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:43,098 INFO L290 TraceCheckUtils]: 68: Hoare triple {69960#(<= ~counter~0 7)} ~cond := #in~cond; {69960#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:43,098 INFO L290 TraceCheckUtils]: 69: Hoare triple {69960#(<= ~counter~0 7)} assume !(0 == ~cond); {69960#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:43,098 INFO L290 TraceCheckUtils]: 70: Hoare triple {69960#(<= ~counter~0 7)} assume true; {69960#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:43,099 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {69960#(<= ~counter~0 7)} {69960#(<= ~counter~0 7)} #96#return; {69960#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:43,099 INFO L290 TraceCheckUtils]: 72: Hoare triple {69960#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {69960#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:43,100 INFO L290 TraceCheckUtils]: 73: Hoare triple {69960#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {69985#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:43,100 INFO L290 TraceCheckUtils]: 74: Hoare triple {69985#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {69985#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:43,101 INFO L272 TraceCheckUtils]: 75: Hoare triple {69985#(<= ~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)); {69985#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:43,101 INFO L290 TraceCheckUtils]: 76: Hoare triple {69985#(<= ~counter~0 8)} ~cond := #in~cond; {69985#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:43,101 INFO L290 TraceCheckUtils]: 77: Hoare triple {69985#(<= ~counter~0 8)} assume !(0 == ~cond); {69985#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:43,101 INFO L290 TraceCheckUtils]: 78: Hoare triple {69985#(<= ~counter~0 8)} assume true; {69985#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:43,102 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {69985#(<= ~counter~0 8)} {69985#(<= ~counter~0 8)} #96#return; {69985#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:43,102 INFO L290 TraceCheckUtils]: 80: Hoare triple {69985#(<= ~counter~0 8)} assume !(~r~0 > 0); {69985#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:43,103 INFO L290 TraceCheckUtils]: 81: Hoare triple {69985#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {70010#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:43,103 INFO L290 TraceCheckUtils]: 82: Hoare triple {70010#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {70010#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:43,104 INFO L272 TraceCheckUtils]: 83: Hoare triple {70010#(<= ~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)); {70010#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:43,104 INFO L290 TraceCheckUtils]: 84: Hoare triple {70010#(<= ~counter~0 9)} ~cond := #in~cond; {70010#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:43,104 INFO L290 TraceCheckUtils]: 85: Hoare triple {70010#(<= ~counter~0 9)} assume !(0 == ~cond); {70010#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:43,104 INFO L290 TraceCheckUtils]: 86: Hoare triple {70010#(<= ~counter~0 9)} assume true; {70010#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:43,105 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {70010#(<= ~counter~0 9)} {70010#(<= ~counter~0 9)} #98#return; {70010#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:43,105 INFO L290 TraceCheckUtils]: 88: Hoare triple {70010#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {70010#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:43,106 INFO L290 TraceCheckUtils]: 89: Hoare triple {70010#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {70035#(<= ~counter~0 10)} is VALID [2022-04-28 05:58:43,106 INFO L290 TraceCheckUtils]: 90: Hoare triple {70035#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {70035#(<= ~counter~0 10)} is VALID [2022-04-28 05:58:43,107 INFO L272 TraceCheckUtils]: 91: Hoare triple {70035#(<= ~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)); {70035#(<= ~counter~0 10)} is VALID [2022-04-28 05:58:43,107 INFO L290 TraceCheckUtils]: 92: Hoare triple {70035#(<= ~counter~0 10)} ~cond := #in~cond; {70035#(<= ~counter~0 10)} is VALID [2022-04-28 05:58:43,107 INFO L290 TraceCheckUtils]: 93: Hoare triple {70035#(<= ~counter~0 10)} assume !(0 == ~cond); {70035#(<= ~counter~0 10)} is VALID [2022-04-28 05:58:43,107 INFO L290 TraceCheckUtils]: 94: Hoare triple {70035#(<= ~counter~0 10)} assume true; {70035#(<= ~counter~0 10)} is VALID [2022-04-28 05:58:43,108 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {70035#(<= ~counter~0 10)} {70035#(<= ~counter~0 10)} #98#return; {70035#(<= ~counter~0 10)} is VALID [2022-04-28 05:58:43,108 INFO L290 TraceCheckUtils]: 96: Hoare triple {70035#(<= ~counter~0 10)} assume !(~r~0 < 0); {70035#(<= ~counter~0 10)} is VALID [2022-04-28 05:58:43,109 INFO L290 TraceCheckUtils]: 97: Hoare triple {70035#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {70060#(<= ~counter~0 11)} is VALID [2022-04-28 05:58:43,109 INFO L290 TraceCheckUtils]: 98: Hoare triple {70060#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {70060#(<= ~counter~0 11)} is VALID [2022-04-28 05:58:43,110 INFO L272 TraceCheckUtils]: 99: Hoare triple {70060#(<= ~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)); {70060#(<= ~counter~0 11)} is VALID [2022-04-28 05:58:43,110 INFO L290 TraceCheckUtils]: 100: Hoare triple {70060#(<= ~counter~0 11)} ~cond := #in~cond; {70060#(<= ~counter~0 11)} is VALID [2022-04-28 05:58:43,110 INFO L290 TraceCheckUtils]: 101: Hoare triple {70060#(<= ~counter~0 11)} assume !(0 == ~cond); {70060#(<= ~counter~0 11)} is VALID [2022-04-28 05:58:43,110 INFO L290 TraceCheckUtils]: 102: Hoare triple {70060#(<= ~counter~0 11)} assume true; {70060#(<= ~counter~0 11)} is VALID [2022-04-28 05:58:43,111 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {70060#(<= ~counter~0 11)} {70060#(<= ~counter~0 11)} #94#return; {70060#(<= ~counter~0 11)} is VALID [2022-04-28 05:58:43,111 INFO L290 TraceCheckUtils]: 104: Hoare triple {70060#(<= ~counter~0 11)} assume !!(0 != ~r~0); {70060#(<= ~counter~0 11)} is VALID [2022-04-28 05:58:43,111 INFO L290 TraceCheckUtils]: 105: Hoare triple {70060#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70085#(<= |main_#t~post7| 11)} is VALID [2022-04-28 05:58:43,112 INFO L290 TraceCheckUtils]: 106: Hoare triple {70085#(<= |main_#t~post7| 11)} assume !(#t~post7 < 100);havoc #t~post7; {69754#false} is VALID [2022-04-28 05:58:43,112 INFO L290 TraceCheckUtils]: 107: Hoare triple {69754#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {69754#false} is VALID [2022-04-28 05:58:43,112 INFO L290 TraceCheckUtils]: 108: Hoare triple {69754#false} assume !(#t~post8 < 100);havoc #t~post8; {69754#false} is VALID [2022-04-28 05:58:43,112 INFO L290 TraceCheckUtils]: 109: Hoare triple {69754#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {69754#false} is VALID [2022-04-28 05:58:43,112 INFO L290 TraceCheckUtils]: 110: Hoare triple {69754#false} assume !(#t~post6 < 100);havoc #t~post6; {69754#false} is VALID [2022-04-28 05:58:43,112 INFO L272 TraceCheckUtils]: 111: Hoare triple {69754#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)); {69754#false} is VALID [2022-04-28 05:58:43,112 INFO L290 TraceCheckUtils]: 112: Hoare triple {69754#false} ~cond := #in~cond; {69754#false} is VALID [2022-04-28 05:58:43,112 INFO L290 TraceCheckUtils]: 113: Hoare triple {69754#false} assume 0 == ~cond; {69754#false} is VALID [2022-04-28 05:58:43,112 INFO L290 TraceCheckUtils]: 114: Hoare triple {69754#false} assume !false; {69754#false} is VALID [2022-04-28 05:58:43,113 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 36 proven. 288 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:58:43,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:58:43,736 INFO L290 TraceCheckUtils]: 114: Hoare triple {69754#false} assume !false; {69754#false} is VALID [2022-04-28 05:58:43,737 INFO L290 TraceCheckUtils]: 113: Hoare triple {69754#false} assume 0 == ~cond; {69754#false} is VALID [2022-04-28 05:58:43,737 INFO L290 TraceCheckUtils]: 112: Hoare triple {69754#false} ~cond := #in~cond; {69754#false} is VALID [2022-04-28 05:58:43,737 INFO L272 TraceCheckUtils]: 111: Hoare triple {69754#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)); {69754#false} is VALID [2022-04-28 05:58:43,737 INFO L290 TraceCheckUtils]: 110: Hoare triple {69754#false} assume !(#t~post6 < 100);havoc #t~post6; {69754#false} is VALID [2022-04-28 05:58:43,737 INFO L290 TraceCheckUtils]: 109: Hoare triple {69754#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {69754#false} is VALID [2022-04-28 05:58:43,737 INFO L290 TraceCheckUtils]: 108: Hoare triple {69754#false} assume !(#t~post8 < 100);havoc #t~post8; {69754#false} is VALID [2022-04-28 05:58:43,737 INFO L290 TraceCheckUtils]: 107: Hoare triple {69754#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {69754#false} is VALID [2022-04-28 05:58:43,744 INFO L290 TraceCheckUtils]: 106: Hoare triple {70137#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {69754#false} is VALID [2022-04-28 05:58:43,744 INFO L290 TraceCheckUtils]: 105: Hoare triple {70141#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70137#(< |main_#t~post7| 100)} is VALID [2022-04-28 05:58:43,744 INFO L290 TraceCheckUtils]: 104: Hoare triple {70141#(< ~counter~0 100)} assume !!(0 != ~r~0); {70141#(< ~counter~0 100)} is VALID [2022-04-28 05:58:43,745 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {69753#true} {70141#(< ~counter~0 100)} #94#return; {70141#(< ~counter~0 100)} is VALID [2022-04-28 05:58:43,745 INFO L290 TraceCheckUtils]: 102: Hoare triple {69753#true} assume true; {69753#true} is VALID [2022-04-28 05:58:43,745 INFO L290 TraceCheckUtils]: 101: Hoare triple {69753#true} assume !(0 == ~cond); {69753#true} is VALID [2022-04-28 05:58:43,745 INFO L290 TraceCheckUtils]: 100: Hoare triple {69753#true} ~cond := #in~cond; {69753#true} is VALID [2022-04-28 05:58:43,745 INFO L272 TraceCheckUtils]: 99: Hoare triple {70141#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69753#true} is VALID [2022-04-28 05:58:43,745 INFO L290 TraceCheckUtils]: 98: Hoare triple {70141#(< ~counter~0 100)} assume !!(#t~post6 < 100);havoc #t~post6; {70141#(< ~counter~0 100)} is VALID [2022-04-28 05:58:43,747 INFO L290 TraceCheckUtils]: 97: Hoare triple {70166#(< ~counter~0 99)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {70141#(< ~counter~0 100)} is VALID [2022-04-28 05:58:43,747 INFO L290 TraceCheckUtils]: 96: Hoare triple {70166#(< ~counter~0 99)} assume !(~r~0 < 0); {70166#(< ~counter~0 99)} is VALID [2022-04-28 05:58:43,748 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {69753#true} {70166#(< ~counter~0 99)} #98#return; {70166#(< ~counter~0 99)} is VALID [2022-04-28 05:58:43,748 INFO L290 TraceCheckUtils]: 94: Hoare triple {69753#true} assume true; {69753#true} is VALID [2022-04-28 05:58:43,748 INFO L290 TraceCheckUtils]: 93: Hoare triple {69753#true} assume !(0 == ~cond); {69753#true} is VALID [2022-04-28 05:58:43,748 INFO L290 TraceCheckUtils]: 92: Hoare triple {69753#true} ~cond := #in~cond; {69753#true} is VALID [2022-04-28 05:58:43,748 INFO L272 TraceCheckUtils]: 91: Hoare triple {70166#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69753#true} is VALID [2022-04-28 05:58:43,749 INFO L290 TraceCheckUtils]: 90: Hoare triple {70166#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {70166#(< ~counter~0 99)} is VALID [2022-04-28 05:58:43,749 INFO L290 TraceCheckUtils]: 89: Hoare triple {70191#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {70166#(< ~counter~0 99)} is VALID [2022-04-28 05:58:43,750 INFO L290 TraceCheckUtils]: 88: Hoare triple {70191#(< ~counter~0 98)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {70191#(< ~counter~0 98)} is VALID [2022-04-28 05:58:43,750 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {69753#true} {70191#(< ~counter~0 98)} #98#return; {70191#(< ~counter~0 98)} is VALID [2022-04-28 05:58:43,750 INFO L290 TraceCheckUtils]: 86: Hoare triple {69753#true} assume true; {69753#true} is VALID [2022-04-28 05:58:43,750 INFO L290 TraceCheckUtils]: 85: Hoare triple {69753#true} assume !(0 == ~cond); {69753#true} is VALID [2022-04-28 05:58:43,750 INFO L290 TraceCheckUtils]: 84: Hoare triple {69753#true} ~cond := #in~cond; {69753#true} is VALID [2022-04-28 05:58:43,751 INFO L272 TraceCheckUtils]: 83: Hoare triple {70191#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69753#true} is VALID [2022-04-28 05:58:43,751 INFO L290 TraceCheckUtils]: 82: Hoare triple {70191#(< ~counter~0 98)} assume !!(#t~post8 < 100);havoc #t~post8; {70191#(< ~counter~0 98)} is VALID [2022-04-28 05:58:43,752 INFO L290 TraceCheckUtils]: 81: Hoare triple {70216#(< ~counter~0 97)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {70191#(< ~counter~0 98)} is VALID [2022-04-28 05:58:43,752 INFO L290 TraceCheckUtils]: 80: Hoare triple {70216#(< ~counter~0 97)} assume !(~r~0 > 0); {70216#(< ~counter~0 97)} is VALID [2022-04-28 05:58:43,752 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {69753#true} {70216#(< ~counter~0 97)} #96#return; {70216#(< ~counter~0 97)} is VALID [2022-04-28 05:58:43,753 INFO L290 TraceCheckUtils]: 78: Hoare triple {69753#true} assume true; {69753#true} is VALID [2022-04-28 05:58:43,753 INFO L290 TraceCheckUtils]: 77: Hoare triple {69753#true} assume !(0 == ~cond); {69753#true} is VALID [2022-04-28 05:58:43,753 INFO L290 TraceCheckUtils]: 76: Hoare triple {69753#true} ~cond := #in~cond; {69753#true} is VALID [2022-04-28 05:58:43,753 INFO L272 TraceCheckUtils]: 75: Hoare triple {70216#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69753#true} is VALID [2022-04-28 05:58:43,753 INFO L290 TraceCheckUtils]: 74: Hoare triple {70216#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {70216#(< ~counter~0 97)} is VALID [2022-04-28 05:58:43,754 INFO L290 TraceCheckUtils]: 73: Hoare triple {70241#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70216#(< ~counter~0 97)} is VALID [2022-04-28 05:58:43,754 INFO L290 TraceCheckUtils]: 72: Hoare triple {70241#(< ~counter~0 96)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {70241#(< ~counter~0 96)} is VALID [2022-04-28 05:58:43,763 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {69753#true} {70241#(< ~counter~0 96)} #96#return; {70241#(< ~counter~0 96)} is VALID [2022-04-28 05:58:43,763 INFO L290 TraceCheckUtils]: 70: Hoare triple {69753#true} assume true; {69753#true} is VALID [2022-04-28 05:58:43,763 INFO L290 TraceCheckUtils]: 69: Hoare triple {69753#true} assume !(0 == ~cond); {69753#true} is VALID [2022-04-28 05:58:43,763 INFO L290 TraceCheckUtils]: 68: Hoare triple {69753#true} ~cond := #in~cond; {69753#true} is VALID [2022-04-28 05:58:43,763 INFO L272 TraceCheckUtils]: 67: Hoare triple {70241#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69753#true} is VALID [2022-04-28 05:58:43,763 INFO L290 TraceCheckUtils]: 66: Hoare triple {70241#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {70241#(< ~counter~0 96)} is VALID [2022-04-28 05:58:43,764 INFO L290 TraceCheckUtils]: 65: Hoare triple {70266#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70241#(< ~counter~0 96)} is VALID [2022-04-28 05:58:43,765 INFO L290 TraceCheckUtils]: 64: Hoare triple {70266#(< ~counter~0 95)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {70266#(< ~counter~0 95)} is VALID [2022-04-28 05:58:43,765 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {69753#true} {70266#(< ~counter~0 95)} #96#return; {70266#(< ~counter~0 95)} is VALID [2022-04-28 05:58:43,765 INFO L290 TraceCheckUtils]: 62: Hoare triple {69753#true} assume true; {69753#true} is VALID [2022-04-28 05:58:43,765 INFO L290 TraceCheckUtils]: 61: Hoare triple {69753#true} assume !(0 == ~cond); {69753#true} is VALID [2022-04-28 05:58:43,765 INFO L290 TraceCheckUtils]: 60: Hoare triple {69753#true} ~cond := #in~cond; {69753#true} is VALID [2022-04-28 05:58:43,766 INFO L272 TraceCheckUtils]: 59: Hoare triple {70266#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69753#true} is VALID [2022-04-28 05:58:43,766 INFO L290 TraceCheckUtils]: 58: Hoare triple {70266#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {70266#(< ~counter~0 95)} is VALID [2022-04-28 05:58:43,767 INFO L290 TraceCheckUtils]: 57: Hoare triple {70291#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70266#(< ~counter~0 95)} is VALID [2022-04-28 05:58:43,767 INFO L290 TraceCheckUtils]: 56: Hoare triple {70291#(< ~counter~0 94)} assume !!(0 != ~r~0); {70291#(< ~counter~0 94)} is VALID [2022-04-28 05:58:43,767 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {69753#true} {70291#(< ~counter~0 94)} #94#return; {70291#(< ~counter~0 94)} is VALID [2022-04-28 05:58:43,767 INFO L290 TraceCheckUtils]: 54: Hoare triple {69753#true} assume true; {69753#true} is VALID [2022-04-28 05:58:43,767 INFO L290 TraceCheckUtils]: 53: Hoare triple {69753#true} assume !(0 == ~cond); {69753#true} is VALID [2022-04-28 05:58:43,768 INFO L290 TraceCheckUtils]: 52: Hoare triple {69753#true} ~cond := #in~cond; {69753#true} is VALID [2022-04-28 05:58:43,768 INFO L272 TraceCheckUtils]: 51: Hoare triple {70291#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69753#true} is VALID [2022-04-28 05:58:43,774 INFO L290 TraceCheckUtils]: 50: Hoare triple {70291#(< ~counter~0 94)} assume !!(#t~post6 < 100);havoc #t~post6; {70291#(< ~counter~0 94)} is VALID [2022-04-28 05:58:43,775 INFO L290 TraceCheckUtils]: 49: Hoare triple {70316#(< ~counter~0 93)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {70291#(< ~counter~0 94)} is VALID [2022-04-28 05:58:43,776 INFO L290 TraceCheckUtils]: 48: Hoare triple {70316#(< ~counter~0 93)} assume !(~r~0 < 0); {70316#(< ~counter~0 93)} is VALID [2022-04-28 05:58:43,776 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {69753#true} {70316#(< ~counter~0 93)} #98#return; {70316#(< ~counter~0 93)} is VALID [2022-04-28 05:58:43,776 INFO L290 TraceCheckUtils]: 46: Hoare triple {69753#true} assume true; {69753#true} is VALID [2022-04-28 05:58:43,776 INFO L290 TraceCheckUtils]: 45: Hoare triple {69753#true} assume !(0 == ~cond); {69753#true} is VALID [2022-04-28 05:58:43,777 INFO L290 TraceCheckUtils]: 44: Hoare triple {69753#true} ~cond := #in~cond; {69753#true} is VALID [2022-04-28 05:58:43,777 INFO L272 TraceCheckUtils]: 43: Hoare triple {70316#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69753#true} is VALID [2022-04-28 05:58:43,777 INFO L290 TraceCheckUtils]: 42: Hoare triple {70316#(< ~counter~0 93)} assume !!(#t~post8 < 100);havoc #t~post8; {70316#(< ~counter~0 93)} is VALID [2022-04-28 05:58:43,778 INFO L290 TraceCheckUtils]: 41: Hoare triple {70341#(< ~counter~0 92)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {70316#(< ~counter~0 93)} is VALID [2022-04-28 05:58:43,778 INFO L290 TraceCheckUtils]: 40: Hoare triple {70341#(< ~counter~0 92)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {70341#(< ~counter~0 92)} is VALID [2022-04-28 05:58:43,778 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {69753#true} {70341#(< ~counter~0 92)} #98#return; {70341#(< ~counter~0 92)} is VALID [2022-04-28 05:58:43,778 INFO L290 TraceCheckUtils]: 38: Hoare triple {69753#true} assume true; {69753#true} is VALID [2022-04-28 05:58:43,778 INFO L290 TraceCheckUtils]: 37: Hoare triple {69753#true} assume !(0 == ~cond); {69753#true} is VALID [2022-04-28 05:58:43,779 INFO L290 TraceCheckUtils]: 36: Hoare triple {69753#true} ~cond := #in~cond; {69753#true} is VALID [2022-04-28 05:58:43,779 INFO L272 TraceCheckUtils]: 35: Hoare triple {70341#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69753#true} is VALID [2022-04-28 05:58:43,779 INFO L290 TraceCheckUtils]: 34: Hoare triple {70341#(< ~counter~0 92)} assume !!(#t~post8 < 100);havoc #t~post8; {70341#(< ~counter~0 92)} is VALID [2022-04-28 05:58:43,780 INFO L290 TraceCheckUtils]: 33: Hoare triple {70366#(< ~counter~0 91)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {70341#(< ~counter~0 92)} is VALID [2022-04-28 05:58:43,780 INFO L290 TraceCheckUtils]: 32: Hoare triple {70366#(< ~counter~0 91)} assume !(~r~0 > 0); {70366#(< ~counter~0 91)} is VALID [2022-04-28 05:58:43,780 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {69753#true} {70366#(< ~counter~0 91)} #96#return; {70366#(< ~counter~0 91)} is VALID [2022-04-28 05:58:43,780 INFO L290 TraceCheckUtils]: 30: Hoare triple {69753#true} assume true; {69753#true} is VALID [2022-04-28 05:58:43,781 INFO L290 TraceCheckUtils]: 29: Hoare triple {69753#true} assume !(0 == ~cond); {69753#true} is VALID [2022-04-28 05:58:43,781 INFO L290 TraceCheckUtils]: 28: Hoare triple {69753#true} ~cond := #in~cond; {69753#true} is VALID [2022-04-28 05:58:43,781 INFO L272 TraceCheckUtils]: 27: Hoare triple {70366#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69753#true} is VALID [2022-04-28 05:58:43,781 INFO L290 TraceCheckUtils]: 26: Hoare triple {70366#(< ~counter~0 91)} assume !!(#t~post7 < 100);havoc #t~post7; {70366#(< ~counter~0 91)} is VALID [2022-04-28 05:58:43,782 INFO L290 TraceCheckUtils]: 25: Hoare triple {70391#(< ~counter~0 90)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70366#(< ~counter~0 91)} is VALID [2022-04-28 05:58:43,782 INFO L290 TraceCheckUtils]: 24: Hoare triple {70391#(< ~counter~0 90)} assume !!(0 != ~r~0); {70391#(< ~counter~0 90)} is VALID [2022-04-28 05:58:43,782 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {69753#true} {70391#(< ~counter~0 90)} #94#return; {70391#(< ~counter~0 90)} is VALID [2022-04-28 05:58:43,782 INFO L290 TraceCheckUtils]: 22: Hoare triple {69753#true} assume true; {69753#true} is VALID [2022-04-28 05:58:43,783 INFO L290 TraceCheckUtils]: 21: Hoare triple {69753#true} assume !(0 == ~cond); {69753#true} is VALID [2022-04-28 05:58:43,783 INFO L290 TraceCheckUtils]: 20: Hoare triple {69753#true} ~cond := #in~cond; {69753#true} is VALID [2022-04-28 05:58:43,783 INFO L272 TraceCheckUtils]: 19: Hoare triple {70391#(< ~counter~0 90)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {69753#true} is VALID [2022-04-28 05:58:43,783 INFO L290 TraceCheckUtils]: 18: Hoare triple {70391#(< ~counter~0 90)} assume !!(#t~post6 < 100);havoc #t~post6; {70391#(< ~counter~0 90)} is VALID [2022-04-28 05:58:43,784 INFO L290 TraceCheckUtils]: 17: Hoare triple {70416#(< ~counter~0 89)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {70391#(< ~counter~0 90)} is VALID [2022-04-28 05:58:43,784 INFO L290 TraceCheckUtils]: 16: Hoare triple {70416#(< ~counter~0 89)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {70416#(< ~counter~0 89)} is VALID [2022-04-28 05:58:43,784 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {69753#true} {70416#(< ~counter~0 89)} #92#return; {70416#(< ~counter~0 89)} is VALID [2022-04-28 05:58:43,784 INFO L290 TraceCheckUtils]: 14: Hoare triple {69753#true} assume true; {69753#true} is VALID [2022-04-28 05:58:43,784 INFO L290 TraceCheckUtils]: 13: Hoare triple {69753#true} assume !(0 == ~cond); {69753#true} is VALID [2022-04-28 05:58:43,785 INFO L290 TraceCheckUtils]: 12: Hoare triple {69753#true} ~cond := #in~cond; {69753#true} is VALID [2022-04-28 05:58:43,785 INFO L272 TraceCheckUtils]: 11: Hoare triple {70416#(< ~counter~0 89)} 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)); {69753#true} is VALID [2022-04-28 05:58:43,785 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {69753#true} {70416#(< ~counter~0 89)} #90#return; {70416#(< ~counter~0 89)} is VALID [2022-04-28 05:58:43,785 INFO L290 TraceCheckUtils]: 9: Hoare triple {69753#true} assume true; {69753#true} is VALID [2022-04-28 05:58:43,785 INFO L290 TraceCheckUtils]: 8: Hoare triple {69753#true} assume !(0 == ~cond); {69753#true} is VALID [2022-04-28 05:58:43,785 INFO L290 TraceCheckUtils]: 7: Hoare triple {69753#true} ~cond := #in~cond; {69753#true} is VALID [2022-04-28 05:58:43,785 INFO L272 TraceCheckUtils]: 6: Hoare triple {70416#(< ~counter~0 89)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {69753#true} is VALID [2022-04-28 05:58:43,785 INFO L290 TraceCheckUtils]: 5: Hoare triple {70416#(< ~counter~0 89)} 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; {70416#(< ~counter~0 89)} is VALID [2022-04-28 05:58:43,786 INFO L272 TraceCheckUtils]: 4: Hoare triple {70416#(< ~counter~0 89)} call #t~ret9 := main(); {70416#(< ~counter~0 89)} is VALID [2022-04-28 05:58:43,786 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70416#(< ~counter~0 89)} {69753#true} #102#return; {70416#(< ~counter~0 89)} is VALID [2022-04-28 05:58:43,786 INFO L290 TraceCheckUtils]: 2: Hoare triple {70416#(< ~counter~0 89)} assume true; {70416#(< ~counter~0 89)} is VALID [2022-04-28 05:58:43,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {69753#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; {70416#(< ~counter~0 89)} is VALID [2022-04-28 05:58:43,787 INFO L272 TraceCheckUtils]: 0: Hoare triple {69753#true} call ULTIMATE.init(); {69753#true} is VALID [2022-04-28 05:58:43,787 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 36 proven. 68 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-04-28 05:58:43,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:58:43,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848963564] [2022-04-28 05:58:43,787 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:58:43,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516496114] [2022-04-28 05:58:43,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [516496114] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:58:43,788 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:58:43,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2022-04-28 05:58:43,788 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:58:43,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [664589973] [2022-04-28 05:58:43,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [664589973] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:58:43,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:58:43,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 05:58:43,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544252568] [2022-04-28 05:58:43,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:58:43,789 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 14 states have internal predecessors, (82), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) Word has length 115 [2022-04-28 05:58:43,789 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:58:43,789 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 14 states have internal predecessors, (82), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-28 05:58:43,869 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:58:43,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 05:58:43,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:58:43,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 05:58:43,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=426, Unknown=0, NotChecked=0, Total=756 [2022-04-28 05:58:43,870 INFO L87 Difference]: Start difference. First operand 578 states and 790 transitions. Second operand has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 14 states have internal predecessors, (82), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-28 05:58:46,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:46,298 INFO L93 Difference]: Finished difference Result 791 states and 1114 transitions. [2022-04-28 05:58:46,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-28 05:58:46,298 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 14 states have internal predecessors, (82), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) Word has length 115 [2022-04-28 05:58:46,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:58:46,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 14 states have internal predecessors, (82), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-28 05:58:46,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 256 transitions. [2022-04-28 05:58:46,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 14 states have internal predecessors, (82), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-28 05:58:46,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 256 transitions. [2022-04-28 05:58:46,303 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 256 transitions. [2022-04-28 05:58:46,518 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 256 edges. 256 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:58:46,533 INFO L225 Difference]: With dead ends: 791 [2022-04-28 05:58:46,533 INFO L226 Difference]: Without dead ends: 594 [2022-04-28 05:58:46,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=590, Invalid=816, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 05:58:46,534 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 124 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 05:58:46,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 313 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 05:58:46,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2022-04-28 05:58:48,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 594. [2022-04-28 05:58:48,140 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:58:48,141 INFO L82 GeneralOperation]: Start isEquivalent. First operand 594 states. Second operand has 594 states, 452 states have (on average 1.2256637168141593) internal successors, (554), 452 states have internal predecessors, (554), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 125 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-28 05:58:48,142 INFO L74 IsIncluded]: Start isIncluded. First operand 594 states. Second operand has 594 states, 452 states have (on average 1.2256637168141593) internal successors, (554), 452 states have internal predecessors, (554), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 125 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-28 05:58:48,142 INFO L87 Difference]: Start difference. First operand 594 states. Second operand has 594 states, 452 states have (on average 1.2256637168141593) internal successors, (554), 452 states have internal predecessors, (554), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 125 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-28 05:58:48,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:48,155 INFO L93 Difference]: Finished difference Result 594 states and 806 transitions. [2022-04-28 05:58:48,155 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 806 transitions. [2022-04-28 05:58:48,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:58:48,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:58:48,156 INFO L74 IsIncluded]: Start isIncluded. First operand has 594 states, 452 states have (on average 1.2256637168141593) internal successors, (554), 452 states have internal predecessors, (554), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 125 states have call predecessors, (125), 125 states have call successors, (125) Second operand 594 states. [2022-04-28 05:58:48,157 INFO L87 Difference]: Start difference. First operand has 594 states, 452 states have (on average 1.2256637168141593) internal successors, (554), 452 states have internal predecessors, (554), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 125 states have call predecessors, (125), 125 states have call successors, (125) Second operand 594 states. [2022-04-28 05:58:48,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:48,170 INFO L93 Difference]: Finished difference Result 594 states and 806 transitions. [2022-04-28 05:58:48,170 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 806 transitions. [2022-04-28 05:58:48,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:58:48,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:58:48,171 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:58:48,171 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:58:48,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 452 states have (on average 1.2256637168141593) internal successors, (554), 452 states have internal predecessors, (554), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 125 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-28 05:58:48,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 806 transitions. [2022-04-28 05:58:48,193 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 806 transitions. Word has length 115 [2022-04-28 05:58:48,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:58:48,193 INFO L495 AbstractCegarLoop]: Abstraction has 594 states and 806 transitions. [2022-04-28 05:58:48,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 14 states have internal predecessors, (82), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-28 05:58:48,193 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 594 states and 806 transitions. [2022-04-28 05:58:50,497 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 806 edges. 806 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:58:50,497 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 806 transitions. [2022-04-28 05:58:50,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-04-28 05:58:50,498 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:58:50,498 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 6, 6, 6, 6, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:58:50,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-04-28 05:58:50,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-04-28 05:58:50,698 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:58:50,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:58:50,698 INFO L85 PathProgramCache]: Analyzing trace with hash 650985841, now seen corresponding path program 7 times [2022-04-28 05:58:50,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:58:50,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2128776903] [2022-04-28 05:58:50,699 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:58:50,699 INFO L85 PathProgramCache]: Analyzing trace with hash 650985841, now seen corresponding path program 8 times [2022-04-28 05:58:50,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:58:50,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030679290] [2022-04-28 05:58:50,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:58:50,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:58:50,709 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:58:50,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1866420875] [2022-04-28 05:58:50,710 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:58:50,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:58:50,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:58:50,710 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:58:50,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-04-28 05:58:50,764 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:58:50,764 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:58:50,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 05:58:50,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:58:50,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:58:51,342 INFO L272 TraceCheckUtils]: 0: Hoare triple {74448#true} call ULTIMATE.init(); {74448#true} is VALID [2022-04-28 05:58:51,343 INFO L290 TraceCheckUtils]: 1: Hoare triple {74448#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; {74456#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:51,343 INFO L290 TraceCheckUtils]: 2: Hoare triple {74456#(<= ~counter~0 0)} assume true; {74456#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:51,344 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {74456#(<= ~counter~0 0)} {74448#true} #102#return; {74456#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:51,344 INFO L272 TraceCheckUtils]: 4: Hoare triple {74456#(<= ~counter~0 0)} call #t~ret9 := main(); {74456#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:51,344 INFO L290 TraceCheckUtils]: 5: Hoare triple {74456#(<= ~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; {74456#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:51,345 INFO L272 TraceCheckUtils]: 6: Hoare triple {74456#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {74456#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:51,345 INFO L290 TraceCheckUtils]: 7: Hoare triple {74456#(<= ~counter~0 0)} ~cond := #in~cond; {74456#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:51,345 INFO L290 TraceCheckUtils]: 8: Hoare triple {74456#(<= ~counter~0 0)} assume !(0 == ~cond); {74456#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:51,345 INFO L290 TraceCheckUtils]: 9: Hoare triple {74456#(<= ~counter~0 0)} assume true; {74456#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:51,346 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {74456#(<= ~counter~0 0)} {74456#(<= ~counter~0 0)} #90#return; {74456#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:51,346 INFO L272 TraceCheckUtils]: 11: Hoare triple {74456#(<= ~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)); {74456#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:51,346 INFO L290 TraceCheckUtils]: 12: Hoare triple {74456#(<= ~counter~0 0)} ~cond := #in~cond; {74456#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:51,347 INFO L290 TraceCheckUtils]: 13: Hoare triple {74456#(<= ~counter~0 0)} assume !(0 == ~cond); {74456#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:51,347 INFO L290 TraceCheckUtils]: 14: Hoare triple {74456#(<= ~counter~0 0)} assume true; {74456#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:51,347 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {74456#(<= ~counter~0 0)} {74456#(<= ~counter~0 0)} #92#return; {74456#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:51,347 INFO L290 TraceCheckUtils]: 16: Hoare triple {74456#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {74456#(<= ~counter~0 0)} is VALID [2022-04-28 05:58:51,349 INFO L290 TraceCheckUtils]: 17: Hoare triple {74456#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {74505#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:51,349 INFO L290 TraceCheckUtils]: 18: Hoare triple {74505#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {74505#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:51,350 INFO L272 TraceCheckUtils]: 19: Hoare triple {74505#(<= ~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)); {74505#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:51,350 INFO L290 TraceCheckUtils]: 20: Hoare triple {74505#(<= ~counter~0 1)} ~cond := #in~cond; {74505#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:51,350 INFO L290 TraceCheckUtils]: 21: Hoare triple {74505#(<= ~counter~0 1)} assume !(0 == ~cond); {74505#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:51,351 INFO L290 TraceCheckUtils]: 22: Hoare triple {74505#(<= ~counter~0 1)} assume true; {74505#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:51,351 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {74505#(<= ~counter~0 1)} {74505#(<= ~counter~0 1)} #94#return; {74505#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:51,351 INFO L290 TraceCheckUtils]: 24: Hoare triple {74505#(<= ~counter~0 1)} assume !!(0 != ~r~0); {74505#(<= ~counter~0 1)} is VALID [2022-04-28 05:58:51,352 INFO L290 TraceCheckUtils]: 25: Hoare triple {74505#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {74530#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:51,352 INFO L290 TraceCheckUtils]: 26: Hoare triple {74530#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {74530#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:51,353 INFO L272 TraceCheckUtils]: 27: Hoare triple {74530#(<= ~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)); {74530#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:51,353 INFO L290 TraceCheckUtils]: 28: Hoare triple {74530#(<= ~counter~0 2)} ~cond := #in~cond; {74530#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:51,353 INFO L290 TraceCheckUtils]: 29: Hoare triple {74530#(<= ~counter~0 2)} assume !(0 == ~cond); {74530#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:51,353 INFO L290 TraceCheckUtils]: 30: Hoare triple {74530#(<= ~counter~0 2)} assume true; {74530#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:51,354 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {74530#(<= ~counter~0 2)} {74530#(<= ~counter~0 2)} #96#return; {74530#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:51,354 INFO L290 TraceCheckUtils]: 32: Hoare triple {74530#(<= ~counter~0 2)} assume !(~r~0 > 0); {74530#(<= ~counter~0 2)} is VALID [2022-04-28 05:58:51,355 INFO L290 TraceCheckUtils]: 33: Hoare triple {74530#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {74555#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:51,355 INFO L290 TraceCheckUtils]: 34: Hoare triple {74555#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {74555#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:51,356 INFO L272 TraceCheckUtils]: 35: Hoare triple {74555#(<= ~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)); {74555#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:51,356 INFO L290 TraceCheckUtils]: 36: Hoare triple {74555#(<= ~counter~0 3)} ~cond := #in~cond; {74555#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:51,356 INFO L290 TraceCheckUtils]: 37: Hoare triple {74555#(<= ~counter~0 3)} assume !(0 == ~cond); {74555#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:51,356 INFO L290 TraceCheckUtils]: 38: Hoare triple {74555#(<= ~counter~0 3)} assume true; {74555#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:51,357 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {74555#(<= ~counter~0 3)} {74555#(<= ~counter~0 3)} #98#return; {74555#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:51,357 INFO L290 TraceCheckUtils]: 40: Hoare triple {74555#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {74555#(<= ~counter~0 3)} is VALID [2022-04-28 05:58:51,358 INFO L290 TraceCheckUtils]: 41: Hoare triple {74555#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {74580#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:51,358 INFO L290 TraceCheckUtils]: 42: Hoare triple {74580#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {74580#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:51,359 INFO L272 TraceCheckUtils]: 43: Hoare triple {74580#(<= ~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)); {74580#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:51,359 INFO L290 TraceCheckUtils]: 44: Hoare triple {74580#(<= ~counter~0 4)} ~cond := #in~cond; {74580#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:51,359 INFO L290 TraceCheckUtils]: 45: Hoare triple {74580#(<= ~counter~0 4)} assume !(0 == ~cond); {74580#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:51,359 INFO L290 TraceCheckUtils]: 46: Hoare triple {74580#(<= ~counter~0 4)} assume true; {74580#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:51,360 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {74580#(<= ~counter~0 4)} {74580#(<= ~counter~0 4)} #98#return; {74580#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:51,360 INFO L290 TraceCheckUtils]: 48: Hoare triple {74580#(<= ~counter~0 4)} assume !(~r~0 < 0); {74580#(<= ~counter~0 4)} is VALID [2022-04-28 05:58:51,361 INFO L290 TraceCheckUtils]: 49: Hoare triple {74580#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {74605#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:51,361 INFO L290 TraceCheckUtils]: 50: Hoare triple {74605#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {74605#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:51,361 INFO L272 TraceCheckUtils]: 51: Hoare triple {74605#(<= ~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)); {74605#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:51,362 INFO L290 TraceCheckUtils]: 52: Hoare triple {74605#(<= ~counter~0 5)} ~cond := #in~cond; {74605#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:51,362 INFO L290 TraceCheckUtils]: 53: Hoare triple {74605#(<= ~counter~0 5)} assume !(0 == ~cond); {74605#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:51,362 INFO L290 TraceCheckUtils]: 54: Hoare triple {74605#(<= ~counter~0 5)} assume true; {74605#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:51,363 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {74605#(<= ~counter~0 5)} {74605#(<= ~counter~0 5)} #94#return; {74605#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:51,363 INFO L290 TraceCheckUtils]: 56: Hoare triple {74605#(<= ~counter~0 5)} assume !!(0 != ~r~0); {74605#(<= ~counter~0 5)} is VALID [2022-04-28 05:58:51,364 INFO L290 TraceCheckUtils]: 57: Hoare triple {74605#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {74630#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:51,364 INFO L290 TraceCheckUtils]: 58: Hoare triple {74630#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {74630#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:51,364 INFO L272 TraceCheckUtils]: 59: Hoare triple {74630#(<= ~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)); {74630#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:51,365 INFO L290 TraceCheckUtils]: 60: Hoare triple {74630#(<= ~counter~0 6)} ~cond := #in~cond; {74630#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:51,365 INFO L290 TraceCheckUtils]: 61: Hoare triple {74630#(<= ~counter~0 6)} assume !(0 == ~cond); {74630#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:51,365 INFO L290 TraceCheckUtils]: 62: Hoare triple {74630#(<= ~counter~0 6)} assume true; {74630#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:51,366 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {74630#(<= ~counter~0 6)} {74630#(<= ~counter~0 6)} #96#return; {74630#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:51,366 INFO L290 TraceCheckUtils]: 64: Hoare triple {74630#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {74630#(<= ~counter~0 6)} is VALID [2022-04-28 05:58:51,367 INFO L290 TraceCheckUtils]: 65: Hoare triple {74630#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {74655#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:51,367 INFO L290 TraceCheckUtils]: 66: Hoare triple {74655#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {74655#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:51,367 INFO L272 TraceCheckUtils]: 67: Hoare triple {74655#(<= ~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)); {74655#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:51,382 INFO L290 TraceCheckUtils]: 68: Hoare triple {74655#(<= ~counter~0 7)} ~cond := #in~cond; {74655#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:51,383 INFO L290 TraceCheckUtils]: 69: Hoare triple {74655#(<= ~counter~0 7)} assume !(0 == ~cond); {74655#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:51,383 INFO L290 TraceCheckUtils]: 70: Hoare triple {74655#(<= ~counter~0 7)} assume true; {74655#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:51,383 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {74655#(<= ~counter~0 7)} {74655#(<= ~counter~0 7)} #96#return; {74655#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:51,384 INFO L290 TraceCheckUtils]: 72: Hoare triple {74655#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {74655#(<= ~counter~0 7)} is VALID [2022-04-28 05:58:51,385 INFO L290 TraceCheckUtils]: 73: Hoare triple {74655#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {74680#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:51,385 INFO L290 TraceCheckUtils]: 74: Hoare triple {74680#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {74680#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:51,385 INFO L272 TraceCheckUtils]: 75: Hoare triple {74680#(<= ~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)); {74680#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:51,386 INFO L290 TraceCheckUtils]: 76: Hoare triple {74680#(<= ~counter~0 8)} ~cond := #in~cond; {74680#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:51,386 INFO L290 TraceCheckUtils]: 77: Hoare triple {74680#(<= ~counter~0 8)} assume !(0 == ~cond); {74680#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:51,386 INFO L290 TraceCheckUtils]: 78: Hoare triple {74680#(<= ~counter~0 8)} assume true; {74680#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:51,387 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {74680#(<= ~counter~0 8)} {74680#(<= ~counter~0 8)} #96#return; {74680#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:51,387 INFO L290 TraceCheckUtils]: 80: Hoare triple {74680#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {74680#(<= ~counter~0 8)} is VALID [2022-04-28 05:58:51,388 INFO L290 TraceCheckUtils]: 81: Hoare triple {74680#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {74705#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:51,388 INFO L290 TraceCheckUtils]: 82: Hoare triple {74705#(<= ~counter~0 9)} assume !!(#t~post7 < 100);havoc #t~post7; {74705#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:51,388 INFO L272 TraceCheckUtils]: 83: Hoare triple {74705#(<= ~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)); {74705#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:51,389 INFO L290 TraceCheckUtils]: 84: Hoare triple {74705#(<= ~counter~0 9)} ~cond := #in~cond; {74705#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:51,389 INFO L290 TraceCheckUtils]: 85: Hoare triple {74705#(<= ~counter~0 9)} assume !(0 == ~cond); {74705#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:51,389 INFO L290 TraceCheckUtils]: 86: Hoare triple {74705#(<= ~counter~0 9)} assume true; {74705#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:51,390 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {74705#(<= ~counter~0 9)} {74705#(<= ~counter~0 9)} #96#return; {74705#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:51,390 INFO L290 TraceCheckUtils]: 88: Hoare triple {74705#(<= ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {74705#(<= ~counter~0 9)} is VALID [2022-04-28 05:58:51,391 INFO L290 TraceCheckUtils]: 89: Hoare triple {74705#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {74730#(<= ~counter~0 10)} is VALID [2022-04-28 05:58:51,391 INFO L290 TraceCheckUtils]: 90: Hoare triple {74730#(<= ~counter~0 10)} assume !!(#t~post7 < 100);havoc #t~post7; {74730#(<= ~counter~0 10)} is VALID [2022-04-28 05:58:51,391 INFO L272 TraceCheckUtils]: 91: Hoare triple {74730#(<= ~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)); {74730#(<= ~counter~0 10)} is VALID [2022-04-28 05:58:51,392 INFO L290 TraceCheckUtils]: 92: Hoare triple {74730#(<= ~counter~0 10)} ~cond := #in~cond; {74730#(<= ~counter~0 10)} is VALID [2022-04-28 05:58:51,392 INFO L290 TraceCheckUtils]: 93: Hoare triple {74730#(<= ~counter~0 10)} assume !(0 == ~cond); {74730#(<= ~counter~0 10)} is VALID [2022-04-28 05:58:51,392 INFO L290 TraceCheckUtils]: 94: Hoare triple {74730#(<= ~counter~0 10)} assume true; {74730#(<= ~counter~0 10)} is VALID [2022-04-28 05:58:51,392 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {74730#(<= ~counter~0 10)} {74730#(<= ~counter~0 10)} #96#return; {74730#(<= ~counter~0 10)} is VALID [2022-04-28 05:58:51,393 INFO L290 TraceCheckUtils]: 96: Hoare triple {74730#(<= ~counter~0 10)} assume !(~r~0 > 0); {74730#(<= ~counter~0 10)} is VALID [2022-04-28 05:58:51,393 INFO L290 TraceCheckUtils]: 97: Hoare triple {74730#(<= ~counter~0 10)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {74755#(<= ~counter~0 11)} is VALID [2022-04-28 05:58:51,394 INFO L290 TraceCheckUtils]: 98: Hoare triple {74755#(<= ~counter~0 11)} assume !!(#t~post8 < 100);havoc #t~post8; {74755#(<= ~counter~0 11)} is VALID [2022-04-28 05:58:51,394 INFO L272 TraceCheckUtils]: 99: Hoare triple {74755#(<= ~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)); {74755#(<= ~counter~0 11)} is VALID [2022-04-28 05:58:51,394 INFO L290 TraceCheckUtils]: 100: Hoare triple {74755#(<= ~counter~0 11)} ~cond := #in~cond; {74755#(<= ~counter~0 11)} is VALID [2022-04-28 05:58:51,395 INFO L290 TraceCheckUtils]: 101: Hoare triple {74755#(<= ~counter~0 11)} assume !(0 == ~cond); {74755#(<= ~counter~0 11)} is VALID [2022-04-28 05:58:51,395 INFO L290 TraceCheckUtils]: 102: Hoare triple {74755#(<= ~counter~0 11)} assume true; {74755#(<= ~counter~0 11)} is VALID [2022-04-28 05:58:51,395 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {74755#(<= ~counter~0 11)} {74755#(<= ~counter~0 11)} #98#return; {74755#(<= ~counter~0 11)} is VALID [2022-04-28 05:58:51,396 INFO L290 TraceCheckUtils]: 104: Hoare triple {74755#(<= ~counter~0 11)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {74755#(<= ~counter~0 11)} is VALID [2022-04-28 05:58:51,396 INFO L290 TraceCheckUtils]: 105: Hoare triple {74755#(<= ~counter~0 11)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {74780#(<= ~counter~0 12)} is VALID [2022-04-28 05:58:51,397 INFO L290 TraceCheckUtils]: 106: Hoare triple {74780#(<= ~counter~0 12)} assume !!(#t~post8 < 100);havoc #t~post8; {74780#(<= ~counter~0 12)} is VALID [2022-04-28 05:58:51,397 INFO L272 TraceCheckUtils]: 107: Hoare triple {74780#(<= ~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)); {74780#(<= ~counter~0 12)} is VALID [2022-04-28 05:58:51,397 INFO L290 TraceCheckUtils]: 108: Hoare triple {74780#(<= ~counter~0 12)} ~cond := #in~cond; {74780#(<= ~counter~0 12)} is VALID [2022-04-28 05:58:51,398 INFO L290 TraceCheckUtils]: 109: Hoare triple {74780#(<= ~counter~0 12)} assume !(0 == ~cond); {74780#(<= ~counter~0 12)} is VALID [2022-04-28 05:58:51,398 INFO L290 TraceCheckUtils]: 110: Hoare triple {74780#(<= ~counter~0 12)} assume true; {74780#(<= ~counter~0 12)} is VALID [2022-04-28 05:58:51,398 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {74780#(<= ~counter~0 12)} {74780#(<= ~counter~0 12)} #98#return; {74780#(<= ~counter~0 12)} is VALID [2022-04-28 05:58:51,399 INFO L290 TraceCheckUtils]: 112: Hoare triple {74780#(<= ~counter~0 12)} assume !(~r~0 < 0); {74780#(<= ~counter~0 12)} is VALID [2022-04-28 05:58:51,399 INFO L290 TraceCheckUtils]: 113: Hoare triple {74780#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {74805#(<= |main_#t~post6| 12)} is VALID [2022-04-28 05:58:51,399 INFO L290 TraceCheckUtils]: 114: Hoare triple {74805#(<= |main_#t~post6| 12)} assume !(#t~post6 < 100);havoc #t~post6; {74449#false} is VALID [2022-04-28 05:58:51,399 INFO L272 TraceCheckUtils]: 115: Hoare triple {74449#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)); {74449#false} is VALID [2022-04-28 05:58:51,400 INFO L290 TraceCheckUtils]: 116: Hoare triple {74449#false} ~cond := #in~cond; {74449#false} is VALID [2022-04-28 05:58:51,400 INFO L290 TraceCheckUtils]: 117: Hoare triple {74449#false} assume 0 == ~cond; {74449#false} is VALID [2022-04-28 05:58:51,400 INFO L290 TraceCheckUtils]: 118: Hoare triple {74449#false} assume !false; {74449#false} is VALID [2022-04-28 05:58:51,400 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 24 proven. 356 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:58:51,400 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:58:52,077 INFO L290 TraceCheckUtils]: 118: Hoare triple {74449#false} assume !false; {74449#false} is VALID [2022-04-28 05:58:52,077 INFO L290 TraceCheckUtils]: 117: Hoare triple {74449#false} assume 0 == ~cond; {74449#false} is VALID [2022-04-28 05:58:52,077 INFO L290 TraceCheckUtils]: 116: Hoare triple {74449#false} ~cond := #in~cond; {74449#false} is VALID [2022-04-28 05:58:52,077 INFO L272 TraceCheckUtils]: 115: Hoare triple {74449#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)); {74449#false} is VALID [2022-04-28 05:58:52,077 INFO L290 TraceCheckUtils]: 114: Hoare triple {74833#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {74449#false} is VALID [2022-04-28 05:58:52,078 INFO L290 TraceCheckUtils]: 113: Hoare triple {74837#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {74833#(< |main_#t~post6| 100)} is VALID [2022-04-28 05:58:52,078 INFO L290 TraceCheckUtils]: 112: Hoare triple {74837#(< ~counter~0 100)} assume !(~r~0 < 0); {74837#(< ~counter~0 100)} is VALID [2022-04-28 05:58:52,078 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {74448#true} {74837#(< ~counter~0 100)} #98#return; {74837#(< ~counter~0 100)} is VALID [2022-04-28 05:58:52,079 INFO L290 TraceCheckUtils]: 110: Hoare triple {74448#true} assume true; {74448#true} is VALID [2022-04-28 05:58:52,079 INFO L290 TraceCheckUtils]: 109: Hoare triple {74448#true} assume !(0 == ~cond); {74448#true} is VALID [2022-04-28 05:58:52,079 INFO L290 TraceCheckUtils]: 108: Hoare triple {74448#true} ~cond := #in~cond; {74448#true} is VALID [2022-04-28 05:58:52,079 INFO L272 TraceCheckUtils]: 107: Hoare triple {74837#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74448#true} is VALID [2022-04-28 05:58:52,079 INFO L290 TraceCheckUtils]: 106: Hoare triple {74837#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {74837#(< ~counter~0 100)} is VALID [2022-04-28 05:58:52,081 INFO L290 TraceCheckUtils]: 105: Hoare triple {74862#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {74837#(< ~counter~0 100)} is VALID [2022-04-28 05:58:52,081 INFO L290 TraceCheckUtils]: 104: Hoare triple {74862#(< ~counter~0 99)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {74862#(< ~counter~0 99)} is VALID [2022-04-28 05:58:52,082 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {74448#true} {74862#(< ~counter~0 99)} #98#return; {74862#(< ~counter~0 99)} is VALID [2022-04-28 05:58:52,082 INFO L290 TraceCheckUtils]: 102: Hoare triple {74448#true} assume true; {74448#true} is VALID [2022-04-28 05:58:52,082 INFO L290 TraceCheckUtils]: 101: Hoare triple {74448#true} assume !(0 == ~cond); {74448#true} is VALID [2022-04-28 05:58:52,082 INFO L290 TraceCheckUtils]: 100: Hoare triple {74448#true} ~cond := #in~cond; {74448#true} is VALID [2022-04-28 05:58:52,082 INFO L272 TraceCheckUtils]: 99: Hoare triple {74862#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74448#true} is VALID [2022-04-28 05:58:52,082 INFO L290 TraceCheckUtils]: 98: Hoare triple {74862#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {74862#(< ~counter~0 99)} is VALID [2022-04-28 05:58:52,083 INFO L290 TraceCheckUtils]: 97: Hoare triple {74887#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {74862#(< ~counter~0 99)} is VALID [2022-04-28 05:58:52,083 INFO L290 TraceCheckUtils]: 96: Hoare triple {74887#(< ~counter~0 98)} assume !(~r~0 > 0); {74887#(< ~counter~0 98)} is VALID [2022-04-28 05:58:52,084 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {74448#true} {74887#(< ~counter~0 98)} #96#return; {74887#(< ~counter~0 98)} is VALID [2022-04-28 05:58:52,084 INFO L290 TraceCheckUtils]: 94: Hoare triple {74448#true} assume true; {74448#true} is VALID [2022-04-28 05:58:52,084 INFO L290 TraceCheckUtils]: 93: Hoare triple {74448#true} assume !(0 == ~cond); {74448#true} is VALID [2022-04-28 05:58:52,084 INFO L290 TraceCheckUtils]: 92: Hoare triple {74448#true} ~cond := #in~cond; {74448#true} is VALID [2022-04-28 05:58:52,084 INFO L272 TraceCheckUtils]: 91: Hoare triple {74887#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74448#true} is VALID [2022-04-28 05:58:52,084 INFO L290 TraceCheckUtils]: 90: Hoare triple {74887#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {74887#(< ~counter~0 98)} is VALID [2022-04-28 05:58:52,085 INFO L290 TraceCheckUtils]: 89: Hoare triple {74912#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {74887#(< ~counter~0 98)} is VALID [2022-04-28 05:58:52,085 INFO L290 TraceCheckUtils]: 88: Hoare triple {74912#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {74912#(< ~counter~0 97)} is VALID [2022-04-28 05:58:52,086 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {74448#true} {74912#(< ~counter~0 97)} #96#return; {74912#(< ~counter~0 97)} is VALID [2022-04-28 05:58:52,086 INFO L290 TraceCheckUtils]: 86: Hoare triple {74448#true} assume true; {74448#true} is VALID [2022-04-28 05:58:52,086 INFO L290 TraceCheckUtils]: 85: Hoare triple {74448#true} assume !(0 == ~cond); {74448#true} is VALID [2022-04-28 05:58:52,086 INFO L290 TraceCheckUtils]: 84: Hoare triple {74448#true} ~cond := #in~cond; {74448#true} is VALID [2022-04-28 05:58:52,086 INFO L272 TraceCheckUtils]: 83: Hoare triple {74912#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74448#true} is VALID [2022-04-28 05:58:52,086 INFO L290 TraceCheckUtils]: 82: Hoare triple {74912#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {74912#(< ~counter~0 97)} is VALID [2022-04-28 05:58:52,087 INFO L290 TraceCheckUtils]: 81: Hoare triple {74937#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {74912#(< ~counter~0 97)} is VALID [2022-04-28 05:58:52,087 INFO L290 TraceCheckUtils]: 80: Hoare triple {74937#(< ~counter~0 96)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {74937#(< ~counter~0 96)} is VALID [2022-04-28 05:58:52,088 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {74448#true} {74937#(< ~counter~0 96)} #96#return; {74937#(< ~counter~0 96)} is VALID [2022-04-28 05:58:52,088 INFO L290 TraceCheckUtils]: 78: Hoare triple {74448#true} assume true; {74448#true} is VALID [2022-04-28 05:58:52,088 INFO L290 TraceCheckUtils]: 77: Hoare triple {74448#true} assume !(0 == ~cond); {74448#true} is VALID [2022-04-28 05:58:52,088 INFO L290 TraceCheckUtils]: 76: Hoare triple {74448#true} ~cond := #in~cond; {74448#true} is VALID [2022-04-28 05:58:52,088 INFO L272 TraceCheckUtils]: 75: Hoare triple {74937#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74448#true} is VALID [2022-04-28 05:58:52,089 INFO L290 TraceCheckUtils]: 74: Hoare triple {74937#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {74937#(< ~counter~0 96)} is VALID [2022-04-28 05:58:52,089 INFO L290 TraceCheckUtils]: 73: Hoare triple {74962#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {74937#(< ~counter~0 96)} is VALID [2022-04-28 05:58:52,090 INFO L290 TraceCheckUtils]: 72: Hoare triple {74962#(< ~counter~0 95)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {74962#(< ~counter~0 95)} is VALID [2022-04-28 05:58:52,090 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {74448#true} {74962#(< ~counter~0 95)} #96#return; {74962#(< ~counter~0 95)} is VALID [2022-04-28 05:58:52,090 INFO L290 TraceCheckUtils]: 70: Hoare triple {74448#true} assume true; {74448#true} is VALID [2022-04-28 05:58:52,090 INFO L290 TraceCheckUtils]: 69: Hoare triple {74448#true} assume !(0 == ~cond); {74448#true} is VALID [2022-04-28 05:58:52,090 INFO L290 TraceCheckUtils]: 68: Hoare triple {74448#true} ~cond := #in~cond; {74448#true} is VALID [2022-04-28 05:58:52,090 INFO L272 TraceCheckUtils]: 67: Hoare triple {74962#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74448#true} is VALID [2022-04-28 05:58:52,091 INFO L290 TraceCheckUtils]: 66: Hoare triple {74962#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {74962#(< ~counter~0 95)} is VALID [2022-04-28 05:58:52,092 INFO L290 TraceCheckUtils]: 65: Hoare triple {74987#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {74962#(< ~counter~0 95)} is VALID [2022-04-28 05:58:52,092 INFO L290 TraceCheckUtils]: 64: Hoare triple {74987#(< ~counter~0 94)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {74987#(< ~counter~0 94)} is VALID [2022-04-28 05:58:52,092 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {74448#true} {74987#(< ~counter~0 94)} #96#return; {74987#(< ~counter~0 94)} is VALID [2022-04-28 05:58:52,092 INFO L290 TraceCheckUtils]: 62: Hoare triple {74448#true} assume true; {74448#true} is VALID [2022-04-28 05:58:52,093 INFO L290 TraceCheckUtils]: 61: Hoare triple {74448#true} assume !(0 == ~cond); {74448#true} is VALID [2022-04-28 05:58:52,093 INFO L290 TraceCheckUtils]: 60: Hoare triple {74448#true} ~cond := #in~cond; {74448#true} is VALID [2022-04-28 05:58:52,093 INFO L272 TraceCheckUtils]: 59: Hoare triple {74987#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74448#true} is VALID [2022-04-28 05:58:52,093 INFO L290 TraceCheckUtils]: 58: Hoare triple {74987#(< ~counter~0 94)} assume !!(#t~post7 < 100);havoc #t~post7; {74987#(< ~counter~0 94)} is VALID [2022-04-28 05:58:52,094 INFO L290 TraceCheckUtils]: 57: Hoare triple {75012#(< ~counter~0 93)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {74987#(< ~counter~0 94)} is VALID [2022-04-28 05:58:52,094 INFO L290 TraceCheckUtils]: 56: Hoare triple {75012#(< ~counter~0 93)} assume !!(0 != ~r~0); {75012#(< ~counter~0 93)} is VALID [2022-04-28 05:58:52,095 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {74448#true} {75012#(< ~counter~0 93)} #94#return; {75012#(< ~counter~0 93)} is VALID [2022-04-28 05:58:52,095 INFO L290 TraceCheckUtils]: 54: Hoare triple {74448#true} assume true; {74448#true} is VALID [2022-04-28 05:58:52,095 INFO L290 TraceCheckUtils]: 53: Hoare triple {74448#true} assume !(0 == ~cond); {74448#true} is VALID [2022-04-28 05:58:52,095 INFO L290 TraceCheckUtils]: 52: Hoare triple {74448#true} ~cond := #in~cond; {74448#true} is VALID [2022-04-28 05:58:52,095 INFO L272 TraceCheckUtils]: 51: Hoare triple {75012#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74448#true} is VALID [2022-04-28 05:58:52,095 INFO L290 TraceCheckUtils]: 50: Hoare triple {75012#(< ~counter~0 93)} assume !!(#t~post6 < 100);havoc #t~post6; {75012#(< ~counter~0 93)} is VALID [2022-04-28 05:58:52,096 INFO L290 TraceCheckUtils]: 49: Hoare triple {75037#(< ~counter~0 92)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {75012#(< ~counter~0 93)} is VALID [2022-04-28 05:58:52,096 INFO L290 TraceCheckUtils]: 48: Hoare triple {75037#(< ~counter~0 92)} assume !(~r~0 < 0); {75037#(< ~counter~0 92)} is VALID [2022-04-28 05:58:52,097 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {74448#true} {75037#(< ~counter~0 92)} #98#return; {75037#(< ~counter~0 92)} is VALID [2022-04-28 05:58:52,097 INFO L290 TraceCheckUtils]: 46: Hoare triple {74448#true} assume true; {74448#true} is VALID [2022-04-28 05:58:52,097 INFO L290 TraceCheckUtils]: 45: Hoare triple {74448#true} assume !(0 == ~cond); {74448#true} is VALID [2022-04-28 05:58:52,097 INFO L290 TraceCheckUtils]: 44: Hoare triple {74448#true} ~cond := #in~cond; {74448#true} is VALID [2022-04-28 05:58:52,097 INFO L272 TraceCheckUtils]: 43: Hoare triple {75037#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74448#true} is VALID [2022-04-28 05:58:52,097 INFO L290 TraceCheckUtils]: 42: Hoare triple {75037#(< ~counter~0 92)} assume !!(#t~post8 < 100);havoc #t~post8; {75037#(< ~counter~0 92)} is VALID [2022-04-28 05:58:52,098 INFO L290 TraceCheckUtils]: 41: Hoare triple {75062#(< ~counter~0 91)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {75037#(< ~counter~0 92)} is VALID [2022-04-28 05:58:52,098 INFO L290 TraceCheckUtils]: 40: Hoare triple {75062#(< ~counter~0 91)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {75062#(< ~counter~0 91)} is VALID [2022-04-28 05:58:52,099 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {74448#true} {75062#(< ~counter~0 91)} #98#return; {75062#(< ~counter~0 91)} is VALID [2022-04-28 05:58:52,099 INFO L290 TraceCheckUtils]: 38: Hoare triple {74448#true} assume true; {74448#true} is VALID [2022-04-28 05:58:52,099 INFO L290 TraceCheckUtils]: 37: Hoare triple {74448#true} assume !(0 == ~cond); {74448#true} is VALID [2022-04-28 05:58:52,099 INFO L290 TraceCheckUtils]: 36: Hoare triple {74448#true} ~cond := #in~cond; {74448#true} is VALID [2022-04-28 05:58:52,099 INFO L272 TraceCheckUtils]: 35: Hoare triple {75062#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74448#true} is VALID [2022-04-28 05:58:52,100 INFO L290 TraceCheckUtils]: 34: Hoare triple {75062#(< ~counter~0 91)} assume !!(#t~post8 < 100);havoc #t~post8; {75062#(< ~counter~0 91)} is VALID [2022-04-28 05:58:52,100 INFO L290 TraceCheckUtils]: 33: Hoare triple {75087#(< ~counter~0 90)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {75062#(< ~counter~0 91)} is VALID [2022-04-28 05:58:52,101 INFO L290 TraceCheckUtils]: 32: Hoare triple {75087#(< ~counter~0 90)} assume !(~r~0 > 0); {75087#(< ~counter~0 90)} is VALID [2022-04-28 05:58:52,101 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {74448#true} {75087#(< ~counter~0 90)} #96#return; {75087#(< ~counter~0 90)} is VALID [2022-04-28 05:58:52,101 INFO L290 TraceCheckUtils]: 30: Hoare triple {74448#true} assume true; {74448#true} is VALID [2022-04-28 05:58:52,101 INFO L290 TraceCheckUtils]: 29: Hoare triple {74448#true} assume !(0 == ~cond); {74448#true} is VALID [2022-04-28 05:58:52,101 INFO L290 TraceCheckUtils]: 28: Hoare triple {74448#true} ~cond := #in~cond; {74448#true} is VALID [2022-04-28 05:58:52,102 INFO L272 TraceCheckUtils]: 27: Hoare triple {75087#(< ~counter~0 90)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74448#true} is VALID [2022-04-28 05:58:52,102 INFO L290 TraceCheckUtils]: 26: Hoare triple {75087#(< ~counter~0 90)} assume !!(#t~post7 < 100);havoc #t~post7; {75087#(< ~counter~0 90)} is VALID [2022-04-28 05:58:52,103 INFO L290 TraceCheckUtils]: 25: Hoare triple {75112#(< ~counter~0 89)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {75087#(< ~counter~0 90)} is VALID [2022-04-28 05:58:52,103 INFO L290 TraceCheckUtils]: 24: Hoare triple {75112#(< ~counter~0 89)} assume !!(0 != ~r~0); {75112#(< ~counter~0 89)} is VALID [2022-04-28 05:58:52,104 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {74448#true} {75112#(< ~counter~0 89)} #94#return; {75112#(< ~counter~0 89)} is VALID [2022-04-28 05:58:52,104 INFO L290 TraceCheckUtils]: 22: Hoare triple {74448#true} assume true; {74448#true} is VALID [2022-04-28 05:58:52,104 INFO L290 TraceCheckUtils]: 21: Hoare triple {74448#true} assume !(0 == ~cond); {74448#true} is VALID [2022-04-28 05:58:52,104 INFO L290 TraceCheckUtils]: 20: Hoare triple {74448#true} ~cond := #in~cond; {74448#true} is VALID [2022-04-28 05:58:52,104 INFO L272 TraceCheckUtils]: 19: Hoare triple {75112#(< ~counter~0 89)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74448#true} is VALID [2022-04-28 05:58:52,104 INFO L290 TraceCheckUtils]: 18: Hoare triple {75112#(< ~counter~0 89)} assume !!(#t~post6 < 100);havoc #t~post6; {75112#(< ~counter~0 89)} is VALID [2022-04-28 05:58:52,105 INFO L290 TraceCheckUtils]: 17: Hoare triple {75137#(< ~counter~0 88)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {75112#(< ~counter~0 89)} is VALID [2022-04-28 05:58:52,105 INFO L290 TraceCheckUtils]: 16: Hoare triple {75137#(< ~counter~0 88)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {75137#(< ~counter~0 88)} is VALID [2022-04-28 05:58:52,106 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {74448#true} {75137#(< ~counter~0 88)} #92#return; {75137#(< ~counter~0 88)} is VALID [2022-04-28 05:58:52,106 INFO L290 TraceCheckUtils]: 14: Hoare triple {74448#true} assume true; {74448#true} is VALID [2022-04-28 05:58:52,106 INFO L290 TraceCheckUtils]: 13: Hoare triple {74448#true} assume !(0 == ~cond); {74448#true} is VALID [2022-04-28 05:58:52,106 INFO L290 TraceCheckUtils]: 12: Hoare triple {74448#true} ~cond := #in~cond; {74448#true} is VALID [2022-04-28 05:58:52,106 INFO L272 TraceCheckUtils]: 11: Hoare triple {75137#(< ~counter~0 88)} 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)); {74448#true} is VALID [2022-04-28 05:58:52,107 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {74448#true} {75137#(< ~counter~0 88)} #90#return; {75137#(< ~counter~0 88)} is VALID [2022-04-28 05:58:52,107 INFO L290 TraceCheckUtils]: 9: Hoare triple {74448#true} assume true; {74448#true} is VALID [2022-04-28 05:58:52,107 INFO L290 TraceCheckUtils]: 8: Hoare triple {74448#true} assume !(0 == ~cond); {74448#true} is VALID [2022-04-28 05:58:52,107 INFO L290 TraceCheckUtils]: 7: Hoare triple {74448#true} ~cond := #in~cond; {74448#true} is VALID [2022-04-28 05:58:52,107 INFO L272 TraceCheckUtils]: 6: Hoare triple {75137#(< ~counter~0 88)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {74448#true} is VALID [2022-04-28 05:58:52,107 INFO L290 TraceCheckUtils]: 5: Hoare triple {75137#(< ~counter~0 88)} 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; {75137#(< ~counter~0 88)} is VALID [2022-04-28 05:58:52,108 INFO L272 TraceCheckUtils]: 4: Hoare triple {75137#(< ~counter~0 88)} call #t~ret9 := main(); {75137#(< ~counter~0 88)} is VALID [2022-04-28 05:58:52,108 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {75137#(< ~counter~0 88)} {74448#true} #102#return; {75137#(< ~counter~0 88)} is VALID [2022-04-28 05:58:52,108 INFO L290 TraceCheckUtils]: 2: Hoare triple {75137#(< ~counter~0 88)} assume true; {75137#(< ~counter~0 88)} is VALID [2022-04-28 05:58:52,109 INFO L290 TraceCheckUtils]: 1: Hoare triple {74448#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; {75137#(< ~counter~0 88)} is VALID [2022-04-28 05:58:52,109 INFO L272 TraceCheckUtils]: 0: Hoare triple {74448#true} call ULTIMATE.init(); {74448#true} is VALID [2022-04-28 05:58:52,109 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 24 proven. 92 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2022-04-28 05:58:52,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:58:52,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030679290] [2022-04-28 05:58:52,109 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:58:52,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866420875] [2022-04-28 05:58:52,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1866420875] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:58:52,110 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:58:52,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2022-04-28 05:58:52,110 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:58:52,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2128776903] [2022-04-28 05:58:52,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2128776903] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:58:52,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:58:52,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 05:58:52,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986855841] [2022-04-28 05:58:52,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:58:52,112 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.25) internal successors, (84), 15 states have internal predecessors, (84), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) Word has length 119 [2022-04-28 05:58:52,112 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:58:52,112 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 5.25) internal successors, (84), 15 states have internal predecessors, (84), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-28 05:58:52,217 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:58:52,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 05:58:52,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:58:52,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 05:58:52,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=383, Invalid=487, Unknown=0, NotChecked=0, Total=870 [2022-04-28 05:58:52,218 INFO L87 Difference]: Start difference. First operand 594 states and 806 transitions. Second operand has 16 states, 16 states have (on average 5.25) internal successors, (84), 15 states have internal predecessors, (84), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-28 05:58:55,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:55,043 INFO L93 Difference]: Finished difference Result 649 states and 883 transitions. [2022-04-28 05:58:55,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-28 05:58:55,044 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.25) internal successors, (84), 15 states have internal predecessors, (84), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) Word has length 119 [2022-04-28 05:58:55,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:58:55,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 5.25) internal successors, (84), 15 states have internal predecessors, (84), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-28 05:58:55,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 254 transitions. [2022-04-28 05:58:55,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 5.25) internal successors, (84), 15 states have internal predecessors, (84), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-28 05:58:55,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 254 transitions. [2022-04-28 05:58:55,047 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 254 transitions. [2022-04-28 05:58:55,255 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 254 edges. 254 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:58:55,272 INFO L225 Difference]: With dead ends: 649 [2022-04-28 05:58:55,272 INFO L226 Difference]: Without dead ends: 638 [2022-04-28 05:58:55,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=620, Invalid=862, Unknown=0, NotChecked=0, Total=1482 [2022-04-28 05:58:55,273 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 163 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 05:58:55,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 295 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 05:58:55,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2022-04-28 05:58:56,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 616. [2022-04-28 05:58:56,928 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:58:56,929 INFO L82 GeneralOperation]: Start isEquivalent. First operand 638 states. Second operand has 616 states, 460 states have (on average 1.2239130434782608) internal successors, (563), 470 states have internal predecessors, (563), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 128 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-28 05:58:56,929 INFO L74 IsIncluded]: Start isIncluded. First operand 638 states. Second operand has 616 states, 460 states have (on average 1.2239130434782608) internal successors, (563), 470 states have internal predecessors, (563), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 128 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-28 05:58:56,930 INFO L87 Difference]: Start difference. First operand 638 states. Second operand has 616 states, 460 states have (on average 1.2239130434782608) internal successors, (563), 470 states have internal predecessors, (563), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 128 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-28 05:58:56,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:56,945 INFO L93 Difference]: Finished difference Result 638 states and 867 transitions. [2022-04-28 05:58:56,945 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 867 transitions. [2022-04-28 05:58:56,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:58:56,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:58:56,946 INFO L74 IsIncluded]: Start isIncluded. First operand has 616 states, 460 states have (on average 1.2239130434782608) internal successors, (563), 470 states have internal predecessors, (563), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 128 states have call predecessors, (138), 138 states have call successors, (138) Second operand 638 states. [2022-04-28 05:58:56,947 INFO L87 Difference]: Start difference. First operand has 616 states, 460 states have (on average 1.2239130434782608) internal successors, (563), 470 states have internal predecessors, (563), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 128 states have call predecessors, (138), 138 states have call successors, (138) Second operand 638 states. [2022-04-28 05:58:56,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:56,961 INFO L93 Difference]: Finished difference Result 638 states and 867 transitions. [2022-04-28 05:58:56,961 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 867 transitions. [2022-04-28 05:58:56,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:58:56,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:58:56,962 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:58:56,962 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:58:56,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 460 states have (on average 1.2239130434782608) internal successors, (563), 470 states have internal predecessors, (563), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 128 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-28 05:58:56,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 841 transitions. [2022-04-28 05:58:56,988 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 841 transitions. Word has length 119 [2022-04-28 05:58:56,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:58:56,988 INFO L495 AbstractCegarLoop]: Abstraction has 616 states and 841 transitions. [2022-04-28 05:58:56,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.25) internal successors, (84), 15 states have internal predecessors, (84), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-28 05:58:56,988 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 616 states and 841 transitions. [2022-04-28 05:58:59,669 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-28 05:58:59,670 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 841 transitions. [2022-04-28 05:58:59,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-04-28 05:58:59,670 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:58:59,671 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 7, 7, 7, 7, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:58:59,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-04-28 05:58:59,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-04-28 05:58:59,871 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:58:59,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:58:59,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1267134888, now seen corresponding path program 17 times [2022-04-28 05:58:59,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:58:59,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [995482340] [2022-04-28 05:58:59,872 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:58:59,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1267134888, now seen corresponding path program 18 times [2022-04-28 05:58:59,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:58:59,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600738201] [2022-04-28 05:58:59,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:58:59,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:58:59,882 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:58:59,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [725040869] [2022-04-28 05:58:59,883 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 05:58:59,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:58:59,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:58:59,883 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:58:59,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-04-28 05:59:00,430 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-04-28 05:59:00,430 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:59:00,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 05:59:00,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:59:00,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:59:00,997 INFO L272 TraceCheckUtils]: 0: Hoare triple {79015#true} call ULTIMATE.init(); {79015#true} is VALID [2022-04-28 05:59:00,998 INFO L290 TraceCheckUtils]: 1: Hoare triple {79015#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; {79023#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:00,998 INFO L290 TraceCheckUtils]: 2: Hoare triple {79023#(<= ~counter~0 0)} assume true; {79023#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:00,999 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {79023#(<= ~counter~0 0)} {79015#true} #102#return; {79023#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:00,999 INFO L272 TraceCheckUtils]: 4: Hoare triple {79023#(<= ~counter~0 0)} call #t~ret9 := main(); {79023#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:00,999 INFO L290 TraceCheckUtils]: 5: Hoare triple {79023#(<= ~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; {79023#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:00,999 INFO L272 TraceCheckUtils]: 6: Hoare triple {79023#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {79023#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:01,000 INFO L290 TraceCheckUtils]: 7: Hoare triple {79023#(<= ~counter~0 0)} ~cond := #in~cond; {79023#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:01,000 INFO L290 TraceCheckUtils]: 8: Hoare triple {79023#(<= ~counter~0 0)} assume !(0 == ~cond); {79023#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:01,000 INFO L290 TraceCheckUtils]: 9: Hoare triple {79023#(<= ~counter~0 0)} assume true; {79023#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:01,001 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {79023#(<= ~counter~0 0)} {79023#(<= ~counter~0 0)} #90#return; {79023#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:01,001 INFO L272 TraceCheckUtils]: 11: Hoare triple {79023#(<= ~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)); {79023#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:01,001 INFO L290 TraceCheckUtils]: 12: Hoare triple {79023#(<= ~counter~0 0)} ~cond := #in~cond; {79023#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:01,002 INFO L290 TraceCheckUtils]: 13: Hoare triple {79023#(<= ~counter~0 0)} assume !(0 == ~cond); {79023#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:01,002 INFO L290 TraceCheckUtils]: 14: Hoare triple {79023#(<= ~counter~0 0)} assume true; {79023#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:01,002 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {79023#(<= ~counter~0 0)} {79023#(<= ~counter~0 0)} #92#return; {79023#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:01,002 INFO L290 TraceCheckUtils]: 16: Hoare triple {79023#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {79023#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:01,004 INFO L290 TraceCheckUtils]: 17: Hoare triple {79023#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {79072#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:01,004 INFO L290 TraceCheckUtils]: 18: Hoare triple {79072#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {79072#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:01,005 INFO L272 TraceCheckUtils]: 19: Hoare triple {79072#(<= ~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)); {79072#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:01,005 INFO L290 TraceCheckUtils]: 20: Hoare triple {79072#(<= ~counter~0 1)} ~cond := #in~cond; {79072#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:01,005 INFO L290 TraceCheckUtils]: 21: Hoare triple {79072#(<= ~counter~0 1)} assume !(0 == ~cond); {79072#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:01,006 INFO L290 TraceCheckUtils]: 22: Hoare triple {79072#(<= ~counter~0 1)} assume true; {79072#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:01,006 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {79072#(<= ~counter~0 1)} {79072#(<= ~counter~0 1)} #94#return; {79072#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:01,006 INFO L290 TraceCheckUtils]: 24: Hoare triple {79072#(<= ~counter~0 1)} assume !!(0 != ~r~0); {79072#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:01,007 INFO L290 TraceCheckUtils]: 25: Hoare triple {79072#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79097#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:01,007 INFO L290 TraceCheckUtils]: 26: Hoare triple {79097#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {79097#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:01,008 INFO L272 TraceCheckUtils]: 27: Hoare triple {79097#(<= ~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)); {79097#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:01,008 INFO L290 TraceCheckUtils]: 28: Hoare triple {79097#(<= ~counter~0 2)} ~cond := #in~cond; {79097#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:01,008 INFO L290 TraceCheckUtils]: 29: Hoare triple {79097#(<= ~counter~0 2)} assume !(0 == ~cond); {79097#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:01,009 INFO L290 TraceCheckUtils]: 30: Hoare triple {79097#(<= ~counter~0 2)} assume true; {79097#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:01,009 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {79097#(<= ~counter~0 2)} {79097#(<= ~counter~0 2)} #96#return; {79097#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:01,009 INFO L290 TraceCheckUtils]: 32: Hoare triple {79097#(<= ~counter~0 2)} assume !(~r~0 > 0); {79097#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:01,010 INFO L290 TraceCheckUtils]: 33: Hoare triple {79097#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {79122#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:01,010 INFO L290 TraceCheckUtils]: 34: Hoare triple {79122#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {79122#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:01,011 INFO L272 TraceCheckUtils]: 35: Hoare triple {79122#(<= ~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)); {79122#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:01,011 INFO L290 TraceCheckUtils]: 36: Hoare triple {79122#(<= ~counter~0 3)} ~cond := #in~cond; {79122#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:01,011 INFO L290 TraceCheckUtils]: 37: Hoare triple {79122#(<= ~counter~0 3)} assume !(0 == ~cond); {79122#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:01,012 INFO L290 TraceCheckUtils]: 38: Hoare triple {79122#(<= ~counter~0 3)} assume true; {79122#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:01,012 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {79122#(<= ~counter~0 3)} {79122#(<= ~counter~0 3)} #98#return; {79122#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:01,012 INFO L290 TraceCheckUtils]: 40: Hoare triple {79122#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {79122#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:01,013 INFO L290 TraceCheckUtils]: 41: Hoare triple {79122#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {79147#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:01,014 INFO L290 TraceCheckUtils]: 42: Hoare triple {79147#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {79147#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:01,014 INFO L272 TraceCheckUtils]: 43: Hoare triple {79147#(<= ~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)); {79147#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:01,014 INFO L290 TraceCheckUtils]: 44: Hoare triple {79147#(<= ~counter~0 4)} ~cond := #in~cond; {79147#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:01,014 INFO L290 TraceCheckUtils]: 45: Hoare triple {79147#(<= ~counter~0 4)} assume !(0 == ~cond); {79147#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:01,015 INFO L290 TraceCheckUtils]: 46: Hoare triple {79147#(<= ~counter~0 4)} assume true; {79147#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:01,015 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {79147#(<= ~counter~0 4)} {79147#(<= ~counter~0 4)} #98#return; {79147#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:01,015 INFO L290 TraceCheckUtils]: 48: Hoare triple {79147#(<= ~counter~0 4)} assume !(~r~0 < 0); {79147#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:01,016 INFO L290 TraceCheckUtils]: 49: Hoare triple {79147#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {79172#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:01,017 INFO L290 TraceCheckUtils]: 50: Hoare triple {79172#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {79172#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:01,017 INFO L272 TraceCheckUtils]: 51: Hoare triple {79172#(<= ~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)); {79172#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:01,017 INFO L290 TraceCheckUtils]: 52: Hoare triple {79172#(<= ~counter~0 5)} ~cond := #in~cond; {79172#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:01,018 INFO L290 TraceCheckUtils]: 53: Hoare triple {79172#(<= ~counter~0 5)} assume !(0 == ~cond); {79172#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:01,018 INFO L290 TraceCheckUtils]: 54: Hoare triple {79172#(<= ~counter~0 5)} assume true; {79172#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:01,018 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {79172#(<= ~counter~0 5)} {79172#(<= ~counter~0 5)} #94#return; {79172#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:01,018 INFO L290 TraceCheckUtils]: 56: Hoare triple {79172#(<= ~counter~0 5)} assume !!(0 != ~r~0); {79172#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:01,019 INFO L290 TraceCheckUtils]: 57: Hoare triple {79172#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79197#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:01,020 INFO L290 TraceCheckUtils]: 58: Hoare triple {79197#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {79197#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:01,020 INFO L272 TraceCheckUtils]: 59: Hoare triple {79197#(<= ~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)); {79197#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:01,020 INFO L290 TraceCheckUtils]: 60: Hoare triple {79197#(<= ~counter~0 6)} ~cond := #in~cond; {79197#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:01,021 INFO L290 TraceCheckUtils]: 61: Hoare triple {79197#(<= ~counter~0 6)} assume !(0 == ~cond); {79197#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:01,021 INFO L290 TraceCheckUtils]: 62: Hoare triple {79197#(<= ~counter~0 6)} assume true; {79197#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:01,021 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {79197#(<= ~counter~0 6)} {79197#(<= ~counter~0 6)} #96#return; {79197#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:01,021 INFO L290 TraceCheckUtils]: 64: Hoare triple {79197#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {79197#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:01,022 INFO L290 TraceCheckUtils]: 65: Hoare triple {79197#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79222#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:01,023 INFO L290 TraceCheckUtils]: 66: Hoare triple {79222#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {79222#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:01,023 INFO L272 TraceCheckUtils]: 67: Hoare triple {79222#(<= ~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)); {79222#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:01,023 INFO L290 TraceCheckUtils]: 68: Hoare triple {79222#(<= ~counter~0 7)} ~cond := #in~cond; {79222#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:01,024 INFO L290 TraceCheckUtils]: 69: Hoare triple {79222#(<= ~counter~0 7)} assume !(0 == ~cond); {79222#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:01,024 INFO L290 TraceCheckUtils]: 70: Hoare triple {79222#(<= ~counter~0 7)} assume true; {79222#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:01,024 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {79222#(<= ~counter~0 7)} {79222#(<= ~counter~0 7)} #96#return; {79222#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:01,025 INFO L290 TraceCheckUtils]: 72: Hoare triple {79222#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {79222#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:01,026 INFO L290 TraceCheckUtils]: 73: Hoare triple {79222#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79247#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:01,026 INFO L290 TraceCheckUtils]: 74: Hoare triple {79247#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {79247#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:01,026 INFO L272 TraceCheckUtils]: 75: Hoare triple {79247#(<= ~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)); {79247#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:01,027 INFO L290 TraceCheckUtils]: 76: Hoare triple {79247#(<= ~counter~0 8)} ~cond := #in~cond; {79247#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:01,027 INFO L290 TraceCheckUtils]: 77: Hoare triple {79247#(<= ~counter~0 8)} assume !(0 == ~cond); {79247#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:01,027 INFO L290 TraceCheckUtils]: 78: Hoare triple {79247#(<= ~counter~0 8)} assume true; {79247#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:01,028 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {79247#(<= ~counter~0 8)} {79247#(<= ~counter~0 8)} #96#return; {79247#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:01,028 INFO L290 TraceCheckUtils]: 80: Hoare triple {79247#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {79247#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:01,029 INFO L290 TraceCheckUtils]: 81: Hoare triple {79247#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79272#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:01,029 INFO L290 TraceCheckUtils]: 82: Hoare triple {79272#(<= ~counter~0 9)} assume !!(#t~post7 < 100);havoc #t~post7; {79272#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:01,030 INFO L272 TraceCheckUtils]: 83: Hoare triple {79272#(<= ~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)); {79272#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:01,030 INFO L290 TraceCheckUtils]: 84: Hoare triple {79272#(<= ~counter~0 9)} ~cond := #in~cond; {79272#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:01,030 INFO L290 TraceCheckUtils]: 85: Hoare triple {79272#(<= ~counter~0 9)} assume !(0 == ~cond); {79272#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:01,031 INFO L290 TraceCheckUtils]: 86: Hoare triple {79272#(<= ~counter~0 9)} assume true; {79272#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:01,031 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {79272#(<= ~counter~0 9)} {79272#(<= ~counter~0 9)} #96#return; {79272#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:01,031 INFO L290 TraceCheckUtils]: 88: Hoare triple {79272#(<= ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {79272#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:01,032 INFO L290 TraceCheckUtils]: 89: Hoare triple {79272#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79297#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:01,032 INFO L290 TraceCheckUtils]: 90: Hoare triple {79297#(<= ~counter~0 10)} assume !!(#t~post7 < 100);havoc #t~post7; {79297#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:01,033 INFO L272 TraceCheckUtils]: 91: Hoare triple {79297#(<= ~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)); {79297#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:01,033 INFO L290 TraceCheckUtils]: 92: Hoare triple {79297#(<= ~counter~0 10)} ~cond := #in~cond; {79297#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:01,033 INFO L290 TraceCheckUtils]: 93: Hoare triple {79297#(<= ~counter~0 10)} assume !(0 == ~cond); {79297#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:01,034 INFO L290 TraceCheckUtils]: 94: Hoare triple {79297#(<= ~counter~0 10)} assume true; {79297#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:01,034 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {79297#(<= ~counter~0 10)} {79297#(<= ~counter~0 10)} #96#return; {79297#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:01,034 INFO L290 TraceCheckUtils]: 96: Hoare triple {79297#(<= ~counter~0 10)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {79297#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:01,035 INFO L290 TraceCheckUtils]: 97: Hoare triple {79297#(<= ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79322#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:01,035 INFO L290 TraceCheckUtils]: 98: Hoare triple {79322#(<= ~counter~0 11)} assume !!(#t~post7 < 100);havoc #t~post7; {79322#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:01,036 INFO L272 TraceCheckUtils]: 99: Hoare triple {79322#(<= ~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)); {79322#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:01,036 INFO L290 TraceCheckUtils]: 100: Hoare triple {79322#(<= ~counter~0 11)} ~cond := #in~cond; {79322#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:01,036 INFO L290 TraceCheckUtils]: 101: Hoare triple {79322#(<= ~counter~0 11)} assume !(0 == ~cond); {79322#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:01,037 INFO L290 TraceCheckUtils]: 102: Hoare triple {79322#(<= ~counter~0 11)} assume true; {79322#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:01,037 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {79322#(<= ~counter~0 11)} {79322#(<= ~counter~0 11)} #96#return; {79322#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:01,037 INFO L290 TraceCheckUtils]: 104: Hoare triple {79322#(<= ~counter~0 11)} assume !(~r~0 > 0); {79322#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:01,038 INFO L290 TraceCheckUtils]: 105: Hoare triple {79322#(<= ~counter~0 11)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {79347#(<= ~counter~0 12)} is VALID [2022-04-28 05:59:01,039 INFO L290 TraceCheckUtils]: 106: Hoare triple {79347#(<= ~counter~0 12)} assume !!(#t~post8 < 100);havoc #t~post8; {79347#(<= ~counter~0 12)} is VALID [2022-04-28 05:59:01,039 INFO L272 TraceCheckUtils]: 107: Hoare triple {79347#(<= ~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)); {79347#(<= ~counter~0 12)} is VALID [2022-04-28 05:59:01,039 INFO L290 TraceCheckUtils]: 108: Hoare triple {79347#(<= ~counter~0 12)} ~cond := #in~cond; {79347#(<= ~counter~0 12)} is VALID [2022-04-28 05:59:01,039 INFO L290 TraceCheckUtils]: 109: Hoare triple {79347#(<= ~counter~0 12)} assume !(0 == ~cond); {79347#(<= ~counter~0 12)} is VALID [2022-04-28 05:59:01,040 INFO L290 TraceCheckUtils]: 110: Hoare triple {79347#(<= ~counter~0 12)} assume true; {79347#(<= ~counter~0 12)} is VALID [2022-04-28 05:59:01,040 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {79347#(<= ~counter~0 12)} {79347#(<= ~counter~0 12)} #98#return; {79347#(<= ~counter~0 12)} is VALID [2022-04-28 05:59:01,040 INFO L290 TraceCheckUtils]: 112: Hoare triple {79347#(<= ~counter~0 12)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {79347#(<= ~counter~0 12)} is VALID [2022-04-28 05:59:01,041 INFO L290 TraceCheckUtils]: 113: Hoare triple {79347#(<= ~counter~0 12)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {79372#(<= |main_#t~post8| 12)} is VALID [2022-04-28 05:59:01,041 INFO L290 TraceCheckUtils]: 114: Hoare triple {79372#(<= |main_#t~post8| 12)} assume !(#t~post8 < 100);havoc #t~post8; {79016#false} is VALID [2022-04-28 05:59:01,041 INFO L290 TraceCheckUtils]: 115: Hoare triple {79016#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {79016#false} is VALID [2022-04-28 05:59:01,041 INFO L290 TraceCheckUtils]: 116: Hoare triple {79016#false} assume !(#t~post6 < 100);havoc #t~post6; {79016#false} is VALID [2022-04-28 05:59:01,041 INFO L272 TraceCheckUtils]: 117: Hoare triple {79016#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)); {79016#false} is VALID [2022-04-28 05:59:01,041 INFO L290 TraceCheckUtils]: 118: Hoare triple {79016#false} ~cond := #in~cond; {79016#false} is VALID [2022-04-28 05:59:01,041 INFO L290 TraceCheckUtils]: 119: Hoare triple {79016#false} assume 0 == ~cond; {79016#false} is VALID [2022-04-28 05:59:01,042 INFO L290 TraceCheckUtils]: 120: Hoare triple {79016#false} assume !false; {79016#false} is VALID [2022-04-28 05:59:01,042 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 28 proven. 370 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:59:01,042 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:59:01,677 INFO L290 TraceCheckUtils]: 120: Hoare triple {79016#false} assume !false; {79016#false} is VALID [2022-04-28 05:59:01,678 INFO L290 TraceCheckUtils]: 119: Hoare triple {79016#false} assume 0 == ~cond; {79016#false} is VALID [2022-04-28 05:59:01,678 INFO L290 TraceCheckUtils]: 118: Hoare triple {79016#false} ~cond := #in~cond; {79016#false} is VALID [2022-04-28 05:59:01,678 INFO L272 TraceCheckUtils]: 117: Hoare triple {79016#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)); {79016#false} is VALID [2022-04-28 05:59:01,678 INFO L290 TraceCheckUtils]: 116: Hoare triple {79016#false} assume !(#t~post6 < 100);havoc #t~post6; {79016#false} is VALID [2022-04-28 05:59:01,678 INFO L290 TraceCheckUtils]: 115: Hoare triple {79016#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {79016#false} is VALID [2022-04-28 05:59:01,678 INFO L290 TraceCheckUtils]: 114: Hoare triple {79412#(< |main_#t~post8| 100)} assume !(#t~post8 < 100);havoc #t~post8; {79016#false} is VALID [2022-04-28 05:59:01,679 INFO L290 TraceCheckUtils]: 113: Hoare triple {79416#(< ~counter~0 100)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {79412#(< |main_#t~post8| 100)} is VALID [2022-04-28 05:59:01,679 INFO L290 TraceCheckUtils]: 112: Hoare triple {79416#(< ~counter~0 100)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {79416#(< ~counter~0 100)} is VALID [2022-04-28 05:59:01,679 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {79015#true} {79416#(< ~counter~0 100)} #98#return; {79416#(< ~counter~0 100)} is VALID [2022-04-28 05:59:01,679 INFO L290 TraceCheckUtils]: 110: Hoare triple {79015#true} assume true; {79015#true} is VALID [2022-04-28 05:59:01,679 INFO L290 TraceCheckUtils]: 109: Hoare triple {79015#true} assume !(0 == ~cond); {79015#true} is VALID [2022-04-28 05:59:01,680 INFO L290 TraceCheckUtils]: 108: Hoare triple {79015#true} ~cond := #in~cond; {79015#true} is VALID [2022-04-28 05:59:01,680 INFO L272 TraceCheckUtils]: 107: Hoare triple {79416#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79015#true} is VALID [2022-04-28 05:59:01,680 INFO L290 TraceCheckUtils]: 106: Hoare triple {79416#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {79416#(< ~counter~0 100)} is VALID [2022-04-28 05:59:01,681 INFO L290 TraceCheckUtils]: 105: Hoare triple {79441#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {79416#(< ~counter~0 100)} is VALID [2022-04-28 05:59:01,682 INFO L290 TraceCheckUtils]: 104: Hoare triple {79441#(< ~counter~0 99)} assume !(~r~0 > 0); {79441#(< ~counter~0 99)} is VALID [2022-04-28 05:59:01,682 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {79015#true} {79441#(< ~counter~0 99)} #96#return; {79441#(< ~counter~0 99)} is VALID [2022-04-28 05:59:01,682 INFO L290 TraceCheckUtils]: 102: Hoare triple {79015#true} assume true; {79015#true} is VALID [2022-04-28 05:59:01,682 INFO L290 TraceCheckUtils]: 101: Hoare triple {79015#true} assume !(0 == ~cond); {79015#true} is VALID [2022-04-28 05:59:01,682 INFO L290 TraceCheckUtils]: 100: Hoare triple {79015#true} ~cond := #in~cond; {79015#true} is VALID [2022-04-28 05:59:01,683 INFO L272 TraceCheckUtils]: 99: Hoare triple {79441#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79015#true} is VALID [2022-04-28 05:59:01,683 INFO L290 TraceCheckUtils]: 98: Hoare triple {79441#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {79441#(< ~counter~0 99)} is VALID [2022-04-28 05:59:01,684 INFO L290 TraceCheckUtils]: 97: Hoare triple {79466#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79441#(< ~counter~0 99)} is VALID [2022-04-28 05:59:01,684 INFO L290 TraceCheckUtils]: 96: Hoare triple {79466#(< ~counter~0 98)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {79466#(< ~counter~0 98)} is VALID [2022-04-28 05:59:01,684 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {79015#true} {79466#(< ~counter~0 98)} #96#return; {79466#(< ~counter~0 98)} is VALID [2022-04-28 05:59:01,684 INFO L290 TraceCheckUtils]: 94: Hoare triple {79015#true} assume true; {79015#true} is VALID [2022-04-28 05:59:01,684 INFO L290 TraceCheckUtils]: 93: Hoare triple {79015#true} assume !(0 == ~cond); {79015#true} is VALID [2022-04-28 05:59:01,684 INFO L290 TraceCheckUtils]: 92: Hoare triple {79015#true} ~cond := #in~cond; {79015#true} is VALID [2022-04-28 05:59:01,685 INFO L272 TraceCheckUtils]: 91: Hoare triple {79466#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79015#true} is VALID [2022-04-28 05:59:01,685 INFO L290 TraceCheckUtils]: 90: Hoare triple {79466#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {79466#(< ~counter~0 98)} is VALID [2022-04-28 05:59:01,686 INFO L290 TraceCheckUtils]: 89: Hoare triple {79491#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79466#(< ~counter~0 98)} is VALID [2022-04-28 05:59:01,686 INFO L290 TraceCheckUtils]: 88: Hoare triple {79491#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {79491#(< ~counter~0 97)} is VALID [2022-04-28 05:59:01,686 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {79015#true} {79491#(< ~counter~0 97)} #96#return; {79491#(< ~counter~0 97)} is VALID [2022-04-28 05:59:01,686 INFO L290 TraceCheckUtils]: 86: Hoare triple {79015#true} assume true; {79015#true} is VALID [2022-04-28 05:59:01,686 INFO L290 TraceCheckUtils]: 85: Hoare triple {79015#true} assume !(0 == ~cond); {79015#true} is VALID [2022-04-28 05:59:01,686 INFO L290 TraceCheckUtils]: 84: Hoare triple {79015#true} ~cond := #in~cond; {79015#true} is VALID [2022-04-28 05:59:01,687 INFO L272 TraceCheckUtils]: 83: Hoare triple {79491#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79015#true} is VALID [2022-04-28 05:59:01,687 INFO L290 TraceCheckUtils]: 82: Hoare triple {79491#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {79491#(< ~counter~0 97)} is VALID [2022-04-28 05:59:01,688 INFO L290 TraceCheckUtils]: 81: Hoare triple {79516#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79491#(< ~counter~0 97)} is VALID [2022-04-28 05:59:01,688 INFO L290 TraceCheckUtils]: 80: Hoare triple {79516#(< ~counter~0 96)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {79516#(< ~counter~0 96)} is VALID [2022-04-28 05:59:01,688 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {79015#true} {79516#(< ~counter~0 96)} #96#return; {79516#(< ~counter~0 96)} is VALID [2022-04-28 05:59:01,688 INFO L290 TraceCheckUtils]: 78: Hoare triple {79015#true} assume true; {79015#true} is VALID [2022-04-28 05:59:01,688 INFO L290 TraceCheckUtils]: 77: Hoare triple {79015#true} assume !(0 == ~cond); {79015#true} is VALID [2022-04-28 05:59:01,688 INFO L290 TraceCheckUtils]: 76: Hoare triple {79015#true} ~cond := #in~cond; {79015#true} is VALID [2022-04-28 05:59:01,689 INFO L272 TraceCheckUtils]: 75: Hoare triple {79516#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79015#true} is VALID [2022-04-28 05:59:01,689 INFO L290 TraceCheckUtils]: 74: Hoare triple {79516#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {79516#(< ~counter~0 96)} is VALID [2022-04-28 05:59:01,690 INFO L290 TraceCheckUtils]: 73: Hoare triple {79541#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79516#(< ~counter~0 96)} is VALID [2022-04-28 05:59:01,690 INFO L290 TraceCheckUtils]: 72: Hoare triple {79541#(< ~counter~0 95)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {79541#(< ~counter~0 95)} is VALID [2022-04-28 05:59:01,690 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {79015#true} {79541#(< ~counter~0 95)} #96#return; {79541#(< ~counter~0 95)} is VALID [2022-04-28 05:59:01,690 INFO L290 TraceCheckUtils]: 70: Hoare triple {79015#true} assume true; {79015#true} is VALID [2022-04-28 05:59:01,690 INFO L290 TraceCheckUtils]: 69: Hoare triple {79015#true} assume !(0 == ~cond); {79015#true} is VALID [2022-04-28 05:59:01,691 INFO L290 TraceCheckUtils]: 68: Hoare triple {79015#true} ~cond := #in~cond; {79015#true} is VALID [2022-04-28 05:59:01,691 INFO L272 TraceCheckUtils]: 67: Hoare triple {79541#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79015#true} is VALID [2022-04-28 05:59:01,691 INFO L290 TraceCheckUtils]: 66: Hoare triple {79541#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {79541#(< ~counter~0 95)} is VALID [2022-04-28 05:59:01,692 INFO L290 TraceCheckUtils]: 65: Hoare triple {79566#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79541#(< ~counter~0 95)} is VALID [2022-04-28 05:59:01,692 INFO L290 TraceCheckUtils]: 64: Hoare triple {79566#(< ~counter~0 94)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {79566#(< ~counter~0 94)} is VALID [2022-04-28 05:59:01,692 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {79015#true} {79566#(< ~counter~0 94)} #96#return; {79566#(< ~counter~0 94)} is VALID [2022-04-28 05:59:01,692 INFO L290 TraceCheckUtils]: 62: Hoare triple {79015#true} assume true; {79015#true} is VALID [2022-04-28 05:59:01,692 INFO L290 TraceCheckUtils]: 61: Hoare triple {79015#true} assume !(0 == ~cond); {79015#true} is VALID [2022-04-28 05:59:01,693 INFO L290 TraceCheckUtils]: 60: Hoare triple {79015#true} ~cond := #in~cond; {79015#true} is VALID [2022-04-28 05:59:01,693 INFO L272 TraceCheckUtils]: 59: Hoare triple {79566#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79015#true} is VALID [2022-04-28 05:59:01,693 INFO L290 TraceCheckUtils]: 58: Hoare triple {79566#(< ~counter~0 94)} assume !!(#t~post7 < 100);havoc #t~post7; {79566#(< ~counter~0 94)} is VALID [2022-04-28 05:59:01,694 INFO L290 TraceCheckUtils]: 57: Hoare triple {79591#(< ~counter~0 93)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79566#(< ~counter~0 94)} is VALID [2022-04-28 05:59:01,694 INFO L290 TraceCheckUtils]: 56: Hoare triple {79591#(< ~counter~0 93)} assume !!(0 != ~r~0); {79591#(< ~counter~0 93)} is VALID [2022-04-28 05:59:01,694 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {79015#true} {79591#(< ~counter~0 93)} #94#return; {79591#(< ~counter~0 93)} is VALID [2022-04-28 05:59:01,694 INFO L290 TraceCheckUtils]: 54: Hoare triple {79015#true} assume true; {79015#true} is VALID [2022-04-28 05:59:01,694 INFO L290 TraceCheckUtils]: 53: Hoare triple {79015#true} assume !(0 == ~cond); {79015#true} is VALID [2022-04-28 05:59:01,695 INFO L290 TraceCheckUtils]: 52: Hoare triple {79015#true} ~cond := #in~cond; {79015#true} is VALID [2022-04-28 05:59:01,695 INFO L272 TraceCheckUtils]: 51: Hoare triple {79591#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79015#true} is VALID [2022-04-28 05:59:01,695 INFO L290 TraceCheckUtils]: 50: Hoare triple {79591#(< ~counter~0 93)} assume !!(#t~post6 < 100);havoc #t~post6; {79591#(< ~counter~0 93)} is VALID [2022-04-28 05:59:01,696 INFO L290 TraceCheckUtils]: 49: Hoare triple {79616#(< ~counter~0 92)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {79591#(< ~counter~0 93)} is VALID [2022-04-28 05:59:01,696 INFO L290 TraceCheckUtils]: 48: Hoare triple {79616#(< ~counter~0 92)} assume !(~r~0 < 0); {79616#(< ~counter~0 92)} is VALID [2022-04-28 05:59:01,696 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {79015#true} {79616#(< ~counter~0 92)} #98#return; {79616#(< ~counter~0 92)} is VALID [2022-04-28 05:59:01,696 INFO L290 TraceCheckUtils]: 46: Hoare triple {79015#true} assume true; {79015#true} is VALID [2022-04-28 05:59:01,696 INFO L290 TraceCheckUtils]: 45: Hoare triple {79015#true} assume !(0 == ~cond); {79015#true} is VALID [2022-04-28 05:59:01,697 INFO L290 TraceCheckUtils]: 44: Hoare triple {79015#true} ~cond := #in~cond; {79015#true} is VALID [2022-04-28 05:59:01,697 INFO L272 TraceCheckUtils]: 43: Hoare triple {79616#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79015#true} is VALID [2022-04-28 05:59:01,697 INFO L290 TraceCheckUtils]: 42: Hoare triple {79616#(< ~counter~0 92)} assume !!(#t~post8 < 100);havoc #t~post8; {79616#(< ~counter~0 92)} is VALID [2022-04-28 05:59:01,698 INFO L290 TraceCheckUtils]: 41: Hoare triple {79641#(< ~counter~0 91)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {79616#(< ~counter~0 92)} is VALID [2022-04-28 05:59:01,698 INFO L290 TraceCheckUtils]: 40: Hoare triple {79641#(< ~counter~0 91)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {79641#(< ~counter~0 91)} is VALID [2022-04-28 05:59:01,698 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {79015#true} {79641#(< ~counter~0 91)} #98#return; {79641#(< ~counter~0 91)} is VALID [2022-04-28 05:59:01,698 INFO L290 TraceCheckUtils]: 38: Hoare triple {79015#true} assume true; {79015#true} is VALID [2022-04-28 05:59:01,699 INFO L290 TraceCheckUtils]: 37: Hoare triple {79015#true} assume !(0 == ~cond); {79015#true} is VALID [2022-04-28 05:59:01,699 INFO L290 TraceCheckUtils]: 36: Hoare triple {79015#true} ~cond := #in~cond; {79015#true} is VALID [2022-04-28 05:59:01,699 INFO L272 TraceCheckUtils]: 35: Hoare triple {79641#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79015#true} is VALID [2022-04-28 05:59:01,699 INFO L290 TraceCheckUtils]: 34: Hoare triple {79641#(< ~counter~0 91)} assume !!(#t~post8 < 100);havoc #t~post8; {79641#(< ~counter~0 91)} is VALID [2022-04-28 05:59:01,700 INFO L290 TraceCheckUtils]: 33: Hoare triple {79666#(< ~counter~0 90)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {79641#(< ~counter~0 91)} is VALID [2022-04-28 05:59:01,700 INFO L290 TraceCheckUtils]: 32: Hoare triple {79666#(< ~counter~0 90)} assume !(~r~0 > 0); {79666#(< ~counter~0 90)} is VALID [2022-04-28 05:59:01,700 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {79015#true} {79666#(< ~counter~0 90)} #96#return; {79666#(< ~counter~0 90)} is VALID [2022-04-28 05:59:01,700 INFO L290 TraceCheckUtils]: 30: Hoare triple {79015#true} assume true; {79015#true} is VALID [2022-04-28 05:59:01,701 INFO L290 TraceCheckUtils]: 29: Hoare triple {79015#true} assume !(0 == ~cond); {79015#true} is VALID [2022-04-28 05:59:01,701 INFO L290 TraceCheckUtils]: 28: Hoare triple {79015#true} ~cond := #in~cond; {79015#true} is VALID [2022-04-28 05:59:01,701 INFO L272 TraceCheckUtils]: 27: Hoare triple {79666#(< ~counter~0 90)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79015#true} is VALID [2022-04-28 05:59:01,701 INFO L290 TraceCheckUtils]: 26: Hoare triple {79666#(< ~counter~0 90)} assume !!(#t~post7 < 100);havoc #t~post7; {79666#(< ~counter~0 90)} is VALID [2022-04-28 05:59:01,702 INFO L290 TraceCheckUtils]: 25: Hoare triple {79691#(< ~counter~0 89)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79666#(< ~counter~0 90)} is VALID [2022-04-28 05:59:01,702 INFO L290 TraceCheckUtils]: 24: Hoare triple {79691#(< ~counter~0 89)} assume !!(0 != ~r~0); {79691#(< ~counter~0 89)} is VALID [2022-04-28 05:59:01,702 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {79015#true} {79691#(< ~counter~0 89)} #94#return; {79691#(< ~counter~0 89)} is VALID [2022-04-28 05:59:01,702 INFO L290 TraceCheckUtils]: 22: Hoare triple {79015#true} assume true; {79015#true} is VALID [2022-04-28 05:59:01,703 INFO L290 TraceCheckUtils]: 21: Hoare triple {79015#true} assume !(0 == ~cond); {79015#true} is VALID [2022-04-28 05:59:01,703 INFO L290 TraceCheckUtils]: 20: Hoare triple {79015#true} ~cond := #in~cond; {79015#true} is VALID [2022-04-28 05:59:01,703 INFO L272 TraceCheckUtils]: 19: Hoare triple {79691#(< ~counter~0 89)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79015#true} is VALID [2022-04-28 05:59:01,703 INFO L290 TraceCheckUtils]: 18: Hoare triple {79691#(< ~counter~0 89)} assume !!(#t~post6 < 100);havoc #t~post6; {79691#(< ~counter~0 89)} is VALID [2022-04-28 05:59:01,704 INFO L290 TraceCheckUtils]: 17: Hoare triple {79716#(< ~counter~0 88)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {79691#(< ~counter~0 89)} is VALID [2022-04-28 05:59:01,704 INFO L290 TraceCheckUtils]: 16: Hoare triple {79716#(< ~counter~0 88)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {79716#(< ~counter~0 88)} is VALID [2022-04-28 05:59:01,704 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {79015#true} {79716#(< ~counter~0 88)} #92#return; {79716#(< ~counter~0 88)} is VALID [2022-04-28 05:59:01,704 INFO L290 TraceCheckUtils]: 14: Hoare triple {79015#true} assume true; {79015#true} is VALID [2022-04-28 05:59:01,704 INFO L290 TraceCheckUtils]: 13: Hoare triple {79015#true} assume !(0 == ~cond); {79015#true} is VALID [2022-04-28 05:59:01,705 INFO L290 TraceCheckUtils]: 12: Hoare triple {79015#true} ~cond := #in~cond; {79015#true} is VALID [2022-04-28 05:59:01,705 INFO L272 TraceCheckUtils]: 11: Hoare triple {79716#(< ~counter~0 88)} 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)); {79015#true} is VALID [2022-04-28 05:59:01,705 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {79015#true} {79716#(< ~counter~0 88)} #90#return; {79716#(< ~counter~0 88)} is VALID [2022-04-28 05:59:01,705 INFO L290 TraceCheckUtils]: 9: Hoare triple {79015#true} assume true; {79015#true} is VALID [2022-04-28 05:59:01,705 INFO L290 TraceCheckUtils]: 8: Hoare triple {79015#true} assume !(0 == ~cond); {79015#true} is VALID [2022-04-28 05:59:01,705 INFO L290 TraceCheckUtils]: 7: Hoare triple {79015#true} ~cond := #in~cond; {79015#true} is VALID [2022-04-28 05:59:01,705 INFO L272 TraceCheckUtils]: 6: Hoare triple {79716#(< ~counter~0 88)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {79015#true} is VALID [2022-04-28 05:59:01,706 INFO L290 TraceCheckUtils]: 5: Hoare triple {79716#(< ~counter~0 88)} 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; {79716#(< ~counter~0 88)} is VALID [2022-04-28 05:59:01,706 INFO L272 TraceCheckUtils]: 4: Hoare triple {79716#(< ~counter~0 88)} call #t~ret9 := main(); {79716#(< ~counter~0 88)} is VALID [2022-04-28 05:59:01,706 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {79716#(< ~counter~0 88)} {79015#true} #102#return; {79716#(< ~counter~0 88)} is VALID [2022-04-28 05:59:01,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {79716#(< ~counter~0 88)} assume true; {79716#(< ~counter~0 88)} is VALID [2022-04-28 05:59:01,707 INFO L290 TraceCheckUtils]: 1: Hoare triple {79015#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; {79716#(< ~counter~0 88)} is VALID [2022-04-28 05:59:01,707 INFO L272 TraceCheckUtils]: 0: Hoare triple {79015#true} call ULTIMATE.init(); {79015#true} is VALID [2022-04-28 05:59:01,707 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 28 proven. 106 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2022-04-28 05:59:01,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:59:01,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600738201] [2022-04-28 05:59:01,707 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:59:01,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725040869] [2022-04-28 05:59:01,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [725040869] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:59:01,708 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:59:01,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2022-04-28 05:59:01,708 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:59:01,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [995482340] [2022-04-28 05:59:01,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [995482340] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:59:01,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:59:01,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 05:59:01,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686676852] [2022-04-28 05:59:01,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:59:01,709 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.375) internal successors, (86), 15 states have internal predecessors, (86), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) Word has length 121 [2022-04-28 05:59:01,709 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:59:01,709 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 5.375) internal successors, (86), 15 states have internal predecessors, (86), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-28 05:59:01,795 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:59:01,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 05:59:01,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:59:01,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 05:59:01,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=383, Invalid=487, Unknown=0, NotChecked=0, Total=870 [2022-04-28 05:59:01,796 INFO L87 Difference]: Start difference. First operand 616 states and 841 transitions. Second operand has 16 states, 16 states have (on average 5.375) internal successors, (86), 15 states have internal predecessors, (86), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-28 05:59:04,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:59:04,481 INFO L93 Difference]: Finished difference Result 837 states and 1174 transitions. [2022-04-28 05:59:04,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-28 05:59:04,481 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.375) internal successors, (86), 15 states have internal predecessors, (86), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) Word has length 121 [2022-04-28 05:59:04,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:59:04,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 5.375) internal successors, (86), 15 states have internal predecessors, (86), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-28 05:59:04,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 276 transitions. [2022-04-28 05:59:04,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 5.375) internal successors, (86), 15 states have internal predecessors, (86), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-28 05:59:04,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 276 transitions. [2022-04-28 05:59:04,485 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 276 transitions. [2022-04-28 05:59:04,696 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 276 edges. 276 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:59:04,711 INFO L225 Difference]: With dead ends: 837 [2022-04-28 05:59:04,712 INFO L226 Difference]: Without dead ends: 644 [2022-04-28 05:59:04,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=653, Invalid=907, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 05:59:04,713 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 172 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 05:59:04,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 304 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 05:59:04,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2022-04-28 05:59:06,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 634. [2022-04-28 05:59:06,442 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:59:06,442 INFO L82 GeneralOperation]: Start isEquivalent. First operand 644 states. Second operand has 634 states, 478 states have (on average 1.2238493723849373) internal successors, (585), 482 states have internal predecessors, (585), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 134 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-28 05:59:06,443 INFO L74 IsIncluded]: Start isIncluded. First operand 644 states. Second operand has 634 states, 478 states have (on average 1.2238493723849373) internal successors, (585), 482 states have internal predecessors, (585), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 134 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-28 05:59:06,443 INFO L87 Difference]: Start difference. First operand 644 states. Second operand has 634 states, 478 states have (on average 1.2238493723849373) internal successors, (585), 482 states have internal predecessors, (585), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 134 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-28 05:59:06,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:59:06,457 INFO L93 Difference]: Finished difference Result 644 states and 873 transitions. [2022-04-28 05:59:06,457 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 873 transitions. [2022-04-28 05:59:06,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:59:06,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:59:06,458 INFO L74 IsIncluded]: Start isIncluded. First operand has 634 states, 478 states have (on average 1.2238493723849373) internal successors, (585), 482 states have internal predecessors, (585), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 134 states have call predecessors, (138), 138 states have call successors, (138) Second operand 644 states. [2022-04-28 05:59:06,459 INFO L87 Difference]: Start difference. First operand has 634 states, 478 states have (on average 1.2238493723849373) internal successors, (585), 482 states have internal predecessors, (585), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 134 states have call predecessors, (138), 138 states have call successors, (138) Second operand 644 states. [2022-04-28 05:59:06,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:59:06,473 INFO L93 Difference]: Finished difference Result 644 states and 873 transitions. [2022-04-28 05:59:06,473 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 873 transitions. [2022-04-28 05:59:06,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:59:06,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:59:06,473 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:59:06,474 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:59:06,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 478 states have (on average 1.2238493723849373) internal successors, (585), 482 states have internal predecessors, (585), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 134 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-28 05:59:06,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 863 transitions. [2022-04-28 05:59:06,491 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 863 transitions. Word has length 121 [2022-04-28 05:59:06,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:59:06,492 INFO L495 AbstractCegarLoop]: Abstraction has 634 states and 863 transitions. [2022-04-28 05:59:06,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.375) internal successors, (86), 15 states have internal predecessors, (86), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-28 05:59:06,492 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 634 states and 863 transitions. [2022-04-28 05:59:11,154 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 863 edges. 862 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 05:59:11,155 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 863 transitions. [2022-04-28 05:59:11,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-04-28 05:59:11,156 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:59:11,156 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:59:11,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-04-28 05:59:11,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-04-28 05:59:11,356 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:59:11,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:59:11,357 INFO L85 PathProgramCache]: Analyzing trace with hash 487500267, now seen corresponding path program 15 times [2022-04-28 05:59:11,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:59:11,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [53068356] [2022-04-28 05:59:11,357 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:59:11,357 INFO L85 PathProgramCache]: Analyzing trace with hash 487500267, now seen corresponding path program 16 times [2022-04-28 05:59:11,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:59:11,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514935636] [2022-04-28 05:59:11,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:59:11,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:59:11,368 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:59:11,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2108868960] [2022-04-28 05:59:11,368 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 05:59:11,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:59:11,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:59:11,369 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:59:11,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-04-28 05:59:11,483 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 05:59:11,483 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:59:11,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 05:59:11,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:59:11,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:59:12,036 INFO L272 TraceCheckUtils]: 0: Hoare triple {84020#true} call ULTIMATE.init(); {84020#true} is VALID [2022-04-28 05:59:12,037 INFO L290 TraceCheckUtils]: 1: Hoare triple {84020#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; {84028#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:12,037 INFO L290 TraceCheckUtils]: 2: Hoare triple {84028#(<= ~counter~0 0)} assume true; {84028#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:12,037 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {84028#(<= ~counter~0 0)} {84020#true} #102#return; {84028#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:12,038 INFO L272 TraceCheckUtils]: 4: Hoare triple {84028#(<= ~counter~0 0)} call #t~ret9 := main(); {84028#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:12,038 INFO L290 TraceCheckUtils]: 5: Hoare triple {84028#(<= ~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; {84028#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:12,038 INFO L272 TraceCheckUtils]: 6: Hoare triple {84028#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {84028#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:12,039 INFO L290 TraceCheckUtils]: 7: Hoare triple {84028#(<= ~counter~0 0)} ~cond := #in~cond; {84028#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:12,039 INFO L290 TraceCheckUtils]: 8: Hoare triple {84028#(<= ~counter~0 0)} assume !(0 == ~cond); {84028#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:12,039 INFO L290 TraceCheckUtils]: 9: Hoare triple {84028#(<= ~counter~0 0)} assume true; {84028#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:12,040 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {84028#(<= ~counter~0 0)} {84028#(<= ~counter~0 0)} #90#return; {84028#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:12,040 INFO L272 TraceCheckUtils]: 11: Hoare triple {84028#(<= ~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)); {84028#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:12,040 INFO L290 TraceCheckUtils]: 12: Hoare triple {84028#(<= ~counter~0 0)} ~cond := #in~cond; {84028#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:12,040 INFO L290 TraceCheckUtils]: 13: Hoare triple {84028#(<= ~counter~0 0)} assume !(0 == ~cond); {84028#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:12,041 INFO L290 TraceCheckUtils]: 14: Hoare triple {84028#(<= ~counter~0 0)} assume true; {84028#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:12,041 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {84028#(<= ~counter~0 0)} {84028#(<= ~counter~0 0)} #92#return; {84028#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:12,041 INFO L290 TraceCheckUtils]: 16: Hoare triple {84028#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {84028#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:12,043 INFO L290 TraceCheckUtils]: 17: Hoare triple {84028#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {84077#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:12,043 INFO L290 TraceCheckUtils]: 18: Hoare triple {84077#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {84077#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:12,044 INFO L272 TraceCheckUtils]: 19: Hoare triple {84077#(<= ~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)); {84077#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:12,044 INFO L290 TraceCheckUtils]: 20: Hoare triple {84077#(<= ~counter~0 1)} ~cond := #in~cond; {84077#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:12,044 INFO L290 TraceCheckUtils]: 21: Hoare triple {84077#(<= ~counter~0 1)} assume !(0 == ~cond); {84077#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:12,044 INFO L290 TraceCheckUtils]: 22: Hoare triple {84077#(<= ~counter~0 1)} assume true; {84077#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:12,045 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {84077#(<= ~counter~0 1)} {84077#(<= ~counter~0 1)} #94#return; {84077#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:12,045 INFO L290 TraceCheckUtils]: 24: Hoare triple {84077#(<= ~counter~0 1)} assume !!(0 != ~r~0); {84077#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:12,046 INFO L290 TraceCheckUtils]: 25: Hoare triple {84077#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {84102#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:12,046 INFO L290 TraceCheckUtils]: 26: Hoare triple {84102#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {84102#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:12,047 INFO L272 TraceCheckUtils]: 27: Hoare triple {84102#(<= ~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)); {84102#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:12,047 INFO L290 TraceCheckUtils]: 28: Hoare triple {84102#(<= ~counter~0 2)} ~cond := #in~cond; {84102#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:12,047 INFO L290 TraceCheckUtils]: 29: Hoare triple {84102#(<= ~counter~0 2)} assume !(0 == ~cond); {84102#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:12,047 INFO L290 TraceCheckUtils]: 30: Hoare triple {84102#(<= ~counter~0 2)} assume true; {84102#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:12,048 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {84102#(<= ~counter~0 2)} {84102#(<= ~counter~0 2)} #96#return; {84102#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:12,048 INFO L290 TraceCheckUtils]: 32: Hoare triple {84102#(<= ~counter~0 2)} assume !(~r~0 > 0); {84102#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:12,049 INFO L290 TraceCheckUtils]: 33: Hoare triple {84102#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {84127#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:12,049 INFO L290 TraceCheckUtils]: 34: Hoare triple {84127#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {84127#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:12,049 INFO L272 TraceCheckUtils]: 35: Hoare triple {84127#(<= ~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)); {84127#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:12,050 INFO L290 TraceCheckUtils]: 36: Hoare triple {84127#(<= ~counter~0 3)} ~cond := #in~cond; {84127#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:12,050 INFO L290 TraceCheckUtils]: 37: Hoare triple {84127#(<= ~counter~0 3)} assume !(0 == ~cond); {84127#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:12,050 INFO L290 TraceCheckUtils]: 38: Hoare triple {84127#(<= ~counter~0 3)} assume true; {84127#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:12,051 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {84127#(<= ~counter~0 3)} {84127#(<= ~counter~0 3)} #98#return; {84127#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:12,051 INFO L290 TraceCheckUtils]: 40: Hoare triple {84127#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {84127#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:12,052 INFO L290 TraceCheckUtils]: 41: Hoare triple {84127#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {84152#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:12,052 INFO L290 TraceCheckUtils]: 42: Hoare triple {84152#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {84152#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:12,052 INFO L272 TraceCheckUtils]: 43: Hoare triple {84152#(<= ~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)); {84152#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:12,053 INFO L290 TraceCheckUtils]: 44: Hoare triple {84152#(<= ~counter~0 4)} ~cond := #in~cond; {84152#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:12,053 INFO L290 TraceCheckUtils]: 45: Hoare triple {84152#(<= ~counter~0 4)} assume !(0 == ~cond); {84152#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:12,053 INFO L290 TraceCheckUtils]: 46: Hoare triple {84152#(<= ~counter~0 4)} assume true; {84152#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:12,054 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {84152#(<= ~counter~0 4)} {84152#(<= ~counter~0 4)} #98#return; {84152#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:12,054 INFO L290 TraceCheckUtils]: 48: Hoare triple {84152#(<= ~counter~0 4)} assume !(~r~0 < 0); {84152#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:12,055 INFO L290 TraceCheckUtils]: 49: Hoare triple {84152#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {84177#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:12,055 INFO L290 TraceCheckUtils]: 50: Hoare triple {84177#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {84177#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:12,055 INFO L272 TraceCheckUtils]: 51: Hoare triple {84177#(<= ~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)); {84177#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:12,056 INFO L290 TraceCheckUtils]: 52: Hoare triple {84177#(<= ~counter~0 5)} ~cond := #in~cond; {84177#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:12,056 INFO L290 TraceCheckUtils]: 53: Hoare triple {84177#(<= ~counter~0 5)} assume !(0 == ~cond); {84177#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:12,056 INFO L290 TraceCheckUtils]: 54: Hoare triple {84177#(<= ~counter~0 5)} assume true; {84177#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:12,057 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {84177#(<= ~counter~0 5)} {84177#(<= ~counter~0 5)} #94#return; {84177#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:12,057 INFO L290 TraceCheckUtils]: 56: Hoare triple {84177#(<= ~counter~0 5)} assume !!(0 != ~r~0); {84177#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:12,058 INFO L290 TraceCheckUtils]: 57: Hoare triple {84177#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {84202#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:12,058 INFO L290 TraceCheckUtils]: 58: Hoare triple {84202#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {84202#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:12,058 INFO L272 TraceCheckUtils]: 59: Hoare triple {84202#(<= ~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)); {84202#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:12,059 INFO L290 TraceCheckUtils]: 60: Hoare triple {84202#(<= ~counter~0 6)} ~cond := #in~cond; {84202#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:12,059 INFO L290 TraceCheckUtils]: 61: Hoare triple {84202#(<= ~counter~0 6)} assume !(0 == ~cond); {84202#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:12,059 INFO L290 TraceCheckUtils]: 62: Hoare triple {84202#(<= ~counter~0 6)} assume true; {84202#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:12,059 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {84202#(<= ~counter~0 6)} {84202#(<= ~counter~0 6)} #96#return; {84202#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:12,060 INFO L290 TraceCheckUtils]: 64: Hoare triple {84202#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {84202#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:12,061 INFO L290 TraceCheckUtils]: 65: Hoare triple {84202#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {84227#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:12,061 INFO L290 TraceCheckUtils]: 66: Hoare triple {84227#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {84227#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:12,061 INFO L272 TraceCheckUtils]: 67: Hoare triple {84227#(<= ~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)); {84227#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:12,061 INFO L290 TraceCheckUtils]: 68: Hoare triple {84227#(<= ~counter~0 7)} ~cond := #in~cond; {84227#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:12,062 INFO L290 TraceCheckUtils]: 69: Hoare triple {84227#(<= ~counter~0 7)} assume !(0 == ~cond); {84227#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:12,062 INFO L290 TraceCheckUtils]: 70: Hoare triple {84227#(<= ~counter~0 7)} assume true; {84227#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:12,062 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {84227#(<= ~counter~0 7)} {84227#(<= ~counter~0 7)} #96#return; {84227#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:12,063 INFO L290 TraceCheckUtils]: 72: Hoare triple {84227#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {84227#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:12,063 INFO L290 TraceCheckUtils]: 73: Hoare triple {84227#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {84252#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:12,064 INFO L290 TraceCheckUtils]: 74: Hoare triple {84252#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {84252#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:12,064 INFO L272 TraceCheckUtils]: 75: Hoare triple {84252#(<= ~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)); {84252#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:12,064 INFO L290 TraceCheckUtils]: 76: Hoare triple {84252#(<= ~counter~0 8)} ~cond := #in~cond; {84252#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:12,065 INFO L290 TraceCheckUtils]: 77: Hoare triple {84252#(<= ~counter~0 8)} assume !(0 == ~cond); {84252#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:12,065 INFO L290 TraceCheckUtils]: 78: Hoare triple {84252#(<= ~counter~0 8)} assume true; {84252#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:12,065 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {84252#(<= ~counter~0 8)} {84252#(<= ~counter~0 8)} #96#return; {84252#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:12,066 INFO L290 TraceCheckUtils]: 80: Hoare triple {84252#(<= ~counter~0 8)} assume !(~r~0 > 0); {84252#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:12,066 INFO L290 TraceCheckUtils]: 81: Hoare triple {84252#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {84277#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:12,067 INFO L290 TraceCheckUtils]: 82: Hoare triple {84277#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {84277#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:12,067 INFO L272 TraceCheckUtils]: 83: Hoare triple {84277#(<= ~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)); {84277#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:12,067 INFO L290 TraceCheckUtils]: 84: Hoare triple {84277#(<= ~counter~0 9)} ~cond := #in~cond; {84277#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:12,068 INFO L290 TraceCheckUtils]: 85: Hoare triple {84277#(<= ~counter~0 9)} assume !(0 == ~cond); {84277#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:12,068 INFO L290 TraceCheckUtils]: 86: Hoare triple {84277#(<= ~counter~0 9)} assume true; {84277#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:12,068 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {84277#(<= ~counter~0 9)} {84277#(<= ~counter~0 9)} #98#return; {84277#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:12,069 INFO L290 TraceCheckUtils]: 88: Hoare triple {84277#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {84277#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:12,069 INFO L290 TraceCheckUtils]: 89: Hoare triple {84277#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {84302#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:12,070 INFO L290 TraceCheckUtils]: 90: Hoare triple {84302#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {84302#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:12,070 INFO L272 TraceCheckUtils]: 91: Hoare triple {84302#(<= ~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)); {84302#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:12,070 INFO L290 TraceCheckUtils]: 92: Hoare triple {84302#(<= ~counter~0 10)} ~cond := #in~cond; {84302#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:12,071 INFO L290 TraceCheckUtils]: 93: Hoare triple {84302#(<= ~counter~0 10)} assume !(0 == ~cond); {84302#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:12,071 INFO L290 TraceCheckUtils]: 94: Hoare triple {84302#(<= ~counter~0 10)} assume true; {84302#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:12,071 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {84302#(<= ~counter~0 10)} {84302#(<= ~counter~0 10)} #98#return; {84302#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:12,072 INFO L290 TraceCheckUtils]: 96: Hoare triple {84302#(<= ~counter~0 10)} assume !(~r~0 < 0); {84302#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:12,072 INFO L290 TraceCheckUtils]: 97: Hoare triple {84302#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {84327#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:12,073 INFO L290 TraceCheckUtils]: 98: Hoare triple {84327#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {84327#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:12,073 INFO L272 TraceCheckUtils]: 99: Hoare triple {84327#(<= ~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)); {84327#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:12,073 INFO L290 TraceCheckUtils]: 100: Hoare triple {84327#(<= ~counter~0 11)} ~cond := #in~cond; {84327#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:12,074 INFO L290 TraceCheckUtils]: 101: Hoare triple {84327#(<= ~counter~0 11)} assume !(0 == ~cond); {84327#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:12,074 INFO L290 TraceCheckUtils]: 102: Hoare triple {84327#(<= ~counter~0 11)} assume true; {84327#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:12,074 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {84327#(<= ~counter~0 11)} {84327#(<= ~counter~0 11)} #94#return; {84327#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:12,074 INFO L290 TraceCheckUtils]: 104: Hoare triple {84327#(<= ~counter~0 11)} assume !!(0 != ~r~0); {84327#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:12,075 INFO L290 TraceCheckUtils]: 105: Hoare triple {84327#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {84352#(<= ~counter~0 12)} is VALID [2022-04-28 05:59:12,076 INFO L290 TraceCheckUtils]: 106: Hoare triple {84352#(<= ~counter~0 12)} assume !!(#t~post7 < 100);havoc #t~post7; {84352#(<= ~counter~0 12)} is VALID [2022-04-28 05:59:12,076 INFO L272 TraceCheckUtils]: 107: Hoare triple {84352#(<= ~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)); {84352#(<= ~counter~0 12)} is VALID [2022-04-28 05:59:12,076 INFO L290 TraceCheckUtils]: 108: Hoare triple {84352#(<= ~counter~0 12)} ~cond := #in~cond; {84352#(<= ~counter~0 12)} is VALID [2022-04-28 05:59:12,077 INFO L290 TraceCheckUtils]: 109: Hoare triple {84352#(<= ~counter~0 12)} assume !(0 == ~cond); {84352#(<= ~counter~0 12)} is VALID [2022-04-28 05:59:12,077 INFO L290 TraceCheckUtils]: 110: Hoare triple {84352#(<= ~counter~0 12)} assume true; {84352#(<= ~counter~0 12)} is VALID [2022-04-28 05:59:12,077 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {84352#(<= ~counter~0 12)} {84352#(<= ~counter~0 12)} #96#return; {84352#(<= ~counter~0 12)} is VALID [2022-04-28 05:59:12,077 INFO L290 TraceCheckUtils]: 112: Hoare triple {84352#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {84352#(<= ~counter~0 12)} is VALID [2022-04-28 05:59:12,078 INFO L290 TraceCheckUtils]: 113: Hoare triple {84352#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {84377#(<= |main_#t~post7| 12)} is VALID [2022-04-28 05:59:12,078 INFO L290 TraceCheckUtils]: 114: Hoare triple {84377#(<= |main_#t~post7| 12)} assume !(#t~post7 < 100);havoc #t~post7; {84021#false} is VALID [2022-04-28 05:59:12,078 INFO L290 TraceCheckUtils]: 115: Hoare triple {84021#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {84021#false} is VALID [2022-04-28 05:59:12,078 INFO L290 TraceCheckUtils]: 116: Hoare triple {84021#false} assume !(#t~post8 < 100);havoc #t~post8; {84021#false} is VALID [2022-04-28 05:59:12,078 INFO L290 TraceCheckUtils]: 117: Hoare triple {84021#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {84021#false} is VALID [2022-04-28 05:59:12,078 INFO L290 TraceCheckUtils]: 118: Hoare triple {84021#false} assume !(#t~post6 < 100);havoc #t~post6; {84021#false} is VALID [2022-04-28 05:59:12,078 INFO L272 TraceCheckUtils]: 119: Hoare triple {84021#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)); {84021#false} is VALID [2022-04-28 05:59:12,078 INFO L290 TraceCheckUtils]: 120: Hoare triple {84021#false} ~cond := #in~cond; {84021#false} is VALID [2022-04-28 05:59:12,079 INFO L290 TraceCheckUtils]: 121: Hoare triple {84021#false} assume 0 == ~cond; {84021#false} is VALID [2022-04-28 05:59:12,079 INFO L290 TraceCheckUtils]: 122: Hoare triple {84021#false} assume !false; {84021#false} is VALID [2022-04-28 05:59:12,079 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 38 proven. 350 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:59:12,079 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:59:12,722 INFO L290 TraceCheckUtils]: 122: Hoare triple {84021#false} assume !false; {84021#false} is VALID [2022-04-28 05:59:12,722 INFO L290 TraceCheckUtils]: 121: Hoare triple {84021#false} assume 0 == ~cond; {84021#false} is VALID [2022-04-28 05:59:12,722 INFO L290 TraceCheckUtils]: 120: Hoare triple {84021#false} ~cond := #in~cond; {84021#false} is VALID [2022-04-28 05:59:12,722 INFO L272 TraceCheckUtils]: 119: Hoare triple {84021#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)); {84021#false} is VALID [2022-04-28 05:59:12,722 INFO L290 TraceCheckUtils]: 118: Hoare triple {84021#false} assume !(#t~post6 < 100);havoc #t~post6; {84021#false} is VALID [2022-04-28 05:59:12,722 INFO L290 TraceCheckUtils]: 117: Hoare triple {84021#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {84021#false} is VALID [2022-04-28 05:59:12,722 INFO L290 TraceCheckUtils]: 116: Hoare triple {84021#false} assume !(#t~post8 < 100);havoc #t~post8; {84021#false} is VALID [2022-04-28 05:59:12,722 INFO L290 TraceCheckUtils]: 115: Hoare triple {84021#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {84021#false} is VALID [2022-04-28 05:59:12,723 INFO L290 TraceCheckUtils]: 114: Hoare triple {84429#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {84021#false} is VALID [2022-04-28 05:59:12,723 INFO L290 TraceCheckUtils]: 113: Hoare triple {84433#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {84429#(< |main_#t~post7| 100)} is VALID [2022-04-28 05:59:12,723 INFO L290 TraceCheckUtils]: 112: Hoare triple {84433#(< ~counter~0 100)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {84433#(< ~counter~0 100)} is VALID [2022-04-28 05:59:12,724 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {84020#true} {84433#(< ~counter~0 100)} #96#return; {84433#(< ~counter~0 100)} is VALID [2022-04-28 05:59:12,724 INFO L290 TraceCheckUtils]: 110: Hoare triple {84020#true} assume true; {84020#true} is VALID [2022-04-28 05:59:12,724 INFO L290 TraceCheckUtils]: 109: Hoare triple {84020#true} assume !(0 == ~cond); {84020#true} is VALID [2022-04-28 05:59:12,724 INFO L290 TraceCheckUtils]: 108: Hoare triple {84020#true} ~cond := #in~cond; {84020#true} is VALID [2022-04-28 05:59:12,724 INFO L272 TraceCheckUtils]: 107: Hoare triple {84433#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {84020#true} is VALID [2022-04-28 05:59:12,724 INFO L290 TraceCheckUtils]: 106: Hoare triple {84433#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {84433#(< ~counter~0 100)} is VALID [2022-04-28 05:59:12,726 INFO L290 TraceCheckUtils]: 105: Hoare triple {84458#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {84433#(< ~counter~0 100)} is VALID [2022-04-28 05:59:12,727 INFO L290 TraceCheckUtils]: 104: Hoare triple {84458#(< ~counter~0 99)} assume !!(0 != ~r~0); {84458#(< ~counter~0 99)} is VALID [2022-04-28 05:59:12,727 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {84020#true} {84458#(< ~counter~0 99)} #94#return; {84458#(< ~counter~0 99)} is VALID [2022-04-28 05:59:12,727 INFO L290 TraceCheckUtils]: 102: Hoare triple {84020#true} assume true; {84020#true} is VALID [2022-04-28 05:59:12,727 INFO L290 TraceCheckUtils]: 101: Hoare triple {84020#true} assume !(0 == ~cond); {84020#true} is VALID [2022-04-28 05:59:12,727 INFO L290 TraceCheckUtils]: 100: Hoare triple {84020#true} ~cond := #in~cond; {84020#true} is VALID [2022-04-28 05:59:12,727 INFO L272 TraceCheckUtils]: 99: Hoare triple {84458#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {84020#true} is VALID [2022-04-28 05:59:12,728 INFO L290 TraceCheckUtils]: 98: Hoare triple {84458#(< ~counter~0 99)} assume !!(#t~post6 < 100);havoc #t~post6; {84458#(< ~counter~0 99)} is VALID [2022-04-28 05:59:12,729 INFO L290 TraceCheckUtils]: 97: Hoare triple {84483#(< ~counter~0 98)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {84458#(< ~counter~0 99)} is VALID [2022-04-28 05:59:12,729 INFO L290 TraceCheckUtils]: 96: Hoare triple {84483#(< ~counter~0 98)} assume !(~r~0 < 0); {84483#(< ~counter~0 98)} is VALID [2022-04-28 05:59:12,729 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {84020#true} {84483#(< ~counter~0 98)} #98#return; {84483#(< ~counter~0 98)} is VALID [2022-04-28 05:59:12,729 INFO L290 TraceCheckUtils]: 94: Hoare triple {84020#true} assume true; {84020#true} is VALID [2022-04-28 05:59:12,729 INFO L290 TraceCheckUtils]: 93: Hoare triple {84020#true} assume !(0 == ~cond); {84020#true} is VALID [2022-04-28 05:59:12,730 INFO L290 TraceCheckUtils]: 92: Hoare triple {84020#true} ~cond := #in~cond; {84020#true} is VALID [2022-04-28 05:59:12,730 INFO L272 TraceCheckUtils]: 91: Hoare triple {84483#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {84020#true} is VALID [2022-04-28 05:59:12,730 INFO L290 TraceCheckUtils]: 90: Hoare triple {84483#(< ~counter~0 98)} assume !!(#t~post8 < 100);havoc #t~post8; {84483#(< ~counter~0 98)} is VALID [2022-04-28 05:59:12,731 INFO L290 TraceCheckUtils]: 89: Hoare triple {84508#(< ~counter~0 97)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {84483#(< ~counter~0 98)} is VALID [2022-04-28 05:59:12,731 INFO L290 TraceCheckUtils]: 88: Hoare triple {84508#(< ~counter~0 97)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {84508#(< ~counter~0 97)} is VALID [2022-04-28 05:59:12,731 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {84020#true} {84508#(< ~counter~0 97)} #98#return; {84508#(< ~counter~0 97)} is VALID [2022-04-28 05:59:12,732 INFO L290 TraceCheckUtils]: 86: Hoare triple {84020#true} assume true; {84020#true} is VALID [2022-04-28 05:59:12,732 INFO L290 TraceCheckUtils]: 85: Hoare triple {84020#true} assume !(0 == ~cond); {84020#true} is VALID [2022-04-28 05:59:12,732 INFO L290 TraceCheckUtils]: 84: Hoare triple {84020#true} ~cond := #in~cond; {84020#true} is VALID [2022-04-28 05:59:12,732 INFO L272 TraceCheckUtils]: 83: Hoare triple {84508#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {84020#true} is VALID [2022-04-28 05:59:12,732 INFO L290 TraceCheckUtils]: 82: Hoare triple {84508#(< ~counter~0 97)} assume !!(#t~post8 < 100);havoc #t~post8; {84508#(< ~counter~0 97)} is VALID [2022-04-28 05:59:12,733 INFO L290 TraceCheckUtils]: 81: Hoare triple {84533#(< ~counter~0 96)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {84508#(< ~counter~0 97)} is VALID [2022-04-28 05:59:12,733 INFO L290 TraceCheckUtils]: 80: Hoare triple {84533#(< ~counter~0 96)} assume !(~r~0 > 0); {84533#(< ~counter~0 96)} is VALID [2022-04-28 05:59:12,734 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {84020#true} {84533#(< ~counter~0 96)} #96#return; {84533#(< ~counter~0 96)} is VALID [2022-04-28 05:59:12,734 INFO L290 TraceCheckUtils]: 78: Hoare triple {84020#true} assume true; {84020#true} is VALID [2022-04-28 05:59:12,734 INFO L290 TraceCheckUtils]: 77: Hoare triple {84020#true} assume !(0 == ~cond); {84020#true} is VALID [2022-04-28 05:59:12,734 INFO L290 TraceCheckUtils]: 76: Hoare triple {84020#true} ~cond := #in~cond; {84020#true} is VALID [2022-04-28 05:59:12,734 INFO L272 TraceCheckUtils]: 75: Hoare triple {84533#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {84020#true} is VALID [2022-04-28 05:59:12,734 INFO L290 TraceCheckUtils]: 74: Hoare triple {84533#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {84533#(< ~counter~0 96)} is VALID [2022-04-28 05:59:12,735 INFO L290 TraceCheckUtils]: 73: Hoare triple {84558#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {84533#(< ~counter~0 96)} is VALID [2022-04-28 05:59:12,735 INFO L290 TraceCheckUtils]: 72: Hoare triple {84558#(< ~counter~0 95)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {84558#(< ~counter~0 95)} is VALID [2022-04-28 05:59:12,736 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {84020#true} {84558#(< ~counter~0 95)} #96#return; {84558#(< ~counter~0 95)} is VALID [2022-04-28 05:59:12,736 INFO L290 TraceCheckUtils]: 70: Hoare triple {84020#true} assume true; {84020#true} is VALID [2022-04-28 05:59:12,736 INFO L290 TraceCheckUtils]: 69: Hoare triple {84020#true} assume !(0 == ~cond); {84020#true} is VALID [2022-04-28 05:59:12,736 INFO L290 TraceCheckUtils]: 68: Hoare triple {84020#true} ~cond := #in~cond; {84020#true} is VALID [2022-04-28 05:59:12,736 INFO L272 TraceCheckUtils]: 67: Hoare triple {84558#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {84020#true} is VALID [2022-04-28 05:59:12,736 INFO L290 TraceCheckUtils]: 66: Hoare triple {84558#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {84558#(< ~counter~0 95)} is VALID [2022-04-28 05:59:12,737 INFO L290 TraceCheckUtils]: 65: Hoare triple {84583#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {84558#(< ~counter~0 95)} is VALID [2022-04-28 05:59:12,737 INFO L290 TraceCheckUtils]: 64: Hoare triple {84583#(< ~counter~0 94)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {84583#(< ~counter~0 94)} is VALID [2022-04-28 05:59:12,738 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {84020#true} {84583#(< ~counter~0 94)} #96#return; {84583#(< ~counter~0 94)} is VALID [2022-04-28 05:59:12,738 INFO L290 TraceCheckUtils]: 62: Hoare triple {84020#true} assume true; {84020#true} is VALID [2022-04-28 05:59:12,738 INFO L290 TraceCheckUtils]: 61: Hoare triple {84020#true} assume !(0 == ~cond); {84020#true} is VALID [2022-04-28 05:59:12,738 INFO L290 TraceCheckUtils]: 60: Hoare triple {84020#true} ~cond := #in~cond; {84020#true} is VALID [2022-04-28 05:59:12,738 INFO L272 TraceCheckUtils]: 59: Hoare triple {84583#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {84020#true} is VALID [2022-04-28 05:59:12,738 INFO L290 TraceCheckUtils]: 58: Hoare triple {84583#(< ~counter~0 94)} assume !!(#t~post7 < 100);havoc #t~post7; {84583#(< ~counter~0 94)} is VALID [2022-04-28 05:59:12,739 INFO L290 TraceCheckUtils]: 57: Hoare triple {84608#(< ~counter~0 93)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {84583#(< ~counter~0 94)} is VALID [2022-04-28 05:59:12,740 INFO L290 TraceCheckUtils]: 56: Hoare triple {84608#(< ~counter~0 93)} assume !!(0 != ~r~0); {84608#(< ~counter~0 93)} is VALID [2022-04-28 05:59:12,740 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {84020#true} {84608#(< ~counter~0 93)} #94#return; {84608#(< ~counter~0 93)} is VALID [2022-04-28 05:59:12,740 INFO L290 TraceCheckUtils]: 54: Hoare triple {84020#true} assume true; {84020#true} is VALID [2022-04-28 05:59:12,740 INFO L290 TraceCheckUtils]: 53: Hoare triple {84020#true} assume !(0 == ~cond); {84020#true} is VALID [2022-04-28 05:59:12,740 INFO L290 TraceCheckUtils]: 52: Hoare triple {84020#true} ~cond := #in~cond; {84020#true} is VALID [2022-04-28 05:59:12,740 INFO L272 TraceCheckUtils]: 51: Hoare triple {84608#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {84020#true} is VALID [2022-04-28 05:59:12,741 INFO L290 TraceCheckUtils]: 50: Hoare triple {84608#(< ~counter~0 93)} assume !!(#t~post6 < 100);havoc #t~post6; {84608#(< ~counter~0 93)} is VALID [2022-04-28 05:59:12,741 INFO L290 TraceCheckUtils]: 49: Hoare triple {84633#(< ~counter~0 92)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {84608#(< ~counter~0 93)} is VALID [2022-04-28 05:59:12,742 INFO L290 TraceCheckUtils]: 48: Hoare triple {84633#(< ~counter~0 92)} assume !(~r~0 < 0); {84633#(< ~counter~0 92)} is VALID [2022-04-28 05:59:12,742 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {84020#true} {84633#(< ~counter~0 92)} #98#return; {84633#(< ~counter~0 92)} is VALID [2022-04-28 05:59:12,742 INFO L290 TraceCheckUtils]: 46: Hoare triple {84020#true} assume true; {84020#true} is VALID [2022-04-28 05:59:12,742 INFO L290 TraceCheckUtils]: 45: Hoare triple {84020#true} assume !(0 == ~cond); {84020#true} is VALID [2022-04-28 05:59:12,742 INFO L290 TraceCheckUtils]: 44: Hoare triple {84020#true} ~cond := #in~cond; {84020#true} is VALID [2022-04-28 05:59:12,742 INFO L272 TraceCheckUtils]: 43: Hoare triple {84633#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {84020#true} is VALID [2022-04-28 05:59:12,743 INFO L290 TraceCheckUtils]: 42: Hoare triple {84633#(< ~counter~0 92)} assume !!(#t~post8 < 100);havoc #t~post8; {84633#(< ~counter~0 92)} is VALID [2022-04-28 05:59:12,744 INFO L290 TraceCheckUtils]: 41: Hoare triple {84658#(< ~counter~0 91)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {84633#(< ~counter~0 92)} is VALID [2022-04-28 05:59:12,744 INFO L290 TraceCheckUtils]: 40: Hoare triple {84658#(< ~counter~0 91)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {84658#(< ~counter~0 91)} is VALID [2022-04-28 05:59:12,744 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {84020#true} {84658#(< ~counter~0 91)} #98#return; {84658#(< ~counter~0 91)} is VALID [2022-04-28 05:59:12,744 INFO L290 TraceCheckUtils]: 38: Hoare triple {84020#true} assume true; {84020#true} is VALID [2022-04-28 05:59:12,744 INFO L290 TraceCheckUtils]: 37: Hoare triple {84020#true} assume !(0 == ~cond); {84020#true} is VALID [2022-04-28 05:59:12,745 INFO L290 TraceCheckUtils]: 36: Hoare triple {84020#true} ~cond := #in~cond; {84020#true} is VALID [2022-04-28 05:59:12,745 INFO L272 TraceCheckUtils]: 35: Hoare triple {84658#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {84020#true} is VALID [2022-04-28 05:59:12,745 INFO L290 TraceCheckUtils]: 34: Hoare triple {84658#(< ~counter~0 91)} assume !!(#t~post8 < 100);havoc #t~post8; {84658#(< ~counter~0 91)} is VALID [2022-04-28 05:59:12,746 INFO L290 TraceCheckUtils]: 33: Hoare triple {84683#(< ~counter~0 90)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {84658#(< ~counter~0 91)} is VALID [2022-04-28 05:59:12,746 INFO L290 TraceCheckUtils]: 32: Hoare triple {84683#(< ~counter~0 90)} assume !(~r~0 > 0); {84683#(< ~counter~0 90)} is VALID [2022-04-28 05:59:12,746 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {84020#true} {84683#(< ~counter~0 90)} #96#return; {84683#(< ~counter~0 90)} is VALID [2022-04-28 05:59:12,747 INFO L290 TraceCheckUtils]: 30: Hoare triple {84020#true} assume true; {84020#true} is VALID [2022-04-28 05:59:12,747 INFO L290 TraceCheckUtils]: 29: Hoare triple {84020#true} assume !(0 == ~cond); {84020#true} is VALID [2022-04-28 05:59:12,747 INFO L290 TraceCheckUtils]: 28: Hoare triple {84020#true} ~cond := #in~cond; {84020#true} is VALID [2022-04-28 05:59:12,747 INFO L272 TraceCheckUtils]: 27: Hoare triple {84683#(< ~counter~0 90)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {84020#true} is VALID [2022-04-28 05:59:12,747 INFO L290 TraceCheckUtils]: 26: Hoare triple {84683#(< ~counter~0 90)} assume !!(#t~post7 < 100);havoc #t~post7; {84683#(< ~counter~0 90)} is VALID [2022-04-28 05:59:12,748 INFO L290 TraceCheckUtils]: 25: Hoare triple {84708#(< ~counter~0 89)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {84683#(< ~counter~0 90)} is VALID [2022-04-28 05:59:12,748 INFO L290 TraceCheckUtils]: 24: Hoare triple {84708#(< ~counter~0 89)} assume !!(0 != ~r~0); {84708#(< ~counter~0 89)} is VALID [2022-04-28 05:59:12,749 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {84020#true} {84708#(< ~counter~0 89)} #94#return; {84708#(< ~counter~0 89)} is VALID [2022-04-28 05:59:12,749 INFO L290 TraceCheckUtils]: 22: Hoare triple {84020#true} assume true; {84020#true} is VALID [2022-04-28 05:59:12,749 INFO L290 TraceCheckUtils]: 21: Hoare triple {84020#true} assume !(0 == ~cond); {84020#true} is VALID [2022-04-28 05:59:12,749 INFO L290 TraceCheckUtils]: 20: Hoare triple {84020#true} ~cond := #in~cond; {84020#true} is VALID [2022-04-28 05:59:12,749 INFO L272 TraceCheckUtils]: 19: Hoare triple {84708#(< ~counter~0 89)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {84020#true} is VALID [2022-04-28 05:59:12,749 INFO L290 TraceCheckUtils]: 18: Hoare triple {84708#(< ~counter~0 89)} assume !!(#t~post6 < 100);havoc #t~post6; {84708#(< ~counter~0 89)} is VALID [2022-04-28 05:59:12,750 INFO L290 TraceCheckUtils]: 17: Hoare triple {84733#(< ~counter~0 88)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {84708#(< ~counter~0 89)} is VALID [2022-04-28 05:59:12,750 INFO L290 TraceCheckUtils]: 16: Hoare triple {84733#(< ~counter~0 88)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {84733#(< ~counter~0 88)} is VALID [2022-04-28 05:59:12,751 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {84020#true} {84733#(< ~counter~0 88)} #92#return; {84733#(< ~counter~0 88)} is VALID [2022-04-28 05:59:12,751 INFO L290 TraceCheckUtils]: 14: Hoare triple {84020#true} assume true; {84020#true} is VALID [2022-04-28 05:59:12,751 INFO L290 TraceCheckUtils]: 13: Hoare triple {84020#true} assume !(0 == ~cond); {84020#true} is VALID [2022-04-28 05:59:12,751 INFO L290 TraceCheckUtils]: 12: Hoare triple {84020#true} ~cond := #in~cond; {84020#true} is VALID [2022-04-28 05:59:12,751 INFO L272 TraceCheckUtils]: 11: Hoare triple {84733#(< ~counter~0 88)} 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)); {84020#true} is VALID [2022-04-28 05:59:12,751 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {84020#true} {84733#(< ~counter~0 88)} #90#return; {84733#(< ~counter~0 88)} is VALID [2022-04-28 05:59:12,752 INFO L290 TraceCheckUtils]: 9: Hoare triple {84020#true} assume true; {84020#true} is VALID [2022-04-28 05:59:12,752 INFO L290 TraceCheckUtils]: 8: Hoare triple {84020#true} assume !(0 == ~cond); {84020#true} is VALID [2022-04-28 05:59:12,752 INFO L290 TraceCheckUtils]: 7: Hoare triple {84020#true} ~cond := #in~cond; {84020#true} is VALID [2022-04-28 05:59:12,752 INFO L272 TraceCheckUtils]: 6: Hoare triple {84733#(< ~counter~0 88)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {84020#true} is VALID [2022-04-28 05:59:12,752 INFO L290 TraceCheckUtils]: 5: Hoare triple {84733#(< ~counter~0 88)} 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; {84733#(< ~counter~0 88)} is VALID [2022-04-28 05:59:12,752 INFO L272 TraceCheckUtils]: 4: Hoare triple {84733#(< ~counter~0 88)} call #t~ret9 := main(); {84733#(< ~counter~0 88)} is VALID [2022-04-28 05:59:12,753 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {84733#(< ~counter~0 88)} {84020#true} #102#return; {84733#(< ~counter~0 88)} is VALID [2022-04-28 05:59:12,753 INFO L290 TraceCheckUtils]: 2: Hoare triple {84733#(< ~counter~0 88)} assume true; {84733#(< ~counter~0 88)} is VALID [2022-04-28 05:59:12,753 INFO L290 TraceCheckUtils]: 1: Hoare triple {84020#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; {84733#(< ~counter~0 88)} is VALID [2022-04-28 05:59:12,753 INFO L272 TraceCheckUtils]: 0: Hoare triple {84020#true} call ULTIMATE.init(); {84020#true} is VALID [2022-04-28 05:59:12,754 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 38 proven. 86 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2022-04-28 05:59:12,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:59:12,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514935636] [2022-04-28 05:59:12,754 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:59:12,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108868960] [2022-04-28 05:59:12,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2108868960] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:59:12,754 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:59:12,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2022-04-28 05:59:12,754 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:59:12,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [53068356] [2022-04-28 05:59:12,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [53068356] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:59:12,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:59:12,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 05:59:12,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111127261] [2022-04-28 05:59:12,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:59:12,755 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) Word has length 123 [2022-04-28 05:59:12,755 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:59:12,755 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-28 05:59:12,853 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:59:12,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 05:59:12,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:59:12,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 05:59:12,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=383, Invalid=487, Unknown=0, NotChecked=0, Total=870 [2022-04-28 05:59:12,854 INFO L87 Difference]: Start difference. First operand 634 states and 863 transitions. Second operand has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-28 05:59:15,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:59:15,603 INFO L93 Difference]: Finished difference Result 847 states and 1187 transitions. [2022-04-28 05:59:15,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-28 05:59:15,603 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) Word has length 123 [2022-04-28 05:59:15,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:59:15,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-28 05:59:15,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 276 transitions. [2022-04-28 05:59:15,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-28 05:59:15,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 276 transitions. [2022-04-28 05:59:15,607 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 276 transitions. [2022-04-28 05:59:15,873 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 276 edges. 276 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:59:15,890 INFO L225 Difference]: With dead ends: 847 [2022-04-28 05:59:15,890 INFO L226 Difference]: Without dead ends: 650 [2022-04-28 05:59:15,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=691, Invalid=949, Unknown=0, NotChecked=0, Total=1640 [2022-04-28 05:59:15,892 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 171 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 05:59:15,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 281 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 05:59:15,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2022-04-28 05:59:17,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2022-04-28 05:59:17,746 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:59:17,747 INFO L82 GeneralOperation]: Start isEquivalent. First operand 650 states. Second operand has 650 states, 494 states have (on average 1.2165991902834008) internal successors, (601), 494 states have internal predecessors, (601), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 138 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-28 05:59:17,747 INFO L74 IsIncluded]: Start isIncluded. First operand 650 states. Second operand has 650 states, 494 states have (on average 1.2165991902834008) internal successors, (601), 494 states have internal predecessors, (601), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 138 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-28 05:59:17,747 INFO L87 Difference]: Start difference. First operand 650 states. Second operand has 650 states, 494 states have (on average 1.2165991902834008) internal successors, (601), 494 states have internal predecessors, (601), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 138 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-28 05:59:17,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:59:17,762 INFO L93 Difference]: Finished difference Result 650 states and 879 transitions. [2022-04-28 05:59:17,762 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 879 transitions. [2022-04-28 05:59:17,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:59:17,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:59:17,763 INFO L74 IsIncluded]: Start isIncluded. First operand has 650 states, 494 states have (on average 1.2165991902834008) internal successors, (601), 494 states have internal predecessors, (601), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 138 states have call predecessors, (138), 138 states have call successors, (138) Second operand 650 states. [2022-04-28 05:59:17,764 INFO L87 Difference]: Start difference. First operand has 650 states, 494 states have (on average 1.2165991902834008) internal successors, (601), 494 states have internal predecessors, (601), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 138 states have call predecessors, (138), 138 states have call successors, (138) Second operand 650 states. [2022-04-28 05:59:17,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:59:17,779 INFO L93 Difference]: Finished difference Result 650 states and 879 transitions. [2022-04-28 05:59:17,779 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 879 transitions. [2022-04-28 05:59:17,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:59:17,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:59:17,779 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:59:17,779 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:59:17,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 494 states have (on average 1.2165991902834008) internal successors, (601), 494 states have internal predecessors, (601), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 138 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-28 05:59:17,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 879 transitions. [2022-04-28 05:59:17,799 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 879 transitions. Word has length 123 [2022-04-28 05:59:17,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:59:17,799 INFO L495 AbstractCegarLoop]: Abstraction has 650 states and 879 transitions. [2022-04-28 05:59:17,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-28 05:59:17,799 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 650 states and 879 transitions. [2022-04-28 05:59:22,368 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 879 edges. 878 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 05:59:22,369 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 879 transitions. [2022-04-28 05:59:22,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-04-28 05:59:22,370 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:59:22,370 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 7, 7, 7, 7, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:59:22,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-04-28 05:59:22,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:59:22,583 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:59:22,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:59:22,583 INFO L85 PathProgramCache]: Analyzing trace with hash -992818924, now seen corresponding path program 9 times [2022-04-28 05:59:22,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:59:22,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [195297614] [2022-04-28 05:59:22,584 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:59:22,584 INFO L85 PathProgramCache]: Analyzing trace with hash -992818924, now seen corresponding path program 10 times [2022-04-28 05:59:22,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:59:22,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788661354] [2022-04-28 05:59:22,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:59:22,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:59:22,598 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:59:22,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1766569323] [2022-04-28 05:59:22,598 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 05:59:22,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:59:22,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:59:22,599 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:59:22,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-04-28 05:59:22,658 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 05:59:22,659 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:59:22,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 05:59:22,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:59:22,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:59:23,261 INFO L272 TraceCheckUtils]: 0: Hoare triple {89103#true} call ULTIMATE.init(); {89103#true} is VALID [2022-04-28 05:59:23,262 INFO L290 TraceCheckUtils]: 1: Hoare triple {89103#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; {89111#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:23,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {89111#(<= ~counter~0 0)} assume true; {89111#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:23,262 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {89111#(<= ~counter~0 0)} {89103#true} #102#return; {89111#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:23,263 INFO L272 TraceCheckUtils]: 4: Hoare triple {89111#(<= ~counter~0 0)} call #t~ret9 := main(); {89111#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:23,263 INFO L290 TraceCheckUtils]: 5: Hoare triple {89111#(<= ~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; {89111#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:23,263 INFO L272 TraceCheckUtils]: 6: Hoare triple {89111#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {89111#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:23,264 INFO L290 TraceCheckUtils]: 7: Hoare triple {89111#(<= ~counter~0 0)} ~cond := #in~cond; {89111#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:23,264 INFO L290 TraceCheckUtils]: 8: Hoare triple {89111#(<= ~counter~0 0)} assume !(0 == ~cond); {89111#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:23,264 INFO L290 TraceCheckUtils]: 9: Hoare triple {89111#(<= ~counter~0 0)} assume true; {89111#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:23,264 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {89111#(<= ~counter~0 0)} {89111#(<= ~counter~0 0)} #90#return; {89111#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:23,265 INFO L272 TraceCheckUtils]: 11: Hoare triple {89111#(<= ~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)); {89111#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:23,265 INFO L290 TraceCheckUtils]: 12: Hoare triple {89111#(<= ~counter~0 0)} ~cond := #in~cond; {89111#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:23,265 INFO L290 TraceCheckUtils]: 13: Hoare triple {89111#(<= ~counter~0 0)} assume !(0 == ~cond); {89111#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:23,266 INFO L290 TraceCheckUtils]: 14: Hoare triple {89111#(<= ~counter~0 0)} assume true; {89111#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:23,266 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {89111#(<= ~counter~0 0)} {89111#(<= ~counter~0 0)} #92#return; {89111#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:23,266 INFO L290 TraceCheckUtils]: 16: Hoare triple {89111#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {89111#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:23,268 INFO L290 TraceCheckUtils]: 17: Hoare triple {89111#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {89160#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:23,268 INFO L290 TraceCheckUtils]: 18: Hoare triple {89160#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {89160#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:23,269 INFO L272 TraceCheckUtils]: 19: Hoare triple {89160#(<= ~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)); {89160#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:23,269 INFO L290 TraceCheckUtils]: 20: Hoare triple {89160#(<= ~counter~0 1)} ~cond := #in~cond; {89160#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:23,269 INFO L290 TraceCheckUtils]: 21: Hoare triple {89160#(<= ~counter~0 1)} assume !(0 == ~cond); {89160#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:23,270 INFO L290 TraceCheckUtils]: 22: Hoare triple {89160#(<= ~counter~0 1)} assume true; {89160#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:23,270 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {89160#(<= ~counter~0 1)} {89160#(<= ~counter~0 1)} #94#return; {89160#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:23,270 INFO L290 TraceCheckUtils]: 24: Hoare triple {89160#(<= ~counter~0 1)} assume !!(0 != ~r~0); {89160#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:23,271 INFO L290 TraceCheckUtils]: 25: Hoare triple {89160#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89185#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:23,271 INFO L290 TraceCheckUtils]: 26: Hoare triple {89185#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {89185#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:23,272 INFO L272 TraceCheckUtils]: 27: Hoare triple {89185#(<= ~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)); {89185#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:23,272 INFO L290 TraceCheckUtils]: 28: Hoare triple {89185#(<= ~counter~0 2)} ~cond := #in~cond; {89185#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:23,272 INFO L290 TraceCheckUtils]: 29: Hoare triple {89185#(<= ~counter~0 2)} assume !(0 == ~cond); {89185#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:23,273 INFO L290 TraceCheckUtils]: 30: Hoare triple {89185#(<= ~counter~0 2)} assume true; {89185#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:23,273 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {89185#(<= ~counter~0 2)} {89185#(<= ~counter~0 2)} #96#return; {89185#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:23,273 INFO L290 TraceCheckUtils]: 32: Hoare triple {89185#(<= ~counter~0 2)} assume !(~r~0 > 0); {89185#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:23,274 INFO L290 TraceCheckUtils]: 33: Hoare triple {89185#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {89210#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:23,274 INFO L290 TraceCheckUtils]: 34: Hoare triple {89210#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {89210#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:23,275 INFO L272 TraceCheckUtils]: 35: Hoare triple {89210#(<= ~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)); {89210#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:23,275 INFO L290 TraceCheckUtils]: 36: Hoare triple {89210#(<= ~counter~0 3)} ~cond := #in~cond; {89210#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:23,275 INFO L290 TraceCheckUtils]: 37: Hoare triple {89210#(<= ~counter~0 3)} assume !(0 == ~cond); {89210#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:23,276 INFO L290 TraceCheckUtils]: 38: Hoare triple {89210#(<= ~counter~0 3)} assume true; {89210#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:23,276 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {89210#(<= ~counter~0 3)} {89210#(<= ~counter~0 3)} #98#return; {89210#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:23,276 INFO L290 TraceCheckUtils]: 40: Hoare triple {89210#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {89210#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:23,277 INFO L290 TraceCheckUtils]: 41: Hoare triple {89210#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {89235#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:23,277 INFO L290 TraceCheckUtils]: 42: Hoare triple {89235#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {89235#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:23,278 INFO L272 TraceCheckUtils]: 43: Hoare triple {89235#(<= ~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)); {89235#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:23,278 INFO L290 TraceCheckUtils]: 44: Hoare triple {89235#(<= ~counter~0 4)} ~cond := #in~cond; {89235#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:23,278 INFO L290 TraceCheckUtils]: 45: Hoare triple {89235#(<= ~counter~0 4)} assume !(0 == ~cond); {89235#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:23,279 INFO L290 TraceCheckUtils]: 46: Hoare triple {89235#(<= ~counter~0 4)} assume true; {89235#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:23,279 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {89235#(<= ~counter~0 4)} {89235#(<= ~counter~0 4)} #98#return; {89235#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:23,279 INFO L290 TraceCheckUtils]: 48: Hoare triple {89235#(<= ~counter~0 4)} assume !(~r~0 < 0); {89235#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:23,280 INFO L290 TraceCheckUtils]: 49: Hoare triple {89235#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {89260#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:23,280 INFO L290 TraceCheckUtils]: 50: Hoare triple {89260#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {89260#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:23,281 INFO L272 TraceCheckUtils]: 51: Hoare triple {89260#(<= ~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)); {89260#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:23,281 INFO L290 TraceCheckUtils]: 52: Hoare triple {89260#(<= ~counter~0 5)} ~cond := #in~cond; {89260#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:23,281 INFO L290 TraceCheckUtils]: 53: Hoare triple {89260#(<= ~counter~0 5)} assume !(0 == ~cond); {89260#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:23,282 INFO L290 TraceCheckUtils]: 54: Hoare triple {89260#(<= ~counter~0 5)} assume true; {89260#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:23,282 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {89260#(<= ~counter~0 5)} {89260#(<= ~counter~0 5)} #94#return; {89260#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:23,282 INFO L290 TraceCheckUtils]: 56: Hoare triple {89260#(<= ~counter~0 5)} assume !!(0 != ~r~0); {89260#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:23,283 INFO L290 TraceCheckUtils]: 57: Hoare triple {89260#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89285#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:23,284 INFO L290 TraceCheckUtils]: 58: Hoare triple {89285#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {89285#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:23,284 INFO L272 TraceCheckUtils]: 59: Hoare triple {89285#(<= ~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)); {89285#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:23,284 INFO L290 TraceCheckUtils]: 60: Hoare triple {89285#(<= ~counter~0 6)} ~cond := #in~cond; {89285#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:23,285 INFO L290 TraceCheckUtils]: 61: Hoare triple {89285#(<= ~counter~0 6)} assume !(0 == ~cond); {89285#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:23,285 INFO L290 TraceCheckUtils]: 62: Hoare triple {89285#(<= ~counter~0 6)} assume true; {89285#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:23,285 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {89285#(<= ~counter~0 6)} {89285#(<= ~counter~0 6)} #96#return; {89285#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:23,285 INFO L290 TraceCheckUtils]: 64: Hoare triple {89285#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {89285#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:23,286 INFO L290 TraceCheckUtils]: 65: Hoare triple {89285#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89310#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:23,287 INFO L290 TraceCheckUtils]: 66: Hoare triple {89310#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {89310#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:23,287 INFO L272 TraceCheckUtils]: 67: Hoare triple {89310#(<= ~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)); {89310#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:23,287 INFO L290 TraceCheckUtils]: 68: Hoare triple {89310#(<= ~counter~0 7)} ~cond := #in~cond; {89310#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:23,288 INFO L290 TraceCheckUtils]: 69: Hoare triple {89310#(<= ~counter~0 7)} assume !(0 == ~cond); {89310#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:23,288 INFO L290 TraceCheckUtils]: 70: Hoare triple {89310#(<= ~counter~0 7)} assume true; {89310#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:23,288 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {89310#(<= ~counter~0 7)} {89310#(<= ~counter~0 7)} #96#return; {89310#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:23,289 INFO L290 TraceCheckUtils]: 72: Hoare triple {89310#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {89310#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:23,289 INFO L290 TraceCheckUtils]: 73: Hoare triple {89310#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89335#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:23,290 INFO L290 TraceCheckUtils]: 74: Hoare triple {89335#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {89335#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:23,290 INFO L272 TraceCheckUtils]: 75: Hoare triple {89335#(<= ~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)); {89335#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:23,290 INFO L290 TraceCheckUtils]: 76: Hoare triple {89335#(<= ~counter~0 8)} ~cond := #in~cond; {89335#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:23,291 INFO L290 TraceCheckUtils]: 77: Hoare triple {89335#(<= ~counter~0 8)} assume !(0 == ~cond); {89335#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:23,291 INFO L290 TraceCheckUtils]: 78: Hoare triple {89335#(<= ~counter~0 8)} assume true; {89335#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:23,291 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {89335#(<= ~counter~0 8)} {89335#(<= ~counter~0 8)} #96#return; {89335#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:23,292 INFO L290 TraceCheckUtils]: 80: Hoare triple {89335#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {89335#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:23,292 INFO L290 TraceCheckUtils]: 81: Hoare triple {89335#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89360#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:23,293 INFO L290 TraceCheckUtils]: 82: Hoare triple {89360#(<= ~counter~0 9)} assume !!(#t~post7 < 100);havoc #t~post7; {89360#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:23,293 INFO L272 TraceCheckUtils]: 83: Hoare triple {89360#(<= ~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)); {89360#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:23,293 INFO L290 TraceCheckUtils]: 84: Hoare triple {89360#(<= ~counter~0 9)} ~cond := #in~cond; {89360#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:23,294 INFO L290 TraceCheckUtils]: 85: Hoare triple {89360#(<= ~counter~0 9)} assume !(0 == ~cond); {89360#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:23,294 INFO L290 TraceCheckUtils]: 86: Hoare triple {89360#(<= ~counter~0 9)} assume true; {89360#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:23,294 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {89360#(<= ~counter~0 9)} {89360#(<= ~counter~0 9)} #96#return; {89360#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:23,295 INFO L290 TraceCheckUtils]: 88: Hoare triple {89360#(<= ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {89360#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:23,296 INFO L290 TraceCheckUtils]: 89: Hoare triple {89360#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89385#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:23,296 INFO L290 TraceCheckUtils]: 90: Hoare triple {89385#(<= ~counter~0 10)} assume !!(#t~post7 < 100);havoc #t~post7; {89385#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:23,296 INFO L272 TraceCheckUtils]: 91: Hoare triple {89385#(<= ~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)); {89385#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:23,297 INFO L290 TraceCheckUtils]: 92: Hoare triple {89385#(<= ~counter~0 10)} ~cond := #in~cond; {89385#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:23,297 INFO L290 TraceCheckUtils]: 93: Hoare triple {89385#(<= ~counter~0 10)} assume !(0 == ~cond); {89385#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:23,297 INFO L290 TraceCheckUtils]: 94: Hoare triple {89385#(<= ~counter~0 10)} assume true; {89385#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:23,297 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {89385#(<= ~counter~0 10)} {89385#(<= ~counter~0 10)} #96#return; {89385#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:23,298 INFO L290 TraceCheckUtils]: 96: Hoare triple {89385#(<= ~counter~0 10)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {89385#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:23,299 INFO L290 TraceCheckUtils]: 97: Hoare triple {89385#(<= ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89410#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:23,299 INFO L290 TraceCheckUtils]: 98: Hoare triple {89410#(<= ~counter~0 11)} assume !!(#t~post7 < 100);havoc #t~post7; {89410#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:23,299 INFO L272 TraceCheckUtils]: 99: Hoare triple {89410#(<= ~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)); {89410#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:23,300 INFO L290 TraceCheckUtils]: 100: Hoare triple {89410#(<= ~counter~0 11)} ~cond := #in~cond; {89410#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:23,300 INFO L290 TraceCheckUtils]: 101: Hoare triple {89410#(<= ~counter~0 11)} assume !(0 == ~cond); {89410#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:23,300 INFO L290 TraceCheckUtils]: 102: Hoare triple {89410#(<= ~counter~0 11)} assume true; {89410#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:23,301 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {89410#(<= ~counter~0 11)} {89410#(<= ~counter~0 11)} #96#return; {89410#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:23,301 INFO L290 TraceCheckUtils]: 104: Hoare triple {89410#(<= ~counter~0 11)} assume !(~r~0 > 0); {89410#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:23,302 INFO L290 TraceCheckUtils]: 105: Hoare triple {89410#(<= ~counter~0 11)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {89435#(<= ~counter~0 12)} is VALID [2022-04-28 05:59:23,302 INFO L290 TraceCheckUtils]: 106: Hoare triple {89435#(<= ~counter~0 12)} assume !!(#t~post8 < 100);havoc #t~post8; {89435#(<= ~counter~0 12)} is VALID [2022-04-28 05:59:23,302 INFO L272 TraceCheckUtils]: 107: Hoare triple {89435#(<= ~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)); {89435#(<= ~counter~0 12)} is VALID [2022-04-28 05:59:23,303 INFO L290 TraceCheckUtils]: 108: Hoare triple {89435#(<= ~counter~0 12)} ~cond := #in~cond; {89435#(<= ~counter~0 12)} is VALID [2022-04-28 05:59:23,303 INFO L290 TraceCheckUtils]: 109: Hoare triple {89435#(<= ~counter~0 12)} assume !(0 == ~cond); {89435#(<= ~counter~0 12)} is VALID [2022-04-28 05:59:23,303 INFO L290 TraceCheckUtils]: 110: Hoare triple {89435#(<= ~counter~0 12)} assume true; {89435#(<= ~counter~0 12)} is VALID [2022-04-28 05:59:23,304 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {89435#(<= ~counter~0 12)} {89435#(<= ~counter~0 12)} #98#return; {89435#(<= ~counter~0 12)} is VALID [2022-04-28 05:59:23,304 INFO L290 TraceCheckUtils]: 112: Hoare triple {89435#(<= ~counter~0 12)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {89435#(<= ~counter~0 12)} is VALID [2022-04-28 05:59:23,305 INFO L290 TraceCheckUtils]: 113: Hoare triple {89435#(<= ~counter~0 12)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {89460#(<= ~counter~0 13)} is VALID [2022-04-28 05:59:23,305 INFO L290 TraceCheckUtils]: 114: Hoare triple {89460#(<= ~counter~0 13)} assume !!(#t~post8 < 100);havoc #t~post8; {89460#(<= ~counter~0 13)} is VALID [2022-04-28 05:59:23,305 INFO L272 TraceCheckUtils]: 115: Hoare triple {89460#(<= ~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)); {89460#(<= ~counter~0 13)} is VALID [2022-04-28 05:59:23,306 INFO L290 TraceCheckUtils]: 116: Hoare triple {89460#(<= ~counter~0 13)} ~cond := #in~cond; {89460#(<= ~counter~0 13)} is VALID [2022-04-28 05:59:23,306 INFO L290 TraceCheckUtils]: 117: Hoare triple {89460#(<= ~counter~0 13)} assume !(0 == ~cond); {89460#(<= ~counter~0 13)} is VALID [2022-04-28 05:59:23,306 INFO L290 TraceCheckUtils]: 118: Hoare triple {89460#(<= ~counter~0 13)} assume true; {89460#(<= ~counter~0 13)} is VALID [2022-04-28 05:59:23,307 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {89460#(<= ~counter~0 13)} {89460#(<= ~counter~0 13)} #98#return; {89460#(<= ~counter~0 13)} is VALID [2022-04-28 05:59:23,307 INFO L290 TraceCheckUtils]: 120: Hoare triple {89460#(<= ~counter~0 13)} assume !(~r~0 < 0); {89460#(<= ~counter~0 13)} is VALID [2022-04-28 05:59:23,307 INFO L290 TraceCheckUtils]: 121: Hoare triple {89460#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {89485#(<= |main_#t~post6| 13)} is VALID [2022-04-28 05:59:23,308 INFO L290 TraceCheckUtils]: 122: Hoare triple {89485#(<= |main_#t~post6| 13)} assume !(#t~post6 < 100);havoc #t~post6; {89104#false} is VALID [2022-04-28 05:59:23,308 INFO L272 TraceCheckUtils]: 123: Hoare triple {89104#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)); {89104#false} is VALID [2022-04-28 05:59:23,308 INFO L290 TraceCheckUtils]: 124: Hoare triple {89104#false} ~cond := #in~cond; {89104#false} is VALID [2022-04-28 05:59:23,308 INFO L290 TraceCheckUtils]: 125: Hoare triple {89104#false} assume 0 == ~cond; {89104#false} is VALID [2022-04-28 05:59:23,308 INFO L290 TraceCheckUtils]: 126: Hoare triple {89104#false} assume !false; {89104#false} is VALID [2022-04-28 05:59:23,308 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 26 proven. 428 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:59:23,308 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:59:24,056 INFO L290 TraceCheckUtils]: 126: Hoare triple {89104#false} assume !false; {89104#false} is VALID [2022-04-28 05:59:24,056 INFO L290 TraceCheckUtils]: 125: Hoare triple {89104#false} assume 0 == ~cond; {89104#false} is VALID [2022-04-28 05:59:24,057 INFO L290 TraceCheckUtils]: 124: Hoare triple {89104#false} ~cond := #in~cond; {89104#false} is VALID [2022-04-28 05:59:24,057 INFO L272 TraceCheckUtils]: 123: Hoare triple {89104#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)); {89104#false} is VALID [2022-04-28 05:59:24,057 INFO L290 TraceCheckUtils]: 122: Hoare triple {89513#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {89104#false} is VALID [2022-04-28 05:59:24,057 INFO L290 TraceCheckUtils]: 121: Hoare triple {89517#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {89513#(< |main_#t~post6| 100)} is VALID [2022-04-28 05:59:24,058 INFO L290 TraceCheckUtils]: 120: Hoare triple {89517#(< ~counter~0 100)} assume !(~r~0 < 0); {89517#(< ~counter~0 100)} is VALID [2022-04-28 05:59:24,058 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {89103#true} {89517#(< ~counter~0 100)} #98#return; {89517#(< ~counter~0 100)} is VALID [2022-04-28 05:59:24,058 INFO L290 TraceCheckUtils]: 118: Hoare triple {89103#true} assume true; {89103#true} is VALID [2022-04-28 05:59:24,058 INFO L290 TraceCheckUtils]: 117: Hoare triple {89103#true} assume !(0 == ~cond); {89103#true} is VALID [2022-04-28 05:59:24,059 INFO L290 TraceCheckUtils]: 116: Hoare triple {89103#true} ~cond := #in~cond; {89103#true} is VALID [2022-04-28 05:59:24,059 INFO L272 TraceCheckUtils]: 115: Hoare triple {89517#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89103#true} is VALID [2022-04-28 05:59:24,059 INFO L290 TraceCheckUtils]: 114: Hoare triple {89517#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {89517#(< ~counter~0 100)} is VALID [2022-04-28 05:59:24,061 INFO L290 TraceCheckUtils]: 113: Hoare triple {89542#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {89517#(< ~counter~0 100)} is VALID [2022-04-28 05:59:24,061 INFO L290 TraceCheckUtils]: 112: Hoare triple {89542#(< ~counter~0 99)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {89542#(< ~counter~0 99)} is VALID [2022-04-28 05:59:24,062 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {89103#true} {89542#(< ~counter~0 99)} #98#return; {89542#(< ~counter~0 99)} is VALID [2022-04-28 05:59:24,062 INFO L290 TraceCheckUtils]: 110: Hoare triple {89103#true} assume true; {89103#true} is VALID [2022-04-28 05:59:24,062 INFO L290 TraceCheckUtils]: 109: Hoare triple {89103#true} assume !(0 == ~cond); {89103#true} is VALID [2022-04-28 05:59:24,062 INFO L290 TraceCheckUtils]: 108: Hoare triple {89103#true} ~cond := #in~cond; {89103#true} is VALID [2022-04-28 05:59:24,062 INFO L272 TraceCheckUtils]: 107: Hoare triple {89542#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89103#true} is VALID [2022-04-28 05:59:24,062 INFO L290 TraceCheckUtils]: 106: Hoare triple {89542#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {89542#(< ~counter~0 99)} is VALID [2022-04-28 05:59:24,063 INFO L290 TraceCheckUtils]: 105: Hoare triple {89567#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {89542#(< ~counter~0 99)} is VALID [2022-04-28 05:59:24,064 INFO L290 TraceCheckUtils]: 104: Hoare triple {89567#(< ~counter~0 98)} assume !(~r~0 > 0); {89567#(< ~counter~0 98)} is VALID [2022-04-28 05:59:24,064 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {89103#true} {89567#(< ~counter~0 98)} #96#return; {89567#(< ~counter~0 98)} is VALID [2022-04-28 05:59:24,064 INFO L290 TraceCheckUtils]: 102: Hoare triple {89103#true} assume true; {89103#true} is VALID [2022-04-28 05:59:24,064 INFO L290 TraceCheckUtils]: 101: Hoare triple {89103#true} assume !(0 == ~cond); {89103#true} is VALID [2022-04-28 05:59:24,064 INFO L290 TraceCheckUtils]: 100: Hoare triple {89103#true} ~cond := #in~cond; {89103#true} is VALID [2022-04-28 05:59:24,065 INFO L272 TraceCheckUtils]: 99: Hoare triple {89567#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89103#true} is VALID [2022-04-28 05:59:24,065 INFO L290 TraceCheckUtils]: 98: Hoare triple {89567#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {89567#(< ~counter~0 98)} is VALID [2022-04-28 05:59:24,066 INFO L290 TraceCheckUtils]: 97: Hoare triple {89592#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89567#(< ~counter~0 98)} is VALID [2022-04-28 05:59:24,066 INFO L290 TraceCheckUtils]: 96: Hoare triple {89592#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {89592#(< ~counter~0 97)} is VALID [2022-04-28 05:59:24,067 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {89103#true} {89592#(< ~counter~0 97)} #96#return; {89592#(< ~counter~0 97)} is VALID [2022-04-28 05:59:24,067 INFO L290 TraceCheckUtils]: 94: Hoare triple {89103#true} assume true; {89103#true} is VALID [2022-04-28 05:59:24,067 INFO L290 TraceCheckUtils]: 93: Hoare triple {89103#true} assume !(0 == ~cond); {89103#true} is VALID [2022-04-28 05:59:24,067 INFO L290 TraceCheckUtils]: 92: Hoare triple {89103#true} ~cond := #in~cond; {89103#true} is VALID [2022-04-28 05:59:24,067 INFO L272 TraceCheckUtils]: 91: Hoare triple {89592#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89103#true} is VALID [2022-04-28 05:59:24,067 INFO L290 TraceCheckUtils]: 90: Hoare triple {89592#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {89592#(< ~counter~0 97)} is VALID [2022-04-28 05:59:24,068 INFO L290 TraceCheckUtils]: 89: Hoare triple {89617#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89592#(< ~counter~0 97)} is VALID [2022-04-28 05:59:24,069 INFO L290 TraceCheckUtils]: 88: Hoare triple {89617#(< ~counter~0 96)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {89617#(< ~counter~0 96)} is VALID [2022-04-28 05:59:24,069 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {89103#true} {89617#(< ~counter~0 96)} #96#return; {89617#(< ~counter~0 96)} is VALID [2022-04-28 05:59:24,069 INFO L290 TraceCheckUtils]: 86: Hoare triple {89103#true} assume true; {89103#true} is VALID [2022-04-28 05:59:24,069 INFO L290 TraceCheckUtils]: 85: Hoare triple {89103#true} assume !(0 == ~cond); {89103#true} is VALID [2022-04-28 05:59:24,069 INFO L290 TraceCheckUtils]: 84: Hoare triple {89103#true} ~cond := #in~cond; {89103#true} is VALID [2022-04-28 05:59:24,070 INFO L272 TraceCheckUtils]: 83: Hoare triple {89617#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89103#true} is VALID [2022-04-28 05:59:24,070 INFO L290 TraceCheckUtils]: 82: Hoare triple {89617#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {89617#(< ~counter~0 96)} is VALID [2022-04-28 05:59:24,071 INFO L290 TraceCheckUtils]: 81: Hoare triple {89642#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89617#(< ~counter~0 96)} is VALID [2022-04-28 05:59:24,071 INFO L290 TraceCheckUtils]: 80: Hoare triple {89642#(< ~counter~0 95)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {89642#(< ~counter~0 95)} is VALID [2022-04-28 05:59:24,072 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {89103#true} {89642#(< ~counter~0 95)} #96#return; {89642#(< ~counter~0 95)} is VALID [2022-04-28 05:59:24,072 INFO L290 TraceCheckUtils]: 78: Hoare triple {89103#true} assume true; {89103#true} is VALID [2022-04-28 05:59:24,072 INFO L290 TraceCheckUtils]: 77: Hoare triple {89103#true} assume !(0 == ~cond); {89103#true} is VALID [2022-04-28 05:59:24,072 INFO L290 TraceCheckUtils]: 76: Hoare triple {89103#true} ~cond := #in~cond; {89103#true} is VALID [2022-04-28 05:59:24,072 INFO L272 TraceCheckUtils]: 75: Hoare triple {89642#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89103#true} is VALID [2022-04-28 05:59:24,072 INFO L290 TraceCheckUtils]: 74: Hoare triple {89642#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {89642#(< ~counter~0 95)} is VALID [2022-04-28 05:59:24,073 INFO L290 TraceCheckUtils]: 73: Hoare triple {89667#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89642#(< ~counter~0 95)} is VALID [2022-04-28 05:59:24,074 INFO L290 TraceCheckUtils]: 72: Hoare triple {89667#(< ~counter~0 94)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {89667#(< ~counter~0 94)} is VALID [2022-04-28 05:59:24,074 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {89103#true} {89667#(< ~counter~0 94)} #96#return; {89667#(< ~counter~0 94)} is VALID [2022-04-28 05:59:24,074 INFO L290 TraceCheckUtils]: 70: Hoare triple {89103#true} assume true; {89103#true} is VALID [2022-04-28 05:59:24,074 INFO L290 TraceCheckUtils]: 69: Hoare triple {89103#true} assume !(0 == ~cond); {89103#true} is VALID [2022-04-28 05:59:24,075 INFO L290 TraceCheckUtils]: 68: Hoare triple {89103#true} ~cond := #in~cond; {89103#true} is VALID [2022-04-28 05:59:24,075 INFO L272 TraceCheckUtils]: 67: Hoare triple {89667#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89103#true} is VALID [2022-04-28 05:59:24,075 INFO L290 TraceCheckUtils]: 66: Hoare triple {89667#(< ~counter~0 94)} assume !!(#t~post7 < 100);havoc #t~post7; {89667#(< ~counter~0 94)} is VALID [2022-04-28 05:59:24,076 INFO L290 TraceCheckUtils]: 65: Hoare triple {89692#(< ~counter~0 93)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89667#(< ~counter~0 94)} is VALID [2022-04-28 05:59:24,076 INFO L290 TraceCheckUtils]: 64: Hoare triple {89692#(< ~counter~0 93)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {89692#(< ~counter~0 93)} is VALID [2022-04-28 05:59:24,077 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {89103#true} {89692#(< ~counter~0 93)} #96#return; {89692#(< ~counter~0 93)} is VALID [2022-04-28 05:59:24,077 INFO L290 TraceCheckUtils]: 62: Hoare triple {89103#true} assume true; {89103#true} is VALID [2022-04-28 05:59:24,077 INFO L290 TraceCheckUtils]: 61: Hoare triple {89103#true} assume !(0 == ~cond); {89103#true} is VALID [2022-04-28 05:59:24,077 INFO L290 TraceCheckUtils]: 60: Hoare triple {89103#true} ~cond := #in~cond; {89103#true} is VALID [2022-04-28 05:59:24,077 INFO L272 TraceCheckUtils]: 59: Hoare triple {89692#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89103#true} is VALID [2022-04-28 05:59:24,077 INFO L290 TraceCheckUtils]: 58: Hoare triple {89692#(< ~counter~0 93)} assume !!(#t~post7 < 100);havoc #t~post7; {89692#(< ~counter~0 93)} is VALID [2022-04-28 05:59:24,078 INFO L290 TraceCheckUtils]: 57: Hoare triple {89717#(< ~counter~0 92)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89692#(< ~counter~0 93)} is VALID [2022-04-28 05:59:24,079 INFO L290 TraceCheckUtils]: 56: Hoare triple {89717#(< ~counter~0 92)} assume !!(0 != ~r~0); {89717#(< ~counter~0 92)} is VALID [2022-04-28 05:59:24,079 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {89103#true} {89717#(< ~counter~0 92)} #94#return; {89717#(< ~counter~0 92)} is VALID [2022-04-28 05:59:24,079 INFO L290 TraceCheckUtils]: 54: Hoare triple {89103#true} assume true; {89103#true} is VALID [2022-04-28 05:59:24,079 INFO L290 TraceCheckUtils]: 53: Hoare triple {89103#true} assume !(0 == ~cond); {89103#true} is VALID [2022-04-28 05:59:24,080 INFO L290 TraceCheckUtils]: 52: Hoare triple {89103#true} ~cond := #in~cond; {89103#true} is VALID [2022-04-28 05:59:24,080 INFO L272 TraceCheckUtils]: 51: Hoare triple {89717#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89103#true} is VALID [2022-04-28 05:59:24,080 INFO L290 TraceCheckUtils]: 50: Hoare triple {89717#(< ~counter~0 92)} assume !!(#t~post6 < 100);havoc #t~post6; {89717#(< ~counter~0 92)} is VALID [2022-04-28 05:59:24,081 INFO L290 TraceCheckUtils]: 49: Hoare triple {89742#(< ~counter~0 91)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {89717#(< ~counter~0 92)} is VALID [2022-04-28 05:59:24,081 INFO L290 TraceCheckUtils]: 48: Hoare triple {89742#(< ~counter~0 91)} assume !(~r~0 < 0); {89742#(< ~counter~0 91)} is VALID [2022-04-28 05:59:24,082 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {89103#true} {89742#(< ~counter~0 91)} #98#return; {89742#(< ~counter~0 91)} is VALID [2022-04-28 05:59:24,082 INFO L290 TraceCheckUtils]: 46: Hoare triple {89103#true} assume true; {89103#true} is VALID [2022-04-28 05:59:24,082 INFO L290 TraceCheckUtils]: 45: Hoare triple {89103#true} assume !(0 == ~cond); {89103#true} is VALID [2022-04-28 05:59:24,082 INFO L290 TraceCheckUtils]: 44: Hoare triple {89103#true} ~cond := #in~cond; {89103#true} is VALID [2022-04-28 05:59:24,082 INFO L272 TraceCheckUtils]: 43: Hoare triple {89742#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89103#true} is VALID [2022-04-28 05:59:24,082 INFO L290 TraceCheckUtils]: 42: Hoare triple {89742#(< ~counter~0 91)} assume !!(#t~post8 < 100);havoc #t~post8; {89742#(< ~counter~0 91)} is VALID [2022-04-28 05:59:24,083 INFO L290 TraceCheckUtils]: 41: Hoare triple {89767#(< ~counter~0 90)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {89742#(< ~counter~0 91)} is VALID [2022-04-28 05:59:24,084 INFO L290 TraceCheckUtils]: 40: Hoare triple {89767#(< ~counter~0 90)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {89767#(< ~counter~0 90)} is VALID [2022-04-28 05:59:24,084 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {89103#true} {89767#(< ~counter~0 90)} #98#return; {89767#(< ~counter~0 90)} is VALID [2022-04-28 05:59:24,084 INFO L290 TraceCheckUtils]: 38: Hoare triple {89103#true} assume true; {89103#true} is VALID [2022-04-28 05:59:24,084 INFO L290 TraceCheckUtils]: 37: Hoare triple {89103#true} assume !(0 == ~cond); {89103#true} is VALID [2022-04-28 05:59:24,084 INFO L290 TraceCheckUtils]: 36: Hoare triple {89103#true} ~cond := #in~cond; {89103#true} is VALID [2022-04-28 05:59:24,084 INFO L272 TraceCheckUtils]: 35: Hoare triple {89767#(< ~counter~0 90)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89103#true} is VALID [2022-04-28 05:59:24,085 INFO L290 TraceCheckUtils]: 34: Hoare triple {89767#(< ~counter~0 90)} assume !!(#t~post8 < 100);havoc #t~post8; {89767#(< ~counter~0 90)} is VALID [2022-04-28 05:59:24,086 INFO L290 TraceCheckUtils]: 33: Hoare triple {89792#(< ~counter~0 89)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {89767#(< ~counter~0 90)} is VALID [2022-04-28 05:59:24,086 INFO L290 TraceCheckUtils]: 32: Hoare triple {89792#(< ~counter~0 89)} assume !(~r~0 > 0); {89792#(< ~counter~0 89)} is VALID [2022-04-28 05:59:24,086 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {89103#true} {89792#(< ~counter~0 89)} #96#return; {89792#(< ~counter~0 89)} is VALID [2022-04-28 05:59:24,087 INFO L290 TraceCheckUtils]: 30: Hoare triple {89103#true} assume true; {89103#true} is VALID [2022-04-28 05:59:24,087 INFO L290 TraceCheckUtils]: 29: Hoare triple {89103#true} assume !(0 == ~cond); {89103#true} is VALID [2022-04-28 05:59:24,087 INFO L290 TraceCheckUtils]: 28: Hoare triple {89103#true} ~cond := #in~cond; {89103#true} is VALID [2022-04-28 05:59:24,087 INFO L272 TraceCheckUtils]: 27: Hoare triple {89792#(< ~counter~0 89)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89103#true} is VALID [2022-04-28 05:59:24,087 INFO L290 TraceCheckUtils]: 26: Hoare triple {89792#(< ~counter~0 89)} assume !!(#t~post7 < 100);havoc #t~post7; {89792#(< ~counter~0 89)} is VALID [2022-04-28 05:59:24,088 INFO L290 TraceCheckUtils]: 25: Hoare triple {89817#(< ~counter~0 88)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89792#(< ~counter~0 89)} is VALID [2022-04-28 05:59:24,088 INFO L290 TraceCheckUtils]: 24: Hoare triple {89817#(< ~counter~0 88)} assume !!(0 != ~r~0); {89817#(< ~counter~0 88)} is VALID [2022-04-28 05:59:24,089 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {89103#true} {89817#(< ~counter~0 88)} #94#return; {89817#(< ~counter~0 88)} is VALID [2022-04-28 05:59:24,089 INFO L290 TraceCheckUtils]: 22: Hoare triple {89103#true} assume true; {89103#true} is VALID [2022-04-28 05:59:24,089 INFO L290 TraceCheckUtils]: 21: Hoare triple {89103#true} assume !(0 == ~cond); {89103#true} is VALID [2022-04-28 05:59:24,089 INFO L290 TraceCheckUtils]: 20: Hoare triple {89103#true} ~cond := #in~cond; {89103#true} is VALID [2022-04-28 05:59:24,089 INFO L272 TraceCheckUtils]: 19: Hoare triple {89817#(< ~counter~0 88)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89103#true} is VALID [2022-04-28 05:59:24,090 INFO L290 TraceCheckUtils]: 18: Hoare triple {89817#(< ~counter~0 88)} assume !!(#t~post6 < 100);havoc #t~post6; {89817#(< ~counter~0 88)} is VALID [2022-04-28 05:59:24,091 INFO L290 TraceCheckUtils]: 17: Hoare triple {89842#(< ~counter~0 87)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {89817#(< ~counter~0 88)} is VALID [2022-04-28 05:59:24,091 INFO L290 TraceCheckUtils]: 16: Hoare triple {89842#(< ~counter~0 87)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {89842#(< ~counter~0 87)} is VALID [2022-04-28 05:59:24,091 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {89103#true} {89842#(< ~counter~0 87)} #92#return; {89842#(< ~counter~0 87)} is VALID [2022-04-28 05:59:24,091 INFO L290 TraceCheckUtils]: 14: Hoare triple {89103#true} assume true; {89103#true} is VALID [2022-04-28 05:59:24,092 INFO L290 TraceCheckUtils]: 13: Hoare triple {89103#true} assume !(0 == ~cond); {89103#true} is VALID [2022-04-28 05:59:24,092 INFO L290 TraceCheckUtils]: 12: Hoare triple {89103#true} ~cond := #in~cond; {89103#true} is VALID [2022-04-28 05:59:24,092 INFO L272 TraceCheckUtils]: 11: Hoare triple {89842#(< ~counter~0 87)} 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)); {89103#true} is VALID [2022-04-28 05:59:24,092 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {89103#true} {89842#(< ~counter~0 87)} #90#return; {89842#(< ~counter~0 87)} is VALID [2022-04-28 05:59:24,092 INFO L290 TraceCheckUtils]: 9: Hoare triple {89103#true} assume true; {89103#true} is VALID [2022-04-28 05:59:24,092 INFO L290 TraceCheckUtils]: 8: Hoare triple {89103#true} assume !(0 == ~cond); {89103#true} is VALID [2022-04-28 05:59:24,092 INFO L290 TraceCheckUtils]: 7: Hoare triple {89103#true} ~cond := #in~cond; {89103#true} is VALID [2022-04-28 05:59:24,093 INFO L272 TraceCheckUtils]: 6: Hoare triple {89842#(< ~counter~0 87)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {89103#true} is VALID [2022-04-28 05:59:24,093 INFO L290 TraceCheckUtils]: 5: Hoare triple {89842#(< ~counter~0 87)} 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; {89842#(< ~counter~0 87)} is VALID [2022-04-28 05:59:24,093 INFO L272 TraceCheckUtils]: 4: Hoare triple {89842#(< ~counter~0 87)} call #t~ret9 := main(); {89842#(< ~counter~0 87)} is VALID [2022-04-28 05:59:24,093 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {89842#(< ~counter~0 87)} {89103#true} #102#return; {89842#(< ~counter~0 87)} is VALID [2022-04-28 05:59:24,094 INFO L290 TraceCheckUtils]: 2: Hoare triple {89842#(< ~counter~0 87)} assume true; {89842#(< ~counter~0 87)} is VALID [2022-04-28 05:59:24,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {89103#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; {89842#(< ~counter~0 87)} is VALID [2022-04-28 05:59:24,094 INFO L272 TraceCheckUtils]: 0: Hoare triple {89103#true} call ULTIMATE.init(); {89103#true} is VALID [2022-04-28 05:59:24,095 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 26 proven. 116 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2022-04-28 05:59:24,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:59:24,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788661354] [2022-04-28 05:59:24,095 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:59:24,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1766569323] [2022-04-28 05:59:24,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1766569323] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:59:24,095 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:59:24,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2022-04-28 05:59:24,096 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:59:24,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [195297614] [2022-04-28 05:59:24,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [195297614] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:59:24,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:59:24,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 05:59:24,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847948613] [2022-04-28 05:59:24,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:59:24,096 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 16 states have internal predecessors, (90), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) Word has length 127 [2022-04-28 05:59:24,097 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:59:24,097 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 16 states have internal predecessors, (90), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-28 05:59:24,217 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:59:24,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 05:59:24,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:59:24,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 05:59:24,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=552, Unknown=0, NotChecked=0, Total=992 [2022-04-28 05:59:24,218 INFO L87 Difference]: Start difference. First operand 650 states and 879 transitions. Second operand has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 16 states have internal predecessors, (90), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-28 05:59:27,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:59:27,428 INFO L93 Difference]: Finished difference Result 705 states and 956 transitions. [2022-04-28 05:59:27,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-28 05:59:27,428 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 16 states have internal predecessors, (90), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) Word has length 127 [2022-04-28 05:59:27,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:59:27,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 16 states have internal predecessors, (90), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-28 05:59:27,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 274 transitions. [2022-04-28 05:59:27,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 16 states have internal predecessors, (90), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-28 05:59:27,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 274 transitions. [2022-04-28 05:59:27,432 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 274 transitions. [2022-04-28 05:59:27,669 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 274 edges. 274 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:59:27,694 INFO L225 Difference]: With dead ends: 705 [2022-04-28 05:59:27,694 INFO L226 Difference]: Without dead ends: 694 [2022-04-28 05:59:27,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=723, Invalid=999, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 05:59:27,695 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 186 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 05:59:27,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 309 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 05:59:27,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2022-04-28 05:59:29,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 672. [2022-04-28 05:59:29,640 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:59:29,640 INFO L82 GeneralOperation]: Start isEquivalent. First operand 694 states. Second operand has 672 states, 502 states have (on average 1.2151394422310757) internal successors, (610), 512 states have internal predecessors, (610), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 141 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-28 05:59:29,641 INFO L74 IsIncluded]: Start isIncluded. First operand 694 states. Second operand has 672 states, 502 states have (on average 1.2151394422310757) internal successors, (610), 512 states have internal predecessors, (610), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 141 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-28 05:59:29,641 INFO L87 Difference]: Start difference. First operand 694 states. Second operand has 672 states, 502 states have (on average 1.2151394422310757) internal successors, (610), 512 states have internal predecessors, (610), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 141 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-28 05:59:29,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:59:29,657 INFO L93 Difference]: Finished difference Result 694 states and 940 transitions. [2022-04-28 05:59:29,657 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 940 transitions. [2022-04-28 05:59:29,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:59:29,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:59:29,658 INFO L74 IsIncluded]: Start isIncluded. First operand has 672 states, 502 states have (on average 1.2151394422310757) internal successors, (610), 512 states have internal predecessors, (610), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 141 states have call predecessors, (151), 151 states have call successors, (151) Second operand 694 states. [2022-04-28 05:59:29,659 INFO L87 Difference]: Start difference. First operand has 672 states, 502 states have (on average 1.2151394422310757) internal successors, (610), 512 states have internal predecessors, (610), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 141 states have call predecessors, (151), 151 states have call successors, (151) Second operand 694 states. [2022-04-28 05:59:29,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:59:29,688 INFO L93 Difference]: Finished difference Result 694 states and 940 transitions. [2022-04-28 05:59:29,688 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 940 transitions. [2022-04-28 05:59:29,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:59:29,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:59:29,689 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:59:29,689 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:59:29,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 502 states have (on average 1.2151394422310757) internal successors, (610), 512 states have internal predecessors, (610), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 141 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-28 05:59:29,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 914 transitions. [2022-04-28 05:59:29,710 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 914 transitions. Word has length 127 [2022-04-28 05:59:29,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:59:29,710 INFO L495 AbstractCegarLoop]: Abstraction has 672 states and 914 transitions. [2022-04-28 05:59:29,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 16 states have internal predecessors, (90), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-28 05:59:29,710 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 672 states and 914 transitions. [2022-04-28 05:59:33,803 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-28 05:59:33,803 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 914 transitions. [2022-04-28 05:59:33,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-04-28 05:59:33,804 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:59:33,804 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 6, 6, 6, 6, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:59:33,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-04-28 05:59:34,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:59:34,005 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:59:34,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:59:34,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1410231607, now seen corresponding path program 19 times [2022-04-28 05:59:34,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:59:34,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2087284481] [2022-04-28 05:59:34,006 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:59:34,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1410231607, now seen corresponding path program 20 times [2022-04-28 05:59:34,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:59:34,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668771782] [2022-04-28 05:59:34,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:59:34,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:59:34,024 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:59:34,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2109670214] [2022-04-28 05:59:34,024 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:59:34,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:59:34,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:59:34,025 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:59:34,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-04-28 05:59:34,081 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:59:34,081 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:59:34,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 05:59:34,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:59:34,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:59:34,730 INFO L272 TraceCheckUtils]: 0: Hoare triple {94058#true} call ULTIMATE.init(); {94058#true} is VALID [2022-04-28 05:59:34,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {94058#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; {94066#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:34,731 INFO L290 TraceCheckUtils]: 2: Hoare triple {94066#(<= ~counter~0 0)} assume true; {94066#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:34,731 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {94066#(<= ~counter~0 0)} {94058#true} #102#return; {94066#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:34,731 INFO L272 TraceCheckUtils]: 4: Hoare triple {94066#(<= ~counter~0 0)} call #t~ret9 := main(); {94066#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:34,732 INFO L290 TraceCheckUtils]: 5: Hoare triple {94066#(<= ~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; {94066#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:34,732 INFO L272 TraceCheckUtils]: 6: Hoare triple {94066#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {94066#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:34,732 INFO L290 TraceCheckUtils]: 7: Hoare triple {94066#(<= ~counter~0 0)} ~cond := #in~cond; {94066#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:34,733 INFO L290 TraceCheckUtils]: 8: Hoare triple {94066#(<= ~counter~0 0)} assume !(0 == ~cond); {94066#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:34,733 INFO L290 TraceCheckUtils]: 9: Hoare triple {94066#(<= ~counter~0 0)} assume true; {94066#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:34,733 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {94066#(<= ~counter~0 0)} {94066#(<= ~counter~0 0)} #90#return; {94066#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:34,734 INFO L272 TraceCheckUtils]: 11: Hoare triple {94066#(<= ~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)); {94066#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:34,734 INFO L290 TraceCheckUtils]: 12: Hoare triple {94066#(<= ~counter~0 0)} ~cond := #in~cond; {94066#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:34,734 INFO L290 TraceCheckUtils]: 13: Hoare triple {94066#(<= ~counter~0 0)} assume !(0 == ~cond); {94066#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:34,734 INFO L290 TraceCheckUtils]: 14: Hoare triple {94066#(<= ~counter~0 0)} assume true; {94066#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:34,735 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {94066#(<= ~counter~0 0)} {94066#(<= ~counter~0 0)} #92#return; {94066#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:34,735 INFO L290 TraceCheckUtils]: 16: Hoare triple {94066#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {94066#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:34,737 INFO L290 TraceCheckUtils]: 17: Hoare triple {94066#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {94115#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:34,737 INFO L290 TraceCheckUtils]: 18: Hoare triple {94115#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {94115#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:34,738 INFO L272 TraceCheckUtils]: 19: Hoare triple {94115#(<= ~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)); {94115#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:34,738 INFO L290 TraceCheckUtils]: 20: Hoare triple {94115#(<= ~counter~0 1)} ~cond := #in~cond; {94115#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:34,738 INFO L290 TraceCheckUtils]: 21: Hoare triple {94115#(<= ~counter~0 1)} assume !(0 == ~cond); {94115#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:34,738 INFO L290 TraceCheckUtils]: 22: Hoare triple {94115#(<= ~counter~0 1)} assume true; {94115#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:34,739 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {94115#(<= ~counter~0 1)} {94115#(<= ~counter~0 1)} #94#return; {94115#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:34,739 INFO L290 TraceCheckUtils]: 24: Hoare triple {94115#(<= ~counter~0 1)} assume !!(0 != ~r~0); {94115#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:34,740 INFO L290 TraceCheckUtils]: 25: Hoare triple {94115#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {94140#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:34,740 INFO L290 TraceCheckUtils]: 26: Hoare triple {94140#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {94140#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:34,741 INFO L272 TraceCheckUtils]: 27: Hoare triple {94140#(<= ~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)); {94140#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:34,741 INFO L290 TraceCheckUtils]: 28: Hoare triple {94140#(<= ~counter~0 2)} ~cond := #in~cond; {94140#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:34,741 INFO L290 TraceCheckUtils]: 29: Hoare triple {94140#(<= ~counter~0 2)} assume !(0 == ~cond); {94140#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:34,741 INFO L290 TraceCheckUtils]: 30: Hoare triple {94140#(<= ~counter~0 2)} assume true; {94140#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:34,742 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {94140#(<= ~counter~0 2)} {94140#(<= ~counter~0 2)} #96#return; {94140#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:34,742 INFO L290 TraceCheckUtils]: 32: Hoare triple {94140#(<= ~counter~0 2)} assume !(~r~0 > 0); {94140#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:34,743 INFO L290 TraceCheckUtils]: 33: Hoare triple {94140#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {94165#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:34,743 INFO L290 TraceCheckUtils]: 34: Hoare triple {94165#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {94165#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:34,744 INFO L272 TraceCheckUtils]: 35: Hoare triple {94165#(<= ~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)); {94165#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:34,744 INFO L290 TraceCheckUtils]: 36: Hoare triple {94165#(<= ~counter~0 3)} ~cond := #in~cond; {94165#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:34,744 INFO L290 TraceCheckUtils]: 37: Hoare triple {94165#(<= ~counter~0 3)} assume !(0 == ~cond); {94165#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:34,744 INFO L290 TraceCheckUtils]: 38: Hoare triple {94165#(<= ~counter~0 3)} assume true; {94165#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:34,745 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {94165#(<= ~counter~0 3)} {94165#(<= ~counter~0 3)} #98#return; {94165#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:34,745 INFO L290 TraceCheckUtils]: 40: Hoare triple {94165#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {94165#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:34,746 INFO L290 TraceCheckUtils]: 41: Hoare triple {94165#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {94190#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:34,746 INFO L290 TraceCheckUtils]: 42: Hoare triple {94190#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {94190#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:34,747 INFO L272 TraceCheckUtils]: 43: Hoare triple {94190#(<= ~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)); {94190#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:34,747 INFO L290 TraceCheckUtils]: 44: Hoare triple {94190#(<= ~counter~0 4)} ~cond := #in~cond; {94190#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:34,747 INFO L290 TraceCheckUtils]: 45: Hoare triple {94190#(<= ~counter~0 4)} assume !(0 == ~cond); {94190#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:34,747 INFO L290 TraceCheckUtils]: 46: Hoare triple {94190#(<= ~counter~0 4)} assume true; {94190#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:34,748 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {94190#(<= ~counter~0 4)} {94190#(<= ~counter~0 4)} #98#return; {94190#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:34,748 INFO L290 TraceCheckUtils]: 48: Hoare triple {94190#(<= ~counter~0 4)} assume !(~r~0 < 0); {94190#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:34,749 INFO L290 TraceCheckUtils]: 49: Hoare triple {94190#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {94215#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:34,749 INFO L290 TraceCheckUtils]: 50: Hoare triple {94215#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {94215#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:34,750 INFO L272 TraceCheckUtils]: 51: Hoare triple {94215#(<= ~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)); {94215#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:34,750 INFO L290 TraceCheckUtils]: 52: Hoare triple {94215#(<= ~counter~0 5)} ~cond := #in~cond; {94215#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:34,750 INFO L290 TraceCheckUtils]: 53: Hoare triple {94215#(<= ~counter~0 5)} assume !(0 == ~cond); {94215#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:34,750 INFO L290 TraceCheckUtils]: 54: Hoare triple {94215#(<= ~counter~0 5)} assume true; {94215#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:34,751 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {94215#(<= ~counter~0 5)} {94215#(<= ~counter~0 5)} #94#return; {94215#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:34,751 INFO L290 TraceCheckUtils]: 56: Hoare triple {94215#(<= ~counter~0 5)} assume !!(0 != ~r~0); {94215#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:34,752 INFO L290 TraceCheckUtils]: 57: Hoare triple {94215#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {94240#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:34,752 INFO L290 TraceCheckUtils]: 58: Hoare triple {94240#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {94240#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:34,753 INFO L272 TraceCheckUtils]: 59: Hoare triple {94240#(<= ~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)); {94240#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:34,753 INFO L290 TraceCheckUtils]: 60: Hoare triple {94240#(<= ~counter~0 6)} ~cond := #in~cond; {94240#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:34,753 INFO L290 TraceCheckUtils]: 61: Hoare triple {94240#(<= ~counter~0 6)} assume !(0 == ~cond); {94240#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:34,753 INFO L290 TraceCheckUtils]: 62: Hoare triple {94240#(<= ~counter~0 6)} assume true; {94240#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:34,754 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {94240#(<= ~counter~0 6)} {94240#(<= ~counter~0 6)} #96#return; {94240#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:34,754 INFO L290 TraceCheckUtils]: 64: Hoare triple {94240#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {94240#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:34,755 INFO L290 TraceCheckUtils]: 65: Hoare triple {94240#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {94265#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:34,755 INFO L290 TraceCheckUtils]: 66: Hoare triple {94265#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {94265#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:34,756 INFO L272 TraceCheckUtils]: 67: Hoare triple {94265#(<= ~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)); {94265#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:34,756 INFO L290 TraceCheckUtils]: 68: Hoare triple {94265#(<= ~counter~0 7)} ~cond := #in~cond; {94265#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:34,756 INFO L290 TraceCheckUtils]: 69: Hoare triple {94265#(<= ~counter~0 7)} assume !(0 == ~cond); {94265#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:34,756 INFO L290 TraceCheckUtils]: 70: Hoare triple {94265#(<= ~counter~0 7)} assume true; {94265#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:34,757 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {94265#(<= ~counter~0 7)} {94265#(<= ~counter~0 7)} #96#return; {94265#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:34,757 INFO L290 TraceCheckUtils]: 72: Hoare triple {94265#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {94265#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:34,758 INFO L290 TraceCheckUtils]: 73: Hoare triple {94265#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {94290#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:34,758 INFO L290 TraceCheckUtils]: 74: Hoare triple {94290#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {94290#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:34,759 INFO L272 TraceCheckUtils]: 75: Hoare triple {94290#(<= ~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)); {94290#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:34,759 INFO L290 TraceCheckUtils]: 76: Hoare triple {94290#(<= ~counter~0 8)} ~cond := #in~cond; {94290#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:34,759 INFO L290 TraceCheckUtils]: 77: Hoare triple {94290#(<= ~counter~0 8)} assume !(0 == ~cond); {94290#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:34,759 INFO L290 TraceCheckUtils]: 78: Hoare triple {94290#(<= ~counter~0 8)} assume true; {94290#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:34,760 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {94290#(<= ~counter~0 8)} {94290#(<= ~counter~0 8)} #96#return; {94290#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:34,760 INFO L290 TraceCheckUtils]: 80: Hoare triple {94290#(<= ~counter~0 8)} assume !(~r~0 > 0); {94290#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:34,761 INFO L290 TraceCheckUtils]: 81: Hoare triple {94290#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {94315#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:34,761 INFO L290 TraceCheckUtils]: 82: Hoare triple {94315#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {94315#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:34,762 INFO L272 TraceCheckUtils]: 83: Hoare triple {94315#(<= ~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)); {94315#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:34,762 INFO L290 TraceCheckUtils]: 84: Hoare triple {94315#(<= ~counter~0 9)} ~cond := #in~cond; {94315#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:34,762 INFO L290 TraceCheckUtils]: 85: Hoare triple {94315#(<= ~counter~0 9)} assume !(0 == ~cond); {94315#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:34,762 INFO L290 TraceCheckUtils]: 86: Hoare triple {94315#(<= ~counter~0 9)} assume true; {94315#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:34,763 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {94315#(<= ~counter~0 9)} {94315#(<= ~counter~0 9)} #98#return; {94315#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:34,763 INFO L290 TraceCheckUtils]: 88: Hoare triple {94315#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {94315#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:34,764 INFO L290 TraceCheckUtils]: 89: Hoare triple {94315#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {94340#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:34,764 INFO L290 TraceCheckUtils]: 90: Hoare triple {94340#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {94340#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:34,765 INFO L272 TraceCheckUtils]: 91: Hoare triple {94340#(<= ~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)); {94340#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:34,765 INFO L290 TraceCheckUtils]: 92: Hoare triple {94340#(<= ~counter~0 10)} ~cond := #in~cond; {94340#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:34,765 INFO L290 TraceCheckUtils]: 93: Hoare triple {94340#(<= ~counter~0 10)} assume !(0 == ~cond); {94340#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:34,765 INFO L290 TraceCheckUtils]: 94: Hoare triple {94340#(<= ~counter~0 10)} assume true; {94340#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:34,766 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {94340#(<= ~counter~0 10)} {94340#(<= ~counter~0 10)} #98#return; {94340#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:34,766 INFO L290 TraceCheckUtils]: 96: Hoare triple {94340#(<= ~counter~0 10)} assume !(~r~0 < 0); {94340#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:34,767 INFO L290 TraceCheckUtils]: 97: Hoare triple {94340#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {94365#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:34,767 INFO L290 TraceCheckUtils]: 98: Hoare triple {94365#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {94365#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:34,768 INFO L272 TraceCheckUtils]: 99: Hoare triple {94365#(<= ~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)); {94365#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:34,768 INFO L290 TraceCheckUtils]: 100: Hoare triple {94365#(<= ~counter~0 11)} ~cond := #in~cond; {94365#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:34,768 INFO L290 TraceCheckUtils]: 101: Hoare triple {94365#(<= ~counter~0 11)} assume !(0 == ~cond); {94365#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:34,768 INFO L290 TraceCheckUtils]: 102: Hoare triple {94365#(<= ~counter~0 11)} assume true; {94365#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:34,769 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {94365#(<= ~counter~0 11)} {94365#(<= ~counter~0 11)} #94#return; {94365#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:34,769 INFO L290 TraceCheckUtils]: 104: Hoare triple {94365#(<= ~counter~0 11)} assume !!(0 != ~r~0); {94365#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:34,770 INFO L290 TraceCheckUtils]: 105: Hoare triple {94365#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {94390#(<= ~counter~0 12)} is VALID [2022-04-28 05:59:34,770 INFO L290 TraceCheckUtils]: 106: Hoare triple {94390#(<= ~counter~0 12)} assume !!(#t~post7 < 100);havoc #t~post7; {94390#(<= ~counter~0 12)} is VALID [2022-04-28 05:59:34,771 INFO L272 TraceCheckUtils]: 107: Hoare triple {94390#(<= ~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)); {94390#(<= ~counter~0 12)} is VALID [2022-04-28 05:59:34,771 INFO L290 TraceCheckUtils]: 108: Hoare triple {94390#(<= ~counter~0 12)} ~cond := #in~cond; {94390#(<= ~counter~0 12)} is VALID [2022-04-28 05:59:34,771 INFO L290 TraceCheckUtils]: 109: Hoare triple {94390#(<= ~counter~0 12)} assume !(0 == ~cond); {94390#(<= ~counter~0 12)} is VALID [2022-04-28 05:59:34,771 INFO L290 TraceCheckUtils]: 110: Hoare triple {94390#(<= ~counter~0 12)} assume true; {94390#(<= ~counter~0 12)} is VALID [2022-04-28 05:59:34,772 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {94390#(<= ~counter~0 12)} {94390#(<= ~counter~0 12)} #96#return; {94390#(<= ~counter~0 12)} is VALID [2022-04-28 05:59:34,772 INFO L290 TraceCheckUtils]: 112: Hoare triple {94390#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {94390#(<= ~counter~0 12)} is VALID [2022-04-28 05:59:34,773 INFO L290 TraceCheckUtils]: 113: Hoare triple {94390#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {94415#(<= ~counter~0 13)} is VALID [2022-04-28 05:59:34,773 INFO L290 TraceCheckUtils]: 114: Hoare triple {94415#(<= ~counter~0 13)} assume !!(#t~post7 < 100);havoc #t~post7; {94415#(<= ~counter~0 13)} is VALID [2022-04-28 05:59:34,774 INFO L272 TraceCheckUtils]: 115: Hoare triple {94415#(<= ~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)); {94415#(<= ~counter~0 13)} is VALID [2022-04-28 05:59:34,774 INFO L290 TraceCheckUtils]: 116: Hoare triple {94415#(<= ~counter~0 13)} ~cond := #in~cond; {94415#(<= ~counter~0 13)} is VALID [2022-04-28 05:59:34,774 INFO L290 TraceCheckUtils]: 117: Hoare triple {94415#(<= ~counter~0 13)} assume !(0 == ~cond); {94415#(<= ~counter~0 13)} is VALID [2022-04-28 05:59:34,774 INFO L290 TraceCheckUtils]: 118: Hoare triple {94415#(<= ~counter~0 13)} assume true; {94415#(<= ~counter~0 13)} is VALID [2022-04-28 05:59:34,775 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {94415#(<= ~counter~0 13)} {94415#(<= ~counter~0 13)} #96#return; {94415#(<= ~counter~0 13)} is VALID [2022-04-28 05:59:34,775 INFO L290 TraceCheckUtils]: 120: Hoare triple {94415#(<= ~counter~0 13)} assume !(~r~0 > 0); {94415#(<= ~counter~0 13)} is VALID [2022-04-28 05:59:34,775 INFO L290 TraceCheckUtils]: 121: Hoare triple {94415#(<= ~counter~0 13)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {94440#(<= |main_#t~post8| 13)} is VALID [2022-04-28 05:59:34,776 INFO L290 TraceCheckUtils]: 122: Hoare triple {94440#(<= |main_#t~post8| 13)} assume !(#t~post8 < 100);havoc #t~post8; {94059#false} is VALID [2022-04-28 05:59:34,776 INFO L290 TraceCheckUtils]: 123: Hoare triple {94059#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {94059#false} is VALID [2022-04-28 05:59:34,776 INFO L290 TraceCheckUtils]: 124: Hoare triple {94059#false} assume !(#t~post6 < 100);havoc #t~post6; {94059#false} is VALID [2022-04-28 05:59:34,776 INFO L272 TraceCheckUtils]: 125: Hoare triple {94059#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)); {94059#false} is VALID [2022-04-28 05:59:34,776 INFO L290 TraceCheckUtils]: 126: Hoare triple {94059#false} ~cond := #in~cond; {94059#false} is VALID [2022-04-28 05:59:34,776 INFO L290 TraceCheckUtils]: 127: Hoare triple {94059#false} assume 0 == ~cond; {94059#false} is VALID [2022-04-28 05:59:34,776 INFO L290 TraceCheckUtils]: 128: Hoare triple {94059#false} assume !false; {94059#false} is VALID [2022-04-28 05:59:34,776 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 32 proven. 416 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:59:34,777 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:59:35,489 INFO L290 TraceCheckUtils]: 128: Hoare triple {94059#false} assume !false; {94059#false} is VALID [2022-04-28 05:59:35,489 INFO L290 TraceCheckUtils]: 127: Hoare triple {94059#false} assume 0 == ~cond; {94059#false} is VALID [2022-04-28 05:59:35,489 INFO L290 TraceCheckUtils]: 126: Hoare triple {94059#false} ~cond := #in~cond; {94059#false} is VALID [2022-04-28 05:59:35,489 INFO L272 TraceCheckUtils]: 125: Hoare triple {94059#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)); {94059#false} is VALID [2022-04-28 05:59:35,489 INFO L290 TraceCheckUtils]: 124: Hoare triple {94059#false} assume !(#t~post6 < 100);havoc #t~post6; {94059#false} is VALID [2022-04-28 05:59:35,489 INFO L290 TraceCheckUtils]: 123: Hoare triple {94059#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {94059#false} is VALID [2022-04-28 05:59:35,489 INFO L290 TraceCheckUtils]: 122: Hoare triple {94480#(< |main_#t~post8| 100)} assume !(#t~post8 < 100);havoc #t~post8; {94059#false} is VALID [2022-04-28 05:59:35,490 INFO L290 TraceCheckUtils]: 121: Hoare triple {94484#(< ~counter~0 100)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {94480#(< |main_#t~post8| 100)} is VALID [2022-04-28 05:59:35,490 INFO L290 TraceCheckUtils]: 120: Hoare triple {94484#(< ~counter~0 100)} assume !(~r~0 > 0); {94484#(< ~counter~0 100)} is VALID [2022-04-28 05:59:35,490 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {94058#true} {94484#(< ~counter~0 100)} #96#return; {94484#(< ~counter~0 100)} is VALID [2022-04-28 05:59:35,491 INFO L290 TraceCheckUtils]: 118: Hoare triple {94058#true} assume true; {94058#true} is VALID [2022-04-28 05:59:35,491 INFO L290 TraceCheckUtils]: 117: Hoare triple {94058#true} assume !(0 == ~cond); {94058#true} is VALID [2022-04-28 05:59:35,491 INFO L290 TraceCheckUtils]: 116: Hoare triple {94058#true} ~cond := #in~cond; {94058#true} is VALID [2022-04-28 05:59:35,491 INFO L272 TraceCheckUtils]: 115: Hoare triple {94484#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94058#true} is VALID [2022-04-28 05:59:35,491 INFO L290 TraceCheckUtils]: 114: Hoare triple {94484#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {94484#(< ~counter~0 100)} is VALID [2022-04-28 05:59:35,493 INFO L290 TraceCheckUtils]: 113: Hoare triple {94509#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {94484#(< ~counter~0 100)} is VALID [2022-04-28 05:59:35,493 INFO L290 TraceCheckUtils]: 112: Hoare triple {94509#(< ~counter~0 99)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {94509#(< ~counter~0 99)} is VALID [2022-04-28 05:59:35,494 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {94058#true} {94509#(< ~counter~0 99)} #96#return; {94509#(< ~counter~0 99)} is VALID [2022-04-28 05:59:35,494 INFO L290 TraceCheckUtils]: 110: Hoare triple {94058#true} assume true; {94058#true} is VALID [2022-04-28 05:59:35,494 INFO L290 TraceCheckUtils]: 109: Hoare triple {94058#true} assume !(0 == ~cond); {94058#true} is VALID [2022-04-28 05:59:35,494 INFO L290 TraceCheckUtils]: 108: Hoare triple {94058#true} ~cond := #in~cond; {94058#true} is VALID [2022-04-28 05:59:35,494 INFO L272 TraceCheckUtils]: 107: Hoare triple {94509#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94058#true} is VALID [2022-04-28 05:59:35,494 INFO L290 TraceCheckUtils]: 106: Hoare triple {94509#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {94509#(< ~counter~0 99)} is VALID [2022-04-28 05:59:35,495 INFO L290 TraceCheckUtils]: 105: Hoare triple {94534#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {94509#(< ~counter~0 99)} is VALID [2022-04-28 05:59:35,495 INFO L290 TraceCheckUtils]: 104: Hoare triple {94534#(< ~counter~0 98)} assume !!(0 != ~r~0); {94534#(< ~counter~0 98)} is VALID [2022-04-28 05:59:35,496 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {94058#true} {94534#(< ~counter~0 98)} #94#return; {94534#(< ~counter~0 98)} is VALID [2022-04-28 05:59:35,496 INFO L290 TraceCheckUtils]: 102: Hoare triple {94058#true} assume true; {94058#true} is VALID [2022-04-28 05:59:35,496 INFO L290 TraceCheckUtils]: 101: Hoare triple {94058#true} assume !(0 == ~cond); {94058#true} is VALID [2022-04-28 05:59:35,496 INFO L290 TraceCheckUtils]: 100: Hoare triple {94058#true} ~cond := #in~cond; {94058#true} is VALID [2022-04-28 05:59:35,496 INFO L272 TraceCheckUtils]: 99: Hoare triple {94534#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94058#true} is VALID [2022-04-28 05:59:35,496 INFO L290 TraceCheckUtils]: 98: Hoare triple {94534#(< ~counter~0 98)} assume !!(#t~post6 < 100);havoc #t~post6; {94534#(< ~counter~0 98)} is VALID [2022-04-28 05:59:35,497 INFO L290 TraceCheckUtils]: 97: Hoare triple {94559#(< ~counter~0 97)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {94534#(< ~counter~0 98)} is VALID [2022-04-28 05:59:35,497 INFO L290 TraceCheckUtils]: 96: Hoare triple {94559#(< ~counter~0 97)} assume !(~r~0 < 0); {94559#(< ~counter~0 97)} is VALID [2022-04-28 05:59:35,498 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {94058#true} {94559#(< ~counter~0 97)} #98#return; {94559#(< ~counter~0 97)} is VALID [2022-04-28 05:59:35,498 INFO L290 TraceCheckUtils]: 94: Hoare triple {94058#true} assume true; {94058#true} is VALID [2022-04-28 05:59:35,498 INFO L290 TraceCheckUtils]: 93: Hoare triple {94058#true} assume !(0 == ~cond); {94058#true} is VALID [2022-04-28 05:59:35,498 INFO L290 TraceCheckUtils]: 92: Hoare triple {94058#true} ~cond := #in~cond; {94058#true} is VALID [2022-04-28 05:59:35,498 INFO L272 TraceCheckUtils]: 91: Hoare triple {94559#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94058#true} is VALID [2022-04-28 05:59:35,498 INFO L290 TraceCheckUtils]: 90: Hoare triple {94559#(< ~counter~0 97)} assume !!(#t~post8 < 100);havoc #t~post8; {94559#(< ~counter~0 97)} is VALID [2022-04-28 05:59:35,499 INFO L290 TraceCheckUtils]: 89: Hoare triple {94584#(< ~counter~0 96)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {94559#(< ~counter~0 97)} is VALID [2022-04-28 05:59:35,500 INFO L290 TraceCheckUtils]: 88: Hoare triple {94584#(< ~counter~0 96)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {94584#(< ~counter~0 96)} is VALID [2022-04-28 05:59:35,500 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {94058#true} {94584#(< ~counter~0 96)} #98#return; {94584#(< ~counter~0 96)} is VALID [2022-04-28 05:59:35,500 INFO L290 TraceCheckUtils]: 86: Hoare triple {94058#true} assume true; {94058#true} is VALID [2022-04-28 05:59:35,500 INFO L290 TraceCheckUtils]: 85: Hoare triple {94058#true} assume !(0 == ~cond); {94058#true} is VALID [2022-04-28 05:59:35,500 INFO L290 TraceCheckUtils]: 84: Hoare triple {94058#true} ~cond := #in~cond; {94058#true} is VALID [2022-04-28 05:59:35,500 INFO L272 TraceCheckUtils]: 83: Hoare triple {94584#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94058#true} is VALID [2022-04-28 05:59:35,501 INFO L290 TraceCheckUtils]: 82: Hoare triple {94584#(< ~counter~0 96)} assume !!(#t~post8 < 100);havoc #t~post8; {94584#(< ~counter~0 96)} is VALID [2022-04-28 05:59:35,501 INFO L290 TraceCheckUtils]: 81: Hoare triple {94609#(< ~counter~0 95)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {94584#(< ~counter~0 96)} is VALID [2022-04-28 05:59:35,502 INFO L290 TraceCheckUtils]: 80: Hoare triple {94609#(< ~counter~0 95)} assume !(~r~0 > 0); {94609#(< ~counter~0 95)} is VALID [2022-04-28 05:59:35,502 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {94058#true} {94609#(< ~counter~0 95)} #96#return; {94609#(< ~counter~0 95)} is VALID [2022-04-28 05:59:35,502 INFO L290 TraceCheckUtils]: 78: Hoare triple {94058#true} assume true; {94058#true} is VALID [2022-04-28 05:59:35,502 INFO L290 TraceCheckUtils]: 77: Hoare triple {94058#true} assume !(0 == ~cond); {94058#true} is VALID [2022-04-28 05:59:35,502 INFO L290 TraceCheckUtils]: 76: Hoare triple {94058#true} ~cond := #in~cond; {94058#true} is VALID [2022-04-28 05:59:35,502 INFO L272 TraceCheckUtils]: 75: Hoare triple {94609#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94058#true} is VALID [2022-04-28 05:59:35,503 INFO L290 TraceCheckUtils]: 74: Hoare triple {94609#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {94609#(< ~counter~0 95)} is VALID [2022-04-28 05:59:35,503 INFO L290 TraceCheckUtils]: 73: Hoare triple {94634#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {94609#(< ~counter~0 95)} is VALID [2022-04-28 05:59:35,504 INFO L290 TraceCheckUtils]: 72: Hoare triple {94634#(< ~counter~0 94)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {94634#(< ~counter~0 94)} is VALID [2022-04-28 05:59:35,504 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {94058#true} {94634#(< ~counter~0 94)} #96#return; {94634#(< ~counter~0 94)} is VALID [2022-04-28 05:59:35,504 INFO L290 TraceCheckUtils]: 70: Hoare triple {94058#true} assume true; {94058#true} is VALID [2022-04-28 05:59:35,504 INFO L290 TraceCheckUtils]: 69: Hoare triple {94058#true} assume !(0 == ~cond); {94058#true} is VALID [2022-04-28 05:59:35,504 INFO L290 TraceCheckUtils]: 68: Hoare triple {94058#true} ~cond := #in~cond; {94058#true} is VALID [2022-04-28 05:59:35,505 INFO L272 TraceCheckUtils]: 67: Hoare triple {94634#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94058#true} is VALID [2022-04-28 05:59:35,505 INFO L290 TraceCheckUtils]: 66: Hoare triple {94634#(< ~counter~0 94)} assume !!(#t~post7 < 100);havoc #t~post7; {94634#(< ~counter~0 94)} is VALID [2022-04-28 05:59:35,506 INFO L290 TraceCheckUtils]: 65: Hoare triple {94659#(< ~counter~0 93)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {94634#(< ~counter~0 94)} is VALID [2022-04-28 05:59:35,506 INFO L290 TraceCheckUtils]: 64: Hoare triple {94659#(< ~counter~0 93)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {94659#(< ~counter~0 93)} is VALID [2022-04-28 05:59:35,506 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {94058#true} {94659#(< ~counter~0 93)} #96#return; {94659#(< ~counter~0 93)} is VALID [2022-04-28 05:59:35,506 INFO L290 TraceCheckUtils]: 62: Hoare triple {94058#true} assume true; {94058#true} is VALID [2022-04-28 05:59:35,506 INFO L290 TraceCheckUtils]: 61: Hoare triple {94058#true} assume !(0 == ~cond); {94058#true} is VALID [2022-04-28 05:59:35,507 INFO L290 TraceCheckUtils]: 60: Hoare triple {94058#true} ~cond := #in~cond; {94058#true} is VALID [2022-04-28 05:59:35,507 INFO L272 TraceCheckUtils]: 59: Hoare triple {94659#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94058#true} is VALID [2022-04-28 05:59:35,507 INFO L290 TraceCheckUtils]: 58: Hoare triple {94659#(< ~counter~0 93)} assume !!(#t~post7 < 100);havoc #t~post7; {94659#(< ~counter~0 93)} is VALID [2022-04-28 05:59:35,508 INFO L290 TraceCheckUtils]: 57: Hoare triple {94684#(< ~counter~0 92)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {94659#(< ~counter~0 93)} is VALID [2022-04-28 05:59:35,508 INFO L290 TraceCheckUtils]: 56: Hoare triple {94684#(< ~counter~0 92)} assume !!(0 != ~r~0); {94684#(< ~counter~0 92)} is VALID [2022-04-28 05:59:35,508 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {94058#true} {94684#(< ~counter~0 92)} #94#return; {94684#(< ~counter~0 92)} is VALID [2022-04-28 05:59:35,509 INFO L290 TraceCheckUtils]: 54: Hoare triple {94058#true} assume true; {94058#true} is VALID [2022-04-28 05:59:35,509 INFO L290 TraceCheckUtils]: 53: Hoare triple {94058#true} assume !(0 == ~cond); {94058#true} is VALID [2022-04-28 05:59:35,509 INFO L290 TraceCheckUtils]: 52: Hoare triple {94058#true} ~cond := #in~cond; {94058#true} is VALID [2022-04-28 05:59:35,509 INFO L272 TraceCheckUtils]: 51: Hoare triple {94684#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94058#true} is VALID [2022-04-28 05:59:35,509 INFO L290 TraceCheckUtils]: 50: Hoare triple {94684#(< ~counter~0 92)} assume !!(#t~post6 < 100);havoc #t~post6; {94684#(< ~counter~0 92)} is VALID [2022-04-28 05:59:35,510 INFO L290 TraceCheckUtils]: 49: Hoare triple {94709#(< ~counter~0 91)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {94684#(< ~counter~0 92)} is VALID [2022-04-28 05:59:35,510 INFO L290 TraceCheckUtils]: 48: Hoare triple {94709#(< ~counter~0 91)} assume !(~r~0 < 0); {94709#(< ~counter~0 91)} is VALID [2022-04-28 05:59:35,511 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {94058#true} {94709#(< ~counter~0 91)} #98#return; {94709#(< ~counter~0 91)} is VALID [2022-04-28 05:59:35,511 INFO L290 TraceCheckUtils]: 46: Hoare triple {94058#true} assume true; {94058#true} is VALID [2022-04-28 05:59:35,511 INFO L290 TraceCheckUtils]: 45: Hoare triple {94058#true} assume !(0 == ~cond); {94058#true} is VALID [2022-04-28 05:59:35,511 INFO L290 TraceCheckUtils]: 44: Hoare triple {94058#true} ~cond := #in~cond; {94058#true} is VALID [2022-04-28 05:59:35,511 INFO L272 TraceCheckUtils]: 43: Hoare triple {94709#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94058#true} is VALID [2022-04-28 05:59:35,511 INFO L290 TraceCheckUtils]: 42: Hoare triple {94709#(< ~counter~0 91)} assume !!(#t~post8 < 100);havoc #t~post8; {94709#(< ~counter~0 91)} is VALID [2022-04-28 05:59:35,512 INFO L290 TraceCheckUtils]: 41: Hoare triple {94734#(< ~counter~0 90)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {94709#(< ~counter~0 91)} is VALID [2022-04-28 05:59:35,512 INFO L290 TraceCheckUtils]: 40: Hoare triple {94734#(< ~counter~0 90)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {94734#(< ~counter~0 90)} is VALID [2022-04-28 05:59:35,513 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {94058#true} {94734#(< ~counter~0 90)} #98#return; {94734#(< ~counter~0 90)} is VALID [2022-04-28 05:59:35,513 INFO L290 TraceCheckUtils]: 38: Hoare triple {94058#true} assume true; {94058#true} is VALID [2022-04-28 05:59:35,513 INFO L290 TraceCheckUtils]: 37: Hoare triple {94058#true} assume !(0 == ~cond); {94058#true} is VALID [2022-04-28 05:59:35,513 INFO L290 TraceCheckUtils]: 36: Hoare triple {94058#true} ~cond := #in~cond; {94058#true} is VALID [2022-04-28 05:59:35,513 INFO L272 TraceCheckUtils]: 35: Hoare triple {94734#(< ~counter~0 90)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94058#true} is VALID [2022-04-28 05:59:35,513 INFO L290 TraceCheckUtils]: 34: Hoare triple {94734#(< ~counter~0 90)} assume !!(#t~post8 < 100);havoc #t~post8; {94734#(< ~counter~0 90)} is VALID [2022-04-28 05:59:35,514 INFO L290 TraceCheckUtils]: 33: Hoare triple {94759#(< ~counter~0 89)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {94734#(< ~counter~0 90)} is VALID [2022-04-28 05:59:35,514 INFO L290 TraceCheckUtils]: 32: Hoare triple {94759#(< ~counter~0 89)} assume !(~r~0 > 0); {94759#(< ~counter~0 89)} is VALID [2022-04-28 05:59:35,515 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {94058#true} {94759#(< ~counter~0 89)} #96#return; {94759#(< ~counter~0 89)} is VALID [2022-04-28 05:59:35,515 INFO L290 TraceCheckUtils]: 30: Hoare triple {94058#true} assume true; {94058#true} is VALID [2022-04-28 05:59:35,515 INFO L290 TraceCheckUtils]: 29: Hoare triple {94058#true} assume !(0 == ~cond); {94058#true} is VALID [2022-04-28 05:59:35,515 INFO L290 TraceCheckUtils]: 28: Hoare triple {94058#true} ~cond := #in~cond; {94058#true} is VALID [2022-04-28 05:59:35,515 INFO L272 TraceCheckUtils]: 27: Hoare triple {94759#(< ~counter~0 89)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94058#true} is VALID [2022-04-28 05:59:35,515 INFO L290 TraceCheckUtils]: 26: Hoare triple {94759#(< ~counter~0 89)} assume !!(#t~post7 < 100);havoc #t~post7; {94759#(< ~counter~0 89)} is VALID [2022-04-28 05:59:35,516 INFO L290 TraceCheckUtils]: 25: Hoare triple {94784#(< ~counter~0 88)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {94759#(< ~counter~0 89)} is VALID [2022-04-28 05:59:35,516 INFO L290 TraceCheckUtils]: 24: Hoare triple {94784#(< ~counter~0 88)} assume !!(0 != ~r~0); {94784#(< ~counter~0 88)} is VALID [2022-04-28 05:59:35,517 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {94058#true} {94784#(< ~counter~0 88)} #94#return; {94784#(< ~counter~0 88)} is VALID [2022-04-28 05:59:35,517 INFO L290 TraceCheckUtils]: 22: Hoare triple {94058#true} assume true; {94058#true} is VALID [2022-04-28 05:59:35,517 INFO L290 TraceCheckUtils]: 21: Hoare triple {94058#true} assume !(0 == ~cond); {94058#true} is VALID [2022-04-28 05:59:35,517 INFO L290 TraceCheckUtils]: 20: Hoare triple {94058#true} ~cond := #in~cond; {94058#true} is VALID [2022-04-28 05:59:35,517 INFO L272 TraceCheckUtils]: 19: Hoare triple {94784#(< ~counter~0 88)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94058#true} is VALID [2022-04-28 05:59:35,517 INFO L290 TraceCheckUtils]: 18: Hoare triple {94784#(< ~counter~0 88)} assume !!(#t~post6 < 100);havoc #t~post6; {94784#(< ~counter~0 88)} is VALID [2022-04-28 05:59:35,518 INFO L290 TraceCheckUtils]: 17: Hoare triple {94809#(< ~counter~0 87)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {94784#(< ~counter~0 88)} is VALID [2022-04-28 05:59:35,519 INFO L290 TraceCheckUtils]: 16: Hoare triple {94809#(< ~counter~0 87)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {94809#(< ~counter~0 87)} is VALID [2022-04-28 05:59:35,519 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {94058#true} {94809#(< ~counter~0 87)} #92#return; {94809#(< ~counter~0 87)} is VALID [2022-04-28 05:59:35,519 INFO L290 TraceCheckUtils]: 14: Hoare triple {94058#true} assume true; {94058#true} is VALID [2022-04-28 05:59:35,519 INFO L290 TraceCheckUtils]: 13: Hoare triple {94058#true} assume !(0 == ~cond); {94058#true} is VALID [2022-04-28 05:59:35,519 INFO L290 TraceCheckUtils]: 12: Hoare triple {94058#true} ~cond := #in~cond; {94058#true} is VALID [2022-04-28 05:59:35,519 INFO L272 TraceCheckUtils]: 11: Hoare triple {94809#(< ~counter~0 87)} 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)); {94058#true} is VALID [2022-04-28 05:59:35,520 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {94058#true} {94809#(< ~counter~0 87)} #90#return; {94809#(< ~counter~0 87)} is VALID [2022-04-28 05:59:35,520 INFO L290 TraceCheckUtils]: 9: Hoare triple {94058#true} assume true; {94058#true} is VALID [2022-04-28 05:59:35,520 INFO L290 TraceCheckUtils]: 8: Hoare triple {94058#true} assume !(0 == ~cond); {94058#true} is VALID [2022-04-28 05:59:35,520 INFO L290 TraceCheckUtils]: 7: Hoare triple {94058#true} ~cond := #in~cond; {94058#true} is VALID [2022-04-28 05:59:35,520 INFO L272 TraceCheckUtils]: 6: Hoare triple {94809#(< ~counter~0 87)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {94058#true} is VALID [2022-04-28 05:59:35,520 INFO L290 TraceCheckUtils]: 5: Hoare triple {94809#(< ~counter~0 87)} 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; {94809#(< ~counter~0 87)} is VALID [2022-04-28 05:59:35,520 INFO L272 TraceCheckUtils]: 4: Hoare triple {94809#(< ~counter~0 87)} call #t~ret9 := main(); {94809#(< ~counter~0 87)} is VALID [2022-04-28 05:59:35,521 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {94809#(< ~counter~0 87)} {94058#true} #102#return; {94809#(< ~counter~0 87)} is VALID [2022-04-28 05:59:35,521 INFO L290 TraceCheckUtils]: 2: Hoare triple {94809#(< ~counter~0 87)} assume true; {94809#(< ~counter~0 87)} is VALID [2022-04-28 05:59:35,521 INFO L290 TraceCheckUtils]: 1: Hoare triple {94058#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; {94809#(< ~counter~0 87)} is VALID [2022-04-28 05:59:35,522 INFO L272 TraceCheckUtils]: 0: Hoare triple {94058#true} call ULTIMATE.init(); {94058#true} is VALID [2022-04-28 05:59:35,522 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 32 proven. 104 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2022-04-28 05:59:35,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:59:35,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668771782] [2022-04-28 05:59:35,522 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:59:35,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109670214] [2022-04-28 05:59:35,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2109670214] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:59:35,522 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:59:35,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2022-04-28 05:59:35,523 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:59:35,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2087284481] [2022-04-28 05:59:35,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2087284481] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:59:35,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:59:35,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 05:59:35,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464979119] [2022-04-28 05:59:35,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:59:35,523 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 16 states have internal predecessors, (92), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) Word has length 129 [2022-04-28 05:59:35,523 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:59:35,524 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 16 states have internal predecessors, (92), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-28 05:59:35,621 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:59:35,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 05:59:35,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:59:35,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 05:59:35,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=552, Unknown=0, NotChecked=0, Total=992 [2022-04-28 05:59:35,622 INFO L87 Difference]: Start difference. First operand 672 states and 914 transitions. Second operand has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 16 states have internal predecessors, (92), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-28 05:59:38,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:59:38,763 INFO L93 Difference]: Finished difference Result 893 states and 1247 transitions. [2022-04-28 05:59:38,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-28 05:59:38,764 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 16 states have internal predecessors, (92), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) Word has length 129 [2022-04-28 05:59:38,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:59:38,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 16 states have internal predecessors, (92), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-28 05:59:38,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 296 transitions. [2022-04-28 05:59:38,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 16 states have internal predecessors, (92), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-28 05:59:38,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 296 transitions. [2022-04-28 05:59:38,769 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 296 transitions. [2022-04-28 05:59:39,080 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 296 edges. 296 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:59:39,101 INFO L225 Difference]: With dead ends: 893 [2022-04-28 05:59:39,101 INFO L226 Difference]: Without dead ends: 700 [2022-04-28 05:59:39,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=759, Invalid=1047, Unknown=0, NotChecked=0, Total=1806 [2022-04-28 05:59:39,102 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 216 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 05:59:39,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 292 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 05:59:39,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2022-04-28 05:59:41,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 690. [2022-04-28 05:59:41,101 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:59:41,102 INFO L82 GeneralOperation]: Start isEquivalent. First operand 700 states. Second operand has 690 states, 520 states have (on average 1.2153846153846153) internal successors, (632), 524 states have internal predecessors, (632), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 147 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-28 05:59:41,102 INFO L74 IsIncluded]: Start isIncluded. First operand 700 states. Second operand has 690 states, 520 states have (on average 1.2153846153846153) internal successors, (632), 524 states have internal predecessors, (632), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 147 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-28 05:59:41,102 INFO L87 Difference]: Start difference. First operand 700 states. Second operand has 690 states, 520 states have (on average 1.2153846153846153) internal successors, (632), 524 states have internal predecessors, (632), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 147 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-28 05:59:41,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:59:41,119 INFO L93 Difference]: Finished difference Result 700 states and 946 transitions. [2022-04-28 05:59:41,119 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 946 transitions. [2022-04-28 05:59:41,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:59:41,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:59:41,121 INFO L74 IsIncluded]: Start isIncluded. First operand has 690 states, 520 states have (on average 1.2153846153846153) internal successors, (632), 524 states have internal predecessors, (632), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 147 states have call predecessors, (151), 151 states have call successors, (151) Second operand 700 states. [2022-04-28 05:59:41,122 INFO L87 Difference]: Start difference. First operand has 690 states, 520 states have (on average 1.2153846153846153) internal successors, (632), 524 states have internal predecessors, (632), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 147 states have call predecessors, (151), 151 states have call successors, (151) Second operand 700 states. [2022-04-28 05:59:41,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:59:41,138 INFO L93 Difference]: Finished difference Result 700 states and 946 transitions. [2022-04-28 05:59:41,138 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 946 transitions. [2022-04-28 05:59:41,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:59:41,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:59:41,139 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:59:41,139 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:59:41,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 520 states have (on average 1.2153846153846153) internal successors, (632), 524 states have internal predecessors, (632), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 147 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-28 05:59:41,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 936 transitions. [2022-04-28 05:59:41,161 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 936 transitions. Word has length 129 [2022-04-28 05:59:41,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:59:41,162 INFO L495 AbstractCegarLoop]: Abstraction has 690 states and 936 transitions. [2022-04-28 05:59:41,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 16 states have internal predecessors, (92), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-28 05:59:41,162 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 690 states and 936 transitions. [2022-04-28 05:59:46,282 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 936 edges. 935 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 05:59:46,282 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 936 transitions. [2022-04-28 05:59:46,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-28 05:59:46,284 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:59:46,284 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 7, 6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:59:46,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-04-28 05:59:46,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-04-28 05:59:46,485 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:59:46,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:59:46,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1255136270, now seen corresponding path program 17 times [2022-04-28 05:59:46,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:59:46,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1727611535] [2022-04-28 05:59:46,485 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:59:46,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1255136270, now seen corresponding path program 18 times [2022-04-28 05:59:46,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:59:46,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466100015] [2022-04-28 05:59:46,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:59:46,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:59:46,498 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:59:46,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [768261154] [2022-04-28 05:59:46,498 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 05:59:46,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:59:46,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:59:46,499 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:59:46,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-04-28 05:59:46,678 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-28 05:59:46,679 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:59:46,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 05:59:46,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:59:46,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:59:47,283 INFO L272 TraceCheckUtils]: 0: Hoare triple {99451#true} call ULTIMATE.init(); {99451#true} is VALID [2022-04-28 05:59:47,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {99451#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; {99459#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:47,284 INFO L290 TraceCheckUtils]: 2: Hoare triple {99459#(<= ~counter~0 0)} assume true; {99459#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:47,284 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {99459#(<= ~counter~0 0)} {99451#true} #102#return; {99459#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:47,284 INFO L272 TraceCheckUtils]: 4: Hoare triple {99459#(<= ~counter~0 0)} call #t~ret9 := main(); {99459#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:47,285 INFO L290 TraceCheckUtils]: 5: Hoare triple {99459#(<= ~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; {99459#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:47,285 INFO L272 TraceCheckUtils]: 6: Hoare triple {99459#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {99459#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:47,285 INFO L290 TraceCheckUtils]: 7: Hoare triple {99459#(<= ~counter~0 0)} ~cond := #in~cond; {99459#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:47,286 INFO L290 TraceCheckUtils]: 8: Hoare triple {99459#(<= ~counter~0 0)} assume !(0 == ~cond); {99459#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:47,286 INFO L290 TraceCheckUtils]: 9: Hoare triple {99459#(<= ~counter~0 0)} assume true; {99459#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:47,286 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {99459#(<= ~counter~0 0)} {99459#(<= ~counter~0 0)} #90#return; {99459#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:47,287 INFO L272 TraceCheckUtils]: 11: Hoare triple {99459#(<= ~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)); {99459#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:47,287 INFO L290 TraceCheckUtils]: 12: Hoare triple {99459#(<= ~counter~0 0)} ~cond := #in~cond; {99459#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:47,287 INFO L290 TraceCheckUtils]: 13: Hoare triple {99459#(<= ~counter~0 0)} assume !(0 == ~cond); {99459#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:47,287 INFO L290 TraceCheckUtils]: 14: Hoare triple {99459#(<= ~counter~0 0)} assume true; {99459#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:47,288 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {99459#(<= ~counter~0 0)} {99459#(<= ~counter~0 0)} #92#return; {99459#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:47,288 INFO L290 TraceCheckUtils]: 16: Hoare triple {99459#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {99459#(<= ~counter~0 0)} is VALID [2022-04-28 05:59:47,290 INFO L290 TraceCheckUtils]: 17: Hoare triple {99459#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {99508#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:47,290 INFO L290 TraceCheckUtils]: 18: Hoare triple {99508#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {99508#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:47,291 INFO L272 TraceCheckUtils]: 19: Hoare triple {99508#(<= ~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)); {99508#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:47,291 INFO L290 TraceCheckUtils]: 20: Hoare triple {99508#(<= ~counter~0 1)} ~cond := #in~cond; {99508#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:47,291 INFO L290 TraceCheckUtils]: 21: Hoare triple {99508#(<= ~counter~0 1)} assume !(0 == ~cond); {99508#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:47,292 INFO L290 TraceCheckUtils]: 22: Hoare triple {99508#(<= ~counter~0 1)} assume true; {99508#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:47,292 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {99508#(<= ~counter~0 1)} {99508#(<= ~counter~0 1)} #94#return; {99508#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:47,292 INFO L290 TraceCheckUtils]: 24: Hoare triple {99508#(<= ~counter~0 1)} assume !!(0 != ~r~0); {99508#(<= ~counter~0 1)} is VALID [2022-04-28 05:59:47,293 INFO L290 TraceCheckUtils]: 25: Hoare triple {99508#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {99533#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:47,293 INFO L290 TraceCheckUtils]: 26: Hoare triple {99533#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {99533#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:47,294 INFO L272 TraceCheckUtils]: 27: Hoare triple {99533#(<= ~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)); {99533#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:47,294 INFO L290 TraceCheckUtils]: 28: Hoare triple {99533#(<= ~counter~0 2)} ~cond := #in~cond; {99533#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:47,294 INFO L290 TraceCheckUtils]: 29: Hoare triple {99533#(<= ~counter~0 2)} assume !(0 == ~cond); {99533#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:47,295 INFO L290 TraceCheckUtils]: 30: Hoare triple {99533#(<= ~counter~0 2)} assume true; {99533#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:47,295 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {99533#(<= ~counter~0 2)} {99533#(<= ~counter~0 2)} #96#return; {99533#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:47,295 INFO L290 TraceCheckUtils]: 32: Hoare triple {99533#(<= ~counter~0 2)} assume !(~r~0 > 0); {99533#(<= ~counter~0 2)} is VALID [2022-04-28 05:59:47,296 INFO L290 TraceCheckUtils]: 33: Hoare triple {99533#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {99558#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:47,297 INFO L290 TraceCheckUtils]: 34: Hoare triple {99558#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {99558#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:47,297 INFO L272 TraceCheckUtils]: 35: Hoare triple {99558#(<= ~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)); {99558#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:47,297 INFO L290 TraceCheckUtils]: 36: Hoare triple {99558#(<= ~counter~0 3)} ~cond := #in~cond; {99558#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:47,297 INFO L290 TraceCheckUtils]: 37: Hoare triple {99558#(<= ~counter~0 3)} assume !(0 == ~cond); {99558#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:47,298 INFO L290 TraceCheckUtils]: 38: Hoare triple {99558#(<= ~counter~0 3)} assume true; {99558#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:47,298 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {99558#(<= ~counter~0 3)} {99558#(<= ~counter~0 3)} #98#return; {99558#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:47,298 INFO L290 TraceCheckUtils]: 40: Hoare triple {99558#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {99558#(<= ~counter~0 3)} is VALID [2022-04-28 05:59:47,299 INFO L290 TraceCheckUtils]: 41: Hoare triple {99558#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {99583#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:47,300 INFO L290 TraceCheckUtils]: 42: Hoare triple {99583#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {99583#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:47,300 INFO L272 TraceCheckUtils]: 43: Hoare triple {99583#(<= ~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)); {99583#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:47,300 INFO L290 TraceCheckUtils]: 44: Hoare triple {99583#(<= ~counter~0 4)} ~cond := #in~cond; {99583#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:47,300 INFO L290 TraceCheckUtils]: 45: Hoare triple {99583#(<= ~counter~0 4)} assume !(0 == ~cond); {99583#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:47,301 INFO L290 TraceCheckUtils]: 46: Hoare triple {99583#(<= ~counter~0 4)} assume true; {99583#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:47,301 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {99583#(<= ~counter~0 4)} {99583#(<= ~counter~0 4)} #98#return; {99583#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:47,301 INFO L290 TraceCheckUtils]: 48: Hoare triple {99583#(<= ~counter~0 4)} assume !(~r~0 < 0); {99583#(<= ~counter~0 4)} is VALID [2022-04-28 05:59:47,302 INFO L290 TraceCheckUtils]: 49: Hoare triple {99583#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {99608#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:47,303 INFO L290 TraceCheckUtils]: 50: Hoare triple {99608#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {99608#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:47,303 INFO L272 TraceCheckUtils]: 51: Hoare triple {99608#(<= ~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)); {99608#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:47,303 INFO L290 TraceCheckUtils]: 52: Hoare triple {99608#(<= ~counter~0 5)} ~cond := #in~cond; {99608#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:47,304 INFO L290 TraceCheckUtils]: 53: Hoare triple {99608#(<= ~counter~0 5)} assume !(0 == ~cond); {99608#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:47,304 INFO L290 TraceCheckUtils]: 54: Hoare triple {99608#(<= ~counter~0 5)} assume true; {99608#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:47,304 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {99608#(<= ~counter~0 5)} {99608#(<= ~counter~0 5)} #94#return; {99608#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:47,305 INFO L290 TraceCheckUtils]: 56: Hoare triple {99608#(<= ~counter~0 5)} assume !!(0 != ~r~0); {99608#(<= ~counter~0 5)} is VALID [2022-04-28 05:59:47,305 INFO L290 TraceCheckUtils]: 57: Hoare triple {99608#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {99633#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:47,306 INFO L290 TraceCheckUtils]: 58: Hoare triple {99633#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {99633#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:47,306 INFO L272 TraceCheckUtils]: 59: Hoare triple {99633#(<= ~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)); {99633#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:47,306 INFO L290 TraceCheckUtils]: 60: Hoare triple {99633#(<= ~counter~0 6)} ~cond := #in~cond; {99633#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:47,307 INFO L290 TraceCheckUtils]: 61: Hoare triple {99633#(<= ~counter~0 6)} assume !(0 == ~cond); {99633#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:47,307 INFO L290 TraceCheckUtils]: 62: Hoare triple {99633#(<= ~counter~0 6)} assume true; {99633#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:47,307 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {99633#(<= ~counter~0 6)} {99633#(<= ~counter~0 6)} #96#return; {99633#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:47,308 INFO L290 TraceCheckUtils]: 64: Hoare triple {99633#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {99633#(<= ~counter~0 6)} is VALID [2022-04-28 05:59:47,308 INFO L290 TraceCheckUtils]: 65: Hoare triple {99633#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {99658#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:47,309 INFO L290 TraceCheckUtils]: 66: Hoare triple {99658#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {99658#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:47,309 INFO L272 TraceCheckUtils]: 67: Hoare triple {99658#(<= ~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)); {99658#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:47,309 INFO L290 TraceCheckUtils]: 68: Hoare triple {99658#(<= ~counter~0 7)} ~cond := #in~cond; {99658#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:47,310 INFO L290 TraceCheckUtils]: 69: Hoare triple {99658#(<= ~counter~0 7)} assume !(0 == ~cond); {99658#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:47,310 INFO L290 TraceCheckUtils]: 70: Hoare triple {99658#(<= ~counter~0 7)} assume true; {99658#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:47,310 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {99658#(<= ~counter~0 7)} {99658#(<= ~counter~0 7)} #96#return; {99658#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:47,311 INFO L290 TraceCheckUtils]: 72: Hoare triple {99658#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {99658#(<= ~counter~0 7)} is VALID [2022-04-28 05:59:47,312 INFO L290 TraceCheckUtils]: 73: Hoare triple {99658#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {99683#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:47,312 INFO L290 TraceCheckUtils]: 74: Hoare triple {99683#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {99683#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:47,312 INFO L272 TraceCheckUtils]: 75: Hoare triple {99683#(<= ~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)); {99683#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:47,312 INFO L290 TraceCheckUtils]: 76: Hoare triple {99683#(<= ~counter~0 8)} ~cond := #in~cond; {99683#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:47,313 INFO L290 TraceCheckUtils]: 77: Hoare triple {99683#(<= ~counter~0 8)} assume !(0 == ~cond); {99683#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:47,313 INFO L290 TraceCheckUtils]: 78: Hoare triple {99683#(<= ~counter~0 8)} assume true; {99683#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:47,313 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {99683#(<= ~counter~0 8)} {99683#(<= ~counter~0 8)} #96#return; {99683#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:47,314 INFO L290 TraceCheckUtils]: 80: Hoare triple {99683#(<= ~counter~0 8)} assume !(~r~0 > 0); {99683#(<= ~counter~0 8)} is VALID [2022-04-28 05:59:47,315 INFO L290 TraceCheckUtils]: 81: Hoare triple {99683#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {99708#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:47,315 INFO L290 TraceCheckUtils]: 82: Hoare triple {99708#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {99708#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:47,315 INFO L272 TraceCheckUtils]: 83: Hoare triple {99708#(<= ~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)); {99708#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:47,316 INFO L290 TraceCheckUtils]: 84: Hoare triple {99708#(<= ~counter~0 9)} ~cond := #in~cond; {99708#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:47,316 INFO L290 TraceCheckUtils]: 85: Hoare triple {99708#(<= ~counter~0 9)} assume !(0 == ~cond); {99708#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:47,316 INFO L290 TraceCheckUtils]: 86: Hoare triple {99708#(<= ~counter~0 9)} assume true; {99708#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:47,316 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {99708#(<= ~counter~0 9)} {99708#(<= ~counter~0 9)} #98#return; {99708#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:47,317 INFO L290 TraceCheckUtils]: 88: Hoare triple {99708#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {99708#(<= ~counter~0 9)} is VALID [2022-04-28 05:59:47,318 INFO L290 TraceCheckUtils]: 89: Hoare triple {99708#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {99733#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:47,318 INFO L290 TraceCheckUtils]: 90: Hoare triple {99733#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {99733#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:47,318 INFO L272 TraceCheckUtils]: 91: Hoare triple {99733#(<= ~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)); {99733#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:47,319 INFO L290 TraceCheckUtils]: 92: Hoare triple {99733#(<= ~counter~0 10)} ~cond := #in~cond; {99733#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:47,319 INFO L290 TraceCheckUtils]: 93: Hoare triple {99733#(<= ~counter~0 10)} assume !(0 == ~cond); {99733#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:47,319 INFO L290 TraceCheckUtils]: 94: Hoare triple {99733#(<= ~counter~0 10)} assume true; {99733#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:47,320 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {99733#(<= ~counter~0 10)} {99733#(<= ~counter~0 10)} #98#return; {99733#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:47,320 INFO L290 TraceCheckUtils]: 96: Hoare triple {99733#(<= ~counter~0 10)} assume !(~r~0 < 0); {99733#(<= ~counter~0 10)} is VALID [2022-04-28 05:59:47,321 INFO L290 TraceCheckUtils]: 97: Hoare triple {99733#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {99758#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:47,321 INFO L290 TraceCheckUtils]: 98: Hoare triple {99758#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {99758#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:47,321 INFO L272 TraceCheckUtils]: 99: Hoare triple {99758#(<= ~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)); {99758#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:47,322 INFO L290 TraceCheckUtils]: 100: Hoare triple {99758#(<= ~counter~0 11)} ~cond := #in~cond; {99758#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:47,322 INFO L290 TraceCheckUtils]: 101: Hoare triple {99758#(<= ~counter~0 11)} assume !(0 == ~cond); {99758#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:47,322 INFO L290 TraceCheckUtils]: 102: Hoare triple {99758#(<= ~counter~0 11)} assume true; {99758#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:47,323 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {99758#(<= ~counter~0 11)} {99758#(<= ~counter~0 11)} #94#return; {99758#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:47,323 INFO L290 TraceCheckUtils]: 104: Hoare triple {99758#(<= ~counter~0 11)} assume !!(0 != ~r~0); {99758#(<= ~counter~0 11)} is VALID [2022-04-28 05:59:47,324 INFO L290 TraceCheckUtils]: 105: Hoare triple {99758#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {99783#(<= ~counter~0 12)} is VALID [2022-04-28 05:59:47,324 INFO L290 TraceCheckUtils]: 106: Hoare triple {99783#(<= ~counter~0 12)} assume !!(#t~post7 < 100);havoc #t~post7; {99783#(<= ~counter~0 12)} is VALID [2022-04-28 05:59:47,324 INFO L272 TraceCheckUtils]: 107: Hoare triple {99783#(<= ~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)); {99783#(<= ~counter~0 12)} is VALID [2022-04-28 05:59:47,325 INFO L290 TraceCheckUtils]: 108: Hoare triple {99783#(<= ~counter~0 12)} ~cond := #in~cond; {99783#(<= ~counter~0 12)} is VALID [2022-04-28 05:59:47,325 INFO L290 TraceCheckUtils]: 109: Hoare triple {99783#(<= ~counter~0 12)} assume !(0 == ~cond); {99783#(<= ~counter~0 12)} is VALID [2022-04-28 05:59:47,325 INFO L290 TraceCheckUtils]: 110: Hoare triple {99783#(<= ~counter~0 12)} assume true; {99783#(<= ~counter~0 12)} is VALID [2022-04-28 05:59:47,326 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {99783#(<= ~counter~0 12)} {99783#(<= ~counter~0 12)} #96#return; {99783#(<= ~counter~0 12)} is VALID [2022-04-28 05:59:47,326 INFO L290 TraceCheckUtils]: 112: Hoare triple {99783#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {99783#(<= ~counter~0 12)} is VALID [2022-04-28 05:59:47,327 INFO L290 TraceCheckUtils]: 113: Hoare triple {99783#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {99808#(<= ~counter~0 13)} is VALID [2022-04-28 05:59:47,327 INFO L290 TraceCheckUtils]: 114: Hoare triple {99808#(<= ~counter~0 13)} assume !!(#t~post7 < 100);havoc #t~post7; {99808#(<= ~counter~0 13)} is VALID [2022-04-28 05:59:47,328 INFO L272 TraceCheckUtils]: 115: Hoare triple {99808#(<= ~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)); {99808#(<= ~counter~0 13)} is VALID [2022-04-28 05:59:47,328 INFO L290 TraceCheckUtils]: 116: Hoare triple {99808#(<= ~counter~0 13)} ~cond := #in~cond; {99808#(<= ~counter~0 13)} is VALID [2022-04-28 05:59:47,328 INFO L290 TraceCheckUtils]: 117: Hoare triple {99808#(<= ~counter~0 13)} assume !(0 == ~cond); {99808#(<= ~counter~0 13)} is VALID [2022-04-28 05:59:47,328 INFO L290 TraceCheckUtils]: 118: Hoare triple {99808#(<= ~counter~0 13)} assume true; {99808#(<= ~counter~0 13)} is VALID [2022-04-28 05:59:47,329 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {99808#(<= ~counter~0 13)} {99808#(<= ~counter~0 13)} #96#return; {99808#(<= ~counter~0 13)} is VALID [2022-04-28 05:59:47,329 INFO L290 TraceCheckUtils]: 120: Hoare triple {99808#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {99808#(<= ~counter~0 13)} is VALID [2022-04-28 05:59:47,329 INFO L290 TraceCheckUtils]: 121: Hoare triple {99808#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {99833#(<= |main_#t~post7| 13)} is VALID [2022-04-28 05:59:47,330 INFO L290 TraceCheckUtils]: 122: Hoare triple {99833#(<= |main_#t~post7| 13)} assume !(#t~post7 < 100);havoc #t~post7; {99452#false} is VALID [2022-04-28 05:59:47,330 INFO L290 TraceCheckUtils]: 123: Hoare triple {99452#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {99452#false} is VALID [2022-04-28 05:59:47,330 INFO L290 TraceCheckUtils]: 124: Hoare triple {99452#false} assume !(#t~post8 < 100);havoc #t~post8; {99452#false} is VALID [2022-04-28 05:59:47,330 INFO L290 TraceCheckUtils]: 125: Hoare triple {99452#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {99452#false} is VALID [2022-04-28 05:59:47,330 INFO L290 TraceCheckUtils]: 126: Hoare triple {99452#false} assume !(#t~post6 < 100);havoc #t~post6; {99452#false} is VALID [2022-04-28 05:59:47,330 INFO L272 TraceCheckUtils]: 127: Hoare triple {99452#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)); {99452#false} is VALID [2022-04-28 05:59:47,330 INFO L290 TraceCheckUtils]: 128: Hoare triple {99452#false} ~cond := #in~cond; {99452#false} is VALID [2022-04-28 05:59:47,330 INFO L290 TraceCheckUtils]: 129: Hoare triple {99452#false} assume 0 == ~cond; {99452#false} is VALID [2022-04-28 05:59:47,330 INFO L290 TraceCheckUtils]: 130: Hoare triple {99452#false} assume !false; {99452#false} is VALID [2022-04-28 05:59:47,331 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 40 proven. 420 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:59:47,331 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:59:48,023 INFO L290 TraceCheckUtils]: 130: Hoare triple {99452#false} assume !false; {99452#false} is VALID [2022-04-28 05:59:48,023 INFO L290 TraceCheckUtils]: 129: Hoare triple {99452#false} assume 0 == ~cond; {99452#false} is VALID [2022-04-28 05:59:48,023 INFO L290 TraceCheckUtils]: 128: Hoare triple {99452#false} ~cond := #in~cond; {99452#false} is VALID [2022-04-28 05:59:48,023 INFO L272 TraceCheckUtils]: 127: Hoare triple {99452#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)); {99452#false} is VALID [2022-04-28 05:59:48,023 INFO L290 TraceCheckUtils]: 126: Hoare triple {99452#false} assume !(#t~post6 < 100);havoc #t~post6; {99452#false} is VALID [2022-04-28 05:59:48,023 INFO L290 TraceCheckUtils]: 125: Hoare triple {99452#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {99452#false} is VALID [2022-04-28 05:59:48,023 INFO L290 TraceCheckUtils]: 124: Hoare triple {99452#false} assume !(#t~post8 < 100);havoc #t~post8; {99452#false} is VALID [2022-04-28 05:59:48,024 INFO L290 TraceCheckUtils]: 123: Hoare triple {99452#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {99452#false} is VALID [2022-04-28 05:59:48,024 INFO L290 TraceCheckUtils]: 122: Hoare triple {99885#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {99452#false} is VALID [2022-04-28 05:59:48,024 INFO L290 TraceCheckUtils]: 121: Hoare triple {99889#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {99885#(< |main_#t~post7| 100)} is VALID [2022-04-28 05:59:48,024 INFO L290 TraceCheckUtils]: 120: Hoare triple {99889#(< ~counter~0 100)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {99889#(< ~counter~0 100)} is VALID [2022-04-28 05:59:48,025 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {99451#true} {99889#(< ~counter~0 100)} #96#return; {99889#(< ~counter~0 100)} is VALID [2022-04-28 05:59:48,025 INFO L290 TraceCheckUtils]: 118: Hoare triple {99451#true} assume true; {99451#true} is VALID [2022-04-28 05:59:48,025 INFO L290 TraceCheckUtils]: 117: Hoare triple {99451#true} assume !(0 == ~cond); {99451#true} is VALID [2022-04-28 05:59:48,025 INFO L290 TraceCheckUtils]: 116: Hoare triple {99451#true} ~cond := #in~cond; {99451#true} is VALID [2022-04-28 05:59:48,025 INFO L272 TraceCheckUtils]: 115: Hoare triple {99889#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99451#true} is VALID [2022-04-28 05:59:48,025 INFO L290 TraceCheckUtils]: 114: Hoare triple {99889#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {99889#(< ~counter~0 100)} is VALID [2022-04-28 05:59:48,027 INFO L290 TraceCheckUtils]: 113: Hoare triple {99914#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {99889#(< ~counter~0 100)} is VALID [2022-04-28 05:59:48,028 INFO L290 TraceCheckUtils]: 112: Hoare triple {99914#(< ~counter~0 99)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {99914#(< ~counter~0 99)} is VALID [2022-04-28 05:59:48,028 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {99451#true} {99914#(< ~counter~0 99)} #96#return; {99914#(< ~counter~0 99)} is VALID [2022-04-28 05:59:48,028 INFO L290 TraceCheckUtils]: 110: Hoare triple {99451#true} assume true; {99451#true} is VALID [2022-04-28 05:59:48,028 INFO L290 TraceCheckUtils]: 109: Hoare triple {99451#true} assume !(0 == ~cond); {99451#true} is VALID [2022-04-28 05:59:48,028 INFO L290 TraceCheckUtils]: 108: Hoare triple {99451#true} ~cond := #in~cond; {99451#true} is VALID [2022-04-28 05:59:48,028 INFO L272 TraceCheckUtils]: 107: Hoare triple {99914#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99451#true} is VALID [2022-04-28 05:59:48,029 INFO L290 TraceCheckUtils]: 106: Hoare triple {99914#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {99914#(< ~counter~0 99)} is VALID [2022-04-28 05:59:48,030 INFO L290 TraceCheckUtils]: 105: Hoare triple {99939#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {99914#(< ~counter~0 99)} is VALID [2022-04-28 05:59:48,030 INFO L290 TraceCheckUtils]: 104: Hoare triple {99939#(< ~counter~0 98)} assume !!(0 != ~r~0); {99939#(< ~counter~0 98)} is VALID [2022-04-28 05:59:48,030 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {99451#true} {99939#(< ~counter~0 98)} #94#return; {99939#(< ~counter~0 98)} is VALID [2022-04-28 05:59:48,030 INFO L290 TraceCheckUtils]: 102: Hoare triple {99451#true} assume true; {99451#true} is VALID [2022-04-28 05:59:48,030 INFO L290 TraceCheckUtils]: 101: Hoare triple {99451#true} assume !(0 == ~cond); {99451#true} is VALID [2022-04-28 05:59:48,030 INFO L290 TraceCheckUtils]: 100: Hoare triple {99451#true} ~cond := #in~cond; {99451#true} is VALID [2022-04-28 05:59:48,031 INFO L272 TraceCheckUtils]: 99: Hoare triple {99939#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99451#true} is VALID [2022-04-28 05:59:48,031 INFO L290 TraceCheckUtils]: 98: Hoare triple {99939#(< ~counter~0 98)} assume !!(#t~post6 < 100);havoc #t~post6; {99939#(< ~counter~0 98)} is VALID [2022-04-28 05:59:48,032 INFO L290 TraceCheckUtils]: 97: Hoare triple {99964#(< ~counter~0 97)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {99939#(< ~counter~0 98)} is VALID [2022-04-28 05:59:48,032 INFO L290 TraceCheckUtils]: 96: Hoare triple {99964#(< ~counter~0 97)} assume !(~r~0 < 0); {99964#(< ~counter~0 97)} is VALID [2022-04-28 05:59:48,032 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {99451#true} {99964#(< ~counter~0 97)} #98#return; {99964#(< ~counter~0 97)} is VALID [2022-04-28 05:59:48,032 INFO L290 TraceCheckUtils]: 94: Hoare triple {99451#true} assume true; {99451#true} is VALID [2022-04-28 05:59:48,033 INFO L290 TraceCheckUtils]: 93: Hoare triple {99451#true} assume !(0 == ~cond); {99451#true} is VALID [2022-04-28 05:59:48,033 INFO L290 TraceCheckUtils]: 92: Hoare triple {99451#true} ~cond := #in~cond; {99451#true} is VALID [2022-04-28 05:59:48,033 INFO L272 TraceCheckUtils]: 91: Hoare triple {99964#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99451#true} is VALID [2022-04-28 05:59:48,033 INFO L290 TraceCheckUtils]: 90: Hoare triple {99964#(< ~counter~0 97)} assume !!(#t~post8 < 100);havoc #t~post8; {99964#(< ~counter~0 97)} is VALID [2022-04-28 05:59:48,034 INFO L290 TraceCheckUtils]: 89: Hoare triple {99989#(< ~counter~0 96)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {99964#(< ~counter~0 97)} is VALID [2022-04-28 05:59:48,034 INFO L290 TraceCheckUtils]: 88: Hoare triple {99989#(< ~counter~0 96)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {99989#(< ~counter~0 96)} is VALID [2022-04-28 05:59:48,035 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {99451#true} {99989#(< ~counter~0 96)} #98#return; {99989#(< ~counter~0 96)} is VALID [2022-04-28 05:59:48,035 INFO L290 TraceCheckUtils]: 86: Hoare triple {99451#true} assume true; {99451#true} is VALID [2022-04-28 05:59:48,035 INFO L290 TraceCheckUtils]: 85: Hoare triple {99451#true} assume !(0 == ~cond); {99451#true} is VALID [2022-04-28 05:59:48,035 INFO L290 TraceCheckUtils]: 84: Hoare triple {99451#true} ~cond := #in~cond; {99451#true} is VALID [2022-04-28 05:59:48,035 INFO L272 TraceCheckUtils]: 83: Hoare triple {99989#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99451#true} is VALID [2022-04-28 05:59:48,035 INFO L290 TraceCheckUtils]: 82: Hoare triple {99989#(< ~counter~0 96)} assume !!(#t~post8 < 100);havoc #t~post8; {99989#(< ~counter~0 96)} is VALID [2022-04-28 05:59:48,036 INFO L290 TraceCheckUtils]: 81: Hoare triple {100014#(< ~counter~0 95)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {99989#(< ~counter~0 96)} is VALID [2022-04-28 05:59:48,036 INFO L290 TraceCheckUtils]: 80: Hoare triple {100014#(< ~counter~0 95)} assume !(~r~0 > 0); {100014#(< ~counter~0 95)} is VALID [2022-04-28 05:59:48,037 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {99451#true} {100014#(< ~counter~0 95)} #96#return; {100014#(< ~counter~0 95)} is VALID [2022-04-28 05:59:48,037 INFO L290 TraceCheckUtils]: 78: Hoare triple {99451#true} assume true; {99451#true} is VALID [2022-04-28 05:59:48,037 INFO L290 TraceCheckUtils]: 77: Hoare triple {99451#true} assume !(0 == ~cond); {99451#true} is VALID [2022-04-28 05:59:48,037 INFO L290 TraceCheckUtils]: 76: Hoare triple {99451#true} ~cond := #in~cond; {99451#true} is VALID [2022-04-28 05:59:48,037 INFO L272 TraceCheckUtils]: 75: Hoare triple {100014#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99451#true} is VALID [2022-04-28 05:59:48,037 INFO L290 TraceCheckUtils]: 74: Hoare triple {100014#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {100014#(< ~counter~0 95)} is VALID [2022-04-28 05:59:48,038 INFO L290 TraceCheckUtils]: 73: Hoare triple {100039#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {100014#(< ~counter~0 95)} is VALID [2022-04-28 05:59:48,038 INFO L290 TraceCheckUtils]: 72: Hoare triple {100039#(< ~counter~0 94)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {100039#(< ~counter~0 94)} is VALID [2022-04-28 05:59:48,039 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {99451#true} {100039#(< ~counter~0 94)} #96#return; {100039#(< ~counter~0 94)} is VALID [2022-04-28 05:59:48,039 INFO L290 TraceCheckUtils]: 70: Hoare triple {99451#true} assume true; {99451#true} is VALID [2022-04-28 05:59:48,039 INFO L290 TraceCheckUtils]: 69: Hoare triple {99451#true} assume !(0 == ~cond); {99451#true} is VALID [2022-04-28 05:59:48,039 INFO L290 TraceCheckUtils]: 68: Hoare triple {99451#true} ~cond := #in~cond; {99451#true} is VALID [2022-04-28 05:59:48,039 INFO L272 TraceCheckUtils]: 67: Hoare triple {100039#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99451#true} is VALID [2022-04-28 05:59:48,039 INFO L290 TraceCheckUtils]: 66: Hoare triple {100039#(< ~counter~0 94)} assume !!(#t~post7 < 100);havoc #t~post7; {100039#(< ~counter~0 94)} is VALID [2022-04-28 05:59:48,040 INFO L290 TraceCheckUtils]: 65: Hoare triple {100064#(< ~counter~0 93)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {100039#(< ~counter~0 94)} is VALID [2022-04-28 05:59:48,040 INFO L290 TraceCheckUtils]: 64: Hoare triple {100064#(< ~counter~0 93)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {100064#(< ~counter~0 93)} is VALID [2022-04-28 05:59:48,041 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {99451#true} {100064#(< ~counter~0 93)} #96#return; {100064#(< ~counter~0 93)} is VALID [2022-04-28 05:59:48,041 INFO L290 TraceCheckUtils]: 62: Hoare triple {99451#true} assume true; {99451#true} is VALID [2022-04-28 05:59:48,041 INFO L290 TraceCheckUtils]: 61: Hoare triple {99451#true} assume !(0 == ~cond); {99451#true} is VALID [2022-04-28 05:59:48,041 INFO L290 TraceCheckUtils]: 60: Hoare triple {99451#true} ~cond := #in~cond; {99451#true} is VALID [2022-04-28 05:59:48,041 INFO L272 TraceCheckUtils]: 59: Hoare triple {100064#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99451#true} is VALID [2022-04-28 05:59:48,041 INFO L290 TraceCheckUtils]: 58: Hoare triple {100064#(< ~counter~0 93)} assume !!(#t~post7 < 100);havoc #t~post7; {100064#(< ~counter~0 93)} is VALID [2022-04-28 05:59:48,042 INFO L290 TraceCheckUtils]: 57: Hoare triple {100089#(< ~counter~0 92)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {100064#(< ~counter~0 93)} is VALID [2022-04-28 05:59:48,043 INFO L290 TraceCheckUtils]: 56: Hoare triple {100089#(< ~counter~0 92)} assume !!(0 != ~r~0); {100089#(< ~counter~0 92)} is VALID [2022-04-28 05:59:48,043 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {99451#true} {100089#(< ~counter~0 92)} #94#return; {100089#(< ~counter~0 92)} is VALID [2022-04-28 05:59:48,043 INFO L290 TraceCheckUtils]: 54: Hoare triple {99451#true} assume true; {99451#true} is VALID [2022-04-28 05:59:48,043 INFO L290 TraceCheckUtils]: 53: Hoare triple {99451#true} assume !(0 == ~cond); {99451#true} is VALID [2022-04-28 05:59:48,043 INFO L290 TraceCheckUtils]: 52: Hoare triple {99451#true} ~cond := #in~cond; {99451#true} is VALID [2022-04-28 05:59:48,043 INFO L272 TraceCheckUtils]: 51: Hoare triple {100089#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99451#true} is VALID [2022-04-28 05:59:48,044 INFO L290 TraceCheckUtils]: 50: Hoare triple {100089#(< ~counter~0 92)} assume !!(#t~post6 < 100);havoc #t~post6; {100089#(< ~counter~0 92)} is VALID [2022-04-28 05:59:48,044 INFO L290 TraceCheckUtils]: 49: Hoare triple {100114#(< ~counter~0 91)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {100089#(< ~counter~0 92)} is VALID [2022-04-28 05:59:48,045 INFO L290 TraceCheckUtils]: 48: Hoare triple {100114#(< ~counter~0 91)} assume !(~r~0 < 0); {100114#(< ~counter~0 91)} is VALID [2022-04-28 05:59:48,045 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {99451#true} {100114#(< ~counter~0 91)} #98#return; {100114#(< ~counter~0 91)} is VALID [2022-04-28 05:59:48,045 INFO L290 TraceCheckUtils]: 46: Hoare triple {99451#true} assume true; {99451#true} is VALID [2022-04-28 05:59:48,045 INFO L290 TraceCheckUtils]: 45: Hoare triple {99451#true} assume !(0 == ~cond); {99451#true} is VALID [2022-04-28 05:59:48,045 INFO L290 TraceCheckUtils]: 44: Hoare triple {99451#true} ~cond := #in~cond; {99451#true} is VALID [2022-04-28 05:59:48,045 INFO L272 TraceCheckUtils]: 43: Hoare triple {100114#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99451#true} is VALID [2022-04-28 05:59:48,046 INFO L290 TraceCheckUtils]: 42: Hoare triple {100114#(< ~counter~0 91)} assume !!(#t~post8 < 100);havoc #t~post8; {100114#(< ~counter~0 91)} is VALID [2022-04-28 05:59:48,047 INFO L290 TraceCheckUtils]: 41: Hoare triple {100139#(< ~counter~0 90)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {100114#(< ~counter~0 91)} is VALID [2022-04-28 05:59:48,047 INFO L290 TraceCheckUtils]: 40: Hoare triple {100139#(< ~counter~0 90)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {100139#(< ~counter~0 90)} is VALID [2022-04-28 05:59:48,047 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {99451#true} {100139#(< ~counter~0 90)} #98#return; {100139#(< ~counter~0 90)} is VALID [2022-04-28 05:59:48,047 INFO L290 TraceCheckUtils]: 38: Hoare triple {99451#true} assume true; {99451#true} is VALID [2022-04-28 05:59:48,047 INFO L290 TraceCheckUtils]: 37: Hoare triple {99451#true} assume !(0 == ~cond); {99451#true} is VALID [2022-04-28 05:59:48,047 INFO L290 TraceCheckUtils]: 36: Hoare triple {99451#true} ~cond := #in~cond; {99451#true} is VALID [2022-04-28 05:59:48,048 INFO L272 TraceCheckUtils]: 35: Hoare triple {100139#(< ~counter~0 90)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99451#true} is VALID [2022-04-28 05:59:48,048 INFO L290 TraceCheckUtils]: 34: Hoare triple {100139#(< ~counter~0 90)} assume !!(#t~post8 < 100);havoc #t~post8; {100139#(< ~counter~0 90)} is VALID [2022-04-28 05:59:48,049 INFO L290 TraceCheckUtils]: 33: Hoare triple {100164#(< ~counter~0 89)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {100139#(< ~counter~0 90)} is VALID [2022-04-28 05:59:48,049 INFO L290 TraceCheckUtils]: 32: Hoare triple {100164#(< ~counter~0 89)} assume !(~r~0 > 0); {100164#(< ~counter~0 89)} is VALID [2022-04-28 05:59:48,049 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {99451#true} {100164#(< ~counter~0 89)} #96#return; {100164#(< ~counter~0 89)} is VALID [2022-04-28 05:59:48,050 INFO L290 TraceCheckUtils]: 30: Hoare triple {99451#true} assume true; {99451#true} is VALID [2022-04-28 05:59:48,050 INFO L290 TraceCheckUtils]: 29: Hoare triple {99451#true} assume !(0 == ~cond); {99451#true} is VALID [2022-04-28 05:59:48,050 INFO L290 TraceCheckUtils]: 28: Hoare triple {99451#true} ~cond := #in~cond; {99451#true} is VALID [2022-04-28 05:59:48,050 INFO L272 TraceCheckUtils]: 27: Hoare triple {100164#(< ~counter~0 89)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99451#true} is VALID [2022-04-28 05:59:48,050 INFO L290 TraceCheckUtils]: 26: Hoare triple {100164#(< ~counter~0 89)} assume !!(#t~post7 < 100);havoc #t~post7; {100164#(< ~counter~0 89)} is VALID [2022-04-28 05:59:48,051 INFO L290 TraceCheckUtils]: 25: Hoare triple {100189#(< ~counter~0 88)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {100164#(< ~counter~0 89)} is VALID [2022-04-28 05:59:48,051 INFO L290 TraceCheckUtils]: 24: Hoare triple {100189#(< ~counter~0 88)} assume !!(0 != ~r~0); {100189#(< ~counter~0 88)} is VALID [2022-04-28 05:59:48,052 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {99451#true} {100189#(< ~counter~0 88)} #94#return; {100189#(< ~counter~0 88)} is VALID [2022-04-28 05:59:48,052 INFO L290 TraceCheckUtils]: 22: Hoare triple {99451#true} assume true; {99451#true} is VALID [2022-04-28 05:59:48,052 INFO L290 TraceCheckUtils]: 21: Hoare triple {99451#true} assume !(0 == ~cond); {99451#true} is VALID [2022-04-28 05:59:48,052 INFO L290 TraceCheckUtils]: 20: Hoare triple {99451#true} ~cond := #in~cond; {99451#true} is VALID [2022-04-28 05:59:48,052 INFO L272 TraceCheckUtils]: 19: Hoare triple {100189#(< ~counter~0 88)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99451#true} is VALID [2022-04-28 05:59:48,052 INFO L290 TraceCheckUtils]: 18: Hoare triple {100189#(< ~counter~0 88)} assume !!(#t~post6 < 100);havoc #t~post6; {100189#(< ~counter~0 88)} is VALID [2022-04-28 05:59:48,053 INFO L290 TraceCheckUtils]: 17: Hoare triple {100214#(< ~counter~0 87)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {100189#(< ~counter~0 88)} is VALID [2022-04-28 05:59:48,053 INFO L290 TraceCheckUtils]: 16: Hoare triple {100214#(< ~counter~0 87)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {100214#(< ~counter~0 87)} is VALID [2022-04-28 05:59:48,054 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {99451#true} {100214#(< ~counter~0 87)} #92#return; {100214#(< ~counter~0 87)} is VALID [2022-04-28 05:59:48,054 INFO L290 TraceCheckUtils]: 14: Hoare triple {99451#true} assume true; {99451#true} is VALID [2022-04-28 05:59:48,054 INFO L290 TraceCheckUtils]: 13: Hoare triple {99451#true} assume !(0 == ~cond); {99451#true} is VALID [2022-04-28 05:59:48,054 INFO L290 TraceCheckUtils]: 12: Hoare triple {99451#true} ~cond := #in~cond; {99451#true} is VALID [2022-04-28 05:59:48,054 INFO L272 TraceCheckUtils]: 11: Hoare triple {100214#(< ~counter~0 87)} 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)); {99451#true} is VALID [2022-04-28 05:59:48,054 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {99451#true} {100214#(< ~counter~0 87)} #90#return; {100214#(< ~counter~0 87)} is VALID [2022-04-28 05:59:48,054 INFO L290 TraceCheckUtils]: 9: Hoare triple {99451#true} assume true; {99451#true} is VALID [2022-04-28 05:59:48,054 INFO L290 TraceCheckUtils]: 8: Hoare triple {99451#true} assume !(0 == ~cond); {99451#true} is VALID [2022-04-28 05:59:48,055 INFO L290 TraceCheckUtils]: 7: Hoare triple {99451#true} ~cond := #in~cond; {99451#true} is VALID [2022-04-28 05:59:48,055 INFO L272 TraceCheckUtils]: 6: Hoare triple {100214#(< ~counter~0 87)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {99451#true} is VALID [2022-04-28 05:59:48,055 INFO L290 TraceCheckUtils]: 5: Hoare triple {100214#(< ~counter~0 87)} 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; {100214#(< ~counter~0 87)} is VALID [2022-04-28 05:59:48,055 INFO L272 TraceCheckUtils]: 4: Hoare triple {100214#(< ~counter~0 87)} call #t~ret9 := main(); {100214#(< ~counter~0 87)} is VALID [2022-04-28 05:59:48,055 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {100214#(< ~counter~0 87)} {99451#true} #102#return; {100214#(< ~counter~0 87)} is VALID [2022-04-28 05:59:48,056 INFO L290 TraceCheckUtils]: 2: Hoare triple {100214#(< ~counter~0 87)} assume true; {100214#(< ~counter~0 87)} is VALID [2022-04-28 05:59:48,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {99451#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; {100214#(< ~counter~0 87)} is VALID [2022-04-28 05:59:48,056 INFO L272 TraceCheckUtils]: 0: Hoare triple {99451#true} call ULTIMATE.init(); {99451#true} is VALID [2022-04-28 05:59:48,057 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 40 proven. 108 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2022-04-28 05:59:48,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:59:48,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466100015] [2022-04-28 05:59:48,057 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:59:48,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768261154] [2022-04-28 05:59:48,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [768261154] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:59:48,057 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:59:48,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2022-04-28 05:59:48,057 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:59:48,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1727611535] [2022-04-28 05:59:48,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1727611535] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:59:48,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:59:48,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 05:59:48,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134437554] [2022-04-28 05:59:48,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:59:48,058 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 16 states have internal predecessors, (94), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) Word has length 131 [2022-04-28 05:59:48,058 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:59:48,058 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 16 states have internal predecessors, (94), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-28 05:59:48,159 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:59:48,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 05:59:48,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:59:48,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 05:59:48,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=552, Unknown=0, NotChecked=0, Total=992 [2022-04-28 05:59:48,160 INFO L87 Difference]: Start difference. First operand 690 states and 936 transitions. Second operand has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 16 states have internal predecessors, (94), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-28 05:59:51,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:59:51,529 INFO L93 Difference]: Finished difference Result 903 states and 1260 transitions. [2022-04-28 05:59:51,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-28 05:59:51,529 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 16 states have internal predecessors, (94), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) Word has length 131 [2022-04-28 05:59:51,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:59:51,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 16 states have internal predecessors, (94), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-28 05:59:51,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 296 transitions. [2022-04-28 05:59:51,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 16 states have internal predecessors, (94), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-28 05:59:51,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 296 transitions. [2022-04-28 05:59:51,533 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 296 transitions. [2022-04-28 05:59:51,814 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 296 edges. 296 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:59:51,833 INFO L225 Difference]: With dead ends: 903 [2022-04-28 05:59:51,833 INFO L226 Difference]: Without dead ends: 706 [2022-04-28 05:59:51,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=800, Invalid=1092, Unknown=0, NotChecked=0, Total=1892 [2022-04-28 05:59:51,835 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 207 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 05:59:51,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 315 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 05:59:51,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2022-04-28 05:59:54,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 706. [2022-04-28 05:59:54,009 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:59:54,010 INFO L82 GeneralOperation]: Start isEquivalent. First operand 706 states. Second operand has 706 states, 536 states have (on average 1.208955223880597) internal successors, (648), 536 states have internal predecessors, (648), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 151 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-28 05:59:54,011 INFO L74 IsIncluded]: Start isIncluded. First operand 706 states. Second operand has 706 states, 536 states have (on average 1.208955223880597) internal successors, (648), 536 states have internal predecessors, (648), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 151 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-28 05:59:54,011 INFO L87 Difference]: Start difference. First operand 706 states. Second operand has 706 states, 536 states have (on average 1.208955223880597) internal successors, (648), 536 states have internal predecessors, (648), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 151 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-28 05:59:54,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:59:54,035 INFO L93 Difference]: Finished difference Result 706 states and 952 transitions. [2022-04-28 05:59:54,035 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 952 transitions. [2022-04-28 05:59:54,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:59:54,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:59:54,037 INFO L74 IsIncluded]: Start isIncluded. First operand has 706 states, 536 states have (on average 1.208955223880597) internal successors, (648), 536 states have internal predecessors, (648), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 151 states have call predecessors, (151), 151 states have call successors, (151) Second operand 706 states. [2022-04-28 05:59:54,038 INFO L87 Difference]: Start difference. First operand has 706 states, 536 states have (on average 1.208955223880597) internal successors, (648), 536 states have internal predecessors, (648), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 151 states have call predecessors, (151), 151 states have call successors, (151) Second operand 706 states. [2022-04-28 05:59:54,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:59:54,064 INFO L93 Difference]: Finished difference Result 706 states and 952 transitions. [2022-04-28 05:59:54,064 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 952 transitions. [2022-04-28 05:59:54,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:59:54,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:59:54,065 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:59:54,065 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:59:54,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 536 states have (on average 1.208955223880597) internal successors, (648), 536 states have internal predecessors, (648), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 151 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-28 05:59:54,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 952 transitions. [2022-04-28 05:59:54,100 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 952 transitions. Word has length 131 [2022-04-28 05:59:54,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:59:54,100 INFO L495 AbstractCegarLoop]: Abstraction has 706 states and 952 transitions. [2022-04-28 05:59:54,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 16 states have internal predecessors, (94), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-28 05:59:54,100 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 706 states and 952 transitions. [2022-04-28 05:59:58,902 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 952 edges. 952 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:59:58,903 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 952 transitions. [2022-04-28 05:59:58,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-04-28 05:59:58,904 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:59:58,904 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 6, 6, 6, 6, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:59:58,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-04-28 05:59:59,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:59:59,104 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:59:59,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:59:59,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1252937077, now seen corresponding path program 11 times [2022-04-28 05:59:59,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:59:59,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [884422846] [2022-04-28 05:59:59,105 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:59:59,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1252937077, now seen corresponding path program 12 times [2022-04-28 05:59:59,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:59:59,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124573127] [2022-04-28 05:59:59,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:59:59,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:59:59,117 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:59:59,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [555993230] [2022-04-28 05:59:59,117 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 05:59:59,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:59:59,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:59:59,118 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:59:59,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-04-28 05:59:59,207 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 05:59:59,207 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:59:59,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 05:59:59,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:59:59,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:59:59,796 INFO L272 TraceCheckUtils]: 0: Hoare triple {104922#true} call ULTIMATE.init(); {104922#true} is VALID [2022-04-28 05:59:59,797 INFO L290 TraceCheckUtils]: 1: Hoare triple {104922#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; {104922#true} is VALID [2022-04-28 05:59:59,797 INFO L290 TraceCheckUtils]: 2: Hoare triple {104922#true} assume true; {104922#true} is VALID [2022-04-28 05:59:59,797 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {104922#true} {104922#true} #102#return; {104922#true} is VALID [2022-04-28 05:59:59,797 INFO L272 TraceCheckUtils]: 4: Hoare triple {104922#true} call #t~ret9 := main(); {104922#true} is VALID [2022-04-28 05:59:59,797 INFO L290 TraceCheckUtils]: 5: Hoare triple {104922#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; {104922#true} is VALID [2022-04-28 05:59:59,797 INFO L272 TraceCheckUtils]: 6: Hoare triple {104922#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {104922#true} is VALID [2022-04-28 05:59:59,797 INFO L290 TraceCheckUtils]: 7: Hoare triple {104922#true} ~cond := #in~cond; {104922#true} is VALID [2022-04-28 05:59:59,797 INFO L290 TraceCheckUtils]: 8: Hoare triple {104922#true} assume !(0 == ~cond); {104922#true} is VALID [2022-04-28 05:59:59,797 INFO L290 TraceCheckUtils]: 9: Hoare triple {104922#true} assume true; {104922#true} is VALID [2022-04-28 05:59:59,797 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {104922#true} {104922#true} #90#return; {104922#true} is VALID [2022-04-28 05:59:59,797 INFO L272 TraceCheckUtils]: 11: Hoare triple {104922#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)); {104922#true} is VALID [2022-04-28 05:59:59,797 INFO L290 TraceCheckUtils]: 12: Hoare triple {104922#true} ~cond := #in~cond; {104922#true} is VALID [2022-04-28 05:59:59,797 INFO L290 TraceCheckUtils]: 13: Hoare triple {104922#true} assume !(0 == ~cond); {104922#true} is VALID [2022-04-28 05:59:59,798 INFO L290 TraceCheckUtils]: 14: Hoare triple {104922#true} assume true; {104922#true} is VALID [2022-04-28 05:59:59,798 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {104922#true} {104922#true} #92#return; {104922#true} is VALID [2022-04-28 05:59:59,798 INFO L290 TraceCheckUtils]: 16: Hoare triple {104922#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {104922#true} is VALID [2022-04-28 05:59:59,798 INFO L290 TraceCheckUtils]: 17: Hoare triple {104922#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {104922#true} is VALID [2022-04-28 05:59:59,798 INFO L290 TraceCheckUtils]: 18: Hoare triple {104922#true} assume !!(#t~post6 < 100);havoc #t~post6; {104922#true} is VALID [2022-04-28 05:59:59,798 INFO L272 TraceCheckUtils]: 19: Hoare triple {104922#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)); {104922#true} is VALID [2022-04-28 05:59:59,798 INFO L290 TraceCheckUtils]: 20: Hoare triple {104922#true} ~cond := #in~cond; {104922#true} is VALID [2022-04-28 05:59:59,798 INFO L290 TraceCheckUtils]: 21: Hoare triple {104922#true} assume !(0 == ~cond); {104922#true} is VALID [2022-04-28 05:59:59,798 INFO L290 TraceCheckUtils]: 22: Hoare triple {104922#true} assume true; {104922#true} is VALID [2022-04-28 05:59:59,798 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {104922#true} {104922#true} #94#return; {104922#true} is VALID [2022-04-28 05:59:59,798 INFO L290 TraceCheckUtils]: 24: Hoare triple {104922#true} assume !!(0 != ~r~0); {104922#true} is VALID [2022-04-28 05:59:59,798 INFO L290 TraceCheckUtils]: 25: Hoare triple {104922#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {104922#true} is VALID [2022-04-28 05:59:59,798 INFO L290 TraceCheckUtils]: 26: Hoare triple {104922#true} assume !!(#t~post7 < 100);havoc #t~post7; {104922#true} is VALID [2022-04-28 05:59:59,798 INFO L272 TraceCheckUtils]: 27: Hoare triple {104922#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)); {104922#true} is VALID [2022-04-28 05:59:59,798 INFO L290 TraceCheckUtils]: 28: Hoare triple {104922#true} ~cond := #in~cond; {104922#true} is VALID [2022-04-28 05:59:59,798 INFO L290 TraceCheckUtils]: 29: Hoare triple {104922#true} assume !(0 == ~cond); {104922#true} is VALID [2022-04-28 05:59:59,799 INFO L290 TraceCheckUtils]: 30: Hoare triple {104922#true} assume true; {104922#true} is VALID [2022-04-28 05:59:59,799 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {104922#true} {104922#true} #96#return; {104922#true} is VALID [2022-04-28 05:59:59,799 INFO L290 TraceCheckUtils]: 32: Hoare triple {104922#true} assume !(~r~0 > 0); {104922#true} is VALID [2022-04-28 05:59:59,799 INFO L290 TraceCheckUtils]: 33: Hoare triple {104922#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {104922#true} is VALID [2022-04-28 05:59:59,799 INFO L290 TraceCheckUtils]: 34: Hoare triple {104922#true} assume !!(#t~post8 < 100);havoc #t~post8; {104922#true} is VALID [2022-04-28 05:59:59,799 INFO L272 TraceCheckUtils]: 35: Hoare triple {104922#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)); {104922#true} is VALID [2022-04-28 05:59:59,799 INFO L290 TraceCheckUtils]: 36: Hoare triple {104922#true} ~cond := #in~cond; {104922#true} is VALID [2022-04-28 05:59:59,799 INFO L290 TraceCheckUtils]: 37: Hoare triple {104922#true} assume !(0 == ~cond); {104922#true} is VALID [2022-04-28 05:59:59,799 INFO L290 TraceCheckUtils]: 38: Hoare triple {104922#true} assume true; {104922#true} is VALID [2022-04-28 05:59:59,799 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {104922#true} {104922#true} #98#return; {104922#true} is VALID [2022-04-28 05:59:59,799 INFO L290 TraceCheckUtils]: 40: Hoare triple {104922#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {104922#true} is VALID [2022-04-28 05:59:59,799 INFO L290 TraceCheckUtils]: 41: Hoare triple {104922#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {104922#true} is VALID [2022-04-28 05:59:59,799 INFO L290 TraceCheckUtils]: 42: Hoare triple {104922#true} assume !!(#t~post8 < 100);havoc #t~post8; {104922#true} is VALID [2022-04-28 05:59:59,799 INFO L272 TraceCheckUtils]: 43: Hoare triple {104922#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)); {104922#true} is VALID [2022-04-28 05:59:59,799 INFO L290 TraceCheckUtils]: 44: Hoare triple {104922#true} ~cond := #in~cond; {104922#true} is VALID [2022-04-28 05:59:59,800 INFO L290 TraceCheckUtils]: 45: Hoare triple {104922#true} assume !(0 == ~cond); {104922#true} is VALID [2022-04-28 05:59:59,800 INFO L290 TraceCheckUtils]: 46: Hoare triple {104922#true} assume true; {104922#true} is VALID [2022-04-28 05:59:59,800 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {104922#true} {104922#true} #98#return; {104922#true} is VALID [2022-04-28 05:59:59,800 INFO L290 TraceCheckUtils]: 48: Hoare triple {104922#true} assume !(~r~0 < 0); {104922#true} is VALID [2022-04-28 05:59:59,800 INFO L290 TraceCheckUtils]: 49: Hoare triple {104922#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {104922#true} is VALID [2022-04-28 05:59:59,800 INFO L290 TraceCheckUtils]: 50: Hoare triple {104922#true} assume !!(#t~post6 < 100);havoc #t~post6; {104922#true} is VALID [2022-04-28 05:59:59,800 INFO L272 TraceCheckUtils]: 51: Hoare triple {104922#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)); {104922#true} is VALID [2022-04-28 05:59:59,800 INFO L290 TraceCheckUtils]: 52: Hoare triple {104922#true} ~cond := #in~cond; {104922#true} is VALID [2022-04-28 05:59:59,800 INFO L290 TraceCheckUtils]: 53: Hoare triple {104922#true} assume !(0 == ~cond); {104922#true} is VALID [2022-04-28 05:59:59,800 INFO L290 TraceCheckUtils]: 54: Hoare triple {104922#true} assume true; {104922#true} is VALID [2022-04-28 05:59:59,800 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {104922#true} {104922#true} #94#return; {104922#true} is VALID [2022-04-28 05:59:59,800 INFO L290 TraceCheckUtils]: 56: Hoare triple {104922#true} assume !!(0 != ~r~0); {104922#true} is VALID [2022-04-28 05:59:59,800 INFO L290 TraceCheckUtils]: 57: Hoare triple {104922#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {104922#true} is VALID [2022-04-28 05:59:59,800 INFO L290 TraceCheckUtils]: 58: Hoare triple {104922#true} assume !!(#t~post7 < 100);havoc #t~post7; {104922#true} is VALID [2022-04-28 05:59:59,801 INFO L272 TraceCheckUtils]: 59: Hoare triple {104922#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)); {104922#true} is VALID [2022-04-28 05:59:59,801 INFO L290 TraceCheckUtils]: 60: Hoare triple {104922#true} ~cond := #in~cond; {104922#true} is VALID [2022-04-28 05:59:59,801 INFO L290 TraceCheckUtils]: 61: Hoare triple {104922#true} assume !(0 == ~cond); {104922#true} is VALID [2022-04-28 05:59:59,801 INFO L290 TraceCheckUtils]: 62: Hoare triple {104922#true} assume true; {104922#true} is VALID [2022-04-28 05:59:59,801 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {104922#true} {104922#true} #96#return; {104922#true} is VALID [2022-04-28 05:59:59,801 INFO L290 TraceCheckUtils]: 64: Hoare triple {104922#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {104922#true} is VALID [2022-04-28 05:59:59,801 INFO L290 TraceCheckUtils]: 65: Hoare triple {104922#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {104922#true} is VALID [2022-04-28 05:59:59,801 INFO L290 TraceCheckUtils]: 66: Hoare triple {104922#true} assume !!(#t~post7 < 100);havoc #t~post7; {104922#true} is VALID [2022-04-28 05:59:59,801 INFO L272 TraceCheckUtils]: 67: Hoare triple {104922#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)); {104922#true} is VALID [2022-04-28 05:59:59,801 INFO L290 TraceCheckUtils]: 68: Hoare triple {104922#true} ~cond := #in~cond; {104922#true} is VALID [2022-04-28 05:59:59,801 INFO L290 TraceCheckUtils]: 69: Hoare triple {104922#true} assume !(0 == ~cond); {104922#true} is VALID [2022-04-28 05:59:59,801 INFO L290 TraceCheckUtils]: 70: Hoare triple {104922#true} assume true; {104922#true} is VALID [2022-04-28 05:59:59,801 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {104922#true} {104922#true} #96#return; {104922#true} is VALID [2022-04-28 05:59:59,801 INFO L290 TraceCheckUtils]: 72: Hoare triple {104922#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {104922#true} is VALID [2022-04-28 05:59:59,801 INFO L290 TraceCheckUtils]: 73: Hoare triple {104922#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {104922#true} is VALID [2022-04-28 05:59:59,802 INFO L290 TraceCheckUtils]: 74: Hoare triple {104922#true} assume !!(#t~post7 < 100);havoc #t~post7; {104922#true} is VALID [2022-04-28 05:59:59,802 INFO L272 TraceCheckUtils]: 75: Hoare triple {104922#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)); {104922#true} is VALID [2022-04-28 05:59:59,802 INFO L290 TraceCheckUtils]: 76: Hoare triple {104922#true} ~cond := #in~cond; {104922#true} is VALID [2022-04-28 05:59:59,802 INFO L290 TraceCheckUtils]: 77: Hoare triple {104922#true} assume !(0 == ~cond); {104922#true} is VALID [2022-04-28 05:59:59,802 INFO L290 TraceCheckUtils]: 78: Hoare triple {104922#true} assume true; {104922#true} is VALID [2022-04-28 05:59:59,802 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {104922#true} {104922#true} #96#return; {104922#true} is VALID [2022-04-28 05:59:59,802 INFO L290 TraceCheckUtils]: 80: Hoare triple {104922#true} assume !(~r~0 > 0); {104922#true} is VALID [2022-04-28 05:59:59,802 INFO L290 TraceCheckUtils]: 81: Hoare triple {104922#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {104922#true} is VALID [2022-04-28 05:59:59,802 INFO L290 TraceCheckUtils]: 82: Hoare triple {104922#true} assume !!(#t~post8 < 100);havoc #t~post8; {104922#true} is VALID [2022-04-28 05:59:59,802 INFO L272 TraceCheckUtils]: 83: Hoare triple {104922#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)); {104922#true} is VALID [2022-04-28 05:59:59,802 INFO L290 TraceCheckUtils]: 84: Hoare triple {104922#true} ~cond := #in~cond; {104922#true} is VALID [2022-04-28 05:59:59,802 INFO L290 TraceCheckUtils]: 85: Hoare triple {104922#true} assume !(0 == ~cond); {104922#true} is VALID [2022-04-28 05:59:59,802 INFO L290 TraceCheckUtils]: 86: Hoare triple {104922#true} assume true; {104922#true} is VALID [2022-04-28 05:59:59,802 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {104922#true} {104922#true} #98#return; {104922#true} is VALID [2022-04-28 05:59:59,802 INFO L290 TraceCheckUtils]: 88: Hoare triple {104922#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {104922#true} is VALID [2022-04-28 05:59:59,803 INFO L290 TraceCheckUtils]: 89: Hoare triple {104922#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {104922#true} is VALID [2022-04-28 05:59:59,803 INFO L290 TraceCheckUtils]: 90: Hoare triple {104922#true} assume !!(#t~post8 < 100);havoc #t~post8; {104922#true} is VALID [2022-04-28 05:59:59,803 INFO L272 TraceCheckUtils]: 91: Hoare triple {104922#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)); {104922#true} is VALID [2022-04-28 05:59:59,803 INFO L290 TraceCheckUtils]: 92: Hoare triple {104922#true} ~cond := #in~cond; {104922#true} is VALID [2022-04-28 05:59:59,803 INFO L290 TraceCheckUtils]: 93: Hoare triple {104922#true} assume !(0 == ~cond); {104922#true} is VALID [2022-04-28 05:59:59,803 INFO L290 TraceCheckUtils]: 94: Hoare triple {104922#true} assume true; {104922#true} is VALID [2022-04-28 05:59:59,803 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {104922#true} {104922#true} #98#return; {104922#true} is VALID [2022-04-28 05:59:59,803 INFO L290 TraceCheckUtils]: 96: Hoare triple {104922#true} assume !(~r~0 < 0); {104922#true} is VALID [2022-04-28 05:59:59,803 INFO L290 TraceCheckUtils]: 97: Hoare triple {104922#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {104922#true} is VALID [2022-04-28 05:59:59,803 INFO L290 TraceCheckUtils]: 98: Hoare triple {104922#true} assume !!(#t~post6 < 100);havoc #t~post6; {104922#true} is VALID [2022-04-28 05:59:59,803 INFO L272 TraceCheckUtils]: 99: Hoare triple {104922#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)); {104922#true} is VALID [2022-04-28 05:59:59,803 INFO L290 TraceCheckUtils]: 100: Hoare triple {104922#true} ~cond := #in~cond; {104922#true} is VALID [2022-04-28 05:59:59,803 INFO L290 TraceCheckUtils]: 101: Hoare triple {104922#true} assume !(0 == ~cond); {104922#true} is VALID [2022-04-28 05:59:59,803 INFO L290 TraceCheckUtils]: 102: Hoare triple {104922#true} assume true; {104922#true} is VALID [2022-04-28 05:59:59,803 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {104922#true} {104922#true} #94#return; {104922#true} is VALID [2022-04-28 05:59:59,804 INFO L290 TraceCheckUtils]: 104: Hoare triple {104922#true} assume !!(0 != ~r~0); {104922#true} is VALID [2022-04-28 05:59:59,804 INFO L290 TraceCheckUtils]: 105: Hoare triple {104922#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {104922#true} is VALID [2022-04-28 05:59:59,804 INFO L290 TraceCheckUtils]: 106: Hoare triple {104922#true} assume !!(#t~post7 < 100);havoc #t~post7; {104922#true} is VALID [2022-04-28 05:59:59,804 INFO L272 TraceCheckUtils]: 107: Hoare triple {104922#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)); {104922#true} is VALID [2022-04-28 05:59:59,804 INFO L290 TraceCheckUtils]: 108: Hoare triple {104922#true} ~cond := #in~cond; {104922#true} is VALID [2022-04-28 05:59:59,804 INFO L290 TraceCheckUtils]: 109: Hoare triple {104922#true} assume !(0 == ~cond); {104922#true} is VALID [2022-04-28 05:59:59,804 INFO L290 TraceCheckUtils]: 110: Hoare triple {104922#true} assume true; {104922#true} is VALID [2022-04-28 05:59:59,804 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {104922#true} {104922#true} #96#return; {104922#true} is VALID [2022-04-28 05:59:59,804 INFO L290 TraceCheckUtils]: 112: Hoare triple {104922#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {104922#true} is VALID [2022-04-28 05:59:59,804 INFO L290 TraceCheckUtils]: 113: Hoare triple {104922#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {104922#true} is VALID [2022-04-28 05:59:59,804 INFO L290 TraceCheckUtils]: 114: Hoare triple {104922#true} assume !!(#t~post7 < 100);havoc #t~post7; {104922#true} is VALID [2022-04-28 05:59:59,804 INFO L272 TraceCheckUtils]: 115: Hoare triple {104922#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)); {104922#true} is VALID [2022-04-28 05:59:59,804 INFO L290 TraceCheckUtils]: 116: Hoare triple {104922#true} ~cond := #in~cond; {104922#true} is VALID [2022-04-28 05:59:59,804 INFO L290 TraceCheckUtils]: 117: Hoare triple {104922#true} assume !(0 == ~cond); {104922#true} is VALID [2022-04-28 05:59:59,804 INFO L290 TraceCheckUtils]: 118: Hoare triple {104922#true} assume true; {104922#true} is VALID [2022-04-28 05:59:59,805 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {104922#true} {104922#true} #96#return; {104922#true} is VALID [2022-04-28 05:59:59,805 INFO L290 TraceCheckUtils]: 120: Hoare triple {104922#true} assume !(~r~0 > 0); {105287#(not (< 0 main_~r~0))} is VALID [2022-04-28 05:59:59,805 INFO L290 TraceCheckUtils]: 121: Hoare triple {105287#(not (< 0 main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {105287#(not (< 0 main_~r~0))} is VALID [2022-04-28 05:59:59,805 INFO L290 TraceCheckUtils]: 122: Hoare triple {105287#(not (< 0 main_~r~0))} assume !!(#t~post8 < 100);havoc #t~post8; {105287#(not (< 0 main_~r~0))} is VALID [2022-04-28 05:59:59,805 INFO L272 TraceCheckUtils]: 123: Hoare triple {105287#(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)); {104922#true} is VALID [2022-04-28 05:59:59,806 INFO L290 TraceCheckUtils]: 124: Hoare triple {104922#true} ~cond := #in~cond; {105300#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:59:59,806 INFO L290 TraceCheckUtils]: 125: Hoare triple {105300#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {105304#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:59:59,806 INFO L290 TraceCheckUtils]: 126: Hoare triple {105304#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {105304#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:59:59,807 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {105304#(not (= |__VERIFIER_assert_#in~cond| 0))} {105287#(not (< 0 main_~r~0))} #98#return; {105311#(and (= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4) (* main_~r~0 4))) (not (< 0 main_~r~0)))} is VALID [2022-04-28 05:59:59,809 INFO L290 TraceCheckUtils]: 128: Hoare triple {105311#(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); {105315#(and (= (mod (+ (* main_~v~0 2) (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* main_~u~0 2)) 4) 0) (not (< (div (+ (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* (- 2) main_~v~0) (* main_~u~0 2)) (- 4)) main_~A~0)) (not (< main_~A~0 (div (+ (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* (- 2) main_~v~0) (* main_~u~0 2)) (- 4)))))} is VALID [2022-04-28 05:59:59,810 INFO L290 TraceCheckUtils]: 129: Hoare triple {105315#(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; {105315#(and (= (mod (+ (* main_~v~0 2) (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* main_~u~0 2)) 4) 0) (not (< (div (+ (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* (- 2) main_~v~0) (* main_~u~0 2)) (- 4)) main_~A~0)) (not (< main_~A~0 (div (+ (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* (- 2) main_~v~0) (* main_~u~0 2)) (- 4)))))} is VALID [2022-04-28 05:59:59,810 INFO L290 TraceCheckUtils]: 130: Hoare triple {105315#(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 < 100);havoc #t~post6; {105315#(and (= (mod (+ (* main_~v~0 2) (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* main_~u~0 2)) 4) 0) (not (< (div (+ (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* (- 2) main_~v~0) (* main_~u~0 2)) (- 4)) main_~A~0)) (not (< main_~A~0 (div (+ (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* (- 2) main_~v~0) (* main_~u~0 2)) (- 4)))))} is VALID [2022-04-28 05:59:59,811 INFO L272 TraceCheckUtils]: 131: Hoare triple {105315#(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)); {105325#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:59:59,812 INFO L290 TraceCheckUtils]: 132: Hoare triple {105325#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {105329#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:59:59,812 INFO L290 TraceCheckUtils]: 133: Hoare triple {105329#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {104923#false} is VALID [2022-04-28 05:59:59,812 INFO L290 TraceCheckUtils]: 134: Hoare triple {104923#false} assume !false; {104923#false} is VALID [2022-04-28 05:59:59,812 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 88 proven. 1 refuted. 0 times theorem prover too weak. 425 trivial. 0 not checked. [2022-04-28 05:59:59,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:00:02,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:00:02,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124573127] [2022-04-28 06:00:02,286 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:00:02,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555993230] [2022-04-28 06:00:02,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555993230] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 06:00:02,286 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 06:00:02,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-28 06:00:02,286 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:00:02,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [884422846] [2022-04-28 06:00:02,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [884422846] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:00:02,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:00:02,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 06:00:02,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124136718] [2022-04-28 06:00:02,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:00:02,287 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 135 [2022-04-28 06:00:02,287 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:00:02,287 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 06:00:02,329 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:00:02,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 06:00:02,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:00:02,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 06:00:02,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=84, Unknown=1, NotChecked=0, Total=110 [2022-04-28 06:00:02,330 INFO L87 Difference]: Start difference. First operand 706 states and 952 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 06:00:05,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:00:05,483 INFO L93 Difference]: Finished difference Result 758 states and 1028 transitions. [2022-04-28 06:00:05,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 06:00:05,483 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 135 [2022-04-28 06:00:05,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:00:05,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 06:00:05,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 79 transitions. [2022-04-28 06:00:05,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 06:00:05,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 79 transitions. [2022-04-28 06:00:05,485 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 79 transitions. [2022-04-28 06:00:05,572 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:00:05,594 INFO L225 Difference]: With dead ends: 758 [2022-04-28 06:00:05,594 INFO L226 Difference]: Without dead ends: 746 [2022-04-28 06:00:05,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 132 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=43, Invalid=138, Unknown=1, NotChecked=0, Total=182 [2022-04-28 06:00:05,595 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 28 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 06:00:05,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 251 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 06:00:05,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2022-04-28 06:00:07,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 683. [2022-04-28 06:00:07,716 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:00:07,717 INFO L82 GeneralOperation]: Start isEquivalent. First operand 746 states. Second operand has 683 states, 515 states have (on average 1.192233009708738) internal successors, (614), 522 states have internal predecessors, (614), 150 states have call successors, (150), 19 states have call predecessors, (150), 17 states have return successors, (148), 141 states have call predecessors, (148), 148 states have call successors, (148) [2022-04-28 06:00:07,718 INFO L74 IsIncluded]: Start isIncluded. First operand 746 states. Second operand has 683 states, 515 states have (on average 1.192233009708738) internal successors, (614), 522 states have internal predecessors, (614), 150 states have call successors, (150), 19 states have call predecessors, (150), 17 states have return successors, (148), 141 states have call predecessors, (148), 148 states have call successors, (148) [2022-04-28 06:00:07,718 INFO L87 Difference]: Start difference. First operand 746 states. Second operand has 683 states, 515 states have (on average 1.192233009708738) internal successors, (614), 522 states have internal predecessors, (614), 150 states have call successors, (150), 19 states have call predecessors, (150), 17 states have return successors, (148), 141 states have call predecessors, (148), 148 states have call successors, (148) [2022-04-28 06:00:07,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:00:07,737 INFO L93 Difference]: Finished difference Result 746 states and 1010 transitions. [2022-04-28 06:00:07,737 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1010 transitions. [2022-04-28 06:00:07,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:00:07,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:00:07,740 INFO L74 IsIncluded]: Start isIncluded. First operand has 683 states, 515 states have (on average 1.192233009708738) internal successors, (614), 522 states have internal predecessors, (614), 150 states have call successors, (150), 19 states have call predecessors, (150), 17 states have return successors, (148), 141 states have call predecessors, (148), 148 states have call successors, (148) Second operand 746 states. [2022-04-28 06:00:07,740 INFO L87 Difference]: Start difference. First operand has 683 states, 515 states have (on average 1.192233009708738) internal successors, (614), 522 states have internal predecessors, (614), 150 states have call successors, (150), 19 states have call predecessors, (150), 17 states have return successors, (148), 141 states have call predecessors, (148), 148 states have call successors, (148) Second operand 746 states. [2022-04-28 06:00:07,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:00:07,760 INFO L93 Difference]: Finished difference Result 746 states and 1010 transitions. [2022-04-28 06:00:07,760 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1010 transitions. [2022-04-28 06:00:07,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:00:07,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:00:07,761 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:00:07,761 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:00:07,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 515 states have (on average 1.192233009708738) internal successors, (614), 522 states have internal predecessors, (614), 150 states have call successors, (150), 19 states have call predecessors, (150), 17 states have return successors, (148), 141 states have call predecessors, (148), 148 states have call successors, (148) [2022-04-28 06:00:07,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 912 transitions. [2022-04-28 06:00:07,783 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 912 transitions. Word has length 135 [2022-04-28 06:00:07,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:00:07,783 INFO L495 AbstractCegarLoop]: Abstraction has 683 states and 912 transitions. [2022-04-28 06:00:07,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 06:00:07,783 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 683 states and 912 transitions. [2022-04-28 06:00:13,325 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 912 edges. 912 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:00:13,326 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 912 transitions. [2022-04-28 06:00:13,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-04-28 06:00:13,327 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:00:13,327 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 8, 8, 8, 8, 6, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:00:13,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-04-28 06:00:13,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-04-28 06:00:13,528 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:00:13,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:00:13,528 INFO L85 PathProgramCache]: Analyzing trace with hash 200539575, now seen corresponding path program 13 times [2022-04-28 06:00:13,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:00:13,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [971076097] [2022-04-28 06:00:13,528 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:00:13,528 INFO L85 PathProgramCache]: Analyzing trace with hash 200539575, now seen corresponding path program 14 times [2022-04-28 06:00:13,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:00:13,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715837145] [2022-04-28 06:00:13,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:00:13,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:00:13,542 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:00:13,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1682204246] [2022-04-28 06:00:13,542 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 06:00:13,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:00:13,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:00:13,543 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:00:13,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-04-28 06:00:13,614 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 06:00:13,614 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:00:13,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 06:00:13,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:00:13,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:00:14,341 INFO L272 TraceCheckUtils]: 0: Hoare triple {109742#true} call ULTIMATE.init(); {109742#true} is VALID [2022-04-28 06:00:14,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {109742#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; {109750#(<= ~counter~0 0)} is VALID [2022-04-28 06:00:14,342 INFO L290 TraceCheckUtils]: 2: Hoare triple {109750#(<= ~counter~0 0)} assume true; {109750#(<= ~counter~0 0)} is VALID [2022-04-28 06:00:14,342 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {109750#(<= ~counter~0 0)} {109742#true} #102#return; {109750#(<= ~counter~0 0)} is VALID [2022-04-28 06:00:14,342 INFO L272 TraceCheckUtils]: 4: Hoare triple {109750#(<= ~counter~0 0)} call #t~ret9 := main(); {109750#(<= ~counter~0 0)} is VALID [2022-04-28 06:00:14,342 INFO L290 TraceCheckUtils]: 5: Hoare triple {109750#(<= ~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; {109750#(<= ~counter~0 0)} is VALID [2022-04-28 06:00:14,343 INFO L272 TraceCheckUtils]: 6: Hoare triple {109750#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {109750#(<= ~counter~0 0)} is VALID [2022-04-28 06:00:14,343 INFO L290 TraceCheckUtils]: 7: Hoare triple {109750#(<= ~counter~0 0)} ~cond := #in~cond; {109750#(<= ~counter~0 0)} is VALID [2022-04-28 06:00:14,343 INFO L290 TraceCheckUtils]: 8: Hoare triple {109750#(<= ~counter~0 0)} assume !(0 == ~cond); {109750#(<= ~counter~0 0)} is VALID [2022-04-28 06:00:14,344 INFO L290 TraceCheckUtils]: 9: Hoare triple {109750#(<= ~counter~0 0)} assume true; {109750#(<= ~counter~0 0)} is VALID [2022-04-28 06:00:14,344 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {109750#(<= ~counter~0 0)} {109750#(<= ~counter~0 0)} #90#return; {109750#(<= ~counter~0 0)} is VALID [2022-04-28 06:00:14,345 INFO L272 TraceCheckUtils]: 11: Hoare triple {109750#(<= ~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)); {109750#(<= ~counter~0 0)} is VALID [2022-04-28 06:00:14,345 INFO L290 TraceCheckUtils]: 12: Hoare triple {109750#(<= ~counter~0 0)} ~cond := #in~cond; {109750#(<= ~counter~0 0)} is VALID [2022-04-28 06:00:14,345 INFO L290 TraceCheckUtils]: 13: Hoare triple {109750#(<= ~counter~0 0)} assume !(0 == ~cond); {109750#(<= ~counter~0 0)} is VALID [2022-04-28 06:00:14,345 INFO L290 TraceCheckUtils]: 14: Hoare triple {109750#(<= ~counter~0 0)} assume true; {109750#(<= ~counter~0 0)} is VALID [2022-04-28 06:00:14,346 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {109750#(<= ~counter~0 0)} {109750#(<= ~counter~0 0)} #92#return; {109750#(<= ~counter~0 0)} is VALID [2022-04-28 06:00:14,346 INFO L290 TraceCheckUtils]: 16: Hoare triple {109750#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {109750#(<= ~counter~0 0)} is VALID [2022-04-28 06:00:14,348 INFO L290 TraceCheckUtils]: 17: Hoare triple {109750#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {109799#(<= ~counter~0 1)} is VALID [2022-04-28 06:00:14,349 INFO L290 TraceCheckUtils]: 18: Hoare triple {109799#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {109799#(<= ~counter~0 1)} is VALID [2022-04-28 06:00:14,349 INFO L272 TraceCheckUtils]: 19: Hoare triple {109799#(<= ~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)); {109799#(<= ~counter~0 1)} is VALID [2022-04-28 06:00:14,349 INFO L290 TraceCheckUtils]: 20: Hoare triple {109799#(<= ~counter~0 1)} ~cond := #in~cond; {109799#(<= ~counter~0 1)} is VALID [2022-04-28 06:00:14,350 INFO L290 TraceCheckUtils]: 21: Hoare triple {109799#(<= ~counter~0 1)} assume !(0 == ~cond); {109799#(<= ~counter~0 1)} is VALID [2022-04-28 06:00:14,350 INFO L290 TraceCheckUtils]: 22: Hoare triple {109799#(<= ~counter~0 1)} assume true; {109799#(<= ~counter~0 1)} is VALID [2022-04-28 06:00:14,350 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {109799#(<= ~counter~0 1)} {109799#(<= ~counter~0 1)} #94#return; {109799#(<= ~counter~0 1)} is VALID [2022-04-28 06:00:14,351 INFO L290 TraceCheckUtils]: 24: Hoare triple {109799#(<= ~counter~0 1)} assume !!(0 != ~r~0); {109799#(<= ~counter~0 1)} is VALID [2022-04-28 06:00:14,352 INFO L290 TraceCheckUtils]: 25: Hoare triple {109799#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {109824#(<= ~counter~0 2)} is VALID [2022-04-28 06:00:14,352 INFO L290 TraceCheckUtils]: 26: Hoare triple {109824#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {109824#(<= ~counter~0 2)} is VALID [2022-04-28 06:00:14,352 INFO L272 TraceCheckUtils]: 27: Hoare triple {109824#(<= ~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)); {109824#(<= ~counter~0 2)} is VALID [2022-04-28 06:00:14,353 INFO L290 TraceCheckUtils]: 28: Hoare triple {109824#(<= ~counter~0 2)} ~cond := #in~cond; {109824#(<= ~counter~0 2)} is VALID [2022-04-28 06:00:14,353 INFO L290 TraceCheckUtils]: 29: Hoare triple {109824#(<= ~counter~0 2)} assume !(0 == ~cond); {109824#(<= ~counter~0 2)} is VALID [2022-04-28 06:00:14,353 INFO L290 TraceCheckUtils]: 30: Hoare triple {109824#(<= ~counter~0 2)} assume true; {109824#(<= ~counter~0 2)} is VALID [2022-04-28 06:00:14,354 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {109824#(<= ~counter~0 2)} {109824#(<= ~counter~0 2)} #96#return; {109824#(<= ~counter~0 2)} is VALID [2022-04-28 06:00:14,354 INFO L290 TraceCheckUtils]: 32: Hoare triple {109824#(<= ~counter~0 2)} assume !(~r~0 > 0); {109824#(<= ~counter~0 2)} is VALID [2022-04-28 06:00:14,355 INFO L290 TraceCheckUtils]: 33: Hoare triple {109824#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {109849#(<= ~counter~0 3)} is VALID [2022-04-28 06:00:14,355 INFO L290 TraceCheckUtils]: 34: Hoare triple {109849#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {109849#(<= ~counter~0 3)} is VALID [2022-04-28 06:00:14,356 INFO L272 TraceCheckUtils]: 35: Hoare triple {109849#(<= ~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)); {109849#(<= ~counter~0 3)} is VALID [2022-04-28 06:00:14,356 INFO L290 TraceCheckUtils]: 36: Hoare triple {109849#(<= ~counter~0 3)} ~cond := #in~cond; {109849#(<= ~counter~0 3)} is VALID [2022-04-28 06:00:14,356 INFO L290 TraceCheckUtils]: 37: Hoare triple {109849#(<= ~counter~0 3)} assume !(0 == ~cond); {109849#(<= ~counter~0 3)} is VALID [2022-04-28 06:00:14,356 INFO L290 TraceCheckUtils]: 38: Hoare triple {109849#(<= ~counter~0 3)} assume true; {109849#(<= ~counter~0 3)} is VALID [2022-04-28 06:00:14,357 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {109849#(<= ~counter~0 3)} {109849#(<= ~counter~0 3)} #98#return; {109849#(<= ~counter~0 3)} is VALID [2022-04-28 06:00:14,357 INFO L290 TraceCheckUtils]: 40: Hoare triple {109849#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {109849#(<= ~counter~0 3)} is VALID [2022-04-28 06:00:14,359 INFO L290 TraceCheckUtils]: 41: Hoare triple {109849#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {109874#(<= ~counter~0 4)} is VALID [2022-04-28 06:00:14,359 INFO L290 TraceCheckUtils]: 42: Hoare triple {109874#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {109874#(<= ~counter~0 4)} is VALID [2022-04-28 06:00:14,359 INFO L272 TraceCheckUtils]: 43: Hoare triple {109874#(<= ~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)); {109874#(<= ~counter~0 4)} is VALID [2022-04-28 06:00:14,360 INFO L290 TraceCheckUtils]: 44: Hoare triple {109874#(<= ~counter~0 4)} ~cond := #in~cond; {109874#(<= ~counter~0 4)} is VALID [2022-04-28 06:00:14,360 INFO L290 TraceCheckUtils]: 45: Hoare triple {109874#(<= ~counter~0 4)} assume !(0 == ~cond); {109874#(<= ~counter~0 4)} is VALID [2022-04-28 06:00:14,360 INFO L290 TraceCheckUtils]: 46: Hoare triple {109874#(<= ~counter~0 4)} assume true; {109874#(<= ~counter~0 4)} is VALID [2022-04-28 06:00:14,361 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {109874#(<= ~counter~0 4)} {109874#(<= ~counter~0 4)} #98#return; {109874#(<= ~counter~0 4)} is VALID [2022-04-28 06:00:14,361 INFO L290 TraceCheckUtils]: 48: Hoare triple {109874#(<= ~counter~0 4)} assume !(~r~0 < 0); {109874#(<= ~counter~0 4)} is VALID [2022-04-28 06:00:14,362 INFO L290 TraceCheckUtils]: 49: Hoare triple {109874#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {109899#(<= ~counter~0 5)} is VALID [2022-04-28 06:00:14,362 INFO L290 TraceCheckUtils]: 50: Hoare triple {109899#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {109899#(<= ~counter~0 5)} is VALID [2022-04-28 06:00:14,363 INFO L272 TraceCheckUtils]: 51: Hoare triple {109899#(<= ~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)); {109899#(<= ~counter~0 5)} is VALID [2022-04-28 06:00:14,363 INFO L290 TraceCheckUtils]: 52: Hoare triple {109899#(<= ~counter~0 5)} ~cond := #in~cond; {109899#(<= ~counter~0 5)} is VALID [2022-04-28 06:00:14,363 INFO L290 TraceCheckUtils]: 53: Hoare triple {109899#(<= ~counter~0 5)} assume !(0 == ~cond); {109899#(<= ~counter~0 5)} is VALID [2022-04-28 06:00:14,364 INFO L290 TraceCheckUtils]: 54: Hoare triple {109899#(<= ~counter~0 5)} assume true; {109899#(<= ~counter~0 5)} is VALID [2022-04-28 06:00:14,364 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {109899#(<= ~counter~0 5)} {109899#(<= ~counter~0 5)} #94#return; {109899#(<= ~counter~0 5)} is VALID [2022-04-28 06:00:14,364 INFO L290 TraceCheckUtils]: 56: Hoare triple {109899#(<= ~counter~0 5)} assume !!(0 != ~r~0); {109899#(<= ~counter~0 5)} is VALID [2022-04-28 06:00:14,365 INFO L290 TraceCheckUtils]: 57: Hoare triple {109899#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {109924#(<= ~counter~0 6)} is VALID [2022-04-28 06:00:14,366 INFO L290 TraceCheckUtils]: 58: Hoare triple {109924#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {109924#(<= ~counter~0 6)} is VALID [2022-04-28 06:00:14,366 INFO L272 TraceCheckUtils]: 59: Hoare triple {109924#(<= ~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)); {109924#(<= ~counter~0 6)} is VALID [2022-04-28 06:00:14,366 INFO L290 TraceCheckUtils]: 60: Hoare triple {109924#(<= ~counter~0 6)} ~cond := #in~cond; {109924#(<= ~counter~0 6)} is VALID [2022-04-28 06:00:14,367 INFO L290 TraceCheckUtils]: 61: Hoare triple {109924#(<= ~counter~0 6)} assume !(0 == ~cond); {109924#(<= ~counter~0 6)} is VALID [2022-04-28 06:00:14,367 INFO L290 TraceCheckUtils]: 62: Hoare triple {109924#(<= ~counter~0 6)} assume true; {109924#(<= ~counter~0 6)} is VALID [2022-04-28 06:00:14,367 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {109924#(<= ~counter~0 6)} {109924#(<= ~counter~0 6)} #96#return; {109924#(<= ~counter~0 6)} is VALID [2022-04-28 06:00:14,368 INFO L290 TraceCheckUtils]: 64: Hoare triple {109924#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {109924#(<= ~counter~0 6)} is VALID [2022-04-28 06:00:14,369 INFO L290 TraceCheckUtils]: 65: Hoare triple {109924#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {109949#(<= ~counter~0 7)} is VALID [2022-04-28 06:00:14,369 INFO L290 TraceCheckUtils]: 66: Hoare triple {109949#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {109949#(<= ~counter~0 7)} is VALID [2022-04-28 06:00:14,370 INFO L272 TraceCheckUtils]: 67: Hoare triple {109949#(<= ~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)); {109949#(<= ~counter~0 7)} is VALID [2022-04-28 06:00:14,370 INFO L290 TraceCheckUtils]: 68: Hoare triple {109949#(<= ~counter~0 7)} ~cond := #in~cond; {109949#(<= ~counter~0 7)} is VALID [2022-04-28 06:00:14,370 INFO L290 TraceCheckUtils]: 69: Hoare triple {109949#(<= ~counter~0 7)} assume !(0 == ~cond); {109949#(<= ~counter~0 7)} is VALID [2022-04-28 06:00:14,370 INFO L290 TraceCheckUtils]: 70: Hoare triple {109949#(<= ~counter~0 7)} assume true; {109949#(<= ~counter~0 7)} is VALID [2022-04-28 06:00:14,371 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {109949#(<= ~counter~0 7)} {109949#(<= ~counter~0 7)} #96#return; {109949#(<= ~counter~0 7)} is VALID [2022-04-28 06:00:14,371 INFO L290 TraceCheckUtils]: 72: Hoare triple {109949#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {109949#(<= ~counter~0 7)} is VALID [2022-04-28 06:00:14,372 INFO L290 TraceCheckUtils]: 73: Hoare triple {109949#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {109974#(<= ~counter~0 8)} is VALID [2022-04-28 06:00:14,373 INFO L290 TraceCheckUtils]: 74: Hoare triple {109974#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {109974#(<= ~counter~0 8)} is VALID [2022-04-28 06:00:14,373 INFO L272 TraceCheckUtils]: 75: Hoare triple {109974#(<= ~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)); {109974#(<= ~counter~0 8)} is VALID [2022-04-28 06:00:14,373 INFO L290 TraceCheckUtils]: 76: Hoare triple {109974#(<= ~counter~0 8)} ~cond := #in~cond; {109974#(<= ~counter~0 8)} is VALID [2022-04-28 06:00:14,374 INFO L290 TraceCheckUtils]: 77: Hoare triple {109974#(<= ~counter~0 8)} assume !(0 == ~cond); {109974#(<= ~counter~0 8)} is VALID [2022-04-28 06:00:14,374 INFO L290 TraceCheckUtils]: 78: Hoare triple {109974#(<= ~counter~0 8)} assume true; {109974#(<= ~counter~0 8)} is VALID [2022-04-28 06:00:14,374 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {109974#(<= ~counter~0 8)} {109974#(<= ~counter~0 8)} #96#return; {109974#(<= ~counter~0 8)} is VALID [2022-04-28 06:00:14,375 INFO L290 TraceCheckUtils]: 80: Hoare triple {109974#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {109974#(<= ~counter~0 8)} is VALID [2022-04-28 06:00:14,376 INFO L290 TraceCheckUtils]: 81: Hoare triple {109974#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {109999#(<= ~counter~0 9)} is VALID [2022-04-28 06:00:14,377 INFO L290 TraceCheckUtils]: 82: Hoare triple {109999#(<= ~counter~0 9)} assume !!(#t~post7 < 100);havoc #t~post7; {109999#(<= ~counter~0 9)} is VALID [2022-04-28 06:00:14,377 INFO L272 TraceCheckUtils]: 83: Hoare triple {109999#(<= ~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)); {109999#(<= ~counter~0 9)} is VALID [2022-04-28 06:00:14,377 INFO L290 TraceCheckUtils]: 84: Hoare triple {109999#(<= ~counter~0 9)} ~cond := #in~cond; {109999#(<= ~counter~0 9)} is VALID [2022-04-28 06:00:14,378 INFO L290 TraceCheckUtils]: 85: Hoare triple {109999#(<= ~counter~0 9)} assume !(0 == ~cond); {109999#(<= ~counter~0 9)} is VALID [2022-04-28 06:00:14,378 INFO L290 TraceCheckUtils]: 86: Hoare triple {109999#(<= ~counter~0 9)} assume true; {109999#(<= ~counter~0 9)} is VALID [2022-04-28 06:00:14,378 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {109999#(<= ~counter~0 9)} {109999#(<= ~counter~0 9)} #96#return; {109999#(<= ~counter~0 9)} is VALID [2022-04-28 06:00:14,379 INFO L290 TraceCheckUtils]: 88: Hoare triple {109999#(<= ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {109999#(<= ~counter~0 9)} is VALID [2022-04-28 06:00:14,380 INFO L290 TraceCheckUtils]: 89: Hoare triple {109999#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110024#(<= ~counter~0 10)} is VALID [2022-04-28 06:00:14,380 INFO L290 TraceCheckUtils]: 90: Hoare triple {110024#(<= ~counter~0 10)} assume !!(#t~post7 < 100);havoc #t~post7; {110024#(<= ~counter~0 10)} is VALID [2022-04-28 06:00:14,381 INFO L272 TraceCheckUtils]: 91: Hoare triple {110024#(<= ~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)); {110024#(<= ~counter~0 10)} is VALID [2022-04-28 06:00:14,381 INFO L290 TraceCheckUtils]: 92: Hoare triple {110024#(<= ~counter~0 10)} ~cond := #in~cond; {110024#(<= ~counter~0 10)} is VALID [2022-04-28 06:00:14,381 INFO L290 TraceCheckUtils]: 93: Hoare triple {110024#(<= ~counter~0 10)} assume !(0 == ~cond); {110024#(<= ~counter~0 10)} is VALID [2022-04-28 06:00:14,382 INFO L290 TraceCheckUtils]: 94: Hoare triple {110024#(<= ~counter~0 10)} assume true; {110024#(<= ~counter~0 10)} is VALID [2022-04-28 06:00:14,382 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {110024#(<= ~counter~0 10)} {110024#(<= ~counter~0 10)} #96#return; {110024#(<= ~counter~0 10)} is VALID [2022-04-28 06:00:14,382 INFO L290 TraceCheckUtils]: 96: Hoare triple {110024#(<= ~counter~0 10)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {110024#(<= ~counter~0 10)} is VALID [2022-04-28 06:00:14,385 INFO L290 TraceCheckUtils]: 97: Hoare triple {110024#(<= ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110049#(<= ~counter~0 11)} is VALID [2022-04-28 06:00:14,385 INFO L290 TraceCheckUtils]: 98: Hoare triple {110049#(<= ~counter~0 11)} assume !!(#t~post7 < 100);havoc #t~post7; {110049#(<= ~counter~0 11)} is VALID [2022-04-28 06:00:14,386 INFO L272 TraceCheckUtils]: 99: Hoare triple {110049#(<= ~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)); {110049#(<= ~counter~0 11)} is VALID [2022-04-28 06:00:14,386 INFO L290 TraceCheckUtils]: 100: Hoare triple {110049#(<= ~counter~0 11)} ~cond := #in~cond; {110049#(<= ~counter~0 11)} is VALID [2022-04-28 06:00:14,386 INFO L290 TraceCheckUtils]: 101: Hoare triple {110049#(<= ~counter~0 11)} assume !(0 == ~cond); {110049#(<= ~counter~0 11)} is VALID [2022-04-28 06:00:14,386 INFO L290 TraceCheckUtils]: 102: Hoare triple {110049#(<= ~counter~0 11)} assume true; {110049#(<= ~counter~0 11)} is VALID [2022-04-28 06:00:14,387 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {110049#(<= ~counter~0 11)} {110049#(<= ~counter~0 11)} #96#return; {110049#(<= ~counter~0 11)} is VALID [2022-04-28 06:00:14,387 INFO L290 TraceCheckUtils]: 104: Hoare triple {110049#(<= ~counter~0 11)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {110049#(<= ~counter~0 11)} is VALID [2022-04-28 06:00:14,389 INFO L290 TraceCheckUtils]: 105: Hoare triple {110049#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110074#(<= ~counter~0 12)} is VALID [2022-04-28 06:00:14,389 INFO L290 TraceCheckUtils]: 106: Hoare triple {110074#(<= ~counter~0 12)} assume !!(#t~post7 < 100);havoc #t~post7; {110074#(<= ~counter~0 12)} is VALID [2022-04-28 06:00:14,390 INFO L272 TraceCheckUtils]: 107: Hoare triple {110074#(<= ~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)); {110074#(<= ~counter~0 12)} is VALID [2022-04-28 06:00:14,390 INFO L290 TraceCheckUtils]: 108: Hoare triple {110074#(<= ~counter~0 12)} ~cond := #in~cond; {110074#(<= ~counter~0 12)} is VALID [2022-04-28 06:00:14,390 INFO L290 TraceCheckUtils]: 109: Hoare triple {110074#(<= ~counter~0 12)} assume !(0 == ~cond); {110074#(<= ~counter~0 12)} is VALID [2022-04-28 06:00:14,391 INFO L290 TraceCheckUtils]: 110: Hoare triple {110074#(<= ~counter~0 12)} assume true; {110074#(<= ~counter~0 12)} is VALID [2022-04-28 06:00:14,391 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {110074#(<= ~counter~0 12)} {110074#(<= ~counter~0 12)} #96#return; {110074#(<= ~counter~0 12)} is VALID [2022-04-28 06:00:14,391 INFO L290 TraceCheckUtils]: 112: Hoare triple {110074#(<= ~counter~0 12)} assume !(~r~0 > 0); {110074#(<= ~counter~0 12)} is VALID [2022-04-28 06:00:14,393 INFO L290 TraceCheckUtils]: 113: Hoare triple {110074#(<= ~counter~0 12)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {110099#(<= ~counter~0 13)} is VALID [2022-04-28 06:00:14,393 INFO L290 TraceCheckUtils]: 114: Hoare triple {110099#(<= ~counter~0 13)} assume !!(#t~post8 < 100);havoc #t~post8; {110099#(<= ~counter~0 13)} is VALID [2022-04-28 06:00:14,394 INFO L272 TraceCheckUtils]: 115: Hoare triple {110099#(<= ~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)); {110099#(<= ~counter~0 13)} is VALID [2022-04-28 06:00:14,394 INFO L290 TraceCheckUtils]: 116: Hoare triple {110099#(<= ~counter~0 13)} ~cond := #in~cond; {110099#(<= ~counter~0 13)} is VALID [2022-04-28 06:00:14,394 INFO L290 TraceCheckUtils]: 117: Hoare triple {110099#(<= ~counter~0 13)} assume !(0 == ~cond); {110099#(<= ~counter~0 13)} is VALID [2022-04-28 06:00:14,394 INFO L290 TraceCheckUtils]: 118: Hoare triple {110099#(<= ~counter~0 13)} assume true; {110099#(<= ~counter~0 13)} is VALID [2022-04-28 06:00:14,395 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {110099#(<= ~counter~0 13)} {110099#(<= ~counter~0 13)} #98#return; {110099#(<= ~counter~0 13)} is VALID [2022-04-28 06:00:14,395 INFO L290 TraceCheckUtils]: 120: Hoare triple {110099#(<= ~counter~0 13)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {110099#(<= ~counter~0 13)} is VALID [2022-04-28 06:00:14,396 INFO L290 TraceCheckUtils]: 121: Hoare triple {110099#(<= ~counter~0 13)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {110124#(<= ~counter~0 14)} is VALID [2022-04-28 06:00:14,397 INFO L290 TraceCheckUtils]: 122: Hoare triple {110124#(<= ~counter~0 14)} assume !!(#t~post8 < 100);havoc #t~post8; {110124#(<= ~counter~0 14)} is VALID [2022-04-28 06:00:14,397 INFO L272 TraceCheckUtils]: 123: Hoare triple {110124#(<= ~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)); {110124#(<= ~counter~0 14)} is VALID [2022-04-28 06:00:14,398 INFO L290 TraceCheckUtils]: 124: Hoare triple {110124#(<= ~counter~0 14)} ~cond := #in~cond; {110124#(<= ~counter~0 14)} is VALID [2022-04-28 06:00:14,398 INFO L290 TraceCheckUtils]: 125: Hoare triple {110124#(<= ~counter~0 14)} assume !(0 == ~cond); {110124#(<= ~counter~0 14)} is VALID [2022-04-28 06:00:14,398 INFO L290 TraceCheckUtils]: 126: Hoare triple {110124#(<= ~counter~0 14)} assume true; {110124#(<= ~counter~0 14)} is VALID [2022-04-28 06:00:14,399 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {110124#(<= ~counter~0 14)} {110124#(<= ~counter~0 14)} #98#return; {110124#(<= ~counter~0 14)} is VALID [2022-04-28 06:00:14,399 INFO L290 TraceCheckUtils]: 128: Hoare triple {110124#(<= ~counter~0 14)} assume !(~r~0 < 0); {110124#(<= ~counter~0 14)} is VALID [2022-04-28 06:00:14,399 INFO L290 TraceCheckUtils]: 129: Hoare triple {110124#(<= ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {110149#(<= |main_#t~post6| 14)} is VALID [2022-04-28 06:00:14,399 INFO L290 TraceCheckUtils]: 130: Hoare triple {110149#(<= |main_#t~post6| 14)} assume !(#t~post6 < 100);havoc #t~post6; {109743#false} is VALID [2022-04-28 06:00:14,400 INFO L272 TraceCheckUtils]: 131: Hoare triple {109743#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)); {109743#false} is VALID [2022-04-28 06:00:14,400 INFO L290 TraceCheckUtils]: 132: Hoare triple {109743#false} ~cond := #in~cond; {109743#false} is VALID [2022-04-28 06:00:14,400 INFO L290 TraceCheckUtils]: 133: Hoare triple {109743#false} assume 0 == ~cond; {109743#false} is VALID [2022-04-28 06:00:14,400 INFO L290 TraceCheckUtils]: 134: Hoare triple {109743#false} assume !false; {109743#false} is VALID [2022-04-28 06:00:14,400 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 28 proven. 508 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 06:00:14,400 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:00:15,193 INFO L290 TraceCheckUtils]: 134: Hoare triple {109743#false} assume !false; {109743#false} is VALID [2022-04-28 06:00:15,193 INFO L290 TraceCheckUtils]: 133: Hoare triple {109743#false} assume 0 == ~cond; {109743#false} is VALID [2022-04-28 06:00:15,193 INFO L290 TraceCheckUtils]: 132: Hoare triple {109743#false} ~cond := #in~cond; {109743#false} is VALID [2022-04-28 06:00:15,193 INFO L272 TraceCheckUtils]: 131: Hoare triple {109743#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)); {109743#false} is VALID [2022-04-28 06:00:15,193 INFO L290 TraceCheckUtils]: 130: Hoare triple {110177#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {109743#false} is VALID [2022-04-28 06:00:15,194 INFO L290 TraceCheckUtils]: 129: Hoare triple {110181#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {110177#(< |main_#t~post6| 100)} is VALID [2022-04-28 06:00:15,194 INFO L290 TraceCheckUtils]: 128: Hoare triple {110181#(< ~counter~0 100)} assume !(~r~0 < 0); {110181#(< ~counter~0 100)} is VALID [2022-04-28 06:00:15,194 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {109742#true} {110181#(< ~counter~0 100)} #98#return; {110181#(< ~counter~0 100)} is VALID [2022-04-28 06:00:15,194 INFO L290 TraceCheckUtils]: 126: Hoare triple {109742#true} assume true; {109742#true} is VALID [2022-04-28 06:00:15,194 INFO L290 TraceCheckUtils]: 125: Hoare triple {109742#true} assume !(0 == ~cond); {109742#true} is VALID [2022-04-28 06:00:15,195 INFO L290 TraceCheckUtils]: 124: Hoare triple {109742#true} ~cond := #in~cond; {109742#true} is VALID [2022-04-28 06:00:15,195 INFO L272 TraceCheckUtils]: 123: Hoare triple {110181#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109742#true} is VALID [2022-04-28 06:00:15,195 INFO L290 TraceCheckUtils]: 122: Hoare triple {110181#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {110181#(< ~counter~0 100)} is VALID [2022-04-28 06:00:15,197 INFO L290 TraceCheckUtils]: 121: Hoare triple {110206#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {110181#(< ~counter~0 100)} is VALID [2022-04-28 06:00:15,197 INFO L290 TraceCheckUtils]: 120: Hoare triple {110206#(< ~counter~0 99)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {110206#(< ~counter~0 99)} is VALID [2022-04-28 06:00:15,198 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {109742#true} {110206#(< ~counter~0 99)} #98#return; {110206#(< ~counter~0 99)} is VALID [2022-04-28 06:00:15,198 INFO L290 TraceCheckUtils]: 118: Hoare triple {109742#true} assume true; {109742#true} is VALID [2022-04-28 06:00:15,198 INFO L290 TraceCheckUtils]: 117: Hoare triple {109742#true} assume !(0 == ~cond); {109742#true} is VALID [2022-04-28 06:00:15,198 INFO L290 TraceCheckUtils]: 116: Hoare triple {109742#true} ~cond := #in~cond; {109742#true} is VALID [2022-04-28 06:00:15,198 INFO L272 TraceCheckUtils]: 115: Hoare triple {110206#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109742#true} is VALID [2022-04-28 06:00:15,198 INFO L290 TraceCheckUtils]: 114: Hoare triple {110206#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {110206#(< ~counter~0 99)} is VALID [2022-04-28 06:00:15,199 INFO L290 TraceCheckUtils]: 113: Hoare triple {110231#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {110206#(< ~counter~0 99)} is VALID [2022-04-28 06:00:15,200 INFO L290 TraceCheckUtils]: 112: Hoare triple {110231#(< ~counter~0 98)} assume !(~r~0 > 0); {110231#(< ~counter~0 98)} is VALID [2022-04-28 06:00:15,200 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {109742#true} {110231#(< ~counter~0 98)} #96#return; {110231#(< ~counter~0 98)} is VALID [2022-04-28 06:00:15,200 INFO L290 TraceCheckUtils]: 110: Hoare triple {109742#true} assume true; {109742#true} is VALID [2022-04-28 06:00:15,200 INFO L290 TraceCheckUtils]: 109: Hoare triple {109742#true} assume !(0 == ~cond); {109742#true} is VALID [2022-04-28 06:00:15,200 INFO L290 TraceCheckUtils]: 108: Hoare triple {109742#true} ~cond := #in~cond; {109742#true} is VALID [2022-04-28 06:00:15,200 INFO L272 TraceCheckUtils]: 107: Hoare triple {110231#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109742#true} is VALID [2022-04-28 06:00:15,201 INFO L290 TraceCheckUtils]: 106: Hoare triple {110231#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {110231#(< ~counter~0 98)} is VALID [2022-04-28 06:00:15,202 INFO L290 TraceCheckUtils]: 105: Hoare triple {110256#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110231#(< ~counter~0 98)} is VALID [2022-04-28 06:00:15,202 INFO L290 TraceCheckUtils]: 104: Hoare triple {110256#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {110256#(< ~counter~0 97)} is VALID [2022-04-28 06:00:15,202 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {109742#true} {110256#(< ~counter~0 97)} #96#return; {110256#(< ~counter~0 97)} is VALID [2022-04-28 06:00:15,202 INFO L290 TraceCheckUtils]: 102: Hoare triple {109742#true} assume true; {109742#true} is VALID [2022-04-28 06:00:15,203 INFO L290 TraceCheckUtils]: 101: Hoare triple {109742#true} assume !(0 == ~cond); {109742#true} is VALID [2022-04-28 06:00:15,203 INFO L290 TraceCheckUtils]: 100: Hoare triple {109742#true} ~cond := #in~cond; {109742#true} is VALID [2022-04-28 06:00:15,203 INFO L272 TraceCheckUtils]: 99: Hoare triple {110256#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109742#true} is VALID [2022-04-28 06:00:15,203 INFO L290 TraceCheckUtils]: 98: Hoare triple {110256#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {110256#(< ~counter~0 97)} is VALID [2022-04-28 06:00:15,204 INFO L290 TraceCheckUtils]: 97: Hoare triple {110281#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110256#(< ~counter~0 97)} is VALID [2022-04-28 06:00:15,207 INFO L290 TraceCheckUtils]: 96: Hoare triple {110281#(< ~counter~0 96)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {110281#(< ~counter~0 96)} is VALID [2022-04-28 06:00:15,208 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {109742#true} {110281#(< ~counter~0 96)} #96#return; {110281#(< ~counter~0 96)} is VALID [2022-04-28 06:00:15,208 INFO L290 TraceCheckUtils]: 94: Hoare triple {109742#true} assume true; {109742#true} is VALID [2022-04-28 06:00:15,208 INFO L290 TraceCheckUtils]: 93: Hoare triple {109742#true} assume !(0 == ~cond); {109742#true} is VALID [2022-04-28 06:00:15,208 INFO L290 TraceCheckUtils]: 92: Hoare triple {109742#true} ~cond := #in~cond; {109742#true} is VALID [2022-04-28 06:00:15,208 INFO L272 TraceCheckUtils]: 91: Hoare triple {110281#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109742#true} is VALID [2022-04-28 06:00:15,208 INFO L290 TraceCheckUtils]: 90: Hoare triple {110281#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {110281#(< ~counter~0 96)} is VALID [2022-04-28 06:00:15,210 INFO L290 TraceCheckUtils]: 89: Hoare triple {110306#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110281#(< ~counter~0 96)} is VALID [2022-04-28 06:00:15,210 INFO L290 TraceCheckUtils]: 88: Hoare triple {110306#(< ~counter~0 95)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {110306#(< ~counter~0 95)} is VALID [2022-04-28 06:00:15,211 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {109742#true} {110306#(< ~counter~0 95)} #96#return; {110306#(< ~counter~0 95)} is VALID [2022-04-28 06:00:15,211 INFO L290 TraceCheckUtils]: 86: Hoare triple {109742#true} assume true; {109742#true} is VALID [2022-04-28 06:00:15,211 INFO L290 TraceCheckUtils]: 85: Hoare triple {109742#true} assume !(0 == ~cond); {109742#true} is VALID [2022-04-28 06:00:15,211 INFO L290 TraceCheckUtils]: 84: Hoare triple {109742#true} ~cond := #in~cond; {109742#true} is VALID [2022-04-28 06:00:15,211 INFO L272 TraceCheckUtils]: 83: Hoare triple {110306#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109742#true} is VALID [2022-04-28 06:00:15,211 INFO L290 TraceCheckUtils]: 82: Hoare triple {110306#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {110306#(< ~counter~0 95)} is VALID [2022-04-28 06:00:15,212 INFO L290 TraceCheckUtils]: 81: Hoare triple {110331#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110306#(< ~counter~0 95)} is VALID [2022-04-28 06:00:15,213 INFO L290 TraceCheckUtils]: 80: Hoare triple {110331#(< ~counter~0 94)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {110331#(< ~counter~0 94)} is VALID [2022-04-28 06:00:15,213 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {109742#true} {110331#(< ~counter~0 94)} #96#return; {110331#(< ~counter~0 94)} is VALID [2022-04-28 06:00:15,213 INFO L290 TraceCheckUtils]: 78: Hoare triple {109742#true} assume true; {109742#true} is VALID [2022-04-28 06:00:15,213 INFO L290 TraceCheckUtils]: 77: Hoare triple {109742#true} assume !(0 == ~cond); {109742#true} is VALID [2022-04-28 06:00:15,213 INFO L290 TraceCheckUtils]: 76: Hoare triple {109742#true} ~cond := #in~cond; {109742#true} is VALID [2022-04-28 06:00:15,213 INFO L272 TraceCheckUtils]: 75: Hoare triple {110331#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109742#true} is VALID [2022-04-28 06:00:15,214 INFO L290 TraceCheckUtils]: 74: Hoare triple {110331#(< ~counter~0 94)} assume !!(#t~post7 < 100);havoc #t~post7; {110331#(< ~counter~0 94)} is VALID [2022-04-28 06:00:15,215 INFO L290 TraceCheckUtils]: 73: Hoare triple {110356#(< ~counter~0 93)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110331#(< ~counter~0 94)} is VALID [2022-04-28 06:00:15,215 INFO L290 TraceCheckUtils]: 72: Hoare triple {110356#(< ~counter~0 93)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {110356#(< ~counter~0 93)} is VALID [2022-04-28 06:00:15,215 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {109742#true} {110356#(< ~counter~0 93)} #96#return; {110356#(< ~counter~0 93)} is VALID [2022-04-28 06:00:15,216 INFO L290 TraceCheckUtils]: 70: Hoare triple {109742#true} assume true; {109742#true} is VALID [2022-04-28 06:00:15,216 INFO L290 TraceCheckUtils]: 69: Hoare triple {109742#true} assume !(0 == ~cond); {109742#true} is VALID [2022-04-28 06:00:15,216 INFO L290 TraceCheckUtils]: 68: Hoare triple {109742#true} ~cond := #in~cond; {109742#true} is VALID [2022-04-28 06:00:15,216 INFO L272 TraceCheckUtils]: 67: Hoare triple {110356#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109742#true} is VALID [2022-04-28 06:00:15,216 INFO L290 TraceCheckUtils]: 66: Hoare triple {110356#(< ~counter~0 93)} assume !!(#t~post7 < 100);havoc #t~post7; {110356#(< ~counter~0 93)} is VALID [2022-04-28 06:00:15,217 INFO L290 TraceCheckUtils]: 65: Hoare triple {110381#(< ~counter~0 92)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110356#(< ~counter~0 93)} is VALID [2022-04-28 06:00:15,217 INFO L290 TraceCheckUtils]: 64: Hoare triple {110381#(< ~counter~0 92)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {110381#(< ~counter~0 92)} is VALID [2022-04-28 06:00:15,218 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {109742#true} {110381#(< ~counter~0 92)} #96#return; {110381#(< ~counter~0 92)} is VALID [2022-04-28 06:00:15,218 INFO L290 TraceCheckUtils]: 62: Hoare triple {109742#true} assume true; {109742#true} is VALID [2022-04-28 06:00:15,218 INFO L290 TraceCheckUtils]: 61: Hoare triple {109742#true} assume !(0 == ~cond); {109742#true} is VALID [2022-04-28 06:00:15,218 INFO L290 TraceCheckUtils]: 60: Hoare triple {109742#true} ~cond := #in~cond; {109742#true} is VALID [2022-04-28 06:00:15,218 INFO L272 TraceCheckUtils]: 59: Hoare triple {110381#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109742#true} is VALID [2022-04-28 06:00:15,218 INFO L290 TraceCheckUtils]: 58: Hoare triple {110381#(< ~counter~0 92)} assume !!(#t~post7 < 100);havoc #t~post7; {110381#(< ~counter~0 92)} is VALID [2022-04-28 06:00:15,219 INFO L290 TraceCheckUtils]: 57: Hoare triple {110406#(< ~counter~0 91)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110381#(< ~counter~0 92)} is VALID [2022-04-28 06:00:15,220 INFO L290 TraceCheckUtils]: 56: Hoare triple {110406#(< ~counter~0 91)} assume !!(0 != ~r~0); {110406#(< ~counter~0 91)} is VALID [2022-04-28 06:00:15,220 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {109742#true} {110406#(< ~counter~0 91)} #94#return; {110406#(< ~counter~0 91)} is VALID [2022-04-28 06:00:15,220 INFO L290 TraceCheckUtils]: 54: Hoare triple {109742#true} assume true; {109742#true} is VALID [2022-04-28 06:00:15,220 INFO L290 TraceCheckUtils]: 53: Hoare triple {109742#true} assume !(0 == ~cond); {109742#true} is VALID [2022-04-28 06:00:15,220 INFO L290 TraceCheckUtils]: 52: Hoare triple {109742#true} ~cond := #in~cond; {109742#true} is VALID [2022-04-28 06:00:15,220 INFO L272 TraceCheckUtils]: 51: Hoare triple {110406#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109742#true} is VALID [2022-04-28 06:00:15,221 INFO L290 TraceCheckUtils]: 50: Hoare triple {110406#(< ~counter~0 91)} assume !!(#t~post6 < 100);havoc #t~post6; {110406#(< ~counter~0 91)} is VALID [2022-04-28 06:00:15,222 INFO L290 TraceCheckUtils]: 49: Hoare triple {110431#(< ~counter~0 90)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {110406#(< ~counter~0 91)} is VALID [2022-04-28 06:00:15,222 INFO L290 TraceCheckUtils]: 48: Hoare triple {110431#(< ~counter~0 90)} assume !(~r~0 < 0); {110431#(< ~counter~0 90)} is VALID [2022-04-28 06:00:15,222 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {109742#true} {110431#(< ~counter~0 90)} #98#return; {110431#(< ~counter~0 90)} is VALID [2022-04-28 06:00:15,222 INFO L290 TraceCheckUtils]: 46: Hoare triple {109742#true} assume true; {109742#true} is VALID [2022-04-28 06:00:15,222 INFO L290 TraceCheckUtils]: 45: Hoare triple {109742#true} assume !(0 == ~cond); {109742#true} is VALID [2022-04-28 06:00:15,222 INFO L290 TraceCheckUtils]: 44: Hoare triple {109742#true} ~cond := #in~cond; {109742#true} is VALID [2022-04-28 06:00:15,223 INFO L272 TraceCheckUtils]: 43: Hoare triple {110431#(< ~counter~0 90)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109742#true} is VALID [2022-04-28 06:00:15,223 INFO L290 TraceCheckUtils]: 42: Hoare triple {110431#(< ~counter~0 90)} assume !!(#t~post8 < 100);havoc #t~post8; {110431#(< ~counter~0 90)} is VALID [2022-04-28 06:00:15,224 INFO L290 TraceCheckUtils]: 41: Hoare triple {110456#(< ~counter~0 89)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {110431#(< ~counter~0 90)} is VALID [2022-04-28 06:00:15,224 INFO L290 TraceCheckUtils]: 40: Hoare triple {110456#(< ~counter~0 89)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {110456#(< ~counter~0 89)} is VALID [2022-04-28 06:00:15,224 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {109742#true} {110456#(< ~counter~0 89)} #98#return; {110456#(< ~counter~0 89)} is VALID [2022-04-28 06:00:15,225 INFO L290 TraceCheckUtils]: 38: Hoare triple {109742#true} assume true; {109742#true} is VALID [2022-04-28 06:00:15,225 INFO L290 TraceCheckUtils]: 37: Hoare triple {109742#true} assume !(0 == ~cond); {109742#true} is VALID [2022-04-28 06:00:15,225 INFO L290 TraceCheckUtils]: 36: Hoare triple {109742#true} ~cond := #in~cond; {109742#true} is VALID [2022-04-28 06:00:15,225 INFO L272 TraceCheckUtils]: 35: Hoare triple {110456#(< ~counter~0 89)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109742#true} is VALID [2022-04-28 06:00:15,225 INFO L290 TraceCheckUtils]: 34: Hoare triple {110456#(< ~counter~0 89)} assume !!(#t~post8 < 100);havoc #t~post8; {110456#(< ~counter~0 89)} is VALID [2022-04-28 06:00:15,226 INFO L290 TraceCheckUtils]: 33: Hoare triple {110481#(< ~counter~0 88)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {110456#(< ~counter~0 89)} is VALID [2022-04-28 06:00:15,226 INFO L290 TraceCheckUtils]: 32: Hoare triple {110481#(< ~counter~0 88)} assume !(~r~0 > 0); {110481#(< ~counter~0 88)} is VALID [2022-04-28 06:00:15,227 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {109742#true} {110481#(< ~counter~0 88)} #96#return; {110481#(< ~counter~0 88)} is VALID [2022-04-28 06:00:15,227 INFO L290 TraceCheckUtils]: 30: Hoare triple {109742#true} assume true; {109742#true} is VALID [2022-04-28 06:00:15,227 INFO L290 TraceCheckUtils]: 29: Hoare triple {109742#true} assume !(0 == ~cond); {109742#true} is VALID [2022-04-28 06:00:15,227 INFO L290 TraceCheckUtils]: 28: Hoare triple {109742#true} ~cond := #in~cond; {109742#true} is VALID [2022-04-28 06:00:15,227 INFO L272 TraceCheckUtils]: 27: Hoare triple {110481#(< ~counter~0 88)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109742#true} is VALID [2022-04-28 06:00:15,227 INFO L290 TraceCheckUtils]: 26: Hoare triple {110481#(< ~counter~0 88)} assume !!(#t~post7 < 100);havoc #t~post7; {110481#(< ~counter~0 88)} is VALID [2022-04-28 06:00:15,228 INFO L290 TraceCheckUtils]: 25: Hoare triple {110506#(< ~counter~0 87)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110481#(< ~counter~0 88)} is VALID [2022-04-28 06:00:15,228 INFO L290 TraceCheckUtils]: 24: Hoare triple {110506#(< ~counter~0 87)} assume !!(0 != ~r~0); {110506#(< ~counter~0 87)} is VALID [2022-04-28 06:00:15,229 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {109742#true} {110506#(< ~counter~0 87)} #94#return; {110506#(< ~counter~0 87)} is VALID [2022-04-28 06:00:15,229 INFO L290 TraceCheckUtils]: 22: Hoare triple {109742#true} assume true; {109742#true} is VALID [2022-04-28 06:00:15,229 INFO L290 TraceCheckUtils]: 21: Hoare triple {109742#true} assume !(0 == ~cond); {109742#true} is VALID [2022-04-28 06:00:15,229 INFO L290 TraceCheckUtils]: 20: Hoare triple {109742#true} ~cond := #in~cond; {109742#true} is VALID [2022-04-28 06:00:15,229 INFO L272 TraceCheckUtils]: 19: Hoare triple {110506#(< ~counter~0 87)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {109742#true} is VALID [2022-04-28 06:00:15,229 INFO L290 TraceCheckUtils]: 18: Hoare triple {110506#(< ~counter~0 87)} assume !!(#t~post6 < 100);havoc #t~post6; {110506#(< ~counter~0 87)} is VALID [2022-04-28 06:00:15,230 INFO L290 TraceCheckUtils]: 17: Hoare triple {110531#(< ~counter~0 86)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {110506#(< ~counter~0 87)} is VALID [2022-04-28 06:00:15,231 INFO L290 TraceCheckUtils]: 16: Hoare triple {110531#(< ~counter~0 86)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {110531#(< ~counter~0 86)} is VALID [2022-04-28 06:00:15,231 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {109742#true} {110531#(< ~counter~0 86)} #92#return; {110531#(< ~counter~0 86)} is VALID [2022-04-28 06:00:15,231 INFO L290 TraceCheckUtils]: 14: Hoare triple {109742#true} assume true; {109742#true} is VALID [2022-04-28 06:00:15,231 INFO L290 TraceCheckUtils]: 13: Hoare triple {109742#true} assume !(0 == ~cond); {109742#true} is VALID [2022-04-28 06:00:15,231 INFO L290 TraceCheckUtils]: 12: Hoare triple {109742#true} ~cond := #in~cond; {109742#true} is VALID [2022-04-28 06:00:15,231 INFO L272 TraceCheckUtils]: 11: Hoare triple {110531#(< ~counter~0 86)} 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)); {109742#true} is VALID [2022-04-28 06:00:15,232 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {109742#true} {110531#(< ~counter~0 86)} #90#return; {110531#(< ~counter~0 86)} is VALID [2022-04-28 06:00:15,232 INFO L290 TraceCheckUtils]: 9: Hoare triple {109742#true} assume true; {109742#true} is VALID [2022-04-28 06:00:15,232 INFO L290 TraceCheckUtils]: 8: Hoare triple {109742#true} assume !(0 == ~cond); {109742#true} is VALID [2022-04-28 06:00:15,232 INFO L290 TraceCheckUtils]: 7: Hoare triple {109742#true} ~cond := #in~cond; {109742#true} is VALID [2022-04-28 06:00:15,232 INFO L272 TraceCheckUtils]: 6: Hoare triple {110531#(< ~counter~0 86)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {109742#true} is VALID [2022-04-28 06:00:15,232 INFO L290 TraceCheckUtils]: 5: Hoare triple {110531#(< ~counter~0 86)} 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; {110531#(< ~counter~0 86)} is VALID [2022-04-28 06:00:15,233 INFO L272 TraceCheckUtils]: 4: Hoare triple {110531#(< ~counter~0 86)} call #t~ret9 := main(); {110531#(< ~counter~0 86)} is VALID [2022-04-28 06:00:15,233 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {110531#(< ~counter~0 86)} {109742#true} #102#return; {110531#(< ~counter~0 86)} is VALID [2022-04-28 06:00:15,233 INFO L290 TraceCheckUtils]: 2: Hoare triple {110531#(< ~counter~0 86)} assume true; {110531#(< ~counter~0 86)} is VALID [2022-04-28 06:00:15,234 INFO L290 TraceCheckUtils]: 1: Hoare triple {109742#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; {110531#(< ~counter~0 86)} is VALID [2022-04-28 06:00:15,234 INFO L272 TraceCheckUtils]: 0: Hoare triple {109742#true} call ULTIMATE.init(); {109742#true} is VALID [2022-04-28 06:00:15,234 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 28 proven. 144 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2022-04-28 06:00:15,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:00:15,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715837145] [2022-04-28 06:00:15,235 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:00:15,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682204246] [2022-04-28 06:00:15,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1682204246] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:00:15,235 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:00:15,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2022-04-28 06:00:15,235 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:00:15,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [971076097] [2022-04-28 06:00:15,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [971076097] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:00:15,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:00:15,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 06:00:15,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29059127] [2022-04-28 06:00:15,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:00:15,236 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.333333333333333) internal successors, (96), 17 states have internal predecessors, (96), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) Word has length 135 [2022-04-28 06:00:15,236 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:00:15,236 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 5.333333333333333) internal successors, (96), 17 states have internal predecessors, (96), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-28 06:00:15,350 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:00:15,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 06:00:15,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:00:15,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 06:00:15,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=501, Invalid=621, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 06:00:15,352 INFO L87 Difference]: Start difference. First operand 683 states and 912 transitions. Second operand has 18 states, 18 states have (on average 5.333333333333333) internal successors, (96), 17 states have internal predecessors, (96), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-28 06:00:19,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:00:19,223 INFO L93 Difference]: Finished difference Result 734 states and 982 transitions. [2022-04-28 06:00:19,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-28 06:00:19,223 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.333333333333333) internal successors, (96), 17 states have internal predecessors, (96), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) Word has length 135 [2022-04-28 06:00:19,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:00:19,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 5.333333333333333) internal successors, (96), 17 states have internal predecessors, (96), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-28 06:00:19,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 294 transitions. [2022-04-28 06:00:19,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 5.333333333333333) internal successors, (96), 17 states have internal predecessors, (96), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-28 06:00:19,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 294 transitions. [2022-04-28 06:00:19,228 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 294 transitions. [2022-04-28 06:00:19,568 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 294 edges. 294 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:00:19,589 INFO L225 Difference]: With dead ends: 734 [2022-04-28 06:00:19,589 INFO L226 Difference]: Without dead ends: 729 [2022-04-28 06:00:19,590 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=834, Invalid=1146, Unknown=0, NotChecked=0, Total=1980 [2022-04-28 06:00:19,590 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 190 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 06:00:19,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 351 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 06:00:19,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2022-04-28 06:00:21,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 707. [2022-04-28 06:00:21,759 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:00:21,760 INFO L82 GeneralOperation]: Start isEquivalent. First operand 729 states. Second operand has 707 states, 525 states have (on average 1.1923809523809523) internal successors, (626), 542 states have internal predecessors, (626), 163 states have call successors, (163), 20 states have call predecessors, (163), 18 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) [2022-04-28 06:00:21,760 INFO L74 IsIncluded]: Start isIncluded. First operand 729 states. Second operand has 707 states, 525 states have (on average 1.1923809523809523) internal successors, (626), 542 states have internal predecessors, (626), 163 states have call successors, (163), 20 states have call predecessors, (163), 18 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) [2022-04-28 06:00:21,760 INFO L87 Difference]: Start difference. First operand 729 states. Second operand has 707 states, 525 states have (on average 1.1923809523809523) internal successors, (626), 542 states have internal predecessors, (626), 163 states have call successors, (163), 20 states have call predecessors, (163), 18 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) [2022-04-28 06:00:21,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:00:21,778 INFO L93 Difference]: Finished difference Result 729 states and 976 transitions. [2022-04-28 06:00:21,778 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 976 transitions. [2022-04-28 06:00:21,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:00:21,778 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:00:21,779 INFO L74 IsIncluded]: Start isIncluded. First operand has 707 states, 525 states have (on average 1.1923809523809523) internal successors, (626), 542 states have internal predecessors, (626), 163 states have call successors, (163), 20 states have call predecessors, (163), 18 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) Second operand 729 states. [2022-04-28 06:00:21,779 INFO L87 Difference]: Start difference. First operand has 707 states, 525 states have (on average 1.1923809523809523) internal successors, (626), 542 states have internal predecessors, (626), 163 states have call successors, (163), 20 states have call predecessors, (163), 18 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) Second operand 729 states. [2022-04-28 06:00:21,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:00:21,797 INFO L93 Difference]: Finished difference Result 729 states and 976 transitions. [2022-04-28 06:00:21,797 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 976 transitions. [2022-04-28 06:00:21,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:00:21,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:00:21,797 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:00:21,798 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:00:21,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 525 states have (on average 1.1923809523809523) internal successors, (626), 542 states have internal predecessors, (626), 163 states have call successors, (163), 20 states have call predecessors, (163), 18 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) [2022-04-28 06:00:21,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 950 transitions. [2022-04-28 06:00:21,827 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 950 transitions. Word has length 135 [2022-04-28 06:00:21,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:00:21,827 INFO L495 AbstractCegarLoop]: Abstraction has 707 states and 950 transitions. [2022-04-28 06:00:21,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.333333333333333) internal successors, (96), 17 states have internal predecessors, (96), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-28 06:00:21,827 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 707 states and 950 transitions. [2022-04-28 06:00:26,048 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 950 edges. 950 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:00:26,048 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 950 transitions. [2022-04-28 06:00:26,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-04-28 06:00:26,049 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:00:26,049 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 6, 6, 6, 6, 6, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:00:26,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2022-04-28 06:00:26,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:00:26,250 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:00:26,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:00:26,250 INFO L85 PathProgramCache]: Analyzing trace with hash -972958086, now seen corresponding path program 21 times [2022-04-28 06:00:26,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:00:26,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [805675628] [2022-04-28 06:00:26,251 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:00:26,251 INFO L85 PathProgramCache]: Analyzing trace with hash -972958086, now seen corresponding path program 22 times [2022-04-28 06:00:26,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:00:26,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509094460] [2022-04-28 06:00:26,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:00:26,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:00:26,268 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:00:26,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [508541799] [2022-04-28 06:00:26,269 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 06:00:26,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:00:26,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:00:26,270 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:00:26,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-04-28 06:00:26,332 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 06:00:26,333 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:00:26,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-28 06:00:26,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:00:26,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:02:37,040 INFO L272 TraceCheckUtils]: 0: Hoare triple {114947#true} call ULTIMATE.init(); {114947#true} is VALID [2022-04-28 06:02:37,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {114947#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; {114947#true} is VALID [2022-04-28 06:02:37,041 INFO L290 TraceCheckUtils]: 2: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-28 06:02:37,041 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {114947#true} {114947#true} #102#return; {114947#true} is VALID [2022-04-28 06:02:37,041 INFO L272 TraceCheckUtils]: 4: Hoare triple {114947#true} call #t~ret9 := main(); {114947#true} is VALID [2022-04-28 06:02:37,041 INFO L290 TraceCheckUtils]: 5: Hoare triple {114947#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; {114947#true} is VALID [2022-04-28 06:02:37,041 INFO L272 TraceCheckUtils]: 6: Hoare triple {114947#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {114947#true} is VALID [2022-04-28 06:02:37,041 INFO L290 TraceCheckUtils]: 7: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-28 06:02:37,041 INFO L290 TraceCheckUtils]: 8: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-28 06:02:37,041 INFO L290 TraceCheckUtils]: 9: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-28 06:02:37,041 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {114947#true} {114947#true} #90#return; {114947#true} is VALID [2022-04-28 06:02:37,042 INFO L272 TraceCheckUtils]: 11: Hoare triple {114947#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)); {114947#true} is VALID [2022-04-28 06:02:37,042 INFO L290 TraceCheckUtils]: 12: Hoare triple {114947#true} ~cond := #in~cond; {114988#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 06:02:37,042 INFO L290 TraceCheckUtils]: 13: Hoare triple {114988#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {114992#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 06:02:37,042 INFO L290 TraceCheckUtils]: 14: Hoare triple {114992#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {114992#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 06:02:37,043 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {114992#(not (= |assume_abort_if_not_#in~cond| 0))} {114947#true} #92#return; {114999#(and (<= 0 main_~A~0) (= (mod main_~A~0 2) 1))} is VALID [2022-04-28 06:02:39,046 WARN L290 TraceCheckUtils]: 16: Hoare triple {114999#(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; {115003#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} is UNKNOWN [2022-04-28 06:02:39,047 INFO L290 TraceCheckUtils]: 17: Hoare triple {115003#(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; {115003#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} is VALID [2022-04-28 06:02:39,048 INFO L290 TraceCheckUtils]: 18: Hoare triple {115003#(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 < 100);havoc #t~post6; {115003#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} is VALID [2022-04-28 06:02:39,048 INFO L272 TraceCheckUtils]: 19: Hoare triple {115003#(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)); {114947#true} is VALID [2022-04-28 06:02:39,048 INFO L290 TraceCheckUtils]: 20: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-28 06:02:39,048 INFO L290 TraceCheckUtils]: 21: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-28 06:02:39,048 INFO L290 TraceCheckUtils]: 22: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-28 06:02:39,048 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {114947#true} {115003#(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; {115003#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} is VALID [2022-04-28 06:02:39,049 INFO L290 TraceCheckUtils]: 24: Hoare triple {115003#(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); {115003#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} is VALID [2022-04-28 06:02:39,049 INFO L290 TraceCheckUtils]: 25: Hoare triple {115003#(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; {115003#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} is VALID [2022-04-28 06:02:39,050 INFO L290 TraceCheckUtils]: 26: Hoare triple {115003#(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 < 100);havoc #t~post7; {115003#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} is VALID [2022-04-28 06:02:39,050 INFO L272 TraceCheckUtils]: 27: Hoare triple {115003#(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)); {114947#true} is VALID [2022-04-28 06:02:39,050 INFO L290 TraceCheckUtils]: 28: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-28 06:02:39,050 INFO L290 TraceCheckUtils]: 29: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-28 06:02:39,050 INFO L290 TraceCheckUtils]: 30: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-28 06:02:39,051 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {114947#true} {115003#(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; {115003#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} is VALID [2022-04-28 06:02:39,052 INFO L290 TraceCheckUtils]: 32: Hoare triple {115003#(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); {115003#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} is VALID [2022-04-28 06:02:39,052 INFO L290 TraceCheckUtils]: 33: Hoare triple {115003#(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; {115003#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} is VALID [2022-04-28 06:02:39,053 INFO L290 TraceCheckUtils]: 34: Hoare triple {115003#(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 < 100);havoc #t~post8; {115003#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} is VALID [2022-04-28 06:02:39,053 INFO L272 TraceCheckUtils]: 35: Hoare triple {115003#(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)); {114947#true} is VALID [2022-04-28 06:02:39,053 INFO L290 TraceCheckUtils]: 36: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-28 06:02:39,053 INFO L290 TraceCheckUtils]: 37: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-28 06:02:39,053 INFO L290 TraceCheckUtils]: 38: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-28 06:02:39,054 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {114947#true} {115003#(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; {115003#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} is VALID [2022-04-28 06:02:40,149 INFO L290 TraceCheckUtils]: 40: Hoare triple {115003#(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; {115076#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} is VALID [2022-04-28 06:02:40,151 INFO L290 TraceCheckUtils]: 41: Hoare triple {115076#(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; {115076#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} is VALID [2022-04-28 06:02:40,152 INFO L290 TraceCheckUtils]: 42: Hoare triple {115076#(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 < 100);havoc #t~post8; {115076#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} is VALID [2022-04-28 06:02:40,153 INFO L272 TraceCheckUtils]: 43: Hoare triple {115076#(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)); {114947#true} is VALID [2022-04-28 06:02:40,153 INFO L290 TraceCheckUtils]: 44: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-28 06:02:40,153 INFO L290 TraceCheckUtils]: 45: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-28 06:02:40,153 INFO L290 TraceCheckUtils]: 46: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-28 06:02:40,153 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {114947#true} {115076#(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; {115076#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} is VALID [2022-04-28 06:02:40,155 INFO L290 TraceCheckUtils]: 48: Hoare triple {115076#(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); {115076#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} is VALID [2022-04-28 06:02:40,166 INFO L290 TraceCheckUtils]: 49: Hoare triple {115076#(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; {115076#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} is VALID [2022-04-28 06:02:40,340 INFO L290 TraceCheckUtils]: 50: Hoare triple {115076#(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 < 100);havoc #t~post6; {115076#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} is VALID [2022-04-28 06:02:40,340 INFO L272 TraceCheckUtils]: 51: Hoare triple {115076#(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)); {114947#true} is VALID [2022-04-28 06:02:40,340 INFO L290 TraceCheckUtils]: 52: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-28 06:02:40,341 INFO L290 TraceCheckUtils]: 53: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-28 06:02:40,341 INFO L290 TraceCheckUtils]: 54: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-28 06:02:40,341 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {114947#true} {115076#(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; {115076#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} is VALID [2022-04-28 06:02:40,356 INFO L290 TraceCheckUtils]: 56: Hoare triple {115076#(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); {115076#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} is VALID [2022-04-28 06:02:40,357 INFO L290 TraceCheckUtils]: 57: Hoare triple {115076#(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; {115076#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} is VALID [2022-04-28 06:02:40,358 INFO L290 TraceCheckUtils]: 58: Hoare triple {115076#(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 < 100);havoc #t~post7; {115076#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} is VALID [2022-04-28 06:02:40,358 INFO L272 TraceCheckUtils]: 59: Hoare triple {115076#(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)); {114947#true} is VALID [2022-04-28 06:02:40,358 INFO L290 TraceCheckUtils]: 60: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-28 06:02:40,358 INFO L290 TraceCheckUtils]: 61: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-28 06:02:40,358 INFO L290 TraceCheckUtils]: 62: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-28 06:02:40,359 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {114947#true} {115076#(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; {115076#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} is VALID [2022-04-28 06:02:40,902 INFO L290 TraceCheckUtils]: 64: Hoare triple {115076#(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; {115149#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ main_~r~0 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (<= main_~v~0 3))} is VALID [2022-04-28 06:02:42,905 WARN L290 TraceCheckUtils]: 65: Hoare triple {115149#(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; {115149#(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 UNKNOWN [2022-04-28 06:02:42,906 INFO L290 TraceCheckUtils]: 66: Hoare triple {115149#(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 < 100);havoc #t~post7; {115149#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ main_~r~0 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (<= main_~v~0 3))} is VALID [2022-04-28 06:02:42,907 INFO L272 TraceCheckUtils]: 67: Hoare triple {115149#(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)); {114947#true} is VALID [2022-04-28 06:02:42,907 INFO L290 TraceCheckUtils]: 68: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-28 06:02:42,907 INFO L290 TraceCheckUtils]: 69: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-28 06:02:42,907 INFO L290 TraceCheckUtils]: 70: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-28 06:02:42,907 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {114947#true} {115149#(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; {115149#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ main_~r~0 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (<= main_~v~0 3))} is VALID [2022-04-28 06:02:42,909 INFO L290 TraceCheckUtils]: 72: Hoare triple {115149#(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; {115174#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} is VALID [2022-04-28 06:02:42,910 INFO L290 TraceCheckUtils]: 73: Hoare triple {115174#(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; {115174#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} is VALID [2022-04-28 06:02:42,911 INFO L290 TraceCheckUtils]: 74: Hoare triple {115174#(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 < 100);havoc #t~post7; {115174#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} is VALID [2022-04-28 06:02:42,911 INFO L272 TraceCheckUtils]: 75: Hoare triple {115174#(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)); {114947#true} is VALID [2022-04-28 06:02:42,911 INFO L290 TraceCheckUtils]: 76: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-28 06:02:42,911 INFO L290 TraceCheckUtils]: 77: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-28 06:02:42,911 INFO L290 TraceCheckUtils]: 78: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-28 06:02:42,912 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {114947#true} {115174#(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; {115174#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} is VALID [2022-04-28 06:02:42,912 INFO L290 TraceCheckUtils]: 80: Hoare triple {115174#(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); {115174#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} is VALID [2022-04-28 06:02:42,913 INFO L290 TraceCheckUtils]: 81: Hoare triple {115174#(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; {115174#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} is VALID [2022-04-28 06:02:42,914 INFO L290 TraceCheckUtils]: 82: Hoare triple {115174#(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 < 100);havoc #t~post8; {115174#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} is VALID [2022-04-28 06:02:42,914 INFO L272 TraceCheckUtils]: 83: Hoare triple {115174#(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)); {114947#true} is VALID [2022-04-28 06:02:42,914 INFO L290 TraceCheckUtils]: 84: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-28 06:02:42,914 INFO L290 TraceCheckUtils]: 85: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-28 06:02:42,914 INFO L290 TraceCheckUtils]: 86: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-28 06:02:42,915 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {114947#true} {115174#(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; {115174#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} is VALID [2022-04-28 06:02:42,919 INFO L290 TraceCheckUtils]: 88: Hoare triple {115174#(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; {115223#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} is VALID [2022-04-28 06:02:42,922 INFO L290 TraceCheckUtils]: 89: Hoare triple {115223#(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; {115223#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} is VALID [2022-04-28 06:02:44,957 WARN L290 TraceCheckUtils]: 90: Hoare triple {115223#(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 < 100);havoc #t~post8; {115223#(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 UNKNOWN [2022-04-28 06:02:44,957 INFO L272 TraceCheckUtils]: 91: Hoare triple {115223#(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)); {114947#true} is VALID [2022-04-28 06:02:44,958 INFO L290 TraceCheckUtils]: 92: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-28 06:02:44,958 INFO L290 TraceCheckUtils]: 93: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-28 06:02:44,958 INFO L290 TraceCheckUtils]: 94: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-28 06:02:44,958 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {114947#true} {115223#(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; {115223#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} is VALID [2022-04-28 06:02:44,960 INFO L290 TraceCheckUtils]: 96: Hoare triple {115223#(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); {115223#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} is VALID [2022-04-28 06:02:44,975 INFO L290 TraceCheckUtils]: 97: Hoare triple {115223#(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; {115223#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} is VALID [2022-04-28 06:02:44,977 INFO L290 TraceCheckUtils]: 98: Hoare triple {115223#(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 < 100);havoc #t~post6; {115223#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} is VALID [2022-04-28 06:02:44,977 INFO L272 TraceCheckUtils]: 99: Hoare triple {115223#(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)); {114947#true} is VALID [2022-04-28 06:02:44,977 INFO L290 TraceCheckUtils]: 100: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-28 06:02:44,977 INFO L290 TraceCheckUtils]: 101: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-28 06:02:44,977 INFO L290 TraceCheckUtils]: 102: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-28 06:02:44,978 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {114947#true} {115223#(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; {115223#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} is VALID [2022-04-28 06:02:44,979 INFO L290 TraceCheckUtils]: 104: Hoare triple {115223#(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); {115223#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} is VALID [2022-04-28 06:02:44,980 INFO L290 TraceCheckUtils]: 105: Hoare triple {115223#(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; {115223#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} is VALID [2022-04-28 06:02:44,981 INFO L290 TraceCheckUtils]: 106: Hoare triple {115223#(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 < 100);havoc #t~post7; {115223#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} is VALID [2022-04-28 06:02:44,982 INFO L272 TraceCheckUtils]: 107: Hoare triple {115223#(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)); {114947#true} is VALID [2022-04-28 06:02:44,982 INFO L290 TraceCheckUtils]: 108: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-28 06:02:44,982 INFO L290 TraceCheckUtils]: 109: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-28 06:02:44,982 INFO L290 TraceCheckUtils]: 110: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-28 06:02:44,982 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {114947#true} {115223#(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; {115223#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} is VALID [2022-04-28 06:02:45,197 INFO L290 TraceCheckUtils]: 112: Hoare triple {115223#(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; {115296#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} is VALID [2022-04-28 06:02:45,199 INFO L290 TraceCheckUtils]: 113: Hoare triple {115296#(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; {115296#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} is VALID [2022-04-28 06:02:45,210 INFO L290 TraceCheckUtils]: 114: Hoare triple {115296#(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 < 100);havoc #t~post7; {115296#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} is VALID [2022-04-28 06:02:45,210 INFO L272 TraceCheckUtils]: 115: Hoare triple {115296#(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)); {114947#true} is VALID [2022-04-28 06:02:45,210 INFO L290 TraceCheckUtils]: 116: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-28 06:02:45,210 INFO L290 TraceCheckUtils]: 117: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-28 06:02:45,211 INFO L290 TraceCheckUtils]: 118: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-28 06:02:45,211 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {114947#true} {115296#(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; {115296#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} is VALID [2022-04-28 06:02:45,217 INFO L290 TraceCheckUtils]: 120: Hoare triple {115296#(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); {115296#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} is VALID [2022-04-28 06:02:45,219 INFO L290 TraceCheckUtils]: 121: Hoare triple {115296#(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; {115296#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} is VALID [2022-04-28 06:02:45,220 INFO L290 TraceCheckUtils]: 122: Hoare triple {115296#(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 < 100);havoc #t~post8; {115296#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} is VALID [2022-04-28 06:02:45,220 INFO L272 TraceCheckUtils]: 123: Hoare triple {115296#(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)); {114947#true} is VALID [2022-04-28 06:02:45,220 INFO L290 TraceCheckUtils]: 124: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-28 06:02:45,220 INFO L290 TraceCheckUtils]: 125: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-28 06:02:45,220 INFO L290 TraceCheckUtils]: 126: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-28 06:02:45,221 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {114947#true} {115296#(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; {115296#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} is VALID [2022-04-28 06:02:45,225 INFO L290 TraceCheckUtils]: 128: Hoare triple {115296#(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; {114948#false} is VALID [2022-04-28 06:02:45,225 INFO L290 TraceCheckUtils]: 129: Hoare triple {114948#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {114948#false} is VALID [2022-04-28 06:02:45,226 INFO L290 TraceCheckUtils]: 130: Hoare triple {114948#false} assume !(#t~post8 < 100);havoc #t~post8; {114948#false} is VALID [2022-04-28 06:02:45,226 INFO L290 TraceCheckUtils]: 131: Hoare triple {114948#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {114948#false} is VALID [2022-04-28 06:02:45,226 INFO L290 TraceCheckUtils]: 132: Hoare triple {114948#false} assume !(#t~post6 < 100);havoc #t~post6; {114948#false} is VALID [2022-04-28 06:02:45,226 INFO L272 TraceCheckUtils]: 133: Hoare triple {114948#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)); {114948#false} is VALID [2022-04-28 06:02:45,226 INFO L290 TraceCheckUtils]: 134: Hoare triple {114948#false} ~cond := #in~cond; {114948#false} is VALID [2022-04-28 06:02:45,226 INFO L290 TraceCheckUtils]: 135: Hoare triple {114948#false} assume 0 == ~cond; {114948#false} is VALID [2022-04-28 06:02:45,226 INFO L290 TraceCheckUtils]: 136: Hoare triple {114948#false} assume !false; {114948#false} is VALID [2022-04-28 06:02:45,227 INFO L134 CoverageAnalysis]: Checked inductivity of 524 backedges. 47 proven. 112 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2022-04-28 06:02:45,227 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:02:51,101 INFO L290 TraceCheckUtils]: 136: Hoare triple {114948#false} assume !false; {114948#false} is VALID [2022-04-28 06:02:51,101 INFO L290 TraceCheckUtils]: 135: Hoare triple {114948#false} assume 0 == ~cond; {114948#false} is VALID [2022-04-28 06:02:51,101 INFO L290 TraceCheckUtils]: 134: Hoare triple {114948#false} ~cond := #in~cond; {114948#false} is VALID [2022-04-28 06:02:51,101 INFO L272 TraceCheckUtils]: 133: Hoare triple {114948#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)); {114948#false} is VALID [2022-04-28 06:02:51,101 INFO L290 TraceCheckUtils]: 132: Hoare triple {114948#false} assume !(#t~post6 < 100);havoc #t~post6; {114948#false} is VALID [2022-04-28 06:02:51,101 INFO L290 TraceCheckUtils]: 131: Hoare triple {114948#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {114948#false} is VALID [2022-04-28 06:02:51,101 INFO L290 TraceCheckUtils]: 130: Hoare triple {114948#false} assume !(#t~post8 < 100);havoc #t~post8; {114948#false} is VALID [2022-04-28 06:02:51,102 INFO L290 TraceCheckUtils]: 129: Hoare triple {114948#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {114948#false} is VALID [2022-04-28 06:02:51,102 INFO L290 TraceCheckUtils]: 128: Hoare triple {115393#(not (< main_~r~0 0))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {114948#false} is VALID [2022-04-28 06:02:51,102 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {114947#true} {115393#(not (< main_~r~0 0))} #98#return; {115393#(not (< main_~r~0 0))} is VALID [2022-04-28 06:02:51,102 INFO L290 TraceCheckUtils]: 126: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-28 06:02:51,102 INFO L290 TraceCheckUtils]: 125: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-28 06:02:51,103 INFO L290 TraceCheckUtils]: 124: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-28 06:02:51,103 INFO L272 TraceCheckUtils]: 123: Hoare triple {115393#(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)); {114947#true} is VALID [2022-04-28 06:02:51,103 INFO L290 TraceCheckUtils]: 122: Hoare triple {115393#(not (< main_~r~0 0))} assume !!(#t~post8 < 100);havoc #t~post8; {115393#(not (< main_~r~0 0))} is VALID [2022-04-28 06:02:51,103 INFO L290 TraceCheckUtils]: 121: Hoare triple {115393#(not (< main_~r~0 0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {115393#(not (< main_~r~0 0))} is VALID [2022-04-28 06:02:51,103 INFO L290 TraceCheckUtils]: 120: Hoare triple {115393#(not (< main_~r~0 0))} assume !(~r~0 > 0); {115393#(not (< main_~r~0 0))} is VALID [2022-04-28 06:02:51,104 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {114947#true} {115393#(not (< main_~r~0 0))} #96#return; {115393#(not (< main_~r~0 0))} is VALID [2022-04-28 06:02:51,104 INFO L290 TraceCheckUtils]: 118: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-28 06:02:51,104 INFO L290 TraceCheckUtils]: 117: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-28 06:02:51,104 INFO L290 TraceCheckUtils]: 116: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-28 06:02:51,104 INFO L272 TraceCheckUtils]: 115: Hoare triple {115393#(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)); {114947#true} is VALID [2022-04-28 06:02:51,104 INFO L290 TraceCheckUtils]: 114: Hoare triple {115393#(not (< main_~r~0 0))} assume !!(#t~post7 < 100);havoc #t~post7; {115393#(not (< main_~r~0 0))} is VALID [2022-04-28 06:02:51,105 INFO L290 TraceCheckUtils]: 113: Hoare triple {115393#(not (< main_~r~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {115393#(not (< main_~r~0 0))} is VALID [2022-04-28 06:02:51,106 INFO L290 TraceCheckUtils]: 112: Hoare triple {115442#(<= main_~v~0 main_~r~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {115393#(not (< main_~r~0 0))} is VALID [2022-04-28 06:02:51,107 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {114947#true} {115442#(<= main_~v~0 main_~r~0)} #96#return; {115442#(<= main_~v~0 main_~r~0)} is VALID [2022-04-28 06:02:51,107 INFO L290 TraceCheckUtils]: 110: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-28 06:02:51,107 INFO L290 TraceCheckUtils]: 109: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-28 06:02:51,107 INFO L290 TraceCheckUtils]: 108: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-28 06:02:51,107 INFO L272 TraceCheckUtils]: 107: Hoare triple {115442#(<= 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)); {114947#true} is VALID [2022-04-28 06:02:51,107 INFO L290 TraceCheckUtils]: 106: Hoare triple {115442#(<= main_~v~0 main_~r~0)} assume !!(#t~post7 < 100);havoc #t~post7; {115442#(<= main_~v~0 main_~r~0)} is VALID [2022-04-28 06:02:51,107 INFO L290 TraceCheckUtils]: 105: Hoare triple {115442#(<= main_~v~0 main_~r~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {115442#(<= main_~v~0 main_~r~0)} is VALID [2022-04-28 06:02:51,108 INFO L290 TraceCheckUtils]: 104: Hoare triple {115442#(<= main_~v~0 main_~r~0)} assume !!(0 != ~r~0); {115442#(<= main_~v~0 main_~r~0)} is VALID [2022-04-28 06:02:51,108 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {114947#true} {115442#(<= main_~v~0 main_~r~0)} #94#return; {115442#(<= main_~v~0 main_~r~0)} is VALID [2022-04-28 06:02:51,108 INFO L290 TraceCheckUtils]: 102: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-28 06:02:51,108 INFO L290 TraceCheckUtils]: 101: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-28 06:02:51,108 INFO L290 TraceCheckUtils]: 100: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-28 06:02:51,108 INFO L272 TraceCheckUtils]: 99: Hoare triple {115442#(<= 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)); {114947#true} is VALID [2022-04-28 06:02:51,109 INFO L290 TraceCheckUtils]: 98: Hoare triple {115442#(<= main_~v~0 main_~r~0)} assume !!(#t~post6 < 100);havoc #t~post6; {115442#(<= main_~v~0 main_~r~0)} is VALID [2022-04-28 06:02:51,109 INFO L290 TraceCheckUtils]: 97: Hoare triple {115442#(<= main_~v~0 main_~r~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {115442#(<= main_~v~0 main_~r~0)} is VALID [2022-04-28 06:02:51,109 INFO L290 TraceCheckUtils]: 96: Hoare triple {115442#(<= main_~v~0 main_~r~0)} assume !(~r~0 < 0); {115442#(<= main_~v~0 main_~r~0)} is VALID [2022-04-28 06:02:51,110 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {114947#true} {115442#(<= main_~v~0 main_~r~0)} #98#return; {115442#(<= main_~v~0 main_~r~0)} is VALID [2022-04-28 06:02:51,110 INFO L290 TraceCheckUtils]: 94: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-28 06:02:51,110 INFO L290 TraceCheckUtils]: 93: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-28 06:02:51,110 INFO L290 TraceCheckUtils]: 92: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-28 06:02:51,110 INFO L272 TraceCheckUtils]: 91: Hoare triple {115442#(<= 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)); {114947#true} is VALID [2022-04-28 06:02:51,111 INFO L290 TraceCheckUtils]: 90: Hoare triple {115442#(<= main_~v~0 main_~r~0)} assume !!(#t~post8 < 100);havoc #t~post8; {115442#(<= main_~v~0 main_~r~0)} is VALID [2022-04-28 06:02:51,111 INFO L290 TraceCheckUtils]: 89: Hoare triple {115442#(<= main_~v~0 main_~r~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {115442#(<= main_~v~0 main_~r~0)} is VALID [2022-04-28 06:02:51,115 INFO L290 TraceCheckUtils]: 88: Hoare triple {115515#(<= main_~v~0 (+ main_~u~0 main_~r~0))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {115442#(<= main_~v~0 main_~r~0)} is VALID [2022-04-28 06:02:51,115 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {114947#true} {115515#(<= main_~v~0 (+ main_~u~0 main_~r~0))} #98#return; {115515#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-28 06:02:51,115 INFO L290 TraceCheckUtils]: 86: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-28 06:02:51,116 INFO L290 TraceCheckUtils]: 85: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-28 06:02:51,116 INFO L290 TraceCheckUtils]: 84: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-28 06:02:51,116 INFO L272 TraceCheckUtils]: 83: Hoare triple {115515#(<= 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)); {114947#true} is VALID [2022-04-28 06:02:51,116 INFO L290 TraceCheckUtils]: 82: Hoare triple {115515#(<= main_~v~0 (+ main_~u~0 main_~r~0))} assume !!(#t~post8 < 100);havoc #t~post8; {115515#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-28 06:02:51,116 INFO L290 TraceCheckUtils]: 81: Hoare triple {115515#(<= main_~v~0 (+ main_~u~0 main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {115515#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-28 06:02:51,117 INFO L290 TraceCheckUtils]: 80: Hoare triple {115515#(<= main_~v~0 (+ main_~u~0 main_~r~0))} assume !(~r~0 > 0); {115515#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-28 06:02:51,117 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {114947#true} {115515#(<= main_~v~0 (+ main_~u~0 main_~r~0))} #96#return; {115515#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-28 06:02:51,117 INFO L290 TraceCheckUtils]: 78: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-28 06:02:51,117 INFO L290 TraceCheckUtils]: 77: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-28 06:02:51,117 INFO L290 TraceCheckUtils]: 76: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-28 06:02:51,117 INFO L272 TraceCheckUtils]: 75: Hoare triple {115515#(<= 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)); {114947#true} is VALID [2022-04-28 06:02:51,118 INFO L290 TraceCheckUtils]: 74: Hoare triple {115515#(<= main_~v~0 (+ main_~u~0 main_~r~0))} assume !!(#t~post7 < 100);havoc #t~post7; {115515#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-28 06:02:51,118 INFO L290 TraceCheckUtils]: 73: Hoare triple {115515#(<= main_~v~0 (+ main_~u~0 main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {115515#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-28 06:02:51,119 INFO L290 TraceCheckUtils]: 72: Hoare triple {115564#(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; {115515#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-28 06:02:51,119 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {114947#true} {115564#(or (not (< 0 main_~r~0)) (<= (+ (* main_~v~0 2) 2) (+ main_~u~0 main_~r~0)))} #96#return; {115564#(or (not (< 0 main_~r~0)) (<= (+ (* main_~v~0 2) 2) (+ main_~u~0 main_~r~0)))} is VALID [2022-04-28 06:02:51,119 INFO L290 TraceCheckUtils]: 70: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-28 06:02:51,119 INFO L290 TraceCheckUtils]: 69: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-28 06:02:51,120 INFO L290 TraceCheckUtils]: 68: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-28 06:02:51,120 INFO L272 TraceCheckUtils]: 67: Hoare triple {115564#(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)); {114947#true} is VALID [2022-04-28 06:02:51,120 INFO L290 TraceCheckUtils]: 66: Hoare triple {115564#(or (not (< 0 main_~r~0)) (<= (+ (* main_~v~0 2) 2) (+ main_~u~0 main_~r~0)))} assume !!(#t~post7 < 100);havoc #t~post7; {115564#(or (not (< 0 main_~r~0)) (<= (+ (* main_~v~0 2) 2) (+ main_~u~0 main_~r~0)))} is VALID [2022-04-28 06:02:51,120 INFO L290 TraceCheckUtils]: 65: Hoare triple {115564#(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; {115564#(or (not (< 0 main_~r~0)) (<= (+ (* main_~v~0 2) 2) (+ main_~u~0 main_~r~0)))} is VALID [2022-04-28 06:02:51,123 INFO L290 TraceCheckUtils]: 64: Hoare triple {115589#(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; {115564#(or (not (< 0 main_~r~0)) (<= (+ (* main_~v~0 2) 2) (+ main_~u~0 main_~r~0)))} is VALID [2022-04-28 06:02:51,124 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {114947#true} {115589#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} #96#return; {115589#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-28 06:02:51,124 INFO L290 TraceCheckUtils]: 62: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-28 06:02:51,124 INFO L290 TraceCheckUtils]: 61: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-28 06:02:51,124 INFO L290 TraceCheckUtils]: 60: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-28 06:02:51,124 INFO L272 TraceCheckUtils]: 59: Hoare triple {115589#(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)); {114947#true} is VALID [2022-04-28 06:02:51,125 INFO L290 TraceCheckUtils]: 58: Hoare triple {115589#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} assume !!(#t~post7 < 100);havoc #t~post7; {115589#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-28 06:02:51,125 INFO L290 TraceCheckUtils]: 57: Hoare triple {115589#(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; {115589#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-28 06:02:51,125 INFO L290 TraceCheckUtils]: 56: Hoare triple {115589#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} assume !!(0 != ~r~0); {115589#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-28 06:02:51,126 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {114947#true} {115589#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} #94#return; {115589#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-28 06:02:51,126 INFO L290 TraceCheckUtils]: 54: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-28 06:02:51,126 INFO L290 TraceCheckUtils]: 53: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-28 06:02:51,126 INFO L290 TraceCheckUtils]: 52: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-28 06:02:51,126 INFO L272 TraceCheckUtils]: 51: Hoare triple {115589#(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)); {114947#true} is VALID [2022-04-28 06:02:51,127 INFO L290 TraceCheckUtils]: 50: Hoare triple {115589#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} assume !!(#t~post6 < 100);havoc #t~post6; {115589#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-28 06:02:51,127 INFO L290 TraceCheckUtils]: 49: Hoare triple {115589#(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; {115589#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-28 06:02:51,127 INFO L290 TraceCheckUtils]: 48: Hoare triple {115589#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} assume !(~r~0 < 0); {115589#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-28 06:02:51,128 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {114947#true} {115589#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} #98#return; {115589#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-28 06:02:51,128 INFO L290 TraceCheckUtils]: 46: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-28 06:02:51,128 INFO L290 TraceCheckUtils]: 45: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-28 06:02:51,128 INFO L290 TraceCheckUtils]: 44: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-28 06:02:51,128 INFO L272 TraceCheckUtils]: 43: Hoare triple {115589#(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)); {114947#true} is VALID [2022-04-28 06:02:51,128 INFO L290 TraceCheckUtils]: 42: Hoare triple {115589#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} assume !!(#t~post8 < 100);havoc #t~post8; {115589#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-28 06:02:51,129 INFO L290 TraceCheckUtils]: 41: Hoare triple {115589#(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; {115589#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-28 06:02:51,134 INFO L290 TraceCheckUtils]: 40: Hoare triple {115662#(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; {115589#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-28 06:02:51,134 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {114947#true} {115662#(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; {115662#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} is VALID [2022-04-28 06:02:51,134 INFO L290 TraceCheckUtils]: 38: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-28 06:02:51,134 INFO L290 TraceCheckUtils]: 37: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-28 06:02:51,134 INFO L290 TraceCheckUtils]: 36: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-28 06:02:51,134 INFO L272 TraceCheckUtils]: 35: Hoare triple {115662#(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)); {114947#true} is VALID [2022-04-28 06:02:51,135 INFO L290 TraceCheckUtils]: 34: Hoare triple {115662#(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 < 100);havoc #t~post8; {115662#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} is VALID [2022-04-28 06:02:51,135 INFO L290 TraceCheckUtils]: 33: Hoare triple {115662#(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; {115662#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} is VALID [2022-04-28 06:02:51,136 INFO L290 TraceCheckUtils]: 32: Hoare triple {115662#(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); {115662#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} is VALID [2022-04-28 06:02:51,136 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {114947#true} {115662#(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; {115662#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} is VALID [2022-04-28 06:02:51,136 INFO L290 TraceCheckUtils]: 30: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-28 06:02:51,136 INFO L290 TraceCheckUtils]: 29: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-28 06:02:51,136 INFO L290 TraceCheckUtils]: 28: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-28 06:02:51,136 INFO L272 TraceCheckUtils]: 27: Hoare triple {115662#(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)); {114947#true} is VALID [2022-04-28 06:02:51,137 INFO L290 TraceCheckUtils]: 26: Hoare triple {115662#(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 < 100);havoc #t~post7; {115662#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} is VALID [2022-04-28 06:02:51,137 INFO L290 TraceCheckUtils]: 25: Hoare triple {115662#(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; {115662#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} is VALID [2022-04-28 06:02:51,137 INFO L290 TraceCheckUtils]: 24: Hoare triple {115662#(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); {115662#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} is VALID [2022-04-28 06:02:51,138 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {114947#true} {115662#(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; {115662#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} is VALID [2022-04-28 06:02:51,138 INFO L290 TraceCheckUtils]: 22: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-28 06:02:51,138 INFO L290 TraceCheckUtils]: 21: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-28 06:02:51,138 INFO L290 TraceCheckUtils]: 20: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-28 06:02:51,138 INFO L272 TraceCheckUtils]: 19: Hoare triple {115662#(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)); {114947#true} is VALID [2022-04-28 06:02:51,139 INFO L290 TraceCheckUtils]: 18: Hoare triple {115662#(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 < 100);havoc #t~post6; {115662#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} is VALID [2022-04-28 06:02:51,139 INFO L290 TraceCheckUtils]: 17: Hoare triple {115662#(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; {115662#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} is VALID [2022-04-28 06:02:51,141 INFO L290 TraceCheckUtils]: 16: Hoare triple {115735#(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; {115662#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} is VALID [2022-04-28 06:02:51,142 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {114992#(not (= |assume_abort_if_not_#in~cond| 0))} {114947#true} #92#return; {115735#(forall ((main_~R~0 Int)) (or (<= 2 main_~R~0) (<= (+ (* main_~R~0 main_~R~0) (* main_~R~0 2)) main_~A~0) (not (< (* main_~R~0 main_~R~0) main_~A~0))))} is VALID [2022-04-28 06:02:51,152 INFO L290 TraceCheckUtils]: 14: Hoare triple {114992#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {114992#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 06:02:51,153 INFO L290 TraceCheckUtils]: 13: Hoare triple {115748#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {114992#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 06:02:51,154 INFO L290 TraceCheckUtils]: 12: Hoare triple {114947#true} ~cond := #in~cond; {115748#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-28 06:02:51,154 INFO L272 TraceCheckUtils]: 11: Hoare triple {114947#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)); {114947#true} is VALID [2022-04-28 06:02:51,154 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {114947#true} {114947#true} #90#return; {114947#true} is VALID [2022-04-28 06:02:51,154 INFO L290 TraceCheckUtils]: 9: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-28 06:02:51,154 INFO L290 TraceCheckUtils]: 8: Hoare triple {114947#true} assume !(0 == ~cond); {114947#true} is VALID [2022-04-28 06:02:51,154 INFO L290 TraceCheckUtils]: 7: Hoare triple {114947#true} ~cond := #in~cond; {114947#true} is VALID [2022-04-28 06:02:51,154 INFO L272 TraceCheckUtils]: 6: Hoare triple {114947#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {114947#true} is VALID [2022-04-28 06:02:51,154 INFO L290 TraceCheckUtils]: 5: Hoare triple {114947#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; {114947#true} is VALID [2022-04-28 06:02:51,154 INFO L272 TraceCheckUtils]: 4: Hoare triple {114947#true} call #t~ret9 := main(); {114947#true} is VALID [2022-04-28 06:02:51,154 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {114947#true} {114947#true} #102#return; {114947#true} is VALID [2022-04-28 06:02:51,154 INFO L290 TraceCheckUtils]: 2: Hoare triple {114947#true} assume true; {114947#true} is VALID [2022-04-28 06:02:51,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {114947#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; {114947#true} is VALID [2022-04-28 06:02:51,155 INFO L272 TraceCheckUtils]: 0: Hoare triple {114947#true} call ULTIMATE.init(); {114947#true} is VALID [2022-04-28 06:02:51,155 INFO L134 CoverageAnalysis]: Checked inductivity of 524 backedges. 67 proven. 92 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2022-04-28 06:02:51,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:02:51,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509094460] [2022-04-28 06:02:51,155 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:02:51,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508541799] [2022-04-28 06:02:51,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [508541799] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:02:51,155 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:02:51,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2022-04-28 06:02:51,156 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:02:51,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [805675628] [2022-04-28 06:02:51,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [805675628] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:02:51,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:02:51,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 06:02:51,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76437143] [2022-04-28 06:02:51,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:02:51,156 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 states have internal predecessors, (62), 8 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 8 states have call predecessors, (17), 7 states have call successors, (17) Word has length 137 [2022-04-28 06:02:51,157 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:02:51,157 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 states have internal predecessors, (62), 8 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 8 states have call predecessors, (17), 7 states have call successors, (17) [2022-04-28 06:03:00,376 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 94 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-28 06:03:00,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 06:03:00,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:03:00,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 06:03:00,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2022-04-28 06:03:00,377 INFO L87 Difference]: Start difference. First operand 707 states and 950 transitions. Second operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 states have internal predecessors, (62), 8 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 8 states have call predecessors, (17), 7 states have call successors, (17) [2022-04-28 06:03:08,398 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 06:03:12,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:03:12,883 INFO L93 Difference]: Finished difference Result 964 states and 1336 transitions. [2022-04-28 06:03:12,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 06:03:12,883 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 states have internal predecessors, (62), 8 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 8 states have call predecessors, (17), 7 states have call successors, (17) Word has length 137 [2022-04-28 06:03:12,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:03:12,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 states have internal predecessors, (62), 8 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 8 states have call predecessors, (17), 7 states have call successors, (17) [2022-04-28 06:03:12,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 161 transitions. [2022-04-28 06:03:12,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 states have internal predecessors, (62), 8 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 8 states have call predecessors, (17), 7 states have call successors, (17) [2022-04-28 06:03:12,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 161 transitions. [2022-04-28 06:03:12,886 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 161 transitions. [2022-04-28 06:03:21,032 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 158 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 06:03:21,062 INFO L225 Difference]: With dead ends: 964 [2022-04-28 06:03:21,063 INFO L226 Difference]: Without dead ends: 851 [2022-04-28 06:03:21,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2022-04-28 06:03:21,063 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 28 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 218 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-04-28 06:03:21,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 484 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 58 Invalid, 1 Unknown, 218 Unchecked, 3.0s Time] [2022-04-28 06:03:21,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2022-04-28 06:03:23,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 707. [2022-04-28 06:03:23,439 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:03:23,440 INFO L82 GeneralOperation]: Start isEquivalent. First operand 851 states. Second operand has 707 states, 525 states have (on average 1.1923809523809523) internal successors, (626), 542 states have internal predecessors, (626), 163 states have call successors, (163), 20 states have call predecessors, (163), 18 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) [2022-04-28 06:03:23,441 INFO L74 IsIncluded]: Start isIncluded. First operand 851 states. Second operand has 707 states, 525 states have (on average 1.1923809523809523) internal successors, (626), 542 states have internal predecessors, (626), 163 states have call successors, (163), 20 states have call predecessors, (163), 18 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) [2022-04-28 06:03:23,441 INFO L87 Difference]: Start difference. First operand 851 states. Second operand has 707 states, 525 states have (on average 1.1923809523809523) internal successors, (626), 542 states have internal predecessors, (626), 163 states have call successors, (163), 20 states have call predecessors, (163), 18 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) [2022-04-28 06:03:23,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:03:23,470 INFO L93 Difference]: Finished difference Result 851 states and 1168 transitions. [2022-04-28 06:03:23,470 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1168 transitions. [2022-04-28 06:03:23,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:03:23,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:03:23,472 INFO L74 IsIncluded]: Start isIncluded. First operand has 707 states, 525 states have (on average 1.1923809523809523) internal successors, (626), 542 states have internal predecessors, (626), 163 states have call successors, (163), 20 states have call predecessors, (163), 18 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) Second operand 851 states. [2022-04-28 06:03:23,472 INFO L87 Difference]: Start difference. First operand has 707 states, 525 states have (on average 1.1923809523809523) internal successors, (626), 542 states have internal predecessors, (626), 163 states have call successors, (163), 20 states have call predecessors, (163), 18 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) Second operand 851 states. [2022-04-28 06:03:23,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:03:23,498 INFO L93 Difference]: Finished difference Result 851 states and 1168 transitions. [2022-04-28 06:03:23,498 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1168 transitions. [2022-04-28 06:03:23,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:03:23,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:03:23,499 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:03:23,500 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:03:23,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 525 states have (on average 1.1923809523809523) internal successors, (626), 542 states have internal predecessors, (626), 163 states have call successors, (163), 20 states have call predecessors, (163), 18 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) [2022-04-28 06:03:23,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 950 transitions. [2022-04-28 06:03:23,524 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 950 transitions. Word has length 137 [2022-04-28 06:03:23,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:03:23,524 INFO L495 AbstractCegarLoop]: Abstraction has 707 states and 950 transitions. [2022-04-28 06:03:23,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 states have internal predecessors, (62), 8 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 8 states have call predecessors, (17), 7 states have call successors, (17) [2022-04-28 06:03:23,525 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 707 states and 950 transitions. [2022-04-28 06:03:32,348 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 950 edges. 950 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:03:32,348 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 950 transitions. [2022-04-28 06:03:32,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-04-28 06:03:32,349 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:03:32,349 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 7, 7, 7, 7, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:03:32,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2022-04-28 06:03:32,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:03:32,550 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:03:32,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:03:32,550 INFO L85 PathProgramCache]: Analyzing trace with hash -134259028, now seen corresponding path program 23 times [2022-04-28 06:03:32,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:03:32,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [955254271] [2022-04-28 06:03:32,551 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:03:32,551 INFO L85 PathProgramCache]: Analyzing trace with hash -134259028, now seen corresponding path program 24 times [2022-04-28 06:03:32,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:03:32,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917627503] [2022-04-28 06:03:32,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:03:32,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:03:32,564 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:03:32,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1574797942] [2022-04-28 06:03:32,564 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 06:03:32,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:03:32,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:03:32,565 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:03:32,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-04-28 06:03:32,740 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-28 06:03:32,741 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:03:32,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-28 06:03:32,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:03:32,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:03:33,534 INFO L272 TraceCheckUtils]: 0: Hoare triple {120837#true} call ULTIMATE.init(); {120837#true} is VALID [2022-04-28 06:03:33,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {120837#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; {120845#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:33,535 INFO L290 TraceCheckUtils]: 2: Hoare triple {120845#(<= ~counter~0 0)} assume true; {120845#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:33,535 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {120845#(<= ~counter~0 0)} {120837#true} #102#return; {120845#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:33,536 INFO L272 TraceCheckUtils]: 4: Hoare triple {120845#(<= ~counter~0 0)} call #t~ret9 := main(); {120845#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:33,536 INFO L290 TraceCheckUtils]: 5: Hoare triple {120845#(<= ~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; {120845#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:33,536 INFO L272 TraceCheckUtils]: 6: Hoare triple {120845#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {120845#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:33,537 INFO L290 TraceCheckUtils]: 7: Hoare triple {120845#(<= ~counter~0 0)} ~cond := #in~cond; {120845#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:33,537 INFO L290 TraceCheckUtils]: 8: Hoare triple {120845#(<= ~counter~0 0)} assume !(0 == ~cond); {120845#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:33,537 INFO L290 TraceCheckUtils]: 9: Hoare triple {120845#(<= ~counter~0 0)} assume true; {120845#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:33,538 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {120845#(<= ~counter~0 0)} {120845#(<= ~counter~0 0)} #90#return; {120845#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:33,538 INFO L272 TraceCheckUtils]: 11: Hoare triple {120845#(<= ~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)); {120845#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:33,538 INFO L290 TraceCheckUtils]: 12: Hoare triple {120845#(<= ~counter~0 0)} ~cond := #in~cond; {120845#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:33,539 INFO L290 TraceCheckUtils]: 13: Hoare triple {120845#(<= ~counter~0 0)} assume !(0 == ~cond); {120845#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:33,539 INFO L290 TraceCheckUtils]: 14: Hoare triple {120845#(<= ~counter~0 0)} assume true; {120845#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:33,539 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {120845#(<= ~counter~0 0)} {120845#(<= ~counter~0 0)} #92#return; {120845#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:33,539 INFO L290 TraceCheckUtils]: 16: Hoare triple {120845#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {120845#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:33,542 INFO L290 TraceCheckUtils]: 17: Hoare triple {120845#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {120894#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:33,542 INFO L290 TraceCheckUtils]: 18: Hoare triple {120894#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {120894#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:33,543 INFO L272 TraceCheckUtils]: 19: Hoare triple {120894#(<= ~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)); {120894#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:33,543 INFO L290 TraceCheckUtils]: 20: Hoare triple {120894#(<= ~counter~0 1)} ~cond := #in~cond; {120894#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:33,543 INFO L290 TraceCheckUtils]: 21: Hoare triple {120894#(<= ~counter~0 1)} assume !(0 == ~cond); {120894#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:33,543 INFO L290 TraceCheckUtils]: 22: Hoare triple {120894#(<= ~counter~0 1)} assume true; {120894#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:33,544 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {120894#(<= ~counter~0 1)} {120894#(<= ~counter~0 1)} #94#return; {120894#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:33,544 INFO L290 TraceCheckUtils]: 24: Hoare triple {120894#(<= ~counter~0 1)} assume !!(0 != ~r~0); {120894#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:33,545 INFO L290 TraceCheckUtils]: 25: Hoare triple {120894#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {120919#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:33,545 INFO L290 TraceCheckUtils]: 26: Hoare triple {120919#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {120919#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:33,546 INFO L272 TraceCheckUtils]: 27: Hoare triple {120919#(<= ~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)); {120919#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:33,546 INFO L290 TraceCheckUtils]: 28: Hoare triple {120919#(<= ~counter~0 2)} ~cond := #in~cond; {120919#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:33,546 INFO L290 TraceCheckUtils]: 29: Hoare triple {120919#(<= ~counter~0 2)} assume !(0 == ~cond); {120919#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:33,547 INFO L290 TraceCheckUtils]: 30: Hoare triple {120919#(<= ~counter~0 2)} assume true; {120919#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:33,547 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {120919#(<= ~counter~0 2)} {120919#(<= ~counter~0 2)} #96#return; {120919#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:33,547 INFO L290 TraceCheckUtils]: 32: Hoare triple {120919#(<= ~counter~0 2)} assume !(~r~0 > 0); {120919#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:33,548 INFO L290 TraceCheckUtils]: 33: Hoare triple {120919#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {120944#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:33,549 INFO L290 TraceCheckUtils]: 34: Hoare triple {120944#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {120944#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:33,549 INFO L272 TraceCheckUtils]: 35: Hoare triple {120944#(<= ~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)); {120944#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:33,549 INFO L290 TraceCheckUtils]: 36: Hoare triple {120944#(<= ~counter~0 3)} ~cond := #in~cond; {120944#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:33,550 INFO L290 TraceCheckUtils]: 37: Hoare triple {120944#(<= ~counter~0 3)} assume !(0 == ~cond); {120944#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:33,550 INFO L290 TraceCheckUtils]: 38: Hoare triple {120944#(<= ~counter~0 3)} assume true; {120944#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:33,550 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {120944#(<= ~counter~0 3)} {120944#(<= ~counter~0 3)} #98#return; {120944#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:33,551 INFO L290 TraceCheckUtils]: 40: Hoare triple {120944#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {120944#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:33,552 INFO L290 TraceCheckUtils]: 41: Hoare triple {120944#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {120969#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:33,552 INFO L290 TraceCheckUtils]: 42: Hoare triple {120969#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {120969#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:33,552 INFO L272 TraceCheckUtils]: 43: Hoare triple {120969#(<= ~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)); {120969#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:33,553 INFO L290 TraceCheckUtils]: 44: Hoare triple {120969#(<= ~counter~0 4)} ~cond := #in~cond; {120969#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:33,553 INFO L290 TraceCheckUtils]: 45: Hoare triple {120969#(<= ~counter~0 4)} assume !(0 == ~cond); {120969#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:33,553 INFO L290 TraceCheckUtils]: 46: Hoare triple {120969#(<= ~counter~0 4)} assume true; {120969#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:33,554 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {120969#(<= ~counter~0 4)} {120969#(<= ~counter~0 4)} #98#return; {120969#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:33,554 INFO L290 TraceCheckUtils]: 48: Hoare triple {120969#(<= ~counter~0 4)} assume !(~r~0 < 0); {120969#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:33,555 INFO L290 TraceCheckUtils]: 49: Hoare triple {120969#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {120994#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:33,555 INFO L290 TraceCheckUtils]: 50: Hoare triple {120994#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {120994#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:33,556 INFO L272 TraceCheckUtils]: 51: Hoare triple {120994#(<= ~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)); {120994#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:33,556 INFO L290 TraceCheckUtils]: 52: Hoare triple {120994#(<= ~counter~0 5)} ~cond := #in~cond; {120994#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:33,556 INFO L290 TraceCheckUtils]: 53: Hoare triple {120994#(<= ~counter~0 5)} assume !(0 == ~cond); {120994#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:33,556 INFO L290 TraceCheckUtils]: 54: Hoare triple {120994#(<= ~counter~0 5)} assume true; {120994#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:33,557 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {120994#(<= ~counter~0 5)} {120994#(<= ~counter~0 5)} #94#return; {120994#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:33,557 INFO L290 TraceCheckUtils]: 56: Hoare triple {120994#(<= ~counter~0 5)} assume !!(0 != ~r~0); {120994#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:33,558 INFO L290 TraceCheckUtils]: 57: Hoare triple {120994#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {121019#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:33,558 INFO L290 TraceCheckUtils]: 58: Hoare triple {121019#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {121019#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:33,559 INFO L272 TraceCheckUtils]: 59: Hoare triple {121019#(<= ~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)); {121019#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:33,559 INFO L290 TraceCheckUtils]: 60: Hoare triple {121019#(<= ~counter~0 6)} ~cond := #in~cond; {121019#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:33,559 INFO L290 TraceCheckUtils]: 61: Hoare triple {121019#(<= ~counter~0 6)} assume !(0 == ~cond); {121019#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:33,560 INFO L290 TraceCheckUtils]: 62: Hoare triple {121019#(<= ~counter~0 6)} assume true; {121019#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:33,560 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {121019#(<= ~counter~0 6)} {121019#(<= ~counter~0 6)} #96#return; {121019#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:33,560 INFO L290 TraceCheckUtils]: 64: Hoare triple {121019#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {121019#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:33,561 INFO L290 TraceCheckUtils]: 65: Hoare triple {121019#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {121044#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:33,562 INFO L290 TraceCheckUtils]: 66: Hoare triple {121044#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {121044#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:33,562 INFO L272 TraceCheckUtils]: 67: Hoare triple {121044#(<= ~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)); {121044#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:33,562 INFO L290 TraceCheckUtils]: 68: Hoare triple {121044#(<= ~counter~0 7)} ~cond := #in~cond; {121044#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:33,563 INFO L290 TraceCheckUtils]: 69: Hoare triple {121044#(<= ~counter~0 7)} assume !(0 == ~cond); {121044#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:33,563 INFO L290 TraceCheckUtils]: 70: Hoare triple {121044#(<= ~counter~0 7)} assume true; {121044#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:33,563 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {121044#(<= ~counter~0 7)} {121044#(<= ~counter~0 7)} #96#return; {121044#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:33,564 INFO L290 TraceCheckUtils]: 72: Hoare triple {121044#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {121044#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:33,565 INFO L290 TraceCheckUtils]: 73: Hoare triple {121044#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {121069#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:33,565 INFO L290 TraceCheckUtils]: 74: Hoare triple {121069#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {121069#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:33,565 INFO L272 TraceCheckUtils]: 75: Hoare triple {121069#(<= ~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)); {121069#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:33,566 INFO L290 TraceCheckUtils]: 76: Hoare triple {121069#(<= ~counter~0 8)} ~cond := #in~cond; {121069#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:33,566 INFO L290 TraceCheckUtils]: 77: Hoare triple {121069#(<= ~counter~0 8)} assume !(0 == ~cond); {121069#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:33,566 INFO L290 TraceCheckUtils]: 78: Hoare triple {121069#(<= ~counter~0 8)} assume true; {121069#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:33,567 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {121069#(<= ~counter~0 8)} {121069#(<= ~counter~0 8)} #96#return; {121069#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:33,567 INFO L290 TraceCheckUtils]: 80: Hoare triple {121069#(<= ~counter~0 8)} assume !(~r~0 > 0); {121069#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:33,568 INFO L290 TraceCheckUtils]: 81: Hoare triple {121069#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {121094#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:33,568 INFO L290 TraceCheckUtils]: 82: Hoare triple {121094#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {121094#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:33,569 INFO L272 TraceCheckUtils]: 83: Hoare triple {121094#(<= ~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)); {121094#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:33,569 INFO L290 TraceCheckUtils]: 84: Hoare triple {121094#(<= ~counter~0 9)} ~cond := #in~cond; {121094#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:33,569 INFO L290 TraceCheckUtils]: 85: Hoare triple {121094#(<= ~counter~0 9)} assume !(0 == ~cond); {121094#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:33,570 INFO L290 TraceCheckUtils]: 86: Hoare triple {121094#(<= ~counter~0 9)} assume true; {121094#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:33,570 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {121094#(<= ~counter~0 9)} {121094#(<= ~counter~0 9)} #98#return; {121094#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:33,570 INFO L290 TraceCheckUtils]: 88: Hoare triple {121094#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {121094#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:33,572 INFO L290 TraceCheckUtils]: 89: Hoare triple {121094#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {121119#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:33,572 INFO L290 TraceCheckUtils]: 90: Hoare triple {121119#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {121119#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:33,572 INFO L272 TraceCheckUtils]: 91: Hoare triple {121119#(<= ~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)); {121119#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:33,573 INFO L290 TraceCheckUtils]: 92: Hoare triple {121119#(<= ~counter~0 10)} ~cond := #in~cond; {121119#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:33,573 INFO L290 TraceCheckUtils]: 93: Hoare triple {121119#(<= ~counter~0 10)} assume !(0 == ~cond); {121119#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:33,573 INFO L290 TraceCheckUtils]: 94: Hoare triple {121119#(<= ~counter~0 10)} assume true; {121119#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:33,574 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {121119#(<= ~counter~0 10)} {121119#(<= ~counter~0 10)} #98#return; {121119#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:33,574 INFO L290 TraceCheckUtils]: 96: Hoare triple {121119#(<= ~counter~0 10)} assume !(~r~0 < 0); {121119#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:33,575 INFO L290 TraceCheckUtils]: 97: Hoare triple {121119#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {121144#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:33,575 INFO L290 TraceCheckUtils]: 98: Hoare triple {121144#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {121144#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:33,576 INFO L272 TraceCheckUtils]: 99: Hoare triple {121144#(<= ~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)); {121144#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:33,576 INFO L290 TraceCheckUtils]: 100: Hoare triple {121144#(<= ~counter~0 11)} ~cond := #in~cond; {121144#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:33,576 INFO L290 TraceCheckUtils]: 101: Hoare triple {121144#(<= ~counter~0 11)} assume !(0 == ~cond); {121144#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:33,576 INFO L290 TraceCheckUtils]: 102: Hoare triple {121144#(<= ~counter~0 11)} assume true; {121144#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:33,577 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {121144#(<= ~counter~0 11)} {121144#(<= ~counter~0 11)} #94#return; {121144#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:33,577 INFO L290 TraceCheckUtils]: 104: Hoare triple {121144#(<= ~counter~0 11)} assume !!(0 != ~r~0); {121144#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:33,578 INFO L290 TraceCheckUtils]: 105: Hoare triple {121144#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {121169#(<= ~counter~0 12)} is VALID [2022-04-28 06:03:33,578 INFO L290 TraceCheckUtils]: 106: Hoare triple {121169#(<= ~counter~0 12)} assume !!(#t~post7 < 100);havoc #t~post7; {121169#(<= ~counter~0 12)} is VALID [2022-04-28 06:03:33,579 INFO L272 TraceCheckUtils]: 107: Hoare triple {121169#(<= ~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)); {121169#(<= ~counter~0 12)} is VALID [2022-04-28 06:03:33,579 INFO L290 TraceCheckUtils]: 108: Hoare triple {121169#(<= ~counter~0 12)} ~cond := #in~cond; {121169#(<= ~counter~0 12)} is VALID [2022-04-28 06:03:33,579 INFO L290 TraceCheckUtils]: 109: Hoare triple {121169#(<= ~counter~0 12)} assume !(0 == ~cond); {121169#(<= ~counter~0 12)} is VALID [2022-04-28 06:03:33,580 INFO L290 TraceCheckUtils]: 110: Hoare triple {121169#(<= ~counter~0 12)} assume true; {121169#(<= ~counter~0 12)} is VALID [2022-04-28 06:03:33,580 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {121169#(<= ~counter~0 12)} {121169#(<= ~counter~0 12)} #96#return; {121169#(<= ~counter~0 12)} is VALID [2022-04-28 06:03:33,580 INFO L290 TraceCheckUtils]: 112: Hoare triple {121169#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {121169#(<= ~counter~0 12)} is VALID [2022-04-28 06:03:33,582 INFO L290 TraceCheckUtils]: 113: Hoare triple {121169#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {121194#(<= ~counter~0 13)} is VALID [2022-04-28 06:03:33,582 INFO L290 TraceCheckUtils]: 114: Hoare triple {121194#(<= ~counter~0 13)} assume !!(#t~post7 < 100);havoc #t~post7; {121194#(<= ~counter~0 13)} is VALID [2022-04-28 06:03:33,583 INFO L272 TraceCheckUtils]: 115: Hoare triple {121194#(<= ~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)); {121194#(<= ~counter~0 13)} is VALID [2022-04-28 06:03:33,583 INFO L290 TraceCheckUtils]: 116: Hoare triple {121194#(<= ~counter~0 13)} ~cond := #in~cond; {121194#(<= ~counter~0 13)} is VALID [2022-04-28 06:03:33,584 INFO L290 TraceCheckUtils]: 117: Hoare triple {121194#(<= ~counter~0 13)} assume !(0 == ~cond); {121194#(<= ~counter~0 13)} is VALID [2022-04-28 06:03:33,584 INFO L290 TraceCheckUtils]: 118: Hoare triple {121194#(<= ~counter~0 13)} assume true; {121194#(<= ~counter~0 13)} is VALID [2022-04-28 06:03:33,585 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {121194#(<= ~counter~0 13)} {121194#(<= ~counter~0 13)} #96#return; {121194#(<= ~counter~0 13)} is VALID [2022-04-28 06:03:33,585 INFO L290 TraceCheckUtils]: 120: Hoare triple {121194#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {121194#(<= ~counter~0 13)} is VALID [2022-04-28 06:03:33,586 INFO L290 TraceCheckUtils]: 121: Hoare triple {121194#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {121219#(<= ~counter~0 14)} is VALID [2022-04-28 06:03:33,586 INFO L290 TraceCheckUtils]: 122: Hoare triple {121219#(<= ~counter~0 14)} assume !!(#t~post7 < 100);havoc #t~post7; {121219#(<= ~counter~0 14)} is VALID [2022-04-28 06:03:33,587 INFO L272 TraceCheckUtils]: 123: Hoare triple {121219#(<= ~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)); {121219#(<= ~counter~0 14)} is VALID [2022-04-28 06:03:33,587 INFO L290 TraceCheckUtils]: 124: Hoare triple {121219#(<= ~counter~0 14)} ~cond := #in~cond; {121219#(<= ~counter~0 14)} is VALID [2022-04-28 06:03:33,587 INFO L290 TraceCheckUtils]: 125: Hoare triple {121219#(<= ~counter~0 14)} assume !(0 == ~cond); {121219#(<= ~counter~0 14)} is VALID [2022-04-28 06:03:33,588 INFO L290 TraceCheckUtils]: 126: Hoare triple {121219#(<= ~counter~0 14)} assume true; {121219#(<= ~counter~0 14)} is VALID [2022-04-28 06:03:33,588 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {121219#(<= ~counter~0 14)} {121219#(<= ~counter~0 14)} #96#return; {121219#(<= ~counter~0 14)} is VALID [2022-04-28 06:03:33,588 INFO L290 TraceCheckUtils]: 128: Hoare triple {121219#(<= ~counter~0 14)} assume !(~r~0 > 0); {121219#(<= ~counter~0 14)} is VALID [2022-04-28 06:03:33,590 INFO L290 TraceCheckUtils]: 129: Hoare triple {121219#(<= ~counter~0 14)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {121244#(<= ~counter~0 15)} is VALID [2022-04-28 06:03:33,590 INFO L290 TraceCheckUtils]: 130: Hoare triple {121244#(<= ~counter~0 15)} assume !(#t~post8 < 100);havoc #t~post8; {121244#(<= ~counter~0 15)} is VALID [2022-04-28 06:03:33,590 INFO L290 TraceCheckUtils]: 131: Hoare triple {121244#(<= ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {121251#(<= |main_#t~post6| 15)} is VALID [2022-04-28 06:03:33,590 INFO L290 TraceCheckUtils]: 132: Hoare triple {121251#(<= |main_#t~post6| 15)} assume !(#t~post6 < 100);havoc #t~post6; {120838#false} is VALID [2022-04-28 06:03:33,591 INFO L272 TraceCheckUtils]: 133: Hoare triple {120838#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)); {120838#false} is VALID [2022-04-28 06:03:33,591 INFO L290 TraceCheckUtils]: 134: Hoare triple {120838#false} ~cond := #in~cond; {120838#false} is VALID [2022-04-28 06:03:33,591 INFO L290 TraceCheckUtils]: 135: Hoare triple {120838#false} assume 0 == ~cond; {120838#false} is VALID [2022-04-28 06:03:33,591 INFO L290 TraceCheckUtils]: 136: Hoare triple {120838#false} assume !false; {120838#false} is VALID [2022-04-28 06:03:33,591 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 28 proven. 498 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 06:03:33,591 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:03:34,570 INFO L290 TraceCheckUtils]: 136: Hoare triple {120838#false} assume !false; {120838#false} is VALID [2022-04-28 06:03:34,571 INFO L290 TraceCheckUtils]: 135: Hoare triple {120838#false} assume 0 == ~cond; {120838#false} is VALID [2022-04-28 06:03:34,571 INFO L290 TraceCheckUtils]: 134: Hoare triple {120838#false} ~cond := #in~cond; {120838#false} is VALID [2022-04-28 06:03:34,571 INFO L272 TraceCheckUtils]: 133: Hoare triple {120838#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)); {120838#false} is VALID [2022-04-28 06:03:34,571 INFO L290 TraceCheckUtils]: 132: Hoare triple {121279#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {120838#false} is VALID [2022-04-28 06:03:34,571 INFO L290 TraceCheckUtils]: 131: Hoare triple {121283#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {121279#(< |main_#t~post6| 100)} is VALID [2022-04-28 06:03:34,572 INFO L290 TraceCheckUtils]: 130: Hoare triple {121283#(< ~counter~0 100)} assume !(#t~post8 < 100);havoc #t~post8; {121283#(< ~counter~0 100)} is VALID [2022-04-28 06:03:34,574 INFO L290 TraceCheckUtils]: 129: Hoare triple {121290#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {121283#(< ~counter~0 100)} is VALID [2022-04-28 06:03:34,574 INFO L290 TraceCheckUtils]: 128: Hoare triple {121290#(< ~counter~0 99)} assume !(~r~0 > 0); {121290#(< ~counter~0 99)} is VALID [2022-04-28 06:03:34,575 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {120837#true} {121290#(< ~counter~0 99)} #96#return; {121290#(< ~counter~0 99)} is VALID [2022-04-28 06:03:34,575 INFO L290 TraceCheckUtils]: 126: Hoare triple {120837#true} assume true; {120837#true} is VALID [2022-04-28 06:03:34,575 INFO L290 TraceCheckUtils]: 125: Hoare triple {120837#true} assume !(0 == ~cond); {120837#true} is VALID [2022-04-28 06:03:34,575 INFO L290 TraceCheckUtils]: 124: Hoare triple {120837#true} ~cond := #in~cond; {120837#true} is VALID [2022-04-28 06:03:34,575 INFO L272 TraceCheckUtils]: 123: Hoare triple {121290#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {120837#true} is VALID [2022-04-28 06:03:34,575 INFO L290 TraceCheckUtils]: 122: Hoare triple {121290#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {121290#(< ~counter~0 99)} is VALID [2022-04-28 06:03:34,576 INFO L290 TraceCheckUtils]: 121: Hoare triple {121315#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {121290#(< ~counter~0 99)} is VALID [2022-04-28 06:03:34,577 INFO L290 TraceCheckUtils]: 120: Hoare triple {121315#(< ~counter~0 98)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {121315#(< ~counter~0 98)} is VALID [2022-04-28 06:03:34,577 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {120837#true} {121315#(< ~counter~0 98)} #96#return; {121315#(< ~counter~0 98)} is VALID [2022-04-28 06:03:34,577 INFO L290 TraceCheckUtils]: 118: Hoare triple {120837#true} assume true; {120837#true} is VALID [2022-04-28 06:03:34,577 INFO L290 TraceCheckUtils]: 117: Hoare triple {120837#true} assume !(0 == ~cond); {120837#true} is VALID [2022-04-28 06:03:34,577 INFO L290 TraceCheckUtils]: 116: Hoare triple {120837#true} ~cond := #in~cond; {120837#true} is VALID [2022-04-28 06:03:34,577 INFO L272 TraceCheckUtils]: 115: Hoare triple {121315#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {120837#true} is VALID [2022-04-28 06:03:34,578 INFO L290 TraceCheckUtils]: 114: Hoare triple {121315#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {121315#(< ~counter~0 98)} is VALID [2022-04-28 06:03:34,579 INFO L290 TraceCheckUtils]: 113: Hoare triple {121340#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {121315#(< ~counter~0 98)} is VALID [2022-04-28 06:03:34,579 INFO L290 TraceCheckUtils]: 112: Hoare triple {121340#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {121340#(< ~counter~0 97)} is VALID [2022-04-28 06:03:34,579 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {120837#true} {121340#(< ~counter~0 97)} #96#return; {121340#(< ~counter~0 97)} is VALID [2022-04-28 06:03:34,579 INFO L290 TraceCheckUtils]: 110: Hoare triple {120837#true} assume true; {120837#true} is VALID [2022-04-28 06:03:34,580 INFO L290 TraceCheckUtils]: 109: Hoare triple {120837#true} assume !(0 == ~cond); {120837#true} is VALID [2022-04-28 06:03:34,580 INFO L290 TraceCheckUtils]: 108: Hoare triple {120837#true} ~cond := #in~cond; {120837#true} is VALID [2022-04-28 06:03:34,580 INFO L272 TraceCheckUtils]: 107: Hoare triple {121340#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {120837#true} is VALID [2022-04-28 06:03:34,580 INFO L290 TraceCheckUtils]: 106: Hoare triple {121340#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {121340#(< ~counter~0 97)} is VALID [2022-04-28 06:03:34,581 INFO L290 TraceCheckUtils]: 105: Hoare triple {121365#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {121340#(< ~counter~0 97)} is VALID [2022-04-28 06:03:34,581 INFO L290 TraceCheckUtils]: 104: Hoare triple {121365#(< ~counter~0 96)} assume !!(0 != ~r~0); {121365#(< ~counter~0 96)} is VALID [2022-04-28 06:03:34,582 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {120837#true} {121365#(< ~counter~0 96)} #94#return; {121365#(< ~counter~0 96)} is VALID [2022-04-28 06:03:34,582 INFO L290 TraceCheckUtils]: 102: Hoare triple {120837#true} assume true; {120837#true} is VALID [2022-04-28 06:03:34,582 INFO L290 TraceCheckUtils]: 101: Hoare triple {120837#true} assume !(0 == ~cond); {120837#true} is VALID [2022-04-28 06:03:34,582 INFO L290 TraceCheckUtils]: 100: Hoare triple {120837#true} ~cond := #in~cond; {120837#true} is VALID [2022-04-28 06:03:34,582 INFO L272 TraceCheckUtils]: 99: Hoare triple {121365#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {120837#true} is VALID [2022-04-28 06:03:34,582 INFO L290 TraceCheckUtils]: 98: Hoare triple {121365#(< ~counter~0 96)} assume !!(#t~post6 < 100);havoc #t~post6; {121365#(< ~counter~0 96)} is VALID [2022-04-28 06:03:34,583 INFO L290 TraceCheckUtils]: 97: Hoare triple {121390#(< ~counter~0 95)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {121365#(< ~counter~0 96)} is VALID [2022-04-28 06:03:34,583 INFO L290 TraceCheckUtils]: 96: Hoare triple {121390#(< ~counter~0 95)} assume !(~r~0 < 0); {121390#(< ~counter~0 95)} is VALID [2022-04-28 06:03:34,584 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {120837#true} {121390#(< ~counter~0 95)} #98#return; {121390#(< ~counter~0 95)} is VALID [2022-04-28 06:03:34,584 INFO L290 TraceCheckUtils]: 94: Hoare triple {120837#true} assume true; {120837#true} is VALID [2022-04-28 06:03:34,584 INFO L290 TraceCheckUtils]: 93: Hoare triple {120837#true} assume !(0 == ~cond); {120837#true} is VALID [2022-04-28 06:03:34,584 INFO L290 TraceCheckUtils]: 92: Hoare triple {120837#true} ~cond := #in~cond; {120837#true} is VALID [2022-04-28 06:03:34,584 INFO L272 TraceCheckUtils]: 91: Hoare triple {121390#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {120837#true} is VALID [2022-04-28 06:03:34,584 INFO L290 TraceCheckUtils]: 90: Hoare triple {121390#(< ~counter~0 95)} assume !!(#t~post8 < 100);havoc #t~post8; {121390#(< ~counter~0 95)} is VALID [2022-04-28 06:03:34,586 INFO L290 TraceCheckUtils]: 89: Hoare triple {121415#(< ~counter~0 94)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {121390#(< ~counter~0 95)} is VALID [2022-04-28 06:03:34,586 INFO L290 TraceCheckUtils]: 88: Hoare triple {121415#(< ~counter~0 94)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {121415#(< ~counter~0 94)} is VALID [2022-04-28 06:03:34,586 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {120837#true} {121415#(< ~counter~0 94)} #98#return; {121415#(< ~counter~0 94)} is VALID [2022-04-28 06:03:34,586 INFO L290 TraceCheckUtils]: 86: Hoare triple {120837#true} assume true; {120837#true} is VALID [2022-04-28 06:03:34,586 INFO L290 TraceCheckUtils]: 85: Hoare triple {120837#true} assume !(0 == ~cond); {120837#true} is VALID [2022-04-28 06:03:34,586 INFO L290 TraceCheckUtils]: 84: Hoare triple {120837#true} ~cond := #in~cond; {120837#true} is VALID [2022-04-28 06:03:34,587 INFO L272 TraceCheckUtils]: 83: Hoare triple {121415#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {120837#true} is VALID [2022-04-28 06:03:34,587 INFO L290 TraceCheckUtils]: 82: Hoare triple {121415#(< ~counter~0 94)} assume !!(#t~post8 < 100);havoc #t~post8; {121415#(< ~counter~0 94)} is VALID [2022-04-28 06:03:34,588 INFO L290 TraceCheckUtils]: 81: Hoare triple {121440#(< ~counter~0 93)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {121415#(< ~counter~0 94)} is VALID [2022-04-28 06:03:34,588 INFO L290 TraceCheckUtils]: 80: Hoare triple {121440#(< ~counter~0 93)} assume !(~r~0 > 0); {121440#(< ~counter~0 93)} is VALID [2022-04-28 06:03:34,588 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {120837#true} {121440#(< ~counter~0 93)} #96#return; {121440#(< ~counter~0 93)} is VALID [2022-04-28 06:03:34,589 INFO L290 TraceCheckUtils]: 78: Hoare triple {120837#true} assume true; {120837#true} is VALID [2022-04-28 06:03:34,589 INFO L290 TraceCheckUtils]: 77: Hoare triple {120837#true} assume !(0 == ~cond); {120837#true} is VALID [2022-04-28 06:03:34,589 INFO L290 TraceCheckUtils]: 76: Hoare triple {120837#true} ~cond := #in~cond; {120837#true} is VALID [2022-04-28 06:03:34,589 INFO L272 TraceCheckUtils]: 75: Hoare triple {121440#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {120837#true} is VALID [2022-04-28 06:03:34,589 INFO L290 TraceCheckUtils]: 74: Hoare triple {121440#(< ~counter~0 93)} assume !!(#t~post7 < 100);havoc #t~post7; {121440#(< ~counter~0 93)} is VALID [2022-04-28 06:03:34,590 INFO L290 TraceCheckUtils]: 73: Hoare triple {121465#(< ~counter~0 92)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {121440#(< ~counter~0 93)} is VALID [2022-04-28 06:03:34,590 INFO L290 TraceCheckUtils]: 72: Hoare triple {121465#(< ~counter~0 92)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {121465#(< ~counter~0 92)} is VALID [2022-04-28 06:03:34,591 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {120837#true} {121465#(< ~counter~0 92)} #96#return; {121465#(< ~counter~0 92)} is VALID [2022-04-28 06:03:34,591 INFO L290 TraceCheckUtils]: 70: Hoare triple {120837#true} assume true; {120837#true} is VALID [2022-04-28 06:03:34,591 INFO L290 TraceCheckUtils]: 69: Hoare triple {120837#true} assume !(0 == ~cond); {120837#true} is VALID [2022-04-28 06:03:34,591 INFO L290 TraceCheckUtils]: 68: Hoare triple {120837#true} ~cond := #in~cond; {120837#true} is VALID [2022-04-28 06:03:34,591 INFO L272 TraceCheckUtils]: 67: Hoare triple {121465#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {120837#true} is VALID [2022-04-28 06:03:34,591 INFO L290 TraceCheckUtils]: 66: Hoare triple {121465#(< ~counter~0 92)} assume !!(#t~post7 < 100);havoc #t~post7; {121465#(< ~counter~0 92)} is VALID [2022-04-28 06:03:34,592 INFO L290 TraceCheckUtils]: 65: Hoare triple {121490#(< ~counter~0 91)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {121465#(< ~counter~0 92)} is VALID [2022-04-28 06:03:34,593 INFO L290 TraceCheckUtils]: 64: Hoare triple {121490#(< ~counter~0 91)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {121490#(< ~counter~0 91)} is VALID [2022-04-28 06:03:34,593 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {120837#true} {121490#(< ~counter~0 91)} #96#return; {121490#(< ~counter~0 91)} is VALID [2022-04-28 06:03:34,593 INFO L290 TraceCheckUtils]: 62: Hoare triple {120837#true} assume true; {120837#true} is VALID [2022-04-28 06:03:34,593 INFO L290 TraceCheckUtils]: 61: Hoare triple {120837#true} assume !(0 == ~cond); {120837#true} is VALID [2022-04-28 06:03:34,593 INFO L290 TraceCheckUtils]: 60: Hoare triple {120837#true} ~cond := #in~cond; {120837#true} is VALID [2022-04-28 06:03:34,594 INFO L272 TraceCheckUtils]: 59: Hoare triple {121490#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {120837#true} is VALID [2022-04-28 06:03:34,594 INFO L290 TraceCheckUtils]: 58: Hoare triple {121490#(< ~counter~0 91)} assume !!(#t~post7 < 100);havoc #t~post7; {121490#(< ~counter~0 91)} is VALID [2022-04-28 06:03:34,595 INFO L290 TraceCheckUtils]: 57: Hoare triple {121515#(< ~counter~0 90)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {121490#(< ~counter~0 91)} is VALID [2022-04-28 06:03:34,595 INFO L290 TraceCheckUtils]: 56: Hoare triple {121515#(< ~counter~0 90)} assume !!(0 != ~r~0); {121515#(< ~counter~0 90)} is VALID [2022-04-28 06:03:34,595 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {120837#true} {121515#(< ~counter~0 90)} #94#return; {121515#(< ~counter~0 90)} is VALID [2022-04-28 06:03:34,596 INFO L290 TraceCheckUtils]: 54: Hoare triple {120837#true} assume true; {120837#true} is VALID [2022-04-28 06:03:34,596 INFO L290 TraceCheckUtils]: 53: Hoare triple {120837#true} assume !(0 == ~cond); {120837#true} is VALID [2022-04-28 06:03:34,596 INFO L290 TraceCheckUtils]: 52: Hoare triple {120837#true} ~cond := #in~cond; {120837#true} is VALID [2022-04-28 06:03:34,596 INFO L272 TraceCheckUtils]: 51: Hoare triple {121515#(< ~counter~0 90)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {120837#true} is VALID [2022-04-28 06:03:34,596 INFO L290 TraceCheckUtils]: 50: Hoare triple {121515#(< ~counter~0 90)} assume !!(#t~post6 < 100);havoc #t~post6; {121515#(< ~counter~0 90)} is VALID [2022-04-28 06:03:34,597 INFO L290 TraceCheckUtils]: 49: Hoare triple {121540#(< ~counter~0 89)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {121515#(< ~counter~0 90)} is VALID [2022-04-28 06:03:34,597 INFO L290 TraceCheckUtils]: 48: Hoare triple {121540#(< ~counter~0 89)} assume !(~r~0 < 0); {121540#(< ~counter~0 89)} is VALID [2022-04-28 06:03:34,598 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {120837#true} {121540#(< ~counter~0 89)} #98#return; {121540#(< ~counter~0 89)} is VALID [2022-04-28 06:03:34,598 INFO L290 TraceCheckUtils]: 46: Hoare triple {120837#true} assume true; {120837#true} is VALID [2022-04-28 06:03:34,598 INFO L290 TraceCheckUtils]: 45: Hoare triple {120837#true} assume !(0 == ~cond); {120837#true} is VALID [2022-04-28 06:03:34,598 INFO L290 TraceCheckUtils]: 44: Hoare triple {120837#true} ~cond := #in~cond; {120837#true} is VALID [2022-04-28 06:03:34,598 INFO L272 TraceCheckUtils]: 43: Hoare triple {121540#(< ~counter~0 89)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {120837#true} is VALID [2022-04-28 06:03:34,598 INFO L290 TraceCheckUtils]: 42: Hoare triple {121540#(< ~counter~0 89)} assume !!(#t~post8 < 100);havoc #t~post8; {121540#(< ~counter~0 89)} is VALID [2022-04-28 06:03:34,599 INFO L290 TraceCheckUtils]: 41: Hoare triple {121565#(< ~counter~0 88)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {121540#(< ~counter~0 89)} is VALID [2022-04-28 06:03:34,599 INFO L290 TraceCheckUtils]: 40: Hoare triple {121565#(< ~counter~0 88)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {121565#(< ~counter~0 88)} is VALID [2022-04-28 06:03:34,600 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {120837#true} {121565#(< ~counter~0 88)} #98#return; {121565#(< ~counter~0 88)} is VALID [2022-04-28 06:03:34,600 INFO L290 TraceCheckUtils]: 38: Hoare triple {120837#true} assume true; {120837#true} is VALID [2022-04-28 06:03:34,600 INFO L290 TraceCheckUtils]: 37: Hoare triple {120837#true} assume !(0 == ~cond); {120837#true} is VALID [2022-04-28 06:03:34,600 INFO L290 TraceCheckUtils]: 36: Hoare triple {120837#true} ~cond := #in~cond; {120837#true} is VALID [2022-04-28 06:03:34,600 INFO L272 TraceCheckUtils]: 35: Hoare triple {121565#(< ~counter~0 88)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {120837#true} is VALID [2022-04-28 06:03:34,600 INFO L290 TraceCheckUtils]: 34: Hoare triple {121565#(< ~counter~0 88)} assume !!(#t~post8 < 100);havoc #t~post8; {121565#(< ~counter~0 88)} is VALID [2022-04-28 06:03:34,601 INFO L290 TraceCheckUtils]: 33: Hoare triple {121590#(< ~counter~0 87)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {121565#(< ~counter~0 88)} is VALID [2022-04-28 06:03:34,602 INFO L290 TraceCheckUtils]: 32: Hoare triple {121590#(< ~counter~0 87)} assume !(~r~0 > 0); {121590#(< ~counter~0 87)} is VALID [2022-04-28 06:03:34,602 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {120837#true} {121590#(< ~counter~0 87)} #96#return; {121590#(< ~counter~0 87)} is VALID [2022-04-28 06:03:34,602 INFO L290 TraceCheckUtils]: 30: Hoare triple {120837#true} assume true; {120837#true} is VALID [2022-04-28 06:03:34,602 INFO L290 TraceCheckUtils]: 29: Hoare triple {120837#true} assume !(0 == ~cond); {120837#true} is VALID [2022-04-28 06:03:34,602 INFO L290 TraceCheckUtils]: 28: Hoare triple {120837#true} ~cond := #in~cond; {120837#true} is VALID [2022-04-28 06:03:34,602 INFO L272 TraceCheckUtils]: 27: Hoare triple {121590#(< ~counter~0 87)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {120837#true} is VALID [2022-04-28 06:03:34,603 INFO L290 TraceCheckUtils]: 26: Hoare triple {121590#(< ~counter~0 87)} assume !!(#t~post7 < 100);havoc #t~post7; {121590#(< ~counter~0 87)} is VALID [2022-04-28 06:03:34,604 INFO L290 TraceCheckUtils]: 25: Hoare triple {121615#(< ~counter~0 86)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {121590#(< ~counter~0 87)} is VALID [2022-04-28 06:03:34,604 INFO L290 TraceCheckUtils]: 24: Hoare triple {121615#(< ~counter~0 86)} assume !!(0 != ~r~0); {121615#(< ~counter~0 86)} is VALID [2022-04-28 06:03:34,604 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {120837#true} {121615#(< ~counter~0 86)} #94#return; {121615#(< ~counter~0 86)} is VALID [2022-04-28 06:03:34,604 INFO L290 TraceCheckUtils]: 22: Hoare triple {120837#true} assume true; {120837#true} is VALID [2022-04-28 06:03:34,605 INFO L290 TraceCheckUtils]: 21: Hoare triple {120837#true} assume !(0 == ~cond); {120837#true} is VALID [2022-04-28 06:03:34,605 INFO L290 TraceCheckUtils]: 20: Hoare triple {120837#true} ~cond := #in~cond; {120837#true} is VALID [2022-04-28 06:03:34,605 INFO L272 TraceCheckUtils]: 19: Hoare triple {121615#(< ~counter~0 86)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {120837#true} is VALID [2022-04-28 06:03:34,605 INFO L290 TraceCheckUtils]: 18: Hoare triple {121615#(< ~counter~0 86)} assume !!(#t~post6 < 100);havoc #t~post6; {121615#(< ~counter~0 86)} is VALID [2022-04-28 06:03:34,606 INFO L290 TraceCheckUtils]: 17: Hoare triple {121640#(< ~counter~0 85)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {121615#(< ~counter~0 86)} is VALID [2022-04-28 06:03:34,606 INFO L290 TraceCheckUtils]: 16: Hoare triple {121640#(< ~counter~0 85)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {121640#(< ~counter~0 85)} is VALID [2022-04-28 06:03:34,607 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {120837#true} {121640#(< ~counter~0 85)} #92#return; {121640#(< ~counter~0 85)} is VALID [2022-04-28 06:03:34,607 INFO L290 TraceCheckUtils]: 14: Hoare triple {120837#true} assume true; {120837#true} is VALID [2022-04-28 06:03:34,607 INFO L290 TraceCheckUtils]: 13: Hoare triple {120837#true} assume !(0 == ~cond); {120837#true} is VALID [2022-04-28 06:03:34,607 INFO L290 TraceCheckUtils]: 12: Hoare triple {120837#true} ~cond := #in~cond; {120837#true} is VALID [2022-04-28 06:03:34,607 INFO L272 TraceCheckUtils]: 11: Hoare triple {121640#(< ~counter~0 85)} 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)); {120837#true} is VALID [2022-04-28 06:03:34,607 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {120837#true} {121640#(< ~counter~0 85)} #90#return; {121640#(< ~counter~0 85)} is VALID [2022-04-28 06:03:34,607 INFO L290 TraceCheckUtils]: 9: Hoare triple {120837#true} assume true; {120837#true} is VALID [2022-04-28 06:03:34,607 INFO L290 TraceCheckUtils]: 8: Hoare triple {120837#true} assume !(0 == ~cond); {120837#true} is VALID [2022-04-28 06:03:34,608 INFO L290 TraceCheckUtils]: 7: Hoare triple {120837#true} ~cond := #in~cond; {120837#true} is VALID [2022-04-28 06:03:34,608 INFO L272 TraceCheckUtils]: 6: Hoare triple {121640#(< ~counter~0 85)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {120837#true} is VALID [2022-04-28 06:03:34,608 INFO L290 TraceCheckUtils]: 5: Hoare triple {121640#(< ~counter~0 85)} 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; {121640#(< ~counter~0 85)} is VALID [2022-04-28 06:03:34,608 INFO L272 TraceCheckUtils]: 4: Hoare triple {121640#(< ~counter~0 85)} call #t~ret9 := main(); {121640#(< ~counter~0 85)} is VALID [2022-04-28 06:03:34,608 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {121640#(< ~counter~0 85)} {120837#true} #102#return; {121640#(< ~counter~0 85)} is VALID [2022-04-28 06:03:34,609 INFO L290 TraceCheckUtils]: 2: Hoare triple {121640#(< ~counter~0 85)} assume true; {121640#(< ~counter~0 85)} is VALID [2022-04-28 06:03:34,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {120837#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; {121640#(< ~counter~0 85)} is VALID [2022-04-28 06:03:34,609 INFO L272 TraceCheckUtils]: 0: Hoare triple {120837#true} call ULTIMATE.init(); {120837#true} is VALID [2022-04-28 06:03:34,610 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 28 proven. 134 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2022-04-28 06:03:34,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:03:34,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917627503] [2022-04-28 06:03:34,610 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:03:34,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574797942] [2022-04-28 06:03:34,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574797942] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:03:34,610 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:03:34,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2022-04-28 06:03:34,610 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:03:34,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [955254271] [2022-04-28 06:03:34,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [955254271] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:03:34,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:03:34,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 06:03:34,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917220073] [2022-04-28 06:03:34,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:03:34,611 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.157894736842105) internal successors, (98), 18 states have internal predecessors, (98), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) Word has length 137 [2022-04-28 06:03:34,611 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:03:34,611 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 5.157894736842105) internal successors, (98), 18 states have internal predecessors, (98), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-28 06:03:34,742 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:03:34,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 06:03:34,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:03:34,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 06:03:34,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=566, Invalid=694, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 06:03:34,743 INFO L87 Difference]: Start difference. First operand 707 states and 950 transitions. Second operand has 19 states, 19 states have (on average 5.157894736842105) internal successors, (98), 18 states have internal predecessors, (98), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-28 06:03:39,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:03:39,752 INFO L93 Difference]: Finished difference Result 807 states and 1089 transitions. [2022-04-28 06:03:39,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-28 06:03:39,752 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.157894736842105) internal successors, (98), 18 states have internal predecessors, (98), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) Word has length 137 [2022-04-28 06:03:39,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:03:39,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 5.157894736842105) internal successors, (98), 18 states have internal predecessors, (98), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-28 06:03:39,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 316 transitions. [2022-04-28 06:03:39,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 5.157894736842105) internal successors, (98), 18 states have internal predecessors, (98), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-28 06:03:39,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 316 transitions. [2022-04-28 06:03:39,757 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 316 transitions. [2022-04-28 06:03:40,123 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 316 edges. 316 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:03:40,161 INFO L225 Difference]: With dead ends: 807 [2022-04-28 06:03:40,161 INFO L226 Difference]: Without dead ends: 802 [2022-04-28 06:03:40,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=953, Invalid=1303, Unknown=0, NotChecked=0, Total=2256 [2022-04-28 06:03:40,162 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 293 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 219 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 219 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 06:03:40,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 336 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [219 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 06:03:40,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2022-04-28 06:03:42,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 775. [2022-04-28 06:03:42,825 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:03:42,825 INFO L82 GeneralOperation]: Start isEquivalent. First operand 802 states. Second operand has 775 states, 579 states have (on average 1.2037996545768566) internal successors, (697), 596 states have internal predecessors, (697), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 157 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-28 06:03:42,826 INFO L74 IsIncluded]: Start isIncluded. First operand 802 states. Second operand has 775 states, 579 states have (on average 1.2037996545768566) internal successors, (697), 596 states have internal predecessors, (697), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 157 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-28 06:03:42,826 INFO L87 Difference]: Start difference. First operand 802 states. Second operand has 775 states, 579 states have (on average 1.2037996545768566) internal successors, (697), 596 states have internal predecessors, (697), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 157 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-28 06:03:42,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:03:42,848 INFO L93 Difference]: Finished difference Result 802 states and 1078 transitions. [2022-04-28 06:03:42,848 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1078 transitions. [2022-04-28 06:03:42,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:03:42,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:03:42,849 INFO L74 IsIncluded]: Start isIncluded. First operand has 775 states, 579 states have (on average 1.2037996545768566) internal successors, (697), 596 states have internal predecessors, (697), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 157 states have call predecessors, (174), 174 states have call successors, (174) Second operand 802 states. [2022-04-28 06:03:42,850 INFO L87 Difference]: Start difference. First operand has 775 states, 579 states have (on average 1.2037996545768566) internal successors, (697), 596 states have internal predecessors, (697), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 157 states have call predecessors, (174), 174 states have call successors, (174) Second operand 802 states. [2022-04-28 06:03:42,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:03:42,871 INFO L93 Difference]: Finished difference Result 802 states and 1078 transitions. [2022-04-28 06:03:42,871 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1078 transitions. [2022-04-28 06:03:42,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:03:42,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:03:42,872 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:03:42,872 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:03:42,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 775 states, 579 states have (on average 1.2037996545768566) internal successors, (697), 596 states have internal predecessors, (697), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 157 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-28 06:03:42,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1047 transitions. [2022-04-28 06:03:42,901 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1047 transitions. Word has length 137 [2022-04-28 06:03:42,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:03:42,901 INFO L495 AbstractCegarLoop]: Abstraction has 775 states and 1047 transitions. [2022-04-28 06:03:42,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.157894736842105) internal successors, (98), 18 states have internal predecessors, (98), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-28 06:03:42,901 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 775 states and 1047 transitions. [2022-04-28 06:03:57,401 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1047 edges. 1045 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 06:03:57,401 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1047 transitions. [2022-04-28 06:03:57,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-04-28 06:03:57,402 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:03:57,402 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 8, 7, 7, 7, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:03:57,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-04-28 06:03:57,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-04-28 06:03:57,603 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:03:57,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:03:57,603 INFO L85 PathProgramCache]: Analyzing trace with hash -895861967, now seen corresponding path program 19 times [2022-04-28 06:03:57,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:03:57,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1385776870] [2022-04-28 06:03:57,604 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:03:57,604 INFO L85 PathProgramCache]: Analyzing trace with hash -895861967, now seen corresponding path program 20 times [2022-04-28 06:03:57,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:03:57,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30748221] [2022-04-28 06:03:57,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:03:57,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:03:57,615 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:03:57,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [475105947] [2022-04-28 06:03:57,616 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 06:03:57,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:03:57,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:03:57,616 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:03:57,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-04-28 06:03:57,677 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 06:03:57,677 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:03:57,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 06:03:57,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:03:57,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:03:58,473 INFO L272 TraceCheckUtils]: 0: Hoare triple {126486#true} call ULTIMATE.init(); {126486#true} is VALID [2022-04-28 06:03:58,474 INFO L290 TraceCheckUtils]: 1: Hoare triple {126486#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; {126494#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:58,474 INFO L290 TraceCheckUtils]: 2: Hoare triple {126494#(<= ~counter~0 0)} assume true; {126494#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:58,475 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {126494#(<= ~counter~0 0)} {126486#true} #102#return; {126494#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:58,475 INFO L272 TraceCheckUtils]: 4: Hoare triple {126494#(<= ~counter~0 0)} call #t~ret9 := main(); {126494#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:58,475 INFO L290 TraceCheckUtils]: 5: Hoare triple {126494#(<= ~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; {126494#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:58,476 INFO L272 TraceCheckUtils]: 6: Hoare triple {126494#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {126494#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:58,476 INFO L290 TraceCheckUtils]: 7: Hoare triple {126494#(<= ~counter~0 0)} ~cond := #in~cond; {126494#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:58,476 INFO L290 TraceCheckUtils]: 8: Hoare triple {126494#(<= ~counter~0 0)} assume !(0 == ~cond); {126494#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:58,477 INFO L290 TraceCheckUtils]: 9: Hoare triple {126494#(<= ~counter~0 0)} assume true; {126494#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:58,477 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {126494#(<= ~counter~0 0)} {126494#(<= ~counter~0 0)} #90#return; {126494#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:58,478 INFO L272 TraceCheckUtils]: 11: Hoare triple {126494#(<= ~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)); {126494#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:58,478 INFO L290 TraceCheckUtils]: 12: Hoare triple {126494#(<= ~counter~0 0)} ~cond := #in~cond; {126494#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:58,478 INFO L290 TraceCheckUtils]: 13: Hoare triple {126494#(<= ~counter~0 0)} assume !(0 == ~cond); {126494#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:58,479 INFO L290 TraceCheckUtils]: 14: Hoare triple {126494#(<= ~counter~0 0)} assume true; {126494#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:58,479 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {126494#(<= ~counter~0 0)} {126494#(<= ~counter~0 0)} #92#return; {126494#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:58,479 INFO L290 TraceCheckUtils]: 16: Hoare triple {126494#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {126494#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:58,482 INFO L290 TraceCheckUtils]: 17: Hoare triple {126494#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {126543#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:58,482 INFO L290 TraceCheckUtils]: 18: Hoare triple {126543#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {126543#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:58,483 INFO L272 TraceCheckUtils]: 19: Hoare triple {126543#(<= ~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)); {126543#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:58,483 INFO L290 TraceCheckUtils]: 20: Hoare triple {126543#(<= ~counter~0 1)} ~cond := #in~cond; {126543#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:58,483 INFO L290 TraceCheckUtils]: 21: Hoare triple {126543#(<= ~counter~0 1)} assume !(0 == ~cond); {126543#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:58,484 INFO L290 TraceCheckUtils]: 22: Hoare triple {126543#(<= ~counter~0 1)} assume true; {126543#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:58,484 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {126543#(<= ~counter~0 1)} {126543#(<= ~counter~0 1)} #94#return; {126543#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:58,484 INFO L290 TraceCheckUtils]: 24: Hoare triple {126543#(<= ~counter~0 1)} assume !!(0 != ~r~0); {126543#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:58,486 INFO L290 TraceCheckUtils]: 25: Hoare triple {126543#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {126568#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:58,486 INFO L290 TraceCheckUtils]: 26: Hoare triple {126568#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {126568#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:58,486 INFO L272 TraceCheckUtils]: 27: Hoare triple {126568#(<= ~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)); {126568#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:58,487 INFO L290 TraceCheckUtils]: 28: Hoare triple {126568#(<= ~counter~0 2)} ~cond := #in~cond; {126568#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:58,487 INFO L290 TraceCheckUtils]: 29: Hoare triple {126568#(<= ~counter~0 2)} assume !(0 == ~cond); {126568#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:58,487 INFO L290 TraceCheckUtils]: 30: Hoare triple {126568#(<= ~counter~0 2)} assume true; {126568#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:58,488 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {126568#(<= ~counter~0 2)} {126568#(<= ~counter~0 2)} #96#return; {126568#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:58,488 INFO L290 TraceCheckUtils]: 32: Hoare triple {126568#(<= ~counter~0 2)} assume !(~r~0 > 0); {126568#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:58,489 INFO L290 TraceCheckUtils]: 33: Hoare triple {126568#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {126593#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:58,489 INFO L290 TraceCheckUtils]: 34: Hoare triple {126593#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {126593#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:58,490 INFO L272 TraceCheckUtils]: 35: Hoare triple {126593#(<= ~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)); {126593#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:58,490 INFO L290 TraceCheckUtils]: 36: Hoare triple {126593#(<= ~counter~0 3)} ~cond := #in~cond; {126593#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:58,490 INFO L290 TraceCheckUtils]: 37: Hoare triple {126593#(<= ~counter~0 3)} assume !(0 == ~cond); {126593#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:58,491 INFO L290 TraceCheckUtils]: 38: Hoare triple {126593#(<= ~counter~0 3)} assume true; {126593#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:58,491 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {126593#(<= ~counter~0 3)} {126593#(<= ~counter~0 3)} #98#return; {126593#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:58,491 INFO L290 TraceCheckUtils]: 40: Hoare triple {126593#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {126593#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:58,492 INFO L290 TraceCheckUtils]: 41: Hoare triple {126593#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {126618#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:58,493 INFO L290 TraceCheckUtils]: 42: Hoare triple {126618#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {126618#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:58,493 INFO L272 TraceCheckUtils]: 43: Hoare triple {126618#(<= ~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)); {126618#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:58,493 INFO L290 TraceCheckUtils]: 44: Hoare triple {126618#(<= ~counter~0 4)} ~cond := #in~cond; {126618#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:58,494 INFO L290 TraceCheckUtils]: 45: Hoare triple {126618#(<= ~counter~0 4)} assume !(0 == ~cond); {126618#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:58,494 INFO L290 TraceCheckUtils]: 46: Hoare triple {126618#(<= ~counter~0 4)} assume true; {126618#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:58,494 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {126618#(<= ~counter~0 4)} {126618#(<= ~counter~0 4)} #98#return; {126618#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:58,495 INFO L290 TraceCheckUtils]: 48: Hoare triple {126618#(<= ~counter~0 4)} assume !(~r~0 < 0); {126618#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:58,496 INFO L290 TraceCheckUtils]: 49: Hoare triple {126618#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {126643#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:58,496 INFO L290 TraceCheckUtils]: 50: Hoare triple {126643#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {126643#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:58,497 INFO L272 TraceCheckUtils]: 51: Hoare triple {126643#(<= ~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)); {126643#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:58,497 INFO L290 TraceCheckUtils]: 52: Hoare triple {126643#(<= ~counter~0 5)} ~cond := #in~cond; {126643#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:58,497 INFO L290 TraceCheckUtils]: 53: Hoare triple {126643#(<= ~counter~0 5)} assume !(0 == ~cond); {126643#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:58,497 INFO L290 TraceCheckUtils]: 54: Hoare triple {126643#(<= ~counter~0 5)} assume true; {126643#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:58,498 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {126643#(<= ~counter~0 5)} {126643#(<= ~counter~0 5)} #94#return; {126643#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:58,498 INFO L290 TraceCheckUtils]: 56: Hoare triple {126643#(<= ~counter~0 5)} assume !!(0 != ~r~0); {126643#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:58,499 INFO L290 TraceCheckUtils]: 57: Hoare triple {126643#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {126668#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:58,499 INFO L290 TraceCheckUtils]: 58: Hoare triple {126668#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {126668#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:58,500 INFO L272 TraceCheckUtils]: 59: Hoare triple {126668#(<= ~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)); {126668#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:58,500 INFO L290 TraceCheckUtils]: 60: Hoare triple {126668#(<= ~counter~0 6)} ~cond := #in~cond; {126668#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:58,501 INFO L290 TraceCheckUtils]: 61: Hoare triple {126668#(<= ~counter~0 6)} assume !(0 == ~cond); {126668#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:58,501 INFO L290 TraceCheckUtils]: 62: Hoare triple {126668#(<= ~counter~0 6)} assume true; {126668#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:58,501 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {126668#(<= ~counter~0 6)} {126668#(<= ~counter~0 6)} #96#return; {126668#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:58,502 INFO L290 TraceCheckUtils]: 64: Hoare triple {126668#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {126668#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:58,503 INFO L290 TraceCheckUtils]: 65: Hoare triple {126668#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {126693#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:58,503 INFO L290 TraceCheckUtils]: 66: Hoare triple {126693#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {126693#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:58,503 INFO L272 TraceCheckUtils]: 67: Hoare triple {126693#(<= ~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)); {126693#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:58,504 INFO L290 TraceCheckUtils]: 68: Hoare triple {126693#(<= ~counter~0 7)} ~cond := #in~cond; {126693#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:58,504 INFO L290 TraceCheckUtils]: 69: Hoare triple {126693#(<= ~counter~0 7)} assume !(0 == ~cond); {126693#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:58,504 INFO L290 TraceCheckUtils]: 70: Hoare triple {126693#(<= ~counter~0 7)} assume true; {126693#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:58,505 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {126693#(<= ~counter~0 7)} {126693#(<= ~counter~0 7)} #96#return; {126693#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:58,505 INFO L290 TraceCheckUtils]: 72: Hoare triple {126693#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {126693#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:58,506 INFO L290 TraceCheckUtils]: 73: Hoare triple {126693#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {126718#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:58,506 INFO L290 TraceCheckUtils]: 74: Hoare triple {126718#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {126718#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:58,507 INFO L272 TraceCheckUtils]: 75: Hoare triple {126718#(<= ~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)); {126718#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:58,507 INFO L290 TraceCheckUtils]: 76: Hoare triple {126718#(<= ~counter~0 8)} ~cond := #in~cond; {126718#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:58,507 INFO L290 TraceCheckUtils]: 77: Hoare triple {126718#(<= ~counter~0 8)} assume !(0 == ~cond); {126718#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:58,508 INFO L290 TraceCheckUtils]: 78: Hoare triple {126718#(<= ~counter~0 8)} assume true; {126718#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:58,508 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {126718#(<= ~counter~0 8)} {126718#(<= ~counter~0 8)} #96#return; {126718#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:58,508 INFO L290 TraceCheckUtils]: 80: Hoare triple {126718#(<= ~counter~0 8)} assume !(~r~0 > 0); {126718#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:58,510 INFO L290 TraceCheckUtils]: 81: Hoare triple {126718#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {126743#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:58,510 INFO L290 TraceCheckUtils]: 82: Hoare triple {126743#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {126743#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:58,510 INFO L272 TraceCheckUtils]: 83: Hoare triple {126743#(<= ~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)); {126743#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:58,511 INFO L290 TraceCheckUtils]: 84: Hoare triple {126743#(<= ~counter~0 9)} ~cond := #in~cond; {126743#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:58,511 INFO L290 TraceCheckUtils]: 85: Hoare triple {126743#(<= ~counter~0 9)} assume !(0 == ~cond); {126743#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:58,511 INFO L290 TraceCheckUtils]: 86: Hoare triple {126743#(<= ~counter~0 9)} assume true; {126743#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:58,512 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {126743#(<= ~counter~0 9)} {126743#(<= ~counter~0 9)} #98#return; {126743#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:58,512 INFO L290 TraceCheckUtils]: 88: Hoare triple {126743#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {126743#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:58,513 INFO L290 TraceCheckUtils]: 89: Hoare triple {126743#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {126768#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:58,513 INFO L290 TraceCheckUtils]: 90: Hoare triple {126768#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {126768#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:58,514 INFO L272 TraceCheckUtils]: 91: Hoare triple {126768#(<= ~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)); {126768#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:58,514 INFO L290 TraceCheckUtils]: 92: Hoare triple {126768#(<= ~counter~0 10)} ~cond := #in~cond; {126768#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:58,514 INFO L290 TraceCheckUtils]: 93: Hoare triple {126768#(<= ~counter~0 10)} assume !(0 == ~cond); {126768#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:58,515 INFO L290 TraceCheckUtils]: 94: Hoare triple {126768#(<= ~counter~0 10)} assume true; {126768#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:58,515 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {126768#(<= ~counter~0 10)} {126768#(<= ~counter~0 10)} #98#return; {126768#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:58,515 INFO L290 TraceCheckUtils]: 96: Hoare triple {126768#(<= ~counter~0 10)} assume !(~r~0 < 0); {126768#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:58,516 INFO L290 TraceCheckUtils]: 97: Hoare triple {126768#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {126793#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:58,517 INFO L290 TraceCheckUtils]: 98: Hoare triple {126793#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {126793#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:58,517 INFO L272 TraceCheckUtils]: 99: Hoare triple {126793#(<= ~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)); {126793#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:58,518 INFO L290 TraceCheckUtils]: 100: Hoare triple {126793#(<= ~counter~0 11)} ~cond := #in~cond; {126793#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:58,518 INFO L290 TraceCheckUtils]: 101: Hoare triple {126793#(<= ~counter~0 11)} assume !(0 == ~cond); {126793#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:58,518 INFO L290 TraceCheckUtils]: 102: Hoare triple {126793#(<= ~counter~0 11)} assume true; {126793#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:58,519 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {126793#(<= ~counter~0 11)} {126793#(<= ~counter~0 11)} #94#return; {126793#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:58,519 INFO L290 TraceCheckUtils]: 104: Hoare triple {126793#(<= ~counter~0 11)} assume !!(0 != ~r~0); {126793#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:58,521 INFO L290 TraceCheckUtils]: 105: Hoare triple {126793#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {126818#(<= ~counter~0 12)} is VALID [2022-04-28 06:03:58,521 INFO L290 TraceCheckUtils]: 106: Hoare triple {126818#(<= ~counter~0 12)} assume !!(#t~post7 < 100);havoc #t~post7; {126818#(<= ~counter~0 12)} is VALID [2022-04-28 06:03:58,522 INFO L272 TraceCheckUtils]: 107: Hoare triple {126818#(<= ~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)); {126818#(<= ~counter~0 12)} is VALID [2022-04-28 06:03:58,522 INFO L290 TraceCheckUtils]: 108: Hoare triple {126818#(<= ~counter~0 12)} ~cond := #in~cond; {126818#(<= ~counter~0 12)} is VALID [2022-04-28 06:03:58,522 INFO L290 TraceCheckUtils]: 109: Hoare triple {126818#(<= ~counter~0 12)} assume !(0 == ~cond); {126818#(<= ~counter~0 12)} is VALID [2022-04-28 06:03:58,522 INFO L290 TraceCheckUtils]: 110: Hoare triple {126818#(<= ~counter~0 12)} assume true; {126818#(<= ~counter~0 12)} is VALID [2022-04-28 06:03:58,523 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {126818#(<= ~counter~0 12)} {126818#(<= ~counter~0 12)} #96#return; {126818#(<= ~counter~0 12)} is VALID [2022-04-28 06:03:58,523 INFO L290 TraceCheckUtils]: 112: Hoare triple {126818#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {126818#(<= ~counter~0 12)} is VALID [2022-04-28 06:03:58,524 INFO L290 TraceCheckUtils]: 113: Hoare triple {126818#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {126843#(<= ~counter~0 13)} is VALID [2022-04-28 06:03:58,525 INFO L290 TraceCheckUtils]: 114: Hoare triple {126843#(<= ~counter~0 13)} assume !!(#t~post7 < 100);havoc #t~post7; {126843#(<= ~counter~0 13)} is VALID [2022-04-28 06:03:58,525 INFO L272 TraceCheckUtils]: 115: Hoare triple {126843#(<= ~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)); {126843#(<= ~counter~0 13)} is VALID [2022-04-28 06:03:58,525 INFO L290 TraceCheckUtils]: 116: Hoare triple {126843#(<= ~counter~0 13)} ~cond := #in~cond; {126843#(<= ~counter~0 13)} is VALID [2022-04-28 06:03:58,526 INFO L290 TraceCheckUtils]: 117: Hoare triple {126843#(<= ~counter~0 13)} assume !(0 == ~cond); {126843#(<= ~counter~0 13)} is VALID [2022-04-28 06:03:58,526 INFO L290 TraceCheckUtils]: 118: Hoare triple {126843#(<= ~counter~0 13)} assume true; {126843#(<= ~counter~0 13)} is VALID [2022-04-28 06:03:58,526 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {126843#(<= ~counter~0 13)} {126843#(<= ~counter~0 13)} #96#return; {126843#(<= ~counter~0 13)} is VALID [2022-04-28 06:03:58,527 INFO L290 TraceCheckUtils]: 120: Hoare triple {126843#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {126843#(<= ~counter~0 13)} is VALID [2022-04-28 06:03:58,528 INFO L290 TraceCheckUtils]: 121: Hoare triple {126843#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {126868#(<= ~counter~0 14)} is VALID [2022-04-28 06:03:58,528 INFO L290 TraceCheckUtils]: 122: Hoare triple {126868#(<= ~counter~0 14)} assume !!(#t~post7 < 100);havoc #t~post7; {126868#(<= ~counter~0 14)} is VALID [2022-04-28 06:03:58,529 INFO L272 TraceCheckUtils]: 123: Hoare triple {126868#(<= ~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)); {126868#(<= ~counter~0 14)} is VALID [2022-04-28 06:03:58,529 INFO L290 TraceCheckUtils]: 124: Hoare triple {126868#(<= ~counter~0 14)} ~cond := #in~cond; {126868#(<= ~counter~0 14)} is VALID [2022-04-28 06:03:58,529 INFO L290 TraceCheckUtils]: 125: Hoare triple {126868#(<= ~counter~0 14)} assume !(0 == ~cond); {126868#(<= ~counter~0 14)} is VALID [2022-04-28 06:03:58,529 INFO L290 TraceCheckUtils]: 126: Hoare triple {126868#(<= ~counter~0 14)} assume true; {126868#(<= ~counter~0 14)} is VALID [2022-04-28 06:03:58,530 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {126868#(<= ~counter~0 14)} {126868#(<= ~counter~0 14)} #96#return; {126868#(<= ~counter~0 14)} is VALID [2022-04-28 06:03:58,530 INFO L290 TraceCheckUtils]: 128: Hoare triple {126868#(<= ~counter~0 14)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {126868#(<= ~counter~0 14)} is VALID [2022-04-28 06:03:58,530 INFO L290 TraceCheckUtils]: 129: Hoare triple {126868#(<= ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {126893#(<= |main_#t~post7| 14)} is VALID [2022-04-28 06:03:58,531 INFO L290 TraceCheckUtils]: 130: Hoare triple {126893#(<= |main_#t~post7| 14)} assume !(#t~post7 < 100);havoc #t~post7; {126487#false} is VALID [2022-04-28 06:03:58,531 INFO L290 TraceCheckUtils]: 131: Hoare triple {126487#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {126487#false} is VALID [2022-04-28 06:03:58,531 INFO L290 TraceCheckUtils]: 132: Hoare triple {126487#false} assume !(#t~post8 < 100);havoc #t~post8; {126487#false} is VALID [2022-04-28 06:03:58,531 INFO L290 TraceCheckUtils]: 133: Hoare triple {126487#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {126487#false} is VALID [2022-04-28 06:03:58,531 INFO L290 TraceCheckUtils]: 134: Hoare triple {126487#false} assume !(#t~post6 < 100);havoc #t~post6; {126487#false} is VALID [2022-04-28 06:03:58,531 INFO L272 TraceCheckUtils]: 135: Hoare triple {126487#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)); {126487#false} is VALID [2022-04-28 06:03:58,531 INFO L290 TraceCheckUtils]: 136: Hoare triple {126487#false} ~cond := #in~cond; {126487#false} is VALID [2022-04-28 06:03:58,531 INFO L290 TraceCheckUtils]: 137: Hoare triple {126487#false} assume 0 == ~cond; {126487#false} is VALID [2022-04-28 06:03:58,531 INFO L290 TraceCheckUtils]: 138: Hoare triple {126487#false} assume !false; {126487#false} is VALID [2022-04-28 06:03:58,532 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 42 proven. 498 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 06:03:58,532 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:03:59,428 INFO L290 TraceCheckUtils]: 138: Hoare triple {126487#false} assume !false; {126487#false} is VALID [2022-04-28 06:03:59,428 INFO L290 TraceCheckUtils]: 137: Hoare triple {126487#false} assume 0 == ~cond; {126487#false} is VALID [2022-04-28 06:03:59,428 INFO L290 TraceCheckUtils]: 136: Hoare triple {126487#false} ~cond := #in~cond; {126487#false} is VALID [2022-04-28 06:03:59,428 INFO L272 TraceCheckUtils]: 135: Hoare triple {126487#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)); {126487#false} is VALID [2022-04-28 06:03:59,428 INFO L290 TraceCheckUtils]: 134: Hoare triple {126487#false} assume !(#t~post6 < 100);havoc #t~post6; {126487#false} is VALID [2022-04-28 06:03:59,428 INFO L290 TraceCheckUtils]: 133: Hoare triple {126487#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {126487#false} is VALID [2022-04-28 06:03:59,429 INFO L290 TraceCheckUtils]: 132: Hoare triple {126487#false} assume !(#t~post8 < 100);havoc #t~post8; {126487#false} is VALID [2022-04-28 06:03:59,429 INFO L290 TraceCheckUtils]: 131: Hoare triple {126487#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {126487#false} is VALID [2022-04-28 06:03:59,429 INFO L290 TraceCheckUtils]: 130: Hoare triple {126945#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {126487#false} is VALID [2022-04-28 06:03:59,429 INFO L290 TraceCheckUtils]: 129: Hoare triple {126949#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {126945#(< |main_#t~post7| 100)} is VALID [2022-04-28 06:03:59,429 INFO L290 TraceCheckUtils]: 128: Hoare triple {126949#(< ~counter~0 100)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {126949#(< ~counter~0 100)} is VALID [2022-04-28 06:03:59,430 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {126486#true} {126949#(< ~counter~0 100)} #96#return; {126949#(< ~counter~0 100)} is VALID [2022-04-28 06:03:59,430 INFO L290 TraceCheckUtils]: 126: Hoare triple {126486#true} assume true; {126486#true} is VALID [2022-04-28 06:03:59,430 INFO L290 TraceCheckUtils]: 125: Hoare triple {126486#true} assume !(0 == ~cond); {126486#true} is VALID [2022-04-28 06:03:59,430 INFO L290 TraceCheckUtils]: 124: Hoare triple {126486#true} ~cond := #in~cond; {126486#true} is VALID [2022-04-28 06:03:59,430 INFO L272 TraceCheckUtils]: 123: Hoare triple {126949#(< ~counter~0 100)} call __VERIFIER_assert((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#true} is VALID [2022-04-28 06:03:59,431 INFO L290 TraceCheckUtils]: 122: Hoare triple {126949#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {126949#(< ~counter~0 100)} is VALID [2022-04-28 06:03:59,433 INFO L290 TraceCheckUtils]: 121: Hoare triple {126974#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {126949#(< ~counter~0 100)} is VALID [2022-04-28 06:03:59,434 INFO L290 TraceCheckUtils]: 120: Hoare triple {126974#(< ~counter~0 99)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {126974#(< ~counter~0 99)} is VALID [2022-04-28 06:03:59,434 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {126486#true} {126974#(< ~counter~0 99)} #96#return; {126974#(< ~counter~0 99)} is VALID [2022-04-28 06:03:59,434 INFO L290 TraceCheckUtils]: 118: Hoare triple {126486#true} assume true; {126486#true} is VALID [2022-04-28 06:03:59,434 INFO L290 TraceCheckUtils]: 117: Hoare triple {126486#true} assume !(0 == ~cond); {126486#true} is VALID [2022-04-28 06:03:59,434 INFO L290 TraceCheckUtils]: 116: Hoare triple {126486#true} ~cond := #in~cond; {126486#true} is VALID [2022-04-28 06:03:59,434 INFO L272 TraceCheckUtils]: 115: Hoare triple {126974#(< ~counter~0 99)} call __VERIFIER_assert((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#true} is VALID [2022-04-28 06:03:59,435 INFO L290 TraceCheckUtils]: 114: Hoare triple {126974#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {126974#(< ~counter~0 99)} is VALID [2022-04-28 06:03:59,436 INFO L290 TraceCheckUtils]: 113: Hoare triple {126999#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {126974#(< ~counter~0 99)} is VALID [2022-04-28 06:03:59,436 INFO L290 TraceCheckUtils]: 112: Hoare triple {126999#(< ~counter~0 98)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {126999#(< ~counter~0 98)} is VALID [2022-04-28 06:03:59,436 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {126486#true} {126999#(< ~counter~0 98)} #96#return; {126999#(< ~counter~0 98)} is VALID [2022-04-28 06:03:59,437 INFO L290 TraceCheckUtils]: 110: Hoare triple {126486#true} assume true; {126486#true} is VALID [2022-04-28 06:03:59,437 INFO L290 TraceCheckUtils]: 109: Hoare triple {126486#true} assume !(0 == ~cond); {126486#true} is VALID [2022-04-28 06:03:59,437 INFO L290 TraceCheckUtils]: 108: Hoare triple {126486#true} ~cond := #in~cond; {126486#true} is VALID [2022-04-28 06:03:59,437 INFO L272 TraceCheckUtils]: 107: Hoare triple {126999#(< ~counter~0 98)} call __VERIFIER_assert((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#true} is VALID [2022-04-28 06:03:59,437 INFO L290 TraceCheckUtils]: 106: Hoare triple {126999#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {126999#(< ~counter~0 98)} is VALID [2022-04-28 06:03:59,438 INFO L290 TraceCheckUtils]: 105: Hoare triple {127024#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {126999#(< ~counter~0 98)} is VALID [2022-04-28 06:03:59,438 INFO L290 TraceCheckUtils]: 104: Hoare triple {127024#(< ~counter~0 97)} assume !!(0 != ~r~0); {127024#(< ~counter~0 97)} is VALID [2022-04-28 06:03:59,439 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {126486#true} {127024#(< ~counter~0 97)} #94#return; {127024#(< ~counter~0 97)} is VALID [2022-04-28 06:03:59,439 INFO L290 TraceCheckUtils]: 102: Hoare triple {126486#true} assume true; {126486#true} is VALID [2022-04-28 06:03:59,439 INFO L290 TraceCheckUtils]: 101: Hoare triple {126486#true} assume !(0 == ~cond); {126486#true} is VALID [2022-04-28 06:03:59,439 INFO L290 TraceCheckUtils]: 100: Hoare triple {126486#true} ~cond := #in~cond; {126486#true} is VALID [2022-04-28 06:03:59,439 INFO L272 TraceCheckUtils]: 99: Hoare triple {127024#(< ~counter~0 97)} call __VERIFIER_assert((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#true} is VALID [2022-04-28 06:03:59,439 INFO L290 TraceCheckUtils]: 98: Hoare triple {127024#(< ~counter~0 97)} assume !!(#t~post6 < 100);havoc #t~post6; {127024#(< ~counter~0 97)} is VALID [2022-04-28 06:03:59,440 INFO L290 TraceCheckUtils]: 97: Hoare triple {127049#(< ~counter~0 96)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {127024#(< ~counter~0 97)} is VALID [2022-04-28 06:03:59,441 INFO L290 TraceCheckUtils]: 96: Hoare triple {127049#(< ~counter~0 96)} assume !(~r~0 < 0); {127049#(< ~counter~0 96)} is VALID [2022-04-28 06:03:59,441 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {126486#true} {127049#(< ~counter~0 96)} #98#return; {127049#(< ~counter~0 96)} is VALID [2022-04-28 06:03:59,441 INFO L290 TraceCheckUtils]: 94: Hoare triple {126486#true} assume true; {126486#true} is VALID [2022-04-28 06:03:59,441 INFO L290 TraceCheckUtils]: 93: Hoare triple {126486#true} assume !(0 == ~cond); {126486#true} is VALID [2022-04-28 06:03:59,441 INFO L290 TraceCheckUtils]: 92: Hoare triple {126486#true} ~cond := #in~cond; {126486#true} is VALID [2022-04-28 06:03:59,441 INFO L272 TraceCheckUtils]: 91: Hoare triple {127049#(< ~counter~0 96)} call __VERIFIER_assert((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#true} is VALID [2022-04-28 06:03:59,442 INFO L290 TraceCheckUtils]: 90: Hoare triple {127049#(< ~counter~0 96)} assume !!(#t~post8 < 100);havoc #t~post8; {127049#(< ~counter~0 96)} is VALID [2022-04-28 06:03:59,443 INFO L290 TraceCheckUtils]: 89: Hoare triple {127074#(< ~counter~0 95)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {127049#(< ~counter~0 96)} is VALID [2022-04-28 06:03:59,443 INFO L290 TraceCheckUtils]: 88: Hoare triple {127074#(< ~counter~0 95)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {127074#(< ~counter~0 95)} is VALID [2022-04-28 06:03:59,443 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {126486#true} {127074#(< ~counter~0 95)} #98#return; {127074#(< ~counter~0 95)} is VALID [2022-04-28 06:03:59,444 INFO L290 TraceCheckUtils]: 86: Hoare triple {126486#true} assume true; {126486#true} is VALID [2022-04-28 06:03:59,444 INFO L290 TraceCheckUtils]: 85: Hoare triple {126486#true} assume !(0 == ~cond); {126486#true} is VALID [2022-04-28 06:03:59,444 INFO L290 TraceCheckUtils]: 84: Hoare triple {126486#true} ~cond := #in~cond; {126486#true} is VALID [2022-04-28 06:03:59,444 INFO L272 TraceCheckUtils]: 83: Hoare triple {127074#(< ~counter~0 95)} call __VERIFIER_assert((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#true} is VALID [2022-04-28 06:03:59,444 INFO L290 TraceCheckUtils]: 82: Hoare triple {127074#(< ~counter~0 95)} assume !!(#t~post8 < 100);havoc #t~post8; {127074#(< ~counter~0 95)} is VALID [2022-04-28 06:03:59,445 INFO L290 TraceCheckUtils]: 81: Hoare triple {127099#(< ~counter~0 94)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {127074#(< ~counter~0 95)} is VALID [2022-04-28 06:03:59,445 INFO L290 TraceCheckUtils]: 80: Hoare triple {127099#(< ~counter~0 94)} assume !(~r~0 > 0); {127099#(< ~counter~0 94)} is VALID [2022-04-28 06:03:59,446 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {126486#true} {127099#(< ~counter~0 94)} #96#return; {127099#(< ~counter~0 94)} is VALID [2022-04-28 06:03:59,446 INFO L290 TraceCheckUtils]: 78: Hoare triple {126486#true} assume true; {126486#true} is VALID [2022-04-28 06:03:59,446 INFO L290 TraceCheckUtils]: 77: Hoare triple {126486#true} assume !(0 == ~cond); {126486#true} is VALID [2022-04-28 06:03:59,446 INFO L290 TraceCheckUtils]: 76: Hoare triple {126486#true} ~cond := #in~cond; {126486#true} is VALID [2022-04-28 06:03:59,446 INFO L272 TraceCheckUtils]: 75: Hoare triple {127099#(< ~counter~0 94)} call __VERIFIER_assert((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#true} is VALID [2022-04-28 06:03:59,446 INFO L290 TraceCheckUtils]: 74: Hoare triple {127099#(< ~counter~0 94)} assume !!(#t~post7 < 100);havoc #t~post7; {127099#(< ~counter~0 94)} is VALID [2022-04-28 06:03:59,448 INFO L290 TraceCheckUtils]: 73: Hoare triple {127124#(< ~counter~0 93)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {127099#(< ~counter~0 94)} is VALID [2022-04-28 06:03:59,448 INFO L290 TraceCheckUtils]: 72: Hoare triple {127124#(< ~counter~0 93)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {127124#(< ~counter~0 93)} is VALID [2022-04-28 06:03:59,448 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {126486#true} {127124#(< ~counter~0 93)} #96#return; {127124#(< ~counter~0 93)} is VALID [2022-04-28 06:03:59,448 INFO L290 TraceCheckUtils]: 70: Hoare triple {126486#true} assume true; {126486#true} is VALID [2022-04-28 06:03:59,448 INFO L290 TraceCheckUtils]: 69: Hoare triple {126486#true} assume !(0 == ~cond); {126486#true} is VALID [2022-04-28 06:03:59,448 INFO L290 TraceCheckUtils]: 68: Hoare triple {126486#true} ~cond := #in~cond; {126486#true} is VALID [2022-04-28 06:03:59,449 INFO L272 TraceCheckUtils]: 67: Hoare triple {127124#(< ~counter~0 93)} call __VERIFIER_assert((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#true} is VALID [2022-04-28 06:03:59,449 INFO L290 TraceCheckUtils]: 66: Hoare triple {127124#(< ~counter~0 93)} assume !!(#t~post7 < 100);havoc #t~post7; {127124#(< ~counter~0 93)} is VALID [2022-04-28 06:03:59,450 INFO L290 TraceCheckUtils]: 65: Hoare triple {127149#(< ~counter~0 92)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {127124#(< ~counter~0 93)} is VALID [2022-04-28 06:03:59,450 INFO L290 TraceCheckUtils]: 64: Hoare triple {127149#(< ~counter~0 92)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {127149#(< ~counter~0 92)} is VALID [2022-04-28 06:03:59,451 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {126486#true} {127149#(< ~counter~0 92)} #96#return; {127149#(< ~counter~0 92)} is VALID [2022-04-28 06:03:59,451 INFO L290 TraceCheckUtils]: 62: Hoare triple {126486#true} assume true; {126486#true} is VALID [2022-04-28 06:03:59,451 INFO L290 TraceCheckUtils]: 61: Hoare triple {126486#true} assume !(0 == ~cond); {126486#true} is VALID [2022-04-28 06:03:59,451 INFO L290 TraceCheckUtils]: 60: Hoare triple {126486#true} ~cond := #in~cond; {126486#true} is VALID [2022-04-28 06:03:59,451 INFO L272 TraceCheckUtils]: 59: Hoare triple {127149#(< ~counter~0 92)} call __VERIFIER_assert((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#true} is VALID [2022-04-28 06:03:59,451 INFO L290 TraceCheckUtils]: 58: Hoare triple {127149#(< ~counter~0 92)} assume !!(#t~post7 < 100);havoc #t~post7; {127149#(< ~counter~0 92)} is VALID [2022-04-28 06:03:59,452 INFO L290 TraceCheckUtils]: 57: Hoare triple {127174#(< ~counter~0 91)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {127149#(< ~counter~0 92)} is VALID [2022-04-28 06:03:59,452 INFO L290 TraceCheckUtils]: 56: Hoare triple {127174#(< ~counter~0 91)} assume !!(0 != ~r~0); {127174#(< ~counter~0 91)} is VALID [2022-04-28 06:03:59,453 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {126486#true} {127174#(< ~counter~0 91)} #94#return; {127174#(< ~counter~0 91)} is VALID [2022-04-28 06:03:59,453 INFO L290 TraceCheckUtils]: 54: Hoare triple {126486#true} assume true; {126486#true} is VALID [2022-04-28 06:03:59,453 INFO L290 TraceCheckUtils]: 53: Hoare triple {126486#true} assume !(0 == ~cond); {126486#true} is VALID [2022-04-28 06:03:59,453 INFO L290 TraceCheckUtils]: 52: Hoare triple {126486#true} ~cond := #in~cond; {126486#true} is VALID [2022-04-28 06:03:59,453 INFO L272 TraceCheckUtils]: 51: Hoare triple {127174#(< ~counter~0 91)} call __VERIFIER_assert((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#true} is VALID [2022-04-28 06:03:59,453 INFO L290 TraceCheckUtils]: 50: Hoare triple {127174#(< ~counter~0 91)} assume !!(#t~post6 < 100);havoc #t~post6; {127174#(< ~counter~0 91)} is VALID [2022-04-28 06:03:59,455 INFO L290 TraceCheckUtils]: 49: Hoare triple {127199#(< ~counter~0 90)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {127174#(< ~counter~0 91)} is VALID [2022-04-28 06:03:59,455 INFO L290 TraceCheckUtils]: 48: Hoare triple {127199#(< ~counter~0 90)} assume !(~r~0 < 0); {127199#(< ~counter~0 90)} is VALID [2022-04-28 06:03:59,455 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {126486#true} {127199#(< ~counter~0 90)} #98#return; {127199#(< ~counter~0 90)} is VALID [2022-04-28 06:03:59,455 INFO L290 TraceCheckUtils]: 46: Hoare triple {126486#true} assume true; {126486#true} is VALID [2022-04-28 06:03:59,455 INFO L290 TraceCheckUtils]: 45: Hoare triple {126486#true} assume !(0 == ~cond); {126486#true} is VALID [2022-04-28 06:03:59,455 INFO L290 TraceCheckUtils]: 44: Hoare triple {126486#true} ~cond := #in~cond; {126486#true} is VALID [2022-04-28 06:03:59,456 INFO L272 TraceCheckUtils]: 43: Hoare triple {127199#(< ~counter~0 90)} call __VERIFIER_assert((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#true} is VALID [2022-04-28 06:03:59,456 INFO L290 TraceCheckUtils]: 42: Hoare triple {127199#(< ~counter~0 90)} assume !!(#t~post8 < 100);havoc #t~post8; {127199#(< ~counter~0 90)} is VALID [2022-04-28 06:03:59,457 INFO L290 TraceCheckUtils]: 41: Hoare triple {127224#(< ~counter~0 89)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {127199#(< ~counter~0 90)} is VALID [2022-04-28 06:03:59,457 INFO L290 TraceCheckUtils]: 40: Hoare triple {127224#(< ~counter~0 89)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {127224#(< ~counter~0 89)} is VALID [2022-04-28 06:03:59,458 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {126486#true} {127224#(< ~counter~0 89)} #98#return; {127224#(< ~counter~0 89)} is VALID [2022-04-28 06:03:59,458 INFO L290 TraceCheckUtils]: 38: Hoare triple {126486#true} assume true; {126486#true} is VALID [2022-04-28 06:03:59,458 INFO L290 TraceCheckUtils]: 37: Hoare triple {126486#true} assume !(0 == ~cond); {126486#true} is VALID [2022-04-28 06:03:59,458 INFO L290 TraceCheckUtils]: 36: Hoare triple {126486#true} ~cond := #in~cond; {126486#true} is VALID [2022-04-28 06:03:59,458 INFO L272 TraceCheckUtils]: 35: Hoare triple {127224#(< ~counter~0 89)} call __VERIFIER_assert((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#true} is VALID [2022-04-28 06:03:59,458 INFO L290 TraceCheckUtils]: 34: Hoare triple {127224#(< ~counter~0 89)} assume !!(#t~post8 < 100);havoc #t~post8; {127224#(< ~counter~0 89)} is VALID [2022-04-28 06:03:59,459 INFO L290 TraceCheckUtils]: 33: Hoare triple {127249#(< ~counter~0 88)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {127224#(< ~counter~0 89)} is VALID [2022-04-28 06:03:59,460 INFO L290 TraceCheckUtils]: 32: Hoare triple {127249#(< ~counter~0 88)} assume !(~r~0 > 0); {127249#(< ~counter~0 88)} is VALID [2022-04-28 06:03:59,460 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {126486#true} {127249#(< ~counter~0 88)} #96#return; {127249#(< ~counter~0 88)} is VALID [2022-04-28 06:03:59,460 INFO L290 TraceCheckUtils]: 30: Hoare triple {126486#true} assume true; {126486#true} is VALID [2022-04-28 06:03:59,460 INFO L290 TraceCheckUtils]: 29: Hoare triple {126486#true} assume !(0 == ~cond); {126486#true} is VALID [2022-04-28 06:03:59,460 INFO L290 TraceCheckUtils]: 28: Hoare triple {126486#true} ~cond := #in~cond; {126486#true} is VALID [2022-04-28 06:03:59,460 INFO L272 TraceCheckUtils]: 27: Hoare triple {127249#(< ~counter~0 88)} call __VERIFIER_assert((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#true} is VALID [2022-04-28 06:03:59,461 INFO L290 TraceCheckUtils]: 26: Hoare triple {127249#(< ~counter~0 88)} assume !!(#t~post7 < 100);havoc #t~post7; {127249#(< ~counter~0 88)} is VALID [2022-04-28 06:03:59,462 INFO L290 TraceCheckUtils]: 25: Hoare triple {127274#(< ~counter~0 87)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {127249#(< ~counter~0 88)} is VALID [2022-04-28 06:03:59,462 INFO L290 TraceCheckUtils]: 24: Hoare triple {127274#(< ~counter~0 87)} assume !!(0 != ~r~0); {127274#(< ~counter~0 87)} is VALID [2022-04-28 06:03:59,462 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {126486#true} {127274#(< ~counter~0 87)} #94#return; {127274#(< ~counter~0 87)} is VALID [2022-04-28 06:03:59,463 INFO L290 TraceCheckUtils]: 22: Hoare triple {126486#true} assume true; {126486#true} is VALID [2022-04-28 06:03:59,463 INFO L290 TraceCheckUtils]: 21: Hoare triple {126486#true} assume !(0 == ~cond); {126486#true} is VALID [2022-04-28 06:03:59,463 INFO L290 TraceCheckUtils]: 20: Hoare triple {126486#true} ~cond := #in~cond; {126486#true} is VALID [2022-04-28 06:03:59,463 INFO L272 TraceCheckUtils]: 19: Hoare triple {127274#(< ~counter~0 87)} call __VERIFIER_assert((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#true} is VALID [2022-04-28 06:03:59,463 INFO L290 TraceCheckUtils]: 18: Hoare triple {127274#(< ~counter~0 87)} assume !!(#t~post6 < 100);havoc #t~post6; {127274#(< ~counter~0 87)} is VALID [2022-04-28 06:03:59,464 INFO L290 TraceCheckUtils]: 17: Hoare triple {127299#(< ~counter~0 86)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {127274#(< ~counter~0 87)} is VALID [2022-04-28 06:03:59,464 INFO L290 TraceCheckUtils]: 16: Hoare triple {127299#(< ~counter~0 86)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {127299#(< ~counter~0 86)} is VALID [2022-04-28 06:03:59,465 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {126486#true} {127299#(< ~counter~0 86)} #92#return; {127299#(< ~counter~0 86)} is VALID [2022-04-28 06:03:59,465 INFO L290 TraceCheckUtils]: 14: Hoare triple {126486#true} assume true; {126486#true} is VALID [2022-04-28 06:03:59,465 INFO L290 TraceCheckUtils]: 13: Hoare triple {126486#true} assume !(0 == ~cond); {126486#true} is VALID [2022-04-28 06:03:59,465 INFO L290 TraceCheckUtils]: 12: Hoare triple {126486#true} ~cond := #in~cond; {126486#true} is VALID [2022-04-28 06:03:59,465 INFO L272 TraceCheckUtils]: 11: Hoare triple {127299#(< ~counter~0 86)} 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)); {126486#true} is VALID [2022-04-28 06:03:59,466 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {126486#true} {127299#(< ~counter~0 86)} #90#return; {127299#(< ~counter~0 86)} is VALID [2022-04-28 06:03:59,466 INFO L290 TraceCheckUtils]: 9: Hoare triple {126486#true} assume true; {126486#true} is VALID [2022-04-28 06:03:59,466 INFO L290 TraceCheckUtils]: 8: Hoare triple {126486#true} assume !(0 == ~cond); {126486#true} is VALID [2022-04-28 06:03:59,466 INFO L290 TraceCheckUtils]: 7: Hoare triple {126486#true} ~cond := #in~cond; {126486#true} is VALID [2022-04-28 06:03:59,466 INFO L272 TraceCheckUtils]: 6: Hoare triple {127299#(< ~counter~0 86)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {126486#true} is VALID [2022-04-28 06:03:59,466 INFO L290 TraceCheckUtils]: 5: Hoare triple {127299#(< ~counter~0 86)} 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; {127299#(< ~counter~0 86)} is VALID [2022-04-28 06:03:59,466 INFO L272 TraceCheckUtils]: 4: Hoare triple {127299#(< ~counter~0 86)} call #t~ret9 := main(); {127299#(< ~counter~0 86)} is VALID [2022-04-28 06:03:59,467 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {127299#(< ~counter~0 86)} {126486#true} #102#return; {127299#(< ~counter~0 86)} is VALID [2022-04-28 06:03:59,467 INFO L290 TraceCheckUtils]: 2: Hoare triple {127299#(< ~counter~0 86)} assume true; {127299#(< ~counter~0 86)} is VALID [2022-04-28 06:03:59,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {126486#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; {127299#(< ~counter~0 86)} is VALID [2022-04-28 06:03:59,467 INFO L272 TraceCheckUtils]: 0: Hoare triple {126486#true} call ULTIMATE.init(); {126486#true} is VALID [2022-04-28 06:03:59,468 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 42 proven. 134 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2022-04-28 06:03:59,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:03:59,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30748221] [2022-04-28 06:03:59,468 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:03:59,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475105947] [2022-04-28 06:03:59,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [475105947] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:03:59,468 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:03:59,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2022-04-28 06:03:59,469 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:03:59,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1385776870] [2022-04-28 06:03:59,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1385776870] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:03:59,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:03:59,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 06:03:59,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764074868] [2022-04-28 06:03:59,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:03:59,469 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.555555555555555) internal successors, (100), 17 states have internal predecessors, (100), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) Word has length 139 [2022-04-28 06:03:59,469 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:03:59,469 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 5.555555555555555) internal successors, (100), 17 states have internal predecessors, (100), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-28 06:03:59,612 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:03:59,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 06:03:59,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:03:59,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 06:03:59,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=501, Invalid=621, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 06:03:59,613 INFO L87 Difference]: Start difference. First operand 775 states and 1047 transitions. Second operand has 18 states, 18 states have (on average 5.555555555555555) internal successors, (100), 17 states have internal predecessors, (100), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-28 06:04:04,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:04:04,231 INFO L93 Difference]: Finished difference Result 945 states and 1302 transitions. [2022-04-28 06:04:04,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-28 06:04:04,231 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.555555555555555) internal successors, (100), 17 states have internal predecessors, (100), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) Word has length 139 [2022-04-28 06:04:04,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:04:04,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 5.555555555555555) internal successors, (100), 17 states have internal predecessors, (100), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-28 06:04:04,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 316 transitions. [2022-04-28 06:04:04,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 5.555555555555555) internal successors, (100), 17 states have internal predecessors, (100), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-28 06:04:04,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 316 transitions. [2022-04-28 06:04:04,236 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 316 transitions. [2022-04-28 06:04:04,598 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 316 edges. 316 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:04:04,628 INFO L225 Difference]: With dead ends: 945 [2022-04-28 06:04:04,628 INFO L226 Difference]: Without dead ends: 775 [2022-04-28 06:04:04,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=917, Invalid=1245, Unknown=0, NotChecked=0, Total=2162 [2022-04-28 06:04:04,631 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 212 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 06:04:04,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 324 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 06:04:04,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2022-04-28 06:04:07,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 775. [2022-04-28 06:04:07,280 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:04:07,281 INFO L82 GeneralOperation]: Start isEquivalent. First operand 775 states. Second operand has 775 states, 579 states have (on average 1.1934369602763386) internal successors, (691), 596 states have internal predecessors, (691), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 157 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-28 06:04:07,281 INFO L74 IsIncluded]: Start isIncluded. First operand 775 states. Second operand has 775 states, 579 states have (on average 1.1934369602763386) internal successors, (691), 596 states have internal predecessors, (691), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 157 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-28 06:04:07,282 INFO L87 Difference]: Start difference. First operand 775 states. Second operand has 775 states, 579 states have (on average 1.1934369602763386) internal successors, (691), 596 states have internal predecessors, (691), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 157 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-28 06:04:07,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:04:07,312 INFO L93 Difference]: Finished difference Result 775 states and 1041 transitions. [2022-04-28 06:04:07,313 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1041 transitions. [2022-04-28 06:04:07,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:04:07,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:04:07,315 INFO L74 IsIncluded]: Start isIncluded. First operand has 775 states, 579 states have (on average 1.1934369602763386) internal successors, (691), 596 states have internal predecessors, (691), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 157 states have call predecessors, (174), 174 states have call successors, (174) Second operand 775 states. [2022-04-28 06:04:07,316 INFO L87 Difference]: Start difference. First operand has 775 states, 579 states have (on average 1.1934369602763386) internal successors, (691), 596 states have internal predecessors, (691), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 157 states have call predecessors, (174), 174 states have call successors, (174) Second operand 775 states. [2022-04-28 06:04:07,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:04:07,347 INFO L93 Difference]: Finished difference Result 775 states and 1041 transitions. [2022-04-28 06:04:07,347 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1041 transitions. [2022-04-28 06:04:07,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:04:07,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:04:07,348 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:04:07,348 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:04:07,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 775 states, 579 states have (on average 1.1934369602763386) internal successors, (691), 596 states have internal predecessors, (691), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 157 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-28 06:04:07,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1041 transitions. [2022-04-28 06:04:07,388 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1041 transitions. Word has length 139 [2022-04-28 06:04:07,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:04:07,389 INFO L495 AbstractCegarLoop]: Abstraction has 775 states and 1041 transitions. [2022-04-28 06:04:07,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.555555555555555) internal successors, (100), 17 states have internal predecessors, (100), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-28 06:04:07,389 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 775 states and 1041 transitions. [2022-04-28 06:04:16,916 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1041 edges. 1040 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 06:04:16,916 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1041 transitions. [2022-04-28 06:04:16,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-04-28 06:04:16,918 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:04:16,918 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 15, 7, 7, 7, 7, 6, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:04:16,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2022-04-28 06:04:17,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-04-28 06:04:17,118 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:04:17,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:04:17,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1908608861, now seen corresponding path program 25 times [2022-04-28 06:04:17,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:04:17,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [217678005] [2022-04-28 06:04:17,119 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:04:17,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1908608861, now seen corresponding path program 26 times [2022-04-28 06:04:17,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:04:17,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356713721] [2022-04-28 06:04:17,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:04:17,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:04:17,131 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:04:17,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1730996434] [2022-04-28 06:04:17,132 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 06:04:17,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:04:17,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:04:17,133 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:04:17,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-04-28 06:04:17,198 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 06:04:17,198 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:04:17,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-28 06:04:17,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:04:17,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:04:18,035 INFO L272 TraceCheckUtils]: 0: Hoare triple {132369#true} call ULTIMATE.init(); {132369#true} is VALID [2022-04-28 06:04:18,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {132369#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; {132377#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:18,036 INFO L290 TraceCheckUtils]: 2: Hoare triple {132377#(<= ~counter~0 0)} assume true; {132377#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:18,036 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {132377#(<= ~counter~0 0)} {132369#true} #102#return; {132377#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:18,037 INFO L272 TraceCheckUtils]: 4: Hoare triple {132377#(<= ~counter~0 0)} call #t~ret9 := main(); {132377#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:18,037 INFO L290 TraceCheckUtils]: 5: Hoare triple {132377#(<= ~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; {132377#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:18,038 INFO L272 TraceCheckUtils]: 6: Hoare triple {132377#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {132377#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:18,038 INFO L290 TraceCheckUtils]: 7: Hoare triple {132377#(<= ~counter~0 0)} ~cond := #in~cond; {132377#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:18,038 INFO L290 TraceCheckUtils]: 8: Hoare triple {132377#(<= ~counter~0 0)} assume !(0 == ~cond); {132377#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:18,038 INFO L290 TraceCheckUtils]: 9: Hoare triple {132377#(<= ~counter~0 0)} assume true; {132377#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:18,039 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {132377#(<= ~counter~0 0)} {132377#(<= ~counter~0 0)} #90#return; {132377#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:18,039 INFO L272 TraceCheckUtils]: 11: Hoare triple {132377#(<= ~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)); {132377#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:18,039 INFO L290 TraceCheckUtils]: 12: Hoare triple {132377#(<= ~counter~0 0)} ~cond := #in~cond; {132377#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:18,040 INFO L290 TraceCheckUtils]: 13: Hoare triple {132377#(<= ~counter~0 0)} assume !(0 == ~cond); {132377#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:18,040 INFO L290 TraceCheckUtils]: 14: Hoare triple {132377#(<= ~counter~0 0)} assume true; {132377#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:18,040 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {132377#(<= ~counter~0 0)} {132377#(<= ~counter~0 0)} #92#return; {132377#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:18,040 INFO L290 TraceCheckUtils]: 16: Hoare triple {132377#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {132377#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:18,043 INFO L290 TraceCheckUtils]: 17: Hoare triple {132377#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {132426#(<= ~counter~0 1)} is VALID [2022-04-28 06:04:18,043 INFO L290 TraceCheckUtils]: 18: Hoare triple {132426#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {132426#(<= ~counter~0 1)} is VALID [2022-04-28 06:04:18,044 INFO L272 TraceCheckUtils]: 19: Hoare triple {132426#(<= ~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)); {132426#(<= ~counter~0 1)} is VALID [2022-04-28 06:04:18,044 INFO L290 TraceCheckUtils]: 20: Hoare triple {132426#(<= ~counter~0 1)} ~cond := #in~cond; {132426#(<= ~counter~0 1)} is VALID [2022-04-28 06:04:18,044 INFO L290 TraceCheckUtils]: 21: Hoare triple {132426#(<= ~counter~0 1)} assume !(0 == ~cond); {132426#(<= ~counter~0 1)} is VALID [2022-04-28 06:04:18,045 INFO L290 TraceCheckUtils]: 22: Hoare triple {132426#(<= ~counter~0 1)} assume true; {132426#(<= ~counter~0 1)} is VALID [2022-04-28 06:04:18,045 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {132426#(<= ~counter~0 1)} {132426#(<= ~counter~0 1)} #94#return; {132426#(<= ~counter~0 1)} is VALID [2022-04-28 06:04:18,045 INFO L290 TraceCheckUtils]: 24: Hoare triple {132426#(<= ~counter~0 1)} assume !!(0 != ~r~0); {132426#(<= ~counter~0 1)} is VALID [2022-04-28 06:04:18,047 INFO L290 TraceCheckUtils]: 25: Hoare triple {132426#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {132451#(<= ~counter~0 2)} is VALID [2022-04-28 06:04:18,047 INFO L290 TraceCheckUtils]: 26: Hoare triple {132451#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {132451#(<= ~counter~0 2)} is VALID [2022-04-28 06:04:18,048 INFO L272 TraceCheckUtils]: 27: Hoare triple {132451#(<= ~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)); {132451#(<= ~counter~0 2)} is VALID [2022-04-28 06:04:18,048 INFO L290 TraceCheckUtils]: 28: Hoare triple {132451#(<= ~counter~0 2)} ~cond := #in~cond; {132451#(<= ~counter~0 2)} is VALID [2022-04-28 06:04:18,048 INFO L290 TraceCheckUtils]: 29: Hoare triple {132451#(<= ~counter~0 2)} assume !(0 == ~cond); {132451#(<= ~counter~0 2)} is VALID [2022-04-28 06:04:18,048 INFO L290 TraceCheckUtils]: 30: Hoare triple {132451#(<= ~counter~0 2)} assume true; {132451#(<= ~counter~0 2)} is VALID [2022-04-28 06:04:18,049 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {132451#(<= ~counter~0 2)} {132451#(<= ~counter~0 2)} #96#return; {132451#(<= ~counter~0 2)} is VALID [2022-04-28 06:04:18,049 INFO L290 TraceCheckUtils]: 32: Hoare triple {132451#(<= ~counter~0 2)} assume !(~r~0 > 0); {132451#(<= ~counter~0 2)} is VALID [2022-04-28 06:04:18,050 INFO L290 TraceCheckUtils]: 33: Hoare triple {132451#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {132476#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:18,050 INFO L290 TraceCheckUtils]: 34: Hoare triple {132476#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {132476#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:18,051 INFO L272 TraceCheckUtils]: 35: Hoare triple {132476#(<= ~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)); {132476#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:18,051 INFO L290 TraceCheckUtils]: 36: Hoare triple {132476#(<= ~counter~0 3)} ~cond := #in~cond; {132476#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:18,051 INFO L290 TraceCheckUtils]: 37: Hoare triple {132476#(<= ~counter~0 3)} assume !(0 == ~cond); {132476#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:18,052 INFO L290 TraceCheckUtils]: 38: Hoare triple {132476#(<= ~counter~0 3)} assume true; {132476#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:18,052 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {132476#(<= ~counter~0 3)} {132476#(<= ~counter~0 3)} #98#return; {132476#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:18,052 INFO L290 TraceCheckUtils]: 40: Hoare triple {132476#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {132476#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:18,053 INFO L290 TraceCheckUtils]: 41: Hoare triple {132476#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {132501#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:18,054 INFO L290 TraceCheckUtils]: 42: Hoare triple {132501#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {132501#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:18,054 INFO L272 TraceCheckUtils]: 43: Hoare triple {132501#(<= ~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)); {132501#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:18,054 INFO L290 TraceCheckUtils]: 44: Hoare triple {132501#(<= ~counter~0 4)} ~cond := #in~cond; {132501#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:18,055 INFO L290 TraceCheckUtils]: 45: Hoare triple {132501#(<= ~counter~0 4)} assume !(0 == ~cond); {132501#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:18,055 INFO L290 TraceCheckUtils]: 46: Hoare triple {132501#(<= ~counter~0 4)} assume true; {132501#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:18,055 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {132501#(<= ~counter~0 4)} {132501#(<= ~counter~0 4)} #98#return; {132501#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:18,056 INFO L290 TraceCheckUtils]: 48: Hoare triple {132501#(<= ~counter~0 4)} assume !(~r~0 < 0); {132501#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:18,057 INFO L290 TraceCheckUtils]: 49: Hoare triple {132501#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {132526#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:18,057 INFO L290 TraceCheckUtils]: 50: Hoare triple {132526#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {132526#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:18,058 INFO L272 TraceCheckUtils]: 51: Hoare triple {132526#(<= ~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)); {132526#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:18,058 INFO L290 TraceCheckUtils]: 52: Hoare triple {132526#(<= ~counter~0 5)} ~cond := #in~cond; {132526#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:18,058 INFO L290 TraceCheckUtils]: 53: Hoare triple {132526#(<= ~counter~0 5)} assume !(0 == ~cond); {132526#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:18,058 INFO L290 TraceCheckUtils]: 54: Hoare triple {132526#(<= ~counter~0 5)} assume true; {132526#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:18,059 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {132526#(<= ~counter~0 5)} {132526#(<= ~counter~0 5)} #94#return; {132526#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:18,059 INFO L290 TraceCheckUtils]: 56: Hoare triple {132526#(<= ~counter~0 5)} assume !!(0 != ~r~0); {132526#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:18,060 INFO L290 TraceCheckUtils]: 57: Hoare triple {132526#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {132551#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:18,061 INFO L290 TraceCheckUtils]: 58: Hoare triple {132551#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {132551#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:18,061 INFO L272 TraceCheckUtils]: 59: Hoare triple {132551#(<= ~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)); {132551#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:18,061 INFO L290 TraceCheckUtils]: 60: Hoare triple {132551#(<= ~counter~0 6)} ~cond := #in~cond; {132551#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:18,062 INFO L290 TraceCheckUtils]: 61: Hoare triple {132551#(<= ~counter~0 6)} assume !(0 == ~cond); {132551#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:18,062 INFO L290 TraceCheckUtils]: 62: Hoare triple {132551#(<= ~counter~0 6)} assume true; {132551#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:18,062 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {132551#(<= ~counter~0 6)} {132551#(<= ~counter~0 6)} #96#return; {132551#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:18,063 INFO L290 TraceCheckUtils]: 64: Hoare triple {132551#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {132551#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:18,064 INFO L290 TraceCheckUtils]: 65: Hoare triple {132551#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {132576#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:18,064 INFO L290 TraceCheckUtils]: 66: Hoare triple {132576#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {132576#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:18,064 INFO L272 TraceCheckUtils]: 67: Hoare triple {132576#(<= ~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)); {132576#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:18,065 INFO L290 TraceCheckUtils]: 68: Hoare triple {132576#(<= ~counter~0 7)} ~cond := #in~cond; {132576#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:18,065 INFO L290 TraceCheckUtils]: 69: Hoare triple {132576#(<= ~counter~0 7)} assume !(0 == ~cond); {132576#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:18,065 INFO L290 TraceCheckUtils]: 70: Hoare triple {132576#(<= ~counter~0 7)} assume true; {132576#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:18,066 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {132576#(<= ~counter~0 7)} {132576#(<= ~counter~0 7)} #96#return; {132576#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:18,066 INFO L290 TraceCheckUtils]: 72: Hoare triple {132576#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {132576#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:18,067 INFO L290 TraceCheckUtils]: 73: Hoare triple {132576#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {132601#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:18,067 INFO L290 TraceCheckUtils]: 74: Hoare triple {132601#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {132601#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:18,068 INFO L272 TraceCheckUtils]: 75: Hoare triple {132601#(<= ~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)); {132601#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:18,068 INFO L290 TraceCheckUtils]: 76: Hoare triple {132601#(<= ~counter~0 8)} ~cond := #in~cond; {132601#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:18,068 INFO L290 TraceCheckUtils]: 77: Hoare triple {132601#(<= ~counter~0 8)} assume !(0 == ~cond); {132601#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:18,069 INFO L290 TraceCheckUtils]: 78: Hoare triple {132601#(<= ~counter~0 8)} assume true; {132601#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:18,069 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {132601#(<= ~counter~0 8)} {132601#(<= ~counter~0 8)} #96#return; {132601#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:18,069 INFO L290 TraceCheckUtils]: 80: Hoare triple {132601#(<= ~counter~0 8)} assume !(~r~0 > 0); {132601#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:18,071 INFO L290 TraceCheckUtils]: 81: Hoare triple {132601#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {132626#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:18,071 INFO L290 TraceCheckUtils]: 82: Hoare triple {132626#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {132626#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:18,071 INFO L272 TraceCheckUtils]: 83: Hoare triple {132626#(<= ~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)); {132626#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:18,072 INFO L290 TraceCheckUtils]: 84: Hoare triple {132626#(<= ~counter~0 9)} ~cond := #in~cond; {132626#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:18,072 INFO L290 TraceCheckUtils]: 85: Hoare triple {132626#(<= ~counter~0 9)} assume !(0 == ~cond); {132626#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:18,072 INFO L290 TraceCheckUtils]: 86: Hoare triple {132626#(<= ~counter~0 9)} assume true; {132626#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:18,073 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {132626#(<= ~counter~0 9)} {132626#(<= ~counter~0 9)} #98#return; {132626#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:18,073 INFO L290 TraceCheckUtils]: 88: Hoare triple {132626#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {132626#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:18,074 INFO L290 TraceCheckUtils]: 89: Hoare triple {132626#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {132651#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:18,074 INFO L290 TraceCheckUtils]: 90: Hoare triple {132651#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {132651#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:18,075 INFO L272 TraceCheckUtils]: 91: Hoare triple {132651#(<= ~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)); {132651#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:18,075 INFO L290 TraceCheckUtils]: 92: Hoare triple {132651#(<= ~counter~0 10)} ~cond := #in~cond; {132651#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:18,075 INFO L290 TraceCheckUtils]: 93: Hoare triple {132651#(<= ~counter~0 10)} assume !(0 == ~cond); {132651#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:18,076 INFO L290 TraceCheckUtils]: 94: Hoare triple {132651#(<= ~counter~0 10)} assume true; {132651#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:18,076 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {132651#(<= ~counter~0 10)} {132651#(<= ~counter~0 10)} #98#return; {132651#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:18,076 INFO L290 TraceCheckUtils]: 96: Hoare triple {132651#(<= ~counter~0 10)} assume !(~r~0 < 0); {132651#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:18,077 INFO L290 TraceCheckUtils]: 97: Hoare triple {132651#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {132676#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:18,078 INFO L290 TraceCheckUtils]: 98: Hoare triple {132676#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {132676#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:18,078 INFO L272 TraceCheckUtils]: 99: Hoare triple {132676#(<= ~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)); {132676#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:18,078 INFO L290 TraceCheckUtils]: 100: Hoare triple {132676#(<= ~counter~0 11)} ~cond := #in~cond; {132676#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:18,079 INFO L290 TraceCheckUtils]: 101: Hoare triple {132676#(<= ~counter~0 11)} assume !(0 == ~cond); {132676#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:18,079 INFO L290 TraceCheckUtils]: 102: Hoare triple {132676#(<= ~counter~0 11)} assume true; {132676#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:18,079 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {132676#(<= ~counter~0 11)} {132676#(<= ~counter~0 11)} #94#return; {132676#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:18,080 INFO L290 TraceCheckUtils]: 104: Hoare triple {132676#(<= ~counter~0 11)} assume !!(0 != ~r~0); {132676#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:18,081 INFO L290 TraceCheckUtils]: 105: Hoare triple {132676#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {132701#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:18,081 INFO L290 TraceCheckUtils]: 106: Hoare triple {132701#(<= ~counter~0 12)} assume !!(#t~post7 < 100);havoc #t~post7; {132701#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:18,081 INFO L272 TraceCheckUtils]: 107: Hoare triple {132701#(<= ~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)); {132701#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:18,082 INFO L290 TraceCheckUtils]: 108: Hoare triple {132701#(<= ~counter~0 12)} ~cond := #in~cond; {132701#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:18,082 INFO L290 TraceCheckUtils]: 109: Hoare triple {132701#(<= ~counter~0 12)} assume !(0 == ~cond); {132701#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:18,082 INFO L290 TraceCheckUtils]: 110: Hoare triple {132701#(<= ~counter~0 12)} assume true; {132701#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:18,083 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {132701#(<= ~counter~0 12)} {132701#(<= ~counter~0 12)} #96#return; {132701#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:18,083 INFO L290 TraceCheckUtils]: 112: Hoare triple {132701#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {132701#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:18,084 INFO L290 TraceCheckUtils]: 113: Hoare triple {132701#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {132726#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:18,084 INFO L290 TraceCheckUtils]: 114: Hoare triple {132726#(<= ~counter~0 13)} assume !!(#t~post7 < 100);havoc #t~post7; {132726#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:18,085 INFO L272 TraceCheckUtils]: 115: Hoare triple {132726#(<= ~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)); {132726#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:18,085 INFO L290 TraceCheckUtils]: 116: Hoare triple {132726#(<= ~counter~0 13)} ~cond := #in~cond; {132726#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:18,085 INFO L290 TraceCheckUtils]: 117: Hoare triple {132726#(<= ~counter~0 13)} assume !(0 == ~cond); {132726#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:18,085 INFO L290 TraceCheckUtils]: 118: Hoare triple {132726#(<= ~counter~0 13)} assume true; {132726#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:18,086 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {132726#(<= ~counter~0 13)} {132726#(<= ~counter~0 13)} #96#return; {132726#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:18,086 INFO L290 TraceCheckUtils]: 120: Hoare triple {132726#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {132726#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:18,087 INFO L290 TraceCheckUtils]: 121: Hoare triple {132726#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {132751#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:18,087 INFO L290 TraceCheckUtils]: 122: Hoare triple {132751#(<= ~counter~0 14)} assume !!(#t~post7 < 100);havoc #t~post7; {132751#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:18,088 INFO L272 TraceCheckUtils]: 123: Hoare triple {132751#(<= ~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)); {132751#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:18,088 INFO L290 TraceCheckUtils]: 124: Hoare triple {132751#(<= ~counter~0 14)} ~cond := #in~cond; {132751#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:18,088 INFO L290 TraceCheckUtils]: 125: Hoare triple {132751#(<= ~counter~0 14)} assume !(0 == ~cond); {132751#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:18,089 INFO L290 TraceCheckUtils]: 126: Hoare triple {132751#(<= ~counter~0 14)} assume true; {132751#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:18,089 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {132751#(<= ~counter~0 14)} {132751#(<= ~counter~0 14)} #96#return; {132751#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:18,089 INFO L290 TraceCheckUtils]: 128: Hoare triple {132751#(<= ~counter~0 14)} assume !(~r~0 > 0); {132751#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:18,091 INFO L290 TraceCheckUtils]: 129: Hoare triple {132751#(<= ~counter~0 14)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {132776#(<= ~counter~0 15)} is VALID [2022-04-28 06:04:18,091 INFO L290 TraceCheckUtils]: 130: Hoare triple {132776#(<= ~counter~0 15)} assume !!(#t~post8 < 100);havoc #t~post8; {132776#(<= ~counter~0 15)} is VALID [2022-04-28 06:04:18,091 INFO L272 TraceCheckUtils]: 131: Hoare triple {132776#(<= ~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)); {132776#(<= ~counter~0 15)} is VALID [2022-04-28 06:04:18,092 INFO L290 TraceCheckUtils]: 132: Hoare triple {132776#(<= ~counter~0 15)} ~cond := #in~cond; {132776#(<= ~counter~0 15)} is VALID [2022-04-28 06:04:18,092 INFO L290 TraceCheckUtils]: 133: Hoare triple {132776#(<= ~counter~0 15)} assume !(0 == ~cond); {132776#(<= ~counter~0 15)} is VALID [2022-04-28 06:04:18,092 INFO L290 TraceCheckUtils]: 134: Hoare triple {132776#(<= ~counter~0 15)} assume true; {132776#(<= ~counter~0 15)} is VALID [2022-04-28 06:04:18,092 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {132776#(<= ~counter~0 15)} {132776#(<= ~counter~0 15)} #98#return; {132776#(<= ~counter~0 15)} is VALID [2022-04-28 06:04:18,093 INFO L290 TraceCheckUtils]: 136: Hoare triple {132776#(<= ~counter~0 15)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {132776#(<= ~counter~0 15)} is VALID [2022-04-28 06:04:18,093 INFO L290 TraceCheckUtils]: 137: Hoare triple {132776#(<= ~counter~0 15)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {132801#(<= |main_#t~post8| 15)} is VALID [2022-04-28 06:04:18,093 INFO L290 TraceCheckUtils]: 138: Hoare triple {132801#(<= |main_#t~post8| 15)} assume !(#t~post8 < 100);havoc #t~post8; {132370#false} is VALID [2022-04-28 06:04:18,093 INFO L290 TraceCheckUtils]: 139: Hoare triple {132370#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {132370#false} is VALID [2022-04-28 06:04:18,094 INFO L290 TraceCheckUtils]: 140: Hoare triple {132370#false} assume !(#t~post6 < 100);havoc #t~post6; {132370#false} is VALID [2022-04-28 06:04:18,094 INFO L272 TraceCheckUtils]: 141: Hoare triple {132370#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)); {132370#false} is VALID [2022-04-28 06:04:18,094 INFO L290 TraceCheckUtils]: 142: Hoare triple {132370#false} ~cond := #in~cond; {132370#false} is VALID [2022-04-28 06:04:18,094 INFO L290 TraceCheckUtils]: 143: Hoare triple {132370#false} assume 0 == ~cond; {132370#false} is VALID [2022-04-28 06:04:18,094 INFO L290 TraceCheckUtils]: 144: Hoare triple {132370#false} assume !false; {132370#false} is VALID [2022-04-28 06:04:18,094 INFO L134 CoverageAnalysis]: Checked inductivity of 606 backedges. 36 proven. 566 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 06:04:18,094 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:04:19,072 INFO L290 TraceCheckUtils]: 144: Hoare triple {132370#false} assume !false; {132370#false} is VALID [2022-04-28 06:04:19,072 INFO L290 TraceCheckUtils]: 143: Hoare triple {132370#false} assume 0 == ~cond; {132370#false} is VALID [2022-04-28 06:04:19,072 INFO L290 TraceCheckUtils]: 142: Hoare triple {132370#false} ~cond := #in~cond; {132370#false} is VALID [2022-04-28 06:04:19,073 INFO L272 TraceCheckUtils]: 141: Hoare triple {132370#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)); {132370#false} is VALID [2022-04-28 06:04:19,073 INFO L290 TraceCheckUtils]: 140: Hoare triple {132370#false} assume !(#t~post6 < 100);havoc #t~post6; {132370#false} is VALID [2022-04-28 06:04:19,073 INFO L290 TraceCheckUtils]: 139: Hoare triple {132370#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {132370#false} is VALID [2022-04-28 06:04:19,073 INFO L290 TraceCheckUtils]: 138: Hoare triple {132841#(< |main_#t~post8| 100)} assume !(#t~post8 < 100);havoc #t~post8; {132370#false} is VALID [2022-04-28 06:04:19,073 INFO L290 TraceCheckUtils]: 137: Hoare triple {132845#(< ~counter~0 100)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {132841#(< |main_#t~post8| 100)} is VALID [2022-04-28 06:04:19,074 INFO L290 TraceCheckUtils]: 136: Hoare triple {132845#(< ~counter~0 100)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {132845#(< ~counter~0 100)} is VALID [2022-04-28 06:04:19,074 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {132369#true} {132845#(< ~counter~0 100)} #98#return; {132845#(< ~counter~0 100)} is VALID [2022-04-28 06:04:19,074 INFO L290 TraceCheckUtils]: 134: Hoare triple {132369#true} assume true; {132369#true} is VALID [2022-04-28 06:04:19,074 INFO L290 TraceCheckUtils]: 133: Hoare triple {132369#true} assume !(0 == ~cond); {132369#true} is VALID [2022-04-28 06:04:19,074 INFO L290 TraceCheckUtils]: 132: Hoare triple {132369#true} ~cond := #in~cond; {132369#true} is VALID [2022-04-28 06:04:19,074 INFO L272 TraceCheckUtils]: 131: Hoare triple {132845#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132369#true} is VALID [2022-04-28 06:04:19,075 INFO L290 TraceCheckUtils]: 130: Hoare triple {132845#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {132845#(< ~counter~0 100)} is VALID [2022-04-28 06:04:19,077 INFO L290 TraceCheckUtils]: 129: Hoare triple {132870#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {132845#(< ~counter~0 100)} is VALID [2022-04-28 06:04:19,077 INFO L290 TraceCheckUtils]: 128: Hoare triple {132870#(< ~counter~0 99)} assume !(~r~0 > 0); {132870#(< ~counter~0 99)} is VALID [2022-04-28 06:04:19,078 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {132369#true} {132870#(< ~counter~0 99)} #96#return; {132870#(< ~counter~0 99)} is VALID [2022-04-28 06:04:19,078 INFO L290 TraceCheckUtils]: 126: Hoare triple {132369#true} assume true; {132369#true} is VALID [2022-04-28 06:04:19,078 INFO L290 TraceCheckUtils]: 125: Hoare triple {132369#true} assume !(0 == ~cond); {132369#true} is VALID [2022-04-28 06:04:19,078 INFO L290 TraceCheckUtils]: 124: Hoare triple {132369#true} ~cond := #in~cond; {132369#true} is VALID [2022-04-28 06:04:19,078 INFO L272 TraceCheckUtils]: 123: Hoare triple {132870#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132369#true} is VALID [2022-04-28 06:04:19,078 INFO L290 TraceCheckUtils]: 122: Hoare triple {132870#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {132870#(< ~counter~0 99)} is VALID [2022-04-28 06:04:19,080 INFO L290 TraceCheckUtils]: 121: Hoare triple {132895#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {132870#(< ~counter~0 99)} is VALID [2022-04-28 06:04:19,080 INFO L290 TraceCheckUtils]: 120: Hoare triple {132895#(< ~counter~0 98)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {132895#(< ~counter~0 98)} is VALID [2022-04-28 06:04:19,080 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {132369#true} {132895#(< ~counter~0 98)} #96#return; {132895#(< ~counter~0 98)} is VALID [2022-04-28 06:04:19,080 INFO L290 TraceCheckUtils]: 118: Hoare triple {132369#true} assume true; {132369#true} is VALID [2022-04-28 06:04:19,080 INFO L290 TraceCheckUtils]: 117: Hoare triple {132369#true} assume !(0 == ~cond); {132369#true} is VALID [2022-04-28 06:04:19,080 INFO L290 TraceCheckUtils]: 116: Hoare triple {132369#true} ~cond := #in~cond; {132369#true} is VALID [2022-04-28 06:04:19,081 INFO L272 TraceCheckUtils]: 115: Hoare triple {132895#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132369#true} is VALID [2022-04-28 06:04:19,081 INFO L290 TraceCheckUtils]: 114: Hoare triple {132895#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {132895#(< ~counter~0 98)} is VALID [2022-04-28 06:04:19,082 INFO L290 TraceCheckUtils]: 113: Hoare triple {132920#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {132895#(< ~counter~0 98)} is VALID [2022-04-28 06:04:19,082 INFO L290 TraceCheckUtils]: 112: Hoare triple {132920#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {132920#(< ~counter~0 97)} is VALID [2022-04-28 06:04:19,083 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {132369#true} {132920#(< ~counter~0 97)} #96#return; {132920#(< ~counter~0 97)} is VALID [2022-04-28 06:04:19,083 INFO L290 TraceCheckUtils]: 110: Hoare triple {132369#true} assume true; {132369#true} is VALID [2022-04-28 06:04:19,083 INFO L290 TraceCheckUtils]: 109: Hoare triple {132369#true} assume !(0 == ~cond); {132369#true} is VALID [2022-04-28 06:04:19,083 INFO L290 TraceCheckUtils]: 108: Hoare triple {132369#true} ~cond := #in~cond; {132369#true} is VALID [2022-04-28 06:04:19,083 INFO L272 TraceCheckUtils]: 107: Hoare triple {132920#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132369#true} is VALID [2022-04-28 06:04:19,083 INFO L290 TraceCheckUtils]: 106: Hoare triple {132920#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {132920#(< ~counter~0 97)} is VALID [2022-04-28 06:04:19,084 INFO L290 TraceCheckUtils]: 105: Hoare triple {132945#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {132920#(< ~counter~0 97)} is VALID [2022-04-28 06:04:19,085 INFO L290 TraceCheckUtils]: 104: Hoare triple {132945#(< ~counter~0 96)} assume !!(0 != ~r~0); {132945#(< ~counter~0 96)} is VALID [2022-04-28 06:04:19,085 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {132369#true} {132945#(< ~counter~0 96)} #94#return; {132945#(< ~counter~0 96)} is VALID [2022-04-28 06:04:19,085 INFO L290 TraceCheckUtils]: 102: Hoare triple {132369#true} assume true; {132369#true} is VALID [2022-04-28 06:04:19,085 INFO L290 TraceCheckUtils]: 101: Hoare triple {132369#true} assume !(0 == ~cond); {132369#true} is VALID [2022-04-28 06:04:19,085 INFO L290 TraceCheckUtils]: 100: Hoare triple {132369#true} ~cond := #in~cond; {132369#true} is VALID [2022-04-28 06:04:19,085 INFO L272 TraceCheckUtils]: 99: Hoare triple {132945#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132369#true} is VALID [2022-04-28 06:04:19,086 INFO L290 TraceCheckUtils]: 98: Hoare triple {132945#(< ~counter~0 96)} assume !!(#t~post6 < 100);havoc #t~post6; {132945#(< ~counter~0 96)} is VALID [2022-04-28 06:04:19,087 INFO L290 TraceCheckUtils]: 97: Hoare triple {132970#(< ~counter~0 95)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {132945#(< ~counter~0 96)} is VALID [2022-04-28 06:04:19,087 INFO L290 TraceCheckUtils]: 96: Hoare triple {132970#(< ~counter~0 95)} assume !(~r~0 < 0); {132970#(< ~counter~0 95)} is VALID [2022-04-28 06:04:19,087 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {132369#true} {132970#(< ~counter~0 95)} #98#return; {132970#(< ~counter~0 95)} is VALID [2022-04-28 06:04:19,087 INFO L290 TraceCheckUtils]: 94: Hoare triple {132369#true} assume true; {132369#true} is VALID [2022-04-28 06:04:19,088 INFO L290 TraceCheckUtils]: 93: Hoare triple {132369#true} assume !(0 == ~cond); {132369#true} is VALID [2022-04-28 06:04:19,088 INFO L290 TraceCheckUtils]: 92: Hoare triple {132369#true} ~cond := #in~cond; {132369#true} is VALID [2022-04-28 06:04:19,088 INFO L272 TraceCheckUtils]: 91: Hoare triple {132970#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132369#true} is VALID [2022-04-28 06:04:19,088 INFO L290 TraceCheckUtils]: 90: Hoare triple {132970#(< ~counter~0 95)} assume !!(#t~post8 < 100);havoc #t~post8; {132970#(< ~counter~0 95)} is VALID [2022-04-28 06:04:19,089 INFO L290 TraceCheckUtils]: 89: Hoare triple {132995#(< ~counter~0 94)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {132970#(< ~counter~0 95)} is VALID [2022-04-28 06:04:19,089 INFO L290 TraceCheckUtils]: 88: Hoare triple {132995#(< ~counter~0 94)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {132995#(< ~counter~0 94)} is VALID [2022-04-28 06:04:19,090 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {132369#true} {132995#(< ~counter~0 94)} #98#return; {132995#(< ~counter~0 94)} is VALID [2022-04-28 06:04:19,090 INFO L290 TraceCheckUtils]: 86: Hoare triple {132369#true} assume true; {132369#true} is VALID [2022-04-28 06:04:19,090 INFO L290 TraceCheckUtils]: 85: Hoare triple {132369#true} assume !(0 == ~cond); {132369#true} is VALID [2022-04-28 06:04:19,090 INFO L290 TraceCheckUtils]: 84: Hoare triple {132369#true} ~cond := #in~cond; {132369#true} is VALID [2022-04-28 06:04:19,090 INFO L272 TraceCheckUtils]: 83: Hoare triple {132995#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132369#true} is VALID [2022-04-28 06:04:19,090 INFO L290 TraceCheckUtils]: 82: Hoare triple {132995#(< ~counter~0 94)} assume !!(#t~post8 < 100);havoc #t~post8; {132995#(< ~counter~0 94)} is VALID [2022-04-28 06:04:19,091 INFO L290 TraceCheckUtils]: 81: Hoare triple {133020#(< ~counter~0 93)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {132995#(< ~counter~0 94)} is VALID [2022-04-28 06:04:19,092 INFO L290 TraceCheckUtils]: 80: Hoare triple {133020#(< ~counter~0 93)} assume !(~r~0 > 0); {133020#(< ~counter~0 93)} is VALID [2022-04-28 06:04:19,092 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {132369#true} {133020#(< ~counter~0 93)} #96#return; {133020#(< ~counter~0 93)} is VALID [2022-04-28 06:04:19,092 INFO L290 TraceCheckUtils]: 78: Hoare triple {132369#true} assume true; {132369#true} is VALID [2022-04-28 06:04:19,092 INFO L290 TraceCheckUtils]: 77: Hoare triple {132369#true} assume !(0 == ~cond); {132369#true} is VALID [2022-04-28 06:04:19,092 INFO L290 TraceCheckUtils]: 76: Hoare triple {132369#true} ~cond := #in~cond; {132369#true} is VALID [2022-04-28 06:04:19,092 INFO L272 TraceCheckUtils]: 75: Hoare triple {133020#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132369#true} is VALID [2022-04-28 06:04:19,093 INFO L290 TraceCheckUtils]: 74: Hoare triple {133020#(< ~counter~0 93)} assume !!(#t~post7 < 100);havoc #t~post7; {133020#(< ~counter~0 93)} is VALID [2022-04-28 06:04:19,094 INFO L290 TraceCheckUtils]: 73: Hoare triple {133045#(< ~counter~0 92)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {133020#(< ~counter~0 93)} is VALID [2022-04-28 06:04:19,094 INFO L290 TraceCheckUtils]: 72: Hoare triple {133045#(< ~counter~0 92)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {133045#(< ~counter~0 92)} is VALID [2022-04-28 06:04:19,094 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {132369#true} {133045#(< ~counter~0 92)} #96#return; {133045#(< ~counter~0 92)} is VALID [2022-04-28 06:04:19,094 INFO L290 TraceCheckUtils]: 70: Hoare triple {132369#true} assume true; {132369#true} is VALID [2022-04-28 06:04:19,095 INFO L290 TraceCheckUtils]: 69: Hoare triple {132369#true} assume !(0 == ~cond); {132369#true} is VALID [2022-04-28 06:04:19,095 INFO L290 TraceCheckUtils]: 68: Hoare triple {132369#true} ~cond := #in~cond; {132369#true} is VALID [2022-04-28 06:04:19,095 INFO L272 TraceCheckUtils]: 67: Hoare triple {133045#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132369#true} is VALID [2022-04-28 06:04:19,095 INFO L290 TraceCheckUtils]: 66: Hoare triple {133045#(< ~counter~0 92)} assume !!(#t~post7 < 100);havoc #t~post7; {133045#(< ~counter~0 92)} is VALID [2022-04-28 06:04:19,096 INFO L290 TraceCheckUtils]: 65: Hoare triple {133070#(< ~counter~0 91)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {133045#(< ~counter~0 92)} is VALID [2022-04-28 06:04:19,096 INFO L290 TraceCheckUtils]: 64: Hoare triple {133070#(< ~counter~0 91)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {133070#(< ~counter~0 91)} is VALID [2022-04-28 06:04:19,097 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {132369#true} {133070#(< ~counter~0 91)} #96#return; {133070#(< ~counter~0 91)} is VALID [2022-04-28 06:04:19,097 INFO L290 TraceCheckUtils]: 62: Hoare triple {132369#true} assume true; {132369#true} is VALID [2022-04-28 06:04:19,097 INFO L290 TraceCheckUtils]: 61: Hoare triple {132369#true} assume !(0 == ~cond); {132369#true} is VALID [2022-04-28 06:04:19,097 INFO L290 TraceCheckUtils]: 60: Hoare triple {132369#true} ~cond := #in~cond; {132369#true} is VALID [2022-04-28 06:04:19,097 INFO L272 TraceCheckUtils]: 59: Hoare triple {133070#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132369#true} is VALID [2022-04-28 06:04:19,097 INFO L290 TraceCheckUtils]: 58: Hoare triple {133070#(< ~counter~0 91)} assume !!(#t~post7 < 100);havoc #t~post7; {133070#(< ~counter~0 91)} is VALID [2022-04-28 06:04:19,098 INFO L290 TraceCheckUtils]: 57: Hoare triple {133095#(< ~counter~0 90)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {133070#(< ~counter~0 91)} is VALID [2022-04-28 06:04:19,099 INFO L290 TraceCheckUtils]: 56: Hoare triple {133095#(< ~counter~0 90)} assume !!(0 != ~r~0); {133095#(< ~counter~0 90)} is VALID [2022-04-28 06:04:19,099 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {132369#true} {133095#(< ~counter~0 90)} #94#return; {133095#(< ~counter~0 90)} is VALID [2022-04-28 06:04:19,099 INFO L290 TraceCheckUtils]: 54: Hoare triple {132369#true} assume true; {132369#true} is VALID [2022-04-28 06:04:19,099 INFO L290 TraceCheckUtils]: 53: Hoare triple {132369#true} assume !(0 == ~cond); {132369#true} is VALID [2022-04-28 06:04:19,099 INFO L290 TraceCheckUtils]: 52: Hoare triple {132369#true} ~cond := #in~cond; {132369#true} is VALID [2022-04-28 06:04:19,099 INFO L272 TraceCheckUtils]: 51: Hoare triple {133095#(< ~counter~0 90)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132369#true} is VALID [2022-04-28 06:04:19,100 INFO L290 TraceCheckUtils]: 50: Hoare triple {133095#(< ~counter~0 90)} assume !!(#t~post6 < 100);havoc #t~post6; {133095#(< ~counter~0 90)} is VALID [2022-04-28 06:04:19,108 INFO L290 TraceCheckUtils]: 49: Hoare triple {133120#(< ~counter~0 89)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {133095#(< ~counter~0 90)} is VALID [2022-04-28 06:04:19,108 INFO L290 TraceCheckUtils]: 48: Hoare triple {133120#(< ~counter~0 89)} assume !(~r~0 < 0); {133120#(< ~counter~0 89)} is VALID [2022-04-28 06:04:19,109 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {132369#true} {133120#(< ~counter~0 89)} #98#return; {133120#(< ~counter~0 89)} is VALID [2022-04-28 06:04:19,109 INFO L290 TraceCheckUtils]: 46: Hoare triple {132369#true} assume true; {132369#true} is VALID [2022-04-28 06:04:19,109 INFO L290 TraceCheckUtils]: 45: Hoare triple {132369#true} assume !(0 == ~cond); {132369#true} is VALID [2022-04-28 06:04:19,109 INFO L290 TraceCheckUtils]: 44: Hoare triple {132369#true} ~cond := #in~cond; {132369#true} is VALID [2022-04-28 06:04:19,109 INFO L272 TraceCheckUtils]: 43: Hoare triple {133120#(< ~counter~0 89)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132369#true} is VALID [2022-04-28 06:04:19,109 INFO L290 TraceCheckUtils]: 42: Hoare triple {133120#(< ~counter~0 89)} assume !!(#t~post8 < 100);havoc #t~post8; {133120#(< ~counter~0 89)} is VALID [2022-04-28 06:04:19,110 INFO L290 TraceCheckUtils]: 41: Hoare triple {133145#(< ~counter~0 88)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {133120#(< ~counter~0 89)} is VALID [2022-04-28 06:04:19,110 INFO L290 TraceCheckUtils]: 40: Hoare triple {133145#(< ~counter~0 88)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {133145#(< ~counter~0 88)} is VALID [2022-04-28 06:04:19,111 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {132369#true} {133145#(< ~counter~0 88)} #98#return; {133145#(< ~counter~0 88)} is VALID [2022-04-28 06:04:19,111 INFO L290 TraceCheckUtils]: 38: Hoare triple {132369#true} assume true; {132369#true} is VALID [2022-04-28 06:04:19,111 INFO L290 TraceCheckUtils]: 37: Hoare triple {132369#true} assume !(0 == ~cond); {132369#true} is VALID [2022-04-28 06:04:19,111 INFO L290 TraceCheckUtils]: 36: Hoare triple {132369#true} ~cond := #in~cond; {132369#true} is VALID [2022-04-28 06:04:19,111 INFO L272 TraceCheckUtils]: 35: Hoare triple {133145#(< ~counter~0 88)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132369#true} is VALID [2022-04-28 06:04:19,111 INFO L290 TraceCheckUtils]: 34: Hoare triple {133145#(< ~counter~0 88)} assume !!(#t~post8 < 100);havoc #t~post8; {133145#(< ~counter~0 88)} is VALID [2022-04-28 06:04:19,112 INFO L290 TraceCheckUtils]: 33: Hoare triple {133170#(< ~counter~0 87)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {133145#(< ~counter~0 88)} is VALID [2022-04-28 06:04:19,113 INFO L290 TraceCheckUtils]: 32: Hoare triple {133170#(< ~counter~0 87)} assume !(~r~0 > 0); {133170#(< ~counter~0 87)} is VALID [2022-04-28 06:04:19,113 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {132369#true} {133170#(< ~counter~0 87)} #96#return; {133170#(< ~counter~0 87)} is VALID [2022-04-28 06:04:19,113 INFO L290 TraceCheckUtils]: 30: Hoare triple {132369#true} assume true; {132369#true} is VALID [2022-04-28 06:04:19,113 INFO L290 TraceCheckUtils]: 29: Hoare triple {132369#true} assume !(0 == ~cond); {132369#true} is VALID [2022-04-28 06:04:19,113 INFO L290 TraceCheckUtils]: 28: Hoare triple {132369#true} ~cond := #in~cond; {132369#true} is VALID [2022-04-28 06:04:19,113 INFO L272 TraceCheckUtils]: 27: Hoare triple {133170#(< ~counter~0 87)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132369#true} is VALID [2022-04-28 06:04:19,114 INFO L290 TraceCheckUtils]: 26: Hoare triple {133170#(< ~counter~0 87)} assume !!(#t~post7 < 100);havoc #t~post7; {133170#(< ~counter~0 87)} is VALID [2022-04-28 06:04:19,115 INFO L290 TraceCheckUtils]: 25: Hoare triple {133195#(< ~counter~0 86)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {133170#(< ~counter~0 87)} is VALID [2022-04-28 06:04:19,115 INFO L290 TraceCheckUtils]: 24: Hoare triple {133195#(< ~counter~0 86)} assume !!(0 != ~r~0); {133195#(< ~counter~0 86)} is VALID [2022-04-28 06:04:19,116 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {132369#true} {133195#(< ~counter~0 86)} #94#return; {133195#(< ~counter~0 86)} is VALID [2022-04-28 06:04:19,116 INFO L290 TraceCheckUtils]: 22: Hoare triple {132369#true} assume true; {132369#true} is VALID [2022-04-28 06:04:19,116 INFO L290 TraceCheckUtils]: 21: Hoare triple {132369#true} assume !(0 == ~cond); {132369#true} is VALID [2022-04-28 06:04:19,116 INFO L290 TraceCheckUtils]: 20: Hoare triple {132369#true} ~cond := #in~cond; {132369#true} is VALID [2022-04-28 06:04:19,116 INFO L272 TraceCheckUtils]: 19: Hoare triple {133195#(< ~counter~0 86)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132369#true} is VALID [2022-04-28 06:04:19,116 INFO L290 TraceCheckUtils]: 18: Hoare triple {133195#(< ~counter~0 86)} assume !!(#t~post6 < 100);havoc #t~post6; {133195#(< ~counter~0 86)} is VALID [2022-04-28 06:04:19,117 INFO L290 TraceCheckUtils]: 17: Hoare triple {133220#(< ~counter~0 85)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {133195#(< ~counter~0 86)} is VALID [2022-04-28 06:04:19,117 INFO L290 TraceCheckUtils]: 16: Hoare triple {133220#(< ~counter~0 85)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {133220#(< ~counter~0 85)} is VALID [2022-04-28 06:04:19,118 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {132369#true} {133220#(< ~counter~0 85)} #92#return; {133220#(< ~counter~0 85)} is VALID [2022-04-28 06:04:19,118 INFO L290 TraceCheckUtils]: 14: Hoare triple {132369#true} assume true; {132369#true} is VALID [2022-04-28 06:04:19,118 INFO L290 TraceCheckUtils]: 13: Hoare triple {132369#true} assume !(0 == ~cond); {132369#true} is VALID [2022-04-28 06:04:19,118 INFO L290 TraceCheckUtils]: 12: Hoare triple {132369#true} ~cond := #in~cond; {132369#true} is VALID [2022-04-28 06:04:19,118 INFO L272 TraceCheckUtils]: 11: Hoare triple {133220#(< ~counter~0 85)} 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)); {132369#true} is VALID [2022-04-28 06:04:19,118 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {132369#true} {133220#(< ~counter~0 85)} #90#return; {133220#(< ~counter~0 85)} is VALID [2022-04-28 06:04:19,119 INFO L290 TraceCheckUtils]: 9: Hoare triple {132369#true} assume true; {132369#true} is VALID [2022-04-28 06:04:19,119 INFO L290 TraceCheckUtils]: 8: Hoare triple {132369#true} assume !(0 == ~cond); {132369#true} is VALID [2022-04-28 06:04:19,119 INFO L290 TraceCheckUtils]: 7: Hoare triple {132369#true} ~cond := #in~cond; {132369#true} is VALID [2022-04-28 06:04:19,119 INFO L272 TraceCheckUtils]: 6: Hoare triple {133220#(< ~counter~0 85)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {132369#true} is VALID [2022-04-28 06:04:19,119 INFO L290 TraceCheckUtils]: 5: Hoare triple {133220#(< ~counter~0 85)} 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; {133220#(< ~counter~0 85)} is VALID [2022-04-28 06:04:19,119 INFO L272 TraceCheckUtils]: 4: Hoare triple {133220#(< ~counter~0 85)} call #t~ret9 := main(); {133220#(< ~counter~0 85)} is VALID [2022-04-28 06:04:19,120 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {133220#(< ~counter~0 85)} {132369#true} #102#return; {133220#(< ~counter~0 85)} is VALID [2022-04-28 06:04:19,120 INFO L290 TraceCheckUtils]: 2: Hoare triple {133220#(< ~counter~0 85)} assume true; {133220#(< ~counter~0 85)} is VALID [2022-04-28 06:04:19,120 INFO L290 TraceCheckUtils]: 1: Hoare triple {132369#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; {133220#(< ~counter~0 85)} is VALID [2022-04-28 06:04:19,120 INFO L272 TraceCheckUtils]: 0: Hoare triple {132369#true} call ULTIMATE.init(); {132369#true} is VALID [2022-04-28 06:04:19,121 INFO L134 CoverageAnalysis]: Checked inductivity of 606 backedges. 36 proven. 146 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2022-04-28 06:04:19,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:04:19,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356713721] [2022-04-28 06:04:19,121 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:04:19,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1730996434] [2022-04-28 06:04:19,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1730996434] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:04:19,121 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:04:19,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2022-04-28 06:04:19,121 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:04:19,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [217678005] [2022-04-28 06:04:19,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [217678005] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:04:19,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:04:19,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 06:04:19,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979185244] [2022-04-28 06:04:19,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:04:19,122 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 18 states have internal predecessors, (104), 18 states have call successors, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 16 states have call predecessors, (18), 17 states have call successors, (18) Word has length 145 [2022-04-28 06:04:19,122 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:04:19,122 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 18 states have internal predecessors, (104), 18 states have call successors, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 16 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-28 06:04:19,265 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:04:19,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 06:04:19,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:04:19,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 06:04:19,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=566, Invalid=694, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 06:04:19,267 INFO L87 Difference]: Start difference. First operand 775 states and 1041 transitions. Second operand has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 18 states have internal predecessors, (104), 18 states have call successors, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 16 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-28 06:04:24,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:04:24,467 INFO L93 Difference]: Finished difference Result 981 states and 1345 transitions. [2022-04-28 06:04:24,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-28 06:04:24,467 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 18 states have internal predecessors, (104), 18 states have call successors, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 16 states have call predecessors, (18), 17 states have call successors, (18) Word has length 145 [2022-04-28 06:04:24,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:04:24,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 18 states have internal predecessors, (104), 18 states have call successors, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 16 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-28 06:04:24,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 337 transitions. [2022-04-28 06:04:24,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 18 states have internal predecessors, (104), 18 states have call successors, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 16 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-28 06:04:24,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 337 transitions. [2022-04-28 06:04:24,471 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 337 transitions. [2022-04-28 06:04:24,849 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 337 edges. 337 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:04:24,874 INFO L225 Difference]: With dead ends: 981 [2022-04-28 06:04:24,874 INFO L226 Difference]: Without dead ends: 789 [2022-04-28 06:04:24,875 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=995, Invalid=1357, Unknown=0, NotChecked=0, Total=2352 [2022-04-28 06:04:24,875 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 274 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 257 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 06:04:24,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 334 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 06:04:24,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2022-04-28 06:04:27,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 778. [2022-04-28 06:04:27,608 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:04:27,609 INFO L82 GeneralOperation]: Start isEquivalent. First operand 789 states. Second operand has 778 states, 582 states have (on average 1.1872852233676976) internal successors, (691), 594 states have internal predecessors, (691), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 162 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-28 06:04:27,609 INFO L74 IsIncluded]: Start isIncluded. First operand 789 states. Second operand has 778 states, 582 states have (on average 1.1872852233676976) internal successors, (691), 594 states have internal predecessors, (691), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 162 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-28 06:04:27,610 INFO L87 Difference]: Start difference. First operand 789 states. Second operand has 778 states, 582 states have (on average 1.1872852233676976) internal successors, (691), 594 states have internal predecessors, (691), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 162 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-28 06:04:27,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:04:27,631 INFO L93 Difference]: Finished difference Result 789 states and 1052 transitions. [2022-04-28 06:04:27,631 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1052 transitions. [2022-04-28 06:04:27,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:04:27,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:04:27,633 INFO L74 IsIncluded]: Start isIncluded. First operand has 778 states, 582 states have (on average 1.1872852233676976) internal successors, (691), 594 states have internal predecessors, (691), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 162 states have call predecessors, (174), 174 states have call successors, (174) Second operand 789 states. [2022-04-28 06:04:27,633 INFO L87 Difference]: Start difference. First operand has 778 states, 582 states have (on average 1.1872852233676976) internal successors, (691), 594 states have internal predecessors, (691), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 162 states have call predecessors, (174), 174 states have call successors, (174) Second operand 789 states. [2022-04-28 06:04:27,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:04:27,654 INFO L93 Difference]: Finished difference Result 789 states and 1052 transitions. [2022-04-28 06:04:27,654 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1052 transitions. [2022-04-28 06:04:27,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:04:27,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:04:27,655 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:04:27,655 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:04:27,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 778 states, 582 states have (on average 1.1872852233676976) internal successors, (691), 594 states have internal predecessors, (691), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 162 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-28 06:04:27,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1041 transitions. [2022-04-28 06:04:27,688 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1041 transitions. Word has length 145 [2022-04-28 06:04:27,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:04:27,688 INFO L495 AbstractCegarLoop]: Abstraction has 778 states and 1041 transitions. [2022-04-28 06:04:27,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 18 states have internal predecessors, (104), 18 states have call successors, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 16 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-28 06:04:27,689 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 778 states and 1041 transitions. [2022-04-28 06:04:40,081 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1041 edges. 1039 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 06:04:40,082 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1041 transitions. [2022-04-28 06:04:40,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-04-28 06:04:40,083 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:04:40,083 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 15, 9, 8, 8, 8, 6, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:04:40,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Forceful destruction successful, exit code 0 [2022-04-28 06:04:40,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-04-28 06:04:40,284 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:04:40,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:04:40,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1963931820, now seen corresponding path program 21 times [2022-04-28 06:04:40,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:04:40,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1998388020] [2022-04-28 06:04:40,285 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:04:40,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1963931820, now seen corresponding path program 22 times [2022-04-28 06:04:40,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:04:40,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695410014] [2022-04-28 06:04:40,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:04:40,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:04:40,298 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:04:40,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1614824800] [2022-04-28 06:04:40,298 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 06:04:40,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:04:40,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:04:40,299 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:04:40,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-04-28 06:04:40,477 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 06:04:40,478 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:04:40,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-28 06:04:40,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:04:40,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:04:41,306 INFO L272 TraceCheckUtils]: 0: Hoare triple {138396#true} call ULTIMATE.init(); {138396#true} is VALID [2022-04-28 06:04:41,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {138396#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; {138404#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:41,307 INFO L290 TraceCheckUtils]: 2: Hoare triple {138404#(<= ~counter~0 0)} assume true; {138404#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:41,307 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {138404#(<= ~counter~0 0)} {138396#true} #102#return; {138404#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:41,307 INFO L272 TraceCheckUtils]: 4: Hoare triple {138404#(<= ~counter~0 0)} call #t~ret9 := main(); {138404#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:41,308 INFO L290 TraceCheckUtils]: 5: Hoare triple {138404#(<= ~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; {138404#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:41,308 INFO L272 TraceCheckUtils]: 6: Hoare triple {138404#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {138404#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:41,308 INFO L290 TraceCheckUtils]: 7: Hoare triple {138404#(<= ~counter~0 0)} ~cond := #in~cond; {138404#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:41,309 INFO L290 TraceCheckUtils]: 8: Hoare triple {138404#(<= ~counter~0 0)} assume !(0 == ~cond); {138404#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:41,309 INFO L290 TraceCheckUtils]: 9: Hoare triple {138404#(<= ~counter~0 0)} assume true; {138404#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:41,309 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {138404#(<= ~counter~0 0)} {138404#(<= ~counter~0 0)} #90#return; {138404#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:41,310 INFO L272 TraceCheckUtils]: 11: Hoare triple {138404#(<= ~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)); {138404#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:41,310 INFO L290 TraceCheckUtils]: 12: Hoare triple {138404#(<= ~counter~0 0)} ~cond := #in~cond; {138404#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:41,310 INFO L290 TraceCheckUtils]: 13: Hoare triple {138404#(<= ~counter~0 0)} assume !(0 == ~cond); {138404#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:41,310 INFO L290 TraceCheckUtils]: 14: Hoare triple {138404#(<= ~counter~0 0)} assume true; {138404#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:41,311 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {138404#(<= ~counter~0 0)} {138404#(<= ~counter~0 0)} #92#return; {138404#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:41,311 INFO L290 TraceCheckUtils]: 16: Hoare triple {138404#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {138404#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:41,314 INFO L290 TraceCheckUtils]: 17: Hoare triple {138404#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {138453#(<= ~counter~0 1)} is VALID [2022-04-28 06:04:41,314 INFO L290 TraceCheckUtils]: 18: Hoare triple {138453#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {138453#(<= ~counter~0 1)} is VALID [2022-04-28 06:04:41,314 INFO L272 TraceCheckUtils]: 19: Hoare triple {138453#(<= ~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)); {138453#(<= ~counter~0 1)} is VALID [2022-04-28 06:04:41,315 INFO L290 TraceCheckUtils]: 20: Hoare triple {138453#(<= ~counter~0 1)} ~cond := #in~cond; {138453#(<= ~counter~0 1)} is VALID [2022-04-28 06:04:41,315 INFO L290 TraceCheckUtils]: 21: Hoare triple {138453#(<= ~counter~0 1)} assume !(0 == ~cond); {138453#(<= ~counter~0 1)} is VALID [2022-04-28 06:04:41,315 INFO L290 TraceCheckUtils]: 22: Hoare triple {138453#(<= ~counter~0 1)} assume true; {138453#(<= ~counter~0 1)} is VALID [2022-04-28 06:04:41,316 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {138453#(<= ~counter~0 1)} {138453#(<= ~counter~0 1)} #94#return; {138453#(<= ~counter~0 1)} is VALID [2022-04-28 06:04:41,316 INFO L290 TraceCheckUtils]: 24: Hoare triple {138453#(<= ~counter~0 1)} assume !!(0 != ~r~0); {138453#(<= ~counter~0 1)} is VALID [2022-04-28 06:04:41,317 INFO L290 TraceCheckUtils]: 25: Hoare triple {138453#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {138478#(<= ~counter~0 2)} is VALID [2022-04-28 06:04:41,317 INFO L290 TraceCheckUtils]: 26: Hoare triple {138478#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {138478#(<= ~counter~0 2)} is VALID [2022-04-28 06:04:41,318 INFO L272 TraceCheckUtils]: 27: Hoare triple {138478#(<= ~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)); {138478#(<= ~counter~0 2)} is VALID [2022-04-28 06:04:41,318 INFO L290 TraceCheckUtils]: 28: Hoare triple {138478#(<= ~counter~0 2)} ~cond := #in~cond; {138478#(<= ~counter~0 2)} is VALID [2022-04-28 06:04:41,318 INFO L290 TraceCheckUtils]: 29: Hoare triple {138478#(<= ~counter~0 2)} assume !(0 == ~cond); {138478#(<= ~counter~0 2)} is VALID [2022-04-28 06:04:41,318 INFO L290 TraceCheckUtils]: 30: Hoare triple {138478#(<= ~counter~0 2)} assume true; {138478#(<= ~counter~0 2)} is VALID [2022-04-28 06:04:41,319 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {138478#(<= ~counter~0 2)} {138478#(<= ~counter~0 2)} #96#return; {138478#(<= ~counter~0 2)} is VALID [2022-04-28 06:04:41,319 INFO L290 TraceCheckUtils]: 32: Hoare triple {138478#(<= ~counter~0 2)} assume !(~r~0 > 0); {138478#(<= ~counter~0 2)} is VALID [2022-04-28 06:04:41,320 INFO L290 TraceCheckUtils]: 33: Hoare triple {138478#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {138503#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:41,320 INFO L290 TraceCheckUtils]: 34: Hoare triple {138503#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {138503#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:41,321 INFO L272 TraceCheckUtils]: 35: Hoare triple {138503#(<= ~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)); {138503#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:41,321 INFO L290 TraceCheckUtils]: 36: Hoare triple {138503#(<= ~counter~0 3)} ~cond := #in~cond; {138503#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:41,321 INFO L290 TraceCheckUtils]: 37: Hoare triple {138503#(<= ~counter~0 3)} assume !(0 == ~cond); {138503#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:41,322 INFO L290 TraceCheckUtils]: 38: Hoare triple {138503#(<= ~counter~0 3)} assume true; {138503#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:41,322 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {138503#(<= ~counter~0 3)} {138503#(<= ~counter~0 3)} #98#return; {138503#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:41,322 INFO L290 TraceCheckUtils]: 40: Hoare triple {138503#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {138503#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:41,323 INFO L290 TraceCheckUtils]: 41: Hoare triple {138503#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {138528#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:41,324 INFO L290 TraceCheckUtils]: 42: Hoare triple {138528#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {138528#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:41,324 INFO L272 TraceCheckUtils]: 43: Hoare triple {138528#(<= ~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)); {138528#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:41,324 INFO L290 TraceCheckUtils]: 44: Hoare triple {138528#(<= ~counter~0 4)} ~cond := #in~cond; {138528#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:41,325 INFO L290 TraceCheckUtils]: 45: Hoare triple {138528#(<= ~counter~0 4)} assume !(0 == ~cond); {138528#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:41,325 INFO L290 TraceCheckUtils]: 46: Hoare triple {138528#(<= ~counter~0 4)} assume true; {138528#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:41,325 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {138528#(<= ~counter~0 4)} {138528#(<= ~counter~0 4)} #98#return; {138528#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:41,326 INFO L290 TraceCheckUtils]: 48: Hoare triple {138528#(<= ~counter~0 4)} assume !(~r~0 < 0); {138528#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:41,327 INFO L290 TraceCheckUtils]: 49: Hoare triple {138528#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {138553#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:41,327 INFO L290 TraceCheckUtils]: 50: Hoare triple {138553#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {138553#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:41,327 INFO L272 TraceCheckUtils]: 51: Hoare triple {138553#(<= ~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)); {138553#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:41,328 INFO L290 TraceCheckUtils]: 52: Hoare triple {138553#(<= ~counter~0 5)} ~cond := #in~cond; {138553#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:41,328 INFO L290 TraceCheckUtils]: 53: Hoare triple {138553#(<= ~counter~0 5)} assume !(0 == ~cond); {138553#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:41,328 INFO L290 TraceCheckUtils]: 54: Hoare triple {138553#(<= ~counter~0 5)} assume true; {138553#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:41,329 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {138553#(<= ~counter~0 5)} {138553#(<= ~counter~0 5)} #94#return; {138553#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:41,329 INFO L290 TraceCheckUtils]: 56: Hoare triple {138553#(<= ~counter~0 5)} assume !!(0 != ~r~0); {138553#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:41,330 INFO L290 TraceCheckUtils]: 57: Hoare triple {138553#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {138578#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:41,330 INFO L290 TraceCheckUtils]: 58: Hoare triple {138578#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {138578#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:41,331 INFO L272 TraceCheckUtils]: 59: Hoare triple {138578#(<= ~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)); {138578#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:41,331 INFO L290 TraceCheckUtils]: 60: Hoare triple {138578#(<= ~counter~0 6)} ~cond := #in~cond; {138578#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:41,331 INFO L290 TraceCheckUtils]: 61: Hoare triple {138578#(<= ~counter~0 6)} assume !(0 == ~cond); {138578#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:41,331 INFO L290 TraceCheckUtils]: 62: Hoare triple {138578#(<= ~counter~0 6)} assume true; {138578#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:41,332 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {138578#(<= ~counter~0 6)} {138578#(<= ~counter~0 6)} #96#return; {138578#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:41,332 INFO L290 TraceCheckUtils]: 64: Hoare triple {138578#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {138578#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:41,333 INFO L290 TraceCheckUtils]: 65: Hoare triple {138578#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {138603#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:41,334 INFO L290 TraceCheckUtils]: 66: Hoare triple {138603#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {138603#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:41,334 INFO L272 TraceCheckUtils]: 67: Hoare triple {138603#(<= ~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)); {138603#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:41,334 INFO L290 TraceCheckUtils]: 68: Hoare triple {138603#(<= ~counter~0 7)} ~cond := #in~cond; {138603#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:41,334 INFO L290 TraceCheckUtils]: 69: Hoare triple {138603#(<= ~counter~0 7)} assume !(0 == ~cond); {138603#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:41,335 INFO L290 TraceCheckUtils]: 70: Hoare triple {138603#(<= ~counter~0 7)} assume true; {138603#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:41,335 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {138603#(<= ~counter~0 7)} {138603#(<= ~counter~0 7)} #96#return; {138603#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:41,335 INFO L290 TraceCheckUtils]: 72: Hoare triple {138603#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {138603#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:41,337 INFO L290 TraceCheckUtils]: 73: Hoare triple {138603#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {138628#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:41,337 INFO L290 TraceCheckUtils]: 74: Hoare triple {138628#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {138628#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:41,337 INFO L272 TraceCheckUtils]: 75: Hoare triple {138628#(<= ~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)); {138628#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:41,338 INFO L290 TraceCheckUtils]: 76: Hoare triple {138628#(<= ~counter~0 8)} ~cond := #in~cond; {138628#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:41,338 INFO L290 TraceCheckUtils]: 77: Hoare triple {138628#(<= ~counter~0 8)} assume !(0 == ~cond); {138628#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:41,338 INFO L290 TraceCheckUtils]: 78: Hoare triple {138628#(<= ~counter~0 8)} assume true; {138628#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:41,339 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {138628#(<= ~counter~0 8)} {138628#(<= ~counter~0 8)} #96#return; {138628#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:41,339 INFO L290 TraceCheckUtils]: 80: Hoare triple {138628#(<= ~counter~0 8)} assume !(~r~0 > 0); {138628#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:41,340 INFO L290 TraceCheckUtils]: 81: Hoare triple {138628#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {138653#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:41,340 INFO L290 TraceCheckUtils]: 82: Hoare triple {138653#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {138653#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:41,341 INFO L272 TraceCheckUtils]: 83: Hoare triple {138653#(<= ~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)); {138653#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:41,341 INFO L290 TraceCheckUtils]: 84: Hoare triple {138653#(<= ~counter~0 9)} ~cond := #in~cond; {138653#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:41,341 INFO L290 TraceCheckUtils]: 85: Hoare triple {138653#(<= ~counter~0 9)} assume !(0 == ~cond); {138653#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:41,341 INFO L290 TraceCheckUtils]: 86: Hoare triple {138653#(<= ~counter~0 9)} assume true; {138653#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:41,342 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {138653#(<= ~counter~0 9)} {138653#(<= ~counter~0 9)} #98#return; {138653#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:41,342 INFO L290 TraceCheckUtils]: 88: Hoare triple {138653#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {138653#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:41,343 INFO L290 TraceCheckUtils]: 89: Hoare triple {138653#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {138678#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:41,343 INFO L290 TraceCheckUtils]: 90: Hoare triple {138678#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {138678#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:41,344 INFO L272 TraceCheckUtils]: 91: Hoare triple {138678#(<= ~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)); {138678#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:41,344 INFO L290 TraceCheckUtils]: 92: Hoare triple {138678#(<= ~counter~0 10)} ~cond := #in~cond; {138678#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:41,344 INFO L290 TraceCheckUtils]: 93: Hoare triple {138678#(<= ~counter~0 10)} assume !(0 == ~cond); {138678#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:41,345 INFO L290 TraceCheckUtils]: 94: Hoare triple {138678#(<= ~counter~0 10)} assume true; {138678#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:41,345 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {138678#(<= ~counter~0 10)} {138678#(<= ~counter~0 10)} #98#return; {138678#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:41,345 INFO L290 TraceCheckUtils]: 96: Hoare triple {138678#(<= ~counter~0 10)} assume !(~r~0 < 0); {138678#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:41,346 INFO L290 TraceCheckUtils]: 97: Hoare triple {138678#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {138703#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:41,347 INFO L290 TraceCheckUtils]: 98: Hoare triple {138703#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {138703#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:41,347 INFO L272 TraceCheckUtils]: 99: Hoare triple {138703#(<= ~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)); {138703#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:41,347 INFO L290 TraceCheckUtils]: 100: Hoare triple {138703#(<= ~counter~0 11)} ~cond := #in~cond; {138703#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:41,348 INFO L290 TraceCheckUtils]: 101: Hoare triple {138703#(<= ~counter~0 11)} assume !(0 == ~cond); {138703#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:41,348 INFO L290 TraceCheckUtils]: 102: Hoare triple {138703#(<= ~counter~0 11)} assume true; {138703#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:41,348 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {138703#(<= ~counter~0 11)} {138703#(<= ~counter~0 11)} #94#return; {138703#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:41,349 INFO L290 TraceCheckUtils]: 104: Hoare triple {138703#(<= ~counter~0 11)} assume !!(0 != ~r~0); {138703#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:41,350 INFO L290 TraceCheckUtils]: 105: Hoare triple {138703#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {138728#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:41,350 INFO L290 TraceCheckUtils]: 106: Hoare triple {138728#(<= ~counter~0 12)} assume !!(#t~post7 < 100);havoc #t~post7; {138728#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:41,351 INFO L272 TraceCheckUtils]: 107: Hoare triple {138728#(<= ~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)); {138728#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:41,351 INFO L290 TraceCheckUtils]: 108: Hoare triple {138728#(<= ~counter~0 12)} ~cond := #in~cond; {138728#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:41,351 INFO L290 TraceCheckUtils]: 109: Hoare triple {138728#(<= ~counter~0 12)} assume !(0 == ~cond); {138728#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:41,351 INFO L290 TraceCheckUtils]: 110: Hoare triple {138728#(<= ~counter~0 12)} assume true; {138728#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:41,352 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {138728#(<= ~counter~0 12)} {138728#(<= ~counter~0 12)} #96#return; {138728#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:41,352 INFO L290 TraceCheckUtils]: 112: Hoare triple {138728#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {138728#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:41,353 INFO L290 TraceCheckUtils]: 113: Hoare triple {138728#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {138753#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:41,354 INFO L290 TraceCheckUtils]: 114: Hoare triple {138753#(<= ~counter~0 13)} assume !!(#t~post7 < 100);havoc #t~post7; {138753#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:41,354 INFO L272 TraceCheckUtils]: 115: Hoare triple {138753#(<= ~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)); {138753#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:41,354 INFO L290 TraceCheckUtils]: 116: Hoare triple {138753#(<= ~counter~0 13)} ~cond := #in~cond; {138753#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:41,354 INFO L290 TraceCheckUtils]: 117: Hoare triple {138753#(<= ~counter~0 13)} assume !(0 == ~cond); {138753#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:41,355 INFO L290 TraceCheckUtils]: 118: Hoare triple {138753#(<= ~counter~0 13)} assume true; {138753#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:41,364 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {138753#(<= ~counter~0 13)} {138753#(<= ~counter~0 13)} #96#return; {138753#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:41,365 INFO L290 TraceCheckUtils]: 120: Hoare triple {138753#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {138753#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:41,367 INFO L290 TraceCheckUtils]: 121: Hoare triple {138753#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {138778#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:41,368 INFO L290 TraceCheckUtils]: 122: Hoare triple {138778#(<= ~counter~0 14)} assume !!(#t~post7 < 100);havoc #t~post7; {138778#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:41,368 INFO L272 TraceCheckUtils]: 123: Hoare triple {138778#(<= ~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)); {138778#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:41,368 INFO L290 TraceCheckUtils]: 124: Hoare triple {138778#(<= ~counter~0 14)} ~cond := #in~cond; {138778#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:41,369 INFO L290 TraceCheckUtils]: 125: Hoare triple {138778#(<= ~counter~0 14)} assume !(0 == ~cond); {138778#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:41,369 INFO L290 TraceCheckUtils]: 126: Hoare triple {138778#(<= ~counter~0 14)} assume true; {138778#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:41,369 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {138778#(<= ~counter~0 14)} {138778#(<= ~counter~0 14)} #96#return; {138778#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:41,370 INFO L290 TraceCheckUtils]: 128: Hoare triple {138778#(<= ~counter~0 14)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {138778#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:41,371 INFO L290 TraceCheckUtils]: 129: Hoare triple {138778#(<= ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {138803#(<= ~counter~0 15)} is VALID [2022-04-28 06:04:41,371 INFO L290 TraceCheckUtils]: 130: Hoare triple {138803#(<= ~counter~0 15)} assume !!(#t~post7 < 100);havoc #t~post7; {138803#(<= ~counter~0 15)} is VALID [2022-04-28 06:04:41,371 INFO L272 TraceCheckUtils]: 131: Hoare triple {138803#(<= ~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)); {138803#(<= ~counter~0 15)} is VALID [2022-04-28 06:04:41,372 INFO L290 TraceCheckUtils]: 132: Hoare triple {138803#(<= ~counter~0 15)} ~cond := #in~cond; {138803#(<= ~counter~0 15)} is VALID [2022-04-28 06:04:41,372 INFO L290 TraceCheckUtils]: 133: Hoare triple {138803#(<= ~counter~0 15)} assume !(0 == ~cond); {138803#(<= ~counter~0 15)} is VALID [2022-04-28 06:04:41,372 INFO L290 TraceCheckUtils]: 134: Hoare triple {138803#(<= ~counter~0 15)} assume true; {138803#(<= ~counter~0 15)} is VALID [2022-04-28 06:04:41,373 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {138803#(<= ~counter~0 15)} {138803#(<= ~counter~0 15)} #96#return; {138803#(<= ~counter~0 15)} is VALID [2022-04-28 06:04:41,373 INFO L290 TraceCheckUtils]: 136: Hoare triple {138803#(<= ~counter~0 15)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {138803#(<= ~counter~0 15)} is VALID [2022-04-28 06:04:41,373 INFO L290 TraceCheckUtils]: 137: Hoare triple {138803#(<= ~counter~0 15)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {138828#(<= |main_#t~post7| 15)} is VALID [2022-04-28 06:04:41,374 INFO L290 TraceCheckUtils]: 138: Hoare triple {138828#(<= |main_#t~post7| 15)} assume !(#t~post7 < 100);havoc #t~post7; {138397#false} is VALID [2022-04-28 06:04:41,374 INFO L290 TraceCheckUtils]: 139: Hoare triple {138397#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {138397#false} is VALID [2022-04-28 06:04:41,374 INFO L290 TraceCheckUtils]: 140: Hoare triple {138397#false} assume !(#t~post8 < 100);havoc #t~post8; {138397#false} is VALID [2022-04-28 06:04:41,374 INFO L290 TraceCheckUtils]: 141: Hoare triple {138397#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {138397#false} is VALID [2022-04-28 06:04:41,374 INFO L290 TraceCheckUtils]: 142: Hoare triple {138397#false} assume !(#t~post6 < 100);havoc #t~post6; {138397#false} is VALID [2022-04-28 06:04:41,374 INFO L272 TraceCheckUtils]: 143: Hoare triple {138397#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)); {138397#false} is VALID [2022-04-28 06:04:41,374 INFO L290 TraceCheckUtils]: 144: Hoare triple {138397#false} ~cond := #in~cond; {138397#false} is VALID [2022-04-28 06:04:41,374 INFO L290 TraceCheckUtils]: 145: Hoare triple {138397#false} assume 0 == ~cond; {138397#false} is VALID [2022-04-28 06:04:41,374 INFO L290 TraceCheckUtils]: 146: Hoare triple {138397#false} assume !false; {138397#false} is VALID [2022-04-28 06:04:41,375 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 44 proven. 584 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 06:04:41,375 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:04:42,332 INFO L290 TraceCheckUtils]: 146: Hoare triple {138397#false} assume !false; {138397#false} is VALID [2022-04-28 06:04:42,332 INFO L290 TraceCheckUtils]: 145: Hoare triple {138397#false} assume 0 == ~cond; {138397#false} is VALID [2022-04-28 06:04:42,332 INFO L290 TraceCheckUtils]: 144: Hoare triple {138397#false} ~cond := #in~cond; {138397#false} is VALID [2022-04-28 06:04:42,332 INFO L272 TraceCheckUtils]: 143: Hoare triple {138397#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)); {138397#false} is VALID [2022-04-28 06:04:42,332 INFO L290 TraceCheckUtils]: 142: Hoare triple {138397#false} assume !(#t~post6 < 100);havoc #t~post6; {138397#false} is VALID [2022-04-28 06:04:42,332 INFO L290 TraceCheckUtils]: 141: Hoare triple {138397#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {138397#false} is VALID [2022-04-28 06:04:42,332 INFO L290 TraceCheckUtils]: 140: Hoare triple {138397#false} assume !(#t~post8 < 100);havoc #t~post8; {138397#false} is VALID [2022-04-28 06:04:42,332 INFO L290 TraceCheckUtils]: 139: Hoare triple {138397#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {138397#false} is VALID [2022-04-28 06:04:42,333 INFO L290 TraceCheckUtils]: 138: Hoare triple {138880#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {138397#false} is VALID [2022-04-28 06:04:42,333 INFO L290 TraceCheckUtils]: 137: Hoare triple {138884#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {138880#(< |main_#t~post7| 100)} is VALID [2022-04-28 06:04:42,333 INFO L290 TraceCheckUtils]: 136: Hoare triple {138884#(< ~counter~0 100)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {138884#(< ~counter~0 100)} is VALID [2022-04-28 06:04:42,334 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {138396#true} {138884#(< ~counter~0 100)} #96#return; {138884#(< ~counter~0 100)} is VALID [2022-04-28 06:04:42,334 INFO L290 TraceCheckUtils]: 134: Hoare triple {138396#true} assume true; {138396#true} is VALID [2022-04-28 06:04:42,334 INFO L290 TraceCheckUtils]: 133: Hoare triple {138396#true} assume !(0 == ~cond); {138396#true} is VALID [2022-04-28 06:04:42,334 INFO L290 TraceCheckUtils]: 132: Hoare triple {138396#true} ~cond := #in~cond; {138396#true} is VALID [2022-04-28 06:04:42,334 INFO L272 TraceCheckUtils]: 131: Hoare triple {138884#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138396#true} is VALID [2022-04-28 06:04:42,334 INFO L290 TraceCheckUtils]: 130: Hoare triple {138884#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {138884#(< ~counter~0 100)} is VALID [2022-04-28 06:04:42,337 INFO L290 TraceCheckUtils]: 129: Hoare triple {138909#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {138884#(< ~counter~0 100)} is VALID [2022-04-28 06:04:42,337 INFO L290 TraceCheckUtils]: 128: Hoare triple {138909#(< ~counter~0 99)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {138909#(< ~counter~0 99)} is VALID [2022-04-28 06:04:42,338 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {138396#true} {138909#(< ~counter~0 99)} #96#return; {138909#(< ~counter~0 99)} is VALID [2022-04-28 06:04:42,338 INFO L290 TraceCheckUtils]: 126: Hoare triple {138396#true} assume true; {138396#true} is VALID [2022-04-28 06:04:42,338 INFO L290 TraceCheckUtils]: 125: Hoare triple {138396#true} assume !(0 == ~cond); {138396#true} is VALID [2022-04-28 06:04:42,338 INFO L290 TraceCheckUtils]: 124: Hoare triple {138396#true} ~cond := #in~cond; {138396#true} is VALID [2022-04-28 06:04:42,338 INFO L272 TraceCheckUtils]: 123: Hoare triple {138909#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138396#true} is VALID [2022-04-28 06:04:42,338 INFO L290 TraceCheckUtils]: 122: Hoare triple {138909#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {138909#(< ~counter~0 99)} is VALID [2022-04-28 06:04:42,339 INFO L290 TraceCheckUtils]: 121: Hoare triple {138934#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {138909#(< ~counter~0 99)} is VALID [2022-04-28 06:04:42,340 INFO L290 TraceCheckUtils]: 120: Hoare triple {138934#(< ~counter~0 98)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {138934#(< ~counter~0 98)} is VALID [2022-04-28 06:04:42,340 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {138396#true} {138934#(< ~counter~0 98)} #96#return; {138934#(< ~counter~0 98)} is VALID [2022-04-28 06:04:42,340 INFO L290 TraceCheckUtils]: 118: Hoare triple {138396#true} assume true; {138396#true} is VALID [2022-04-28 06:04:42,340 INFO L290 TraceCheckUtils]: 117: Hoare triple {138396#true} assume !(0 == ~cond); {138396#true} is VALID [2022-04-28 06:04:42,340 INFO L290 TraceCheckUtils]: 116: Hoare triple {138396#true} ~cond := #in~cond; {138396#true} is VALID [2022-04-28 06:04:42,340 INFO L272 TraceCheckUtils]: 115: Hoare triple {138934#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138396#true} is VALID [2022-04-28 06:04:42,341 INFO L290 TraceCheckUtils]: 114: Hoare triple {138934#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {138934#(< ~counter~0 98)} is VALID [2022-04-28 06:04:42,342 INFO L290 TraceCheckUtils]: 113: Hoare triple {138959#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {138934#(< ~counter~0 98)} is VALID [2022-04-28 06:04:42,342 INFO L290 TraceCheckUtils]: 112: Hoare triple {138959#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {138959#(< ~counter~0 97)} is VALID [2022-04-28 06:04:42,343 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {138396#true} {138959#(< ~counter~0 97)} #96#return; {138959#(< ~counter~0 97)} is VALID [2022-04-28 06:04:42,343 INFO L290 TraceCheckUtils]: 110: Hoare triple {138396#true} assume true; {138396#true} is VALID [2022-04-28 06:04:42,343 INFO L290 TraceCheckUtils]: 109: Hoare triple {138396#true} assume !(0 == ~cond); {138396#true} is VALID [2022-04-28 06:04:42,343 INFO L290 TraceCheckUtils]: 108: Hoare triple {138396#true} ~cond := #in~cond; {138396#true} is VALID [2022-04-28 06:04:42,343 INFO L272 TraceCheckUtils]: 107: Hoare triple {138959#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138396#true} is VALID [2022-04-28 06:04:42,343 INFO L290 TraceCheckUtils]: 106: Hoare triple {138959#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {138959#(< ~counter~0 97)} is VALID [2022-04-28 06:04:42,344 INFO L290 TraceCheckUtils]: 105: Hoare triple {138984#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {138959#(< ~counter~0 97)} is VALID [2022-04-28 06:04:42,344 INFO L290 TraceCheckUtils]: 104: Hoare triple {138984#(< ~counter~0 96)} assume !!(0 != ~r~0); {138984#(< ~counter~0 96)} is VALID [2022-04-28 06:04:42,345 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {138396#true} {138984#(< ~counter~0 96)} #94#return; {138984#(< ~counter~0 96)} is VALID [2022-04-28 06:04:42,345 INFO L290 TraceCheckUtils]: 102: Hoare triple {138396#true} assume true; {138396#true} is VALID [2022-04-28 06:04:42,345 INFO L290 TraceCheckUtils]: 101: Hoare triple {138396#true} assume !(0 == ~cond); {138396#true} is VALID [2022-04-28 06:04:42,345 INFO L290 TraceCheckUtils]: 100: Hoare triple {138396#true} ~cond := #in~cond; {138396#true} is VALID [2022-04-28 06:04:42,345 INFO L272 TraceCheckUtils]: 99: Hoare triple {138984#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138396#true} is VALID [2022-04-28 06:04:42,345 INFO L290 TraceCheckUtils]: 98: Hoare triple {138984#(< ~counter~0 96)} assume !!(#t~post6 < 100);havoc #t~post6; {138984#(< ~counter~0 96)} is VALID [2022-04-28 06:04:42,347 INFO L290 TraceCheckUtils]: 97: Hoare triple {139009#(< ~counter~0 95)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {138984#(< ~counter~0 96)} is VALID [2022-04-28 06:04:42,347 INFO L290 TraceCheckUtils]: 96: Hoare triple {139009#(< ~counter~0 95)} assume !(~r~0 < 0); {139009#(< ~counter~0 95)} is VALID [2022-04-28 06:04:42,347 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {138396#true} {139009#(< ~counter~0 95)} #98#return; {139009#(< ~counter~0 95)} is VALID [2022-04-28 06:04:42,347 INFO L290 TraceCheckUtils]: 94: Hoare triple {138396#true} assume true; {138396#true} is VALID [2022-04-28 06:04:42,347 INFO L290 TraceCheckUtils]: 93: Hoare triple {138396#true} assume !(0 == ~cond); {138396#true} is VALID [2022-04-28 06:04:42,348 INFO L290 TraceCheckUtils]: 92: Hoare triple {138396#true} ~cond := #in~cond; {138396#true} is VALID [2022-04-28 06:04:42,348 INFO L272 TraceCheckUtils]: 91: Hoare triple {139009#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138396#true} is VALID [2022-04-28 06:04:42,348 INFO L290 TraceCheckUtils]: 90: Hoare triple {139009#(< ~counter~0 95)} assume !!(#t~post8 < 100);havoc #t~post8; {139009#(< ~counter~0 95)} is VALID [2022-04-28 06:04:42,349 INFO L290 TraceCheckUtils]: 89: Hoare triple {139034#(< ~counter~0 94)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {139009#(< ~counter~0 95)} is VALID [2022-04-28 06:04:42,349 INFO L290 TraceCheckUtils]: 88: Hoare triple {139034#(< ~counter~0 94)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {139034#(< ~counter~0 94)} is VALID [2022-04-28 06:04:42,350 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {138396#true} {139034#(< ~counter~0 94)} #98#return; {139034#(< ~counter~0 94)} is VALID [2022-04-28 06:04:42,350 INFO L290 TraceCheckUtils]: 86: Hoare triple {138396#true} assume true; {138396#true} is VALID [2022-04-28 06:04:42,350 INFO L290 TraceCheckUtils]: 85: Hoare triple {138396#true} assume !(0 == ~cond); {138396#true} is VALID [2022-04-28 06:04:42,350 INFO L290 TraceCheckUtils]: 84: Hoare triple {138396#true} ~cond := #in~cond; {138396#true} is VALID [2022-04-28 06:04:42,350 INFO L272 TraceCheckUtils]: 83: Hoare triple {139034#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138396#true} is VALID [2022-04-28 06:04:42,350 INFO L290 TraceCheckUtils]: 82: Hoare triple {139034#(< ~counter~0 94)} assume !!(#t~post8 < 100);havoc #t~post8; {139034#(< ~counter~0 94)} is VALID [2022-04-28 06:04:42,351 INFO L290 TraceCheckUtils]: 81: Hoare triple {139059#(< ~counter~0 93)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {139034#(< ~counter~0 94)} is VALID [2022-04-28 06:04:42,352 INFO L290 TraceCheckUtils]: 80: Hoare triple {139059#(< ~counter~0 93)} assume !(~r~0 > 0); {139059#(< ~counter~0 93)} is VALID [2022-04-28 06:04:42,352 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {138396#true} {139059#(< ~counter~0 93)} #96#return; {139059#(< ~counter~0 93)} is VALID [2022-04-28 06:04:42,352 INFO L290 TraceCheckUtils]: 78: Hoare triple {138396#true} assume true; {138396#true} is VALID [2022-04-28 06:04:42,352 INFO L290 TraceCheckUtils]: 77: Hoare triple {138396#true} assume !(0 == ~cond); {138396#true} is VALID [2022-04-28 06:04:42,352 INFO L290 TraceCheckUtils]: 76: Hoare triple {138396#true} ~cond := #in~cond; {138396#true} is VALID [2022-04-28 06:04:42,352 INFO L272 TraceCheckUtils]: 75: Hoare triple {139059#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138396#true} is VALID [2022-04-28 06:04:42,353 INFO L290 TraceCheckUtils]: 74: Hoare triple {139059#(< ~counter~0 93)} assume !!(#t~post7 < 100);havoc #t~post7; {139059#(< ~counter~0 93)} is VALID [2022-04-28 06:04:42,354 INFO L290 TraceCheckUtils]: 73: Hoare triple {139084#(< ~counter~0 92)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {139059#(< ~counter~0 93)} is VALID [2022-04-28 06:04:42,354 INFO L290 TraceCheckUtils]: 72: Hoare triple {139084#(< ~counter~0 92)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {139084#(< ~counter~0 92)} is VALID [2022-04-28 06:04:42,354 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {138396#true} {139084#(< ~counter~0 92)} #96#return; {139084#(< ~counter~0 92)} is VALID [2022-04-28 06:04:42,355 INFO L290 TraceCheckUtils]: 70: Hoare triple {138396#true} assume true; {138396#true} is VALID [2022-04-28 06:04:42,355 INFO L290 TraceCheckUtils]: 69: Hoare triple {138396#true} assume !(0 == ~cond); {138396#true} is VALID [2022-04-28 06:04:42,355 INFO L290 TraceCheckUtils]: 68: Hoare triple {138396#true} ~cond := #in~cond; {138396#true} is VALID [2022-04-28 06:04:42,355 INFO L272 TraceCheckUtils]: 67: Hoare triple {139084#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138396#true} is VALID [2022-04-28 06:04:42,355 INFO L290 TraceCheckUtils]: 66: Hoare triple {139084#(< ~counter~0 92)} assume !!(#t~post7 < 100);havoc #t~post7; {139084#(< ~counter~0 92)} is VALID [2022-04-28 06:04:42,356 INFO L290 TraceCheckUtils]: 65: Hoare triple {139109#(< ~counter~0 91)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {139084#(< ~counter~0 92)} is VALID [2022-04-28 06:04:42,356 INFO L290 TraceCheckUtils]: 64: Hoare triple {139109#(< ~counter~0 91)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {139109#(< ~counter~0 91)} is VALID [2022-04-28 06:04:42,357 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {138396#true} {139109#(< ~counter~0 91)} #96#return; {139109#(< ~counter~0 91)} is VALID [2022-04-28 06:04:42,357 INFO L290 TraceCheckUtils]: 62: Hoare triple {138396#true} assume true; {138396#true} is VALID [2022-04-28 06:04:42,357 INFO L290 TraceCheckUtils]: 61: Hoare triple {138396#true} assume !(0 == ~cond); {138396#true} is VALID [2022-04-28 06:04:42,357 INFO L290 TraceCheckUtils]: 60: Hoare triple {138396#true} ~cond := #in~cond; {138396#true} is VALID [2022-04-28 06:04:42,357 INFO L272 TraceCheckUtils]: 59: Hoare triple {139109#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138396#true} is VALID [2022-04-28 06:04:42,357 INFO L290 TraceCheckUtils]: 58: Hoare triple {139109#(< ~counter~0 91)} assume !!(#t~post7 < 100);havoc #t~post7; {139109#(< ~counter~0 91)} is VALID [2022-04-28 06:04:42,359 INFO L290 TraceCheckUtils]: 57: Hoare triple {139134#(< ~counter~0 90)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {139109#(< ~counter~0 91)} is VALID [2022-04-28 06:04:42,359 INFO L290 TraceCheckUtils]: 56: Hoare triple {139134#(< ~counter~0 90)} assume !!(0 != ~r~0); {139134#(< ~counter~0 90)} is VALID [2022-04-28 06:04:42,359 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {138396#true} {139134#(< ~counter~0 90)} #94#return; {139134#(< ~counter~0 90)} is VALID [2022-04-28 06:04:42,359 INFO L290 TraceCheckUtils]: 54: Hoare triple {138396#true} assume true; {138396#true} is VALID [2022-04-28 06:04:42,359 INFO L290 TraceCheckUtils]: 53: Hoare triple {138396#true} assume !(0 == ~cond); {138396#true} is VALID [2022-04-28 06:04:42,359 INFO L290 TraceCheckUtils]: 52: Hoare triple {138396#true} ~cond := #in~cond; {138396#true} is VALID [2022-04-28 06:04:42,360 INFO L272 TraceCheckUtils]: 51: Hoare triple {139134#(< ~counter~0 90)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138396#true} is VALID [2022-04-28 06:04:42,360 INFO L290 TraceCheckUtils]: 50: Hoare triple {139134#(< ~counter~0 90)} assume !!(#t~post6 < 100);havoc #t~post6; {139134#(< ~counter~0 90)} is VALID [2022-04-28 06:04:42,361 INFO L290 TraceCheckUtils]: 49: Hoare triple {139159#(< ~counter~0 89)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {139134#(< ~counter~0 90)} is VALID [2022-04-28 06:04:42,361 INFO L290 TraceCheckUtils]: 48: Hoare triple {139159#(< ~counter~0 89)} assume !(~r~0 < 0); {139159#(< ~counter~0 89)} is VALID [2022-04-28 06:04:42,362 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {138396#true} {139159#(< ~counter~0 89)} #98#return; {139159#(< ~counter~0 89)} is VALID [2022-04-28 06:04:42,362 INFO L290 TraceCheckUtils]: 46: Hoare triple {138396#true} assume true; {138396#true} is VALID [2022-04-28 06:04:42,362 INFO L290 TraceCheckUtils]: 45: Hoare triple {138396#true} assume !(0 == ~cond); {138396#true} is VALID [2022-04-28 06:04:42,362 INFO L290 TraceCheckUtils]: 44: Hoare triple {138396#true} ~cond := #in~cond; {138396#true} is VALID [2022-04-28 06:04:42,362 INFO L272 TraceCheckUtils]: 43: Hoare triple {139159#(< ~counter~0 89)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138396#true} is VALID [2022-04-28 06:04:42,362 INFO L290 TraceCheckUtils]: 42: Hoare triple {139159#(< ~counter~0 89)} assume !!(#t~post8 < 100);havoc #t~post8; {139159#(< ~counter~0 89)} is VALID [2022-04-28 06:04:42,363 INFO L290 TraceCheckUtils]: 41: Hoare triple {139184#(< ~counter~0 88)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {139159#(< ~counter~0 89)} is VALID [2022-04-28 06:04:42,364 INFO L290 TraceCheckUtils]: 40: Hoare triple {139184#(< ~counter~0 88)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {139184#(< ~counter~0 88)} is VALID [2022-04-28 06:04:42,364 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {138396#true} {139184#(< ~counter~0 88)} #98#return; {139184#(< ~counter~0 88)} is VALID [2022-04-28 06:04:42,364 INFO L290 TraceCheckUtils]: 38: Hoare triple {138396#true} assume true; {138396#true} is VALID [2022-04-28 06:04:42,364 INFO L290 TraceCheckUtils]: 37: Hoare triple {138396#true} assume !(0 == ~cond); {138396#true} is VALID [2022-04-28 06:04:42,364 INFO L290 TraceCheckUtils]: 36: Hoare triple {138396#true} ~cond := #in~cond; {138396#true} is VALID [2022-04-28 06:04:42,364 INFO L272 TraceCheckUtils]: 35: Hoare triple {139184#(< ~counter~0 88)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138396#true} is VALID [2022-04-28 06:04:42,365 INFO L290 TraceCheckUtils]: 34: Hoare triple {139184#(< ~counter~0 88)} assume !!(#t~post8 < 100);havoc #t~post8; {139184#(< ~counter~0 88)} is VALID [2022-04-28 06:04:42,366 INFO L290 TraceCheckUtils]: 33: Hoare triple {139209#(< ~counter~0 87)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {139184#(< ~counter~0 88)} is VALID [2022-04-28 06:04:42,366 INFO L290 TraceCheckUtils]: 32: Hoare triple {139209#(< ~counter~0 87)} assume !(~r~0 > 0); {139209#(< ~counter~0 87)} is VALID [2022-04-28 06:04:42,366 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {138396#true} {139209#(< ~counter~0 87)} #96#return; {139209#(< ~counter~0 87)} is VALID [2022-04-28 06:04:42,366 INFO L290 TraceCheckUtils]: 30: Hoare triple {138396#true} assume true; {138396#true} is VALID [2022-04-28 06:04:42,367 INFO L290 TraceCheckUtils]: 29: Hoare triple {138396#true} assume !(0 == ~cond); {138396#true} is VALID [2022-04-28 06:04:42,367 INFO L290 TraceCheckUtils]: 28: Hoare triple {138396#true} ~cond := #in~cond; {138396#true} is VALID [2022-04-28 06:04:42,367 INFO L272 TraceCheckUtils]: 27: Hoare triple {139209#(< ~counter~0 87)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138396#true} is VALID [2022-04-28 06:04:42,367 INFO L290 TraceCheckUtils]: 26: Hoare triple {139209#(< ~counter~0 87)} assume !!(#t~post7 < 100);havoc #t~post7; {139209#(< ~counter~0 87)} is VALID [2022-04-28 06:04:42,368 INFO L290 TraceCheckUtils]: 25: Hoare triple {139234#(< ~counter~0 86)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {139209#(< ~counter~0 87)} is VALID [2022-04-28 06:04:42,368 INFO L290 TraceCheckUtils]: 24: Hoare triple {139234#(< ~counter~0 86)} assume !!(0 != ~r~0); {139234#(< ~counter~0 86)} is VALID [2022-04-28 06:04:42,369 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {138396#true} {139234#(< ~counter~0 86)} #94#return; {139234#(< ~counter~0 86)} is VALID [2022-04-28 06:04:42,369 INFO L290 TraceCheckUtils]: 22: Hoare triple {138396#true} assume true; {138396#true} is VALID [2022-04-28 06:04:42,369 INFO L290 TraceCheckUtils]: 21: Hoare triple {138396#true} assume !(0 == ~cond); {138396#true} is VALID [2022-04-28 06:04:42,369 INFO L290 TraceCheckUtils]: 20: Hoare triple {138396#true} ~cond := #in~cond; {138396#true} is VALID [2022-04-28 06:04:42,369 INFO L272 TraceCheckUtils]: 19: Hoare triple {139234#(< ~counter~0 86)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138396#true} is VALID [2022-04-28 06:04:42,369 INFO L290 TraceCheckUtils]: 18: Hoare triple {139234#(< ~counter~0 86)} assume !!(#t~post6 < 100);havoc #t~post6; {139234#(< ~counter~0 86)} is VALID [2022-04-28 06:04:42,370 INFO L290 TraceCheckUtils]: 17: Hoare triple {139259#(< ~counter~0 85)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {139234#(< ~counter~0 86)} is VALID [2022-04-28 06:04:42,371 INFO L290 TraceCheckUtils]: 16: Hoare triple {139259#(< ~counter~0 85)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {139259#(< ~counter~0 85)} is VALID [2022-04-28 06:04:42,371 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {138396#true} {139259#(< ~counter~0 85)} #92#return; {139259#(< ~counter~0 85)} is VALID [2022-04-28 06:04:42,371 INFO L290 TraceCheckUtils]: 14: Hoare triple {138396#true} assume true; {138396#true} is VALID [2022-04-28 06:04:42,371 INFO L290 TraceCheckUtils]: 13: Hoare triple {138396#true} assume !(0 == ~cond); {138396#true} is VALID [2022-04-28 06:04:42,371 INFO L290 TraceCheckUtils]: 12: Hoare triple {138396#true} ~cond := #in~cond; {138396#true} is VALID [2022-04-28 06:04:42,371 INFO L272 TraceCheckUtils]: 11: Hoare triple {139259#(< ~counter~0 85)} 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)); {138396#true} is VALID [2022-04-28 06:04:42,372 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {138396#true} {139259#(< ~counter~0 85)} #90#return; {139259#(< ~counter~0 85)} is VALID [2022-04-28 06:04:42,372 INFO L290 TraceCheckUtils]: 9: Hoare triple {138396#true} assume true; {138396#true} is VALID [2022-04-28 06:04:42,372 INFO L290 TraceCheckUtils]: 8: Hoare triple {138396#true} assume !(0 == ~cond); {138396#true} is VALID [2022-04-28 06:04:42,372 INFO L290 TraceCheckUtils]: 7: Hoare triple {138396#true} ~cond := #in~cond; {138396#true} is VALID [2022-04-28 06:04:42,372 INFO L272 TraceCheckUtils]: 6: Hoare triple {139259#(< ~counter~0 85)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {138396#true} is VALID [2022-04-28 06:04:42,372 INFO L290 TraceCheckUtils]: 5: Hoare triple {139259#(< ~counter~0 85)} 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; {139259#(< ~counter~0 85)} is VALID [2022-04-28 06:04:42,373 INFO L272 TraceCheckUtils]: 4: Hoare triple {139259#(< ~counter~0 85)} call #t~ret9 := main(); {139259#(< ~counter~0 85)} is VALID [2022-04-28 06:04:42,373 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {139259#(< ~counter~0 85)} {138396#true} #102#return; {139259#(< ~counter~0 85)} is VALID [2022-04-28 06:04:42,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {139259#(< ~counter~0 85)} assume true; {139259#(< ~counter~0 85)} is VALID [2022-04-28 06:04:42,374 INFO L290 TraceCheckUtils]: 1: Hoare triple {138396#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; {139259#(< ~counter~0 85)} is VALID [2022-04-28 06:04:42,374 INFO L272 TraceCheckUtils]: 0: Hoare triple {138396#true} call ULTIMATE.init(); {138396#true} is VALID [2022-04-28 06:04:42,374 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 44 proven. 164 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2022-04-28 06:04:42,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:04:42,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695410014] [2022-04-28 06:04:42,374 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:04:42,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614824800] [2022-04-28 06:04:42,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614824800] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:04:42,375 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:04:42,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2022-04-28 06:04:42,375 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:04:42,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1998388020] [2022-04-28 06:04:42,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1998388020] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:04:42,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:04:42,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 06:04:42,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799903066] [2022-04-28 06:04:42,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:04:42,376 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.578947368421052) internal successors, (106), 18 states have internal predecessors, (106), 18 states have call successors, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 16 states have call predecessors, (18), 17 states have call successors, (18) Word has length 147 [2022-04-28 06:04:42,376 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:04:42,376 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 5.578947368421052) internal successors, (106), 18 states have internal predecessors, (106), 18 states have call successors, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 16 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-28 06:04:42,525 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:04:42,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 06:04:42,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:04:42,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 06:04:42,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=566, Invalid=694, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 06:04:42,526 INFO L87 Difference]: Start difference. First operand 778 states and 1041 transitions. Second operand has 19 states, 19 states have (on average 5.578947368421052) internal successors, (106), 18 states have internal predecessors, (106), 18 states have call successors, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 16 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-28 06:04:47,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:04:47,638 INFO L93 Difference]: Finished difference Result 965 states and 1319 transitions. [2022-04-28 06:04:47,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-28 06:04:47,638 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.578947368421052) internal successors, (106), 18 states have internal predecessors, (106), 18 states have call successors, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 16 states have call predecessors, (18), 17 states have call successors, (18) Word has length 147 [2022-04-28 06:04:47,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:04:47,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 5.578947368421052) internal successors, (106), 18 states have internal predecessors, (106), 18 states have call successors, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 16 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-28 06:04:47,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 336 transitions. [2022-04-28 06:04:47,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 5.578947368421052) internal successors, (106), 18 states have internal predecessors, (106), 18 states have call successors, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 16 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-28 06:04:47,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 336 transitions. [2022-04-28 06:04:47,643 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 336 transitions. [2022-04-28 06:04:48,054 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 336 edges. 336 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:04:48,081 INFO L225 Difference]: With dead ends: 965 [2022-04-28 06:04:48,081 INFO L226 Difference]: Without dead ends: 795 [2022-04-28 06:04:48,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1042, Invalid=1408, Unknown=0, NotChecked=0, Total=2450 [2022-04-28 06:04:48,086 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 219 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 06:04:48,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 344 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 06:04:48,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2022-04-28 06:04:51,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 795. [2022-04-28 06:04:51,195 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:04:51,196 INFO L82 GeneralOperation]: Start isEquivalent. First operand 795 states. Second operand has 795 states, 599 states have (on average 1.1819699499165275) internal successors, (708), 606 states have internal predecessors, (708), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-28 06:04:51,197 INFO L74 IsIncluded]: Start isIncluded. First operand 795 states. Second operand has 795 states, 599 states have (on average 1.1819699499165275) internal successors, (708), 606 states have internal predecessors, (708), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-28 06:04:51,197 INFO L87 Difference]: Start difference. First operand 795 states. Second operand has 795 states, 599 states have (on average 1.1819699499165275) internal successors, (708), 606 states have internal predecessors, (708), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-28 06:04:51,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:04:51,227 INFO L93 Difference]: Finished difference Result 795 states and 1058 transitions. [2022-04-28 06:04:51,227 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1058 transitions. [2022-04-28 06:04:51,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:04:51,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:04:51,229 INFO L74 IsIncluded]: Start isIncluded. First operand has 795 states, 599 states have (on average 1.1819699499165275) internal successors, (708), 606 states have internal predecessors, (708), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) Second operand 795 states. [2022-04-28 06:04:51,230 INFO L87 Difference]: Start difference. First operand has 795 states, 599 states have (on average 1.1819699499165275) internal successors, (708), 606 states have internal predecessors, (708), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) Second operand 795 states. [2022-04-28 06:04:51,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:04:51,260 INFO L93 Difference]: Finished difference Result 795 states and 1058 transitions. [2022-04-28 06:04:51,260 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1058 transitions. [2022-04-28 06:04:51,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:04:51,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:04:51,261 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:04:51,261 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:04:51,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 795 states, 599 states have (on average 1.1819699499165275) internal successors, (708), 606 states have internal predecessors, (708), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-28 06:04:51,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1058 transitions. [2022-04-28 06:04:51,303 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1058 transitions. Word has length 147 [2022-04-28 06:04:51,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:04:51,303 INFO L495 AbstractCegarLoop]: Abstraction has 795 states and 1058 transitions. [2022-04-28 06:04:51,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.578947368421052) internal successors, (106), 18 states have internal predecessors, (106), 18 states have call successors, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 16 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-28 06:04:51,303 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 795 states and 1058 transitions. [2022-04-28 06:05:05,547 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1058 edges. 1055 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 06:05:05,547 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1058 transitions. [2022-04-28 06:05:05,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-04-28 06:05:05,548 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:05:05,548 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 7, 7, 7, 7, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:05:05,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Forceful destruction successful, exit code 0 [2022-04-28 06:05:05,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:05:05,749 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:05:05,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:05:05,749 INFO L85 PathProgramCache]: Analyzing trace with hash -913503479, now seen corresponding path program 15 times [2022-04-28 06:05:05,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:05:05,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2116552993] [2022-04-28 06:05:05,750 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:05:05,750 INFO L85 PathProgramCache]: Analyzing trace with hash -913503479, now seen corresponding path program 16 times [2022-04-28 06:05:05,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:05:05,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931504654] [2022-04-28 06:05:05,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:05:05,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:05:05,763 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:05:05,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [263061437] [2022-04-28 06:05:05,764 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 06:05:05,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:05:05,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:05:05,765 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:05:05,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2022-04-28 06:05:05,882 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 06:05:05,883 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:05:05,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-28 06:05:05,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:05:05,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:05:06,753 INFO L272 TraceCheckUtils]: 0: Hoare triple {144451#true} call ULTIMATE.init(); {144451#true} is VALID [2022-04-28 06:05:06,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {144451#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; {144459#(<= ~counter~0 0)} is VALID [2022-04-28 06:05:06,754 INFO L290 TraceCheckUtils]: 2: Hoare triple {144459#(<= ~counter~0 0)} assume true; {144459#(<= ~counter~0 0)} is VALID [2022-04-28 06:05:06,754 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {144459#(<= ~counter~0 0)} {144451#true} #102#return; {144459#(<= ~counter~0 0)} is VALID [2022-04-28 06:05:06,754 INFO L272 TraceCheckUtils]: 4: Hoare triple {144459#(<= ~counter~0 0)} call #t~ret9 := main(); {144459#(<= ~counter~0 0)} is VALID [2022-04-28 06:05:06,755 INFO L290 TraceCheckUtils]: 5: Hoare triple {144459#(<= ~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; {144459#(<= ~counter~0 0)} is VALID [2022-04-28 06:05:06,755 INFO L272 TraceCheckUtils]: 6: Hoare triple {144459#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {144459#(<= ~counter~0 0)} is VALID [2022-04-28 06:05:06,756 INFO L290 TraceCheckUtils]: 7: Hoare triple {144459#(<= ~counter~0 0)} ~cond := #in~cond; {144459#(<= ~counter~0 0)} is VALID [2022-04-28 06:05:06,756 INFO L290 TraceCheckUtils]: 8: Hoare triple {144459#(<= ~counter~0 0)} assume !(0 == ~cond); {144459#(<= ~counter~0 0)} is VALID [2022-04-28 06:05:06,756 INFO L290 TraceCheckUtils]: 9: Hoare triple {144459#(<= ~counter~0 0)} assume true; {144459#(<= ~counter~0 0)} is VALID [2022-04-28 06:05:06,757 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {144459#(<= ~counter~0 0)} {144459#(<= ~counter~0 0)} #90#return; {144459#(<= ~counter~0 0)} is VALID [2022-04-28 06:05:06,757 INFO L272 TraceCheckUtils]: 11: Hoare triple {144459#(<= ~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)); {144459#(<= ~counter~0 0)} is VALID [2022-04-28 06:05:06,757 INFO L290 TraceCheckUtils]: 12: Hoare triple {144459#(<= ~counter~0 0)} ~cond := #in~cond; {144459#(<= ~counter~0 0)} is VALID [2022-04-28 06:05:06,758 INFO L290 TraceCheckUtils]: 13: Hoare triple {144459#(<= ~counter~0 0)} assume !(0 == ~cond); {144459#(<= ~counter~0 0)} is VALID [2022-04-28 06:05:06,758 INFO L290 TraceCheckUtils]: 14: Hoare triple {144459#(<= ~counter~0 0)} assume true; {144459#(<= ~counter~0 0)} is VALID [2022-04-28 06:05:06,758 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {144459#(<= ~counter~0 0)} {144459#(<= ~counter~0 0)} #92#return; {144459#(<= ~counter~0 0)} is VALID [2022-04-28 06:05:06,758 INFO L290 TraceCheckUtils]: 16: Hoare triple {144459#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {144459#(<= ~counter~0 0)} is VALID [2022-04-28 06:05:06,761 INFO L290 TraceCheckUtils]: 17: Hoare triple {144459#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {144508#(<= ~counter~0 1)} is VALID [2022-04-28 06:05:06,762 INFO L290 TraceCheckUtils]: 18: Hoare triple {144508#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {144508#(<= ~counter~0 1)} is VALID [2022-04-28 06:05:06,762 INFO L272 TraceCheckUtils]: 19: Hoare triple {144508#(<= ~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)); {144508#(<= ~counter~0 1)} is VALID [2022-04-28 06:05:06,762 INFO L290 TraceCheckUtils]: 20: Hoare triple {144508#(<= ~counter~0 1)} ~cond := #in~cond; {144508#(<= ~counter~0 1)} is VALID [2022-04-28 06:05:06,763 INFO L290 TraceCheckUtils]: 21: Hoare triple {144508#(<= ~counter~0 1)} assume !(0 == ~cond); {144508#(<= ~counter~0 1)} is VALID [2022-04-28 06:05:06,763 INFO L290 TraceCheckUtils]: 22: Hoare triple {144508#(<= ~counter~0 1)} assume true; {144508#(<= ~counter~0 1)} is VALID [2022-04-28 06:05:06,763 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {144508#(<= ~counter~0 1)} {144508#(<= ~counter~0 1)} #94#return; {144508#(<= ~counter~0 1)} is VALID [2022-04-28 06:05:06,764 INFO L290 TraceCheckUtils]: 24: Hoare triple {144508#(<= ~counter~0 1)} assume !!(0 != ~r~0); {144508#(<= ~counter~0 1)} is VALID [2022-04-28 06:05:06,765 INFO L290 TraceCheckUtils]: 25: Hoare triple {144508#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {144533#(<= ~counter~0 2)} is VALID [2022-04-28 06:05:06,765 INFO L290 TraceCheckUtils]: 26: Hoare triple {144533#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {144533#(<= ~counter~0 2)} is VALID [2022-04-28 06:05:06,766 INFO L272 TraceCheckUtils]: 27: Hoare triple {144533#(<= ~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)); {144533#(<= ~counter~0 2)} is VALID [2022-04-28 06:05:06,766 INFO L290 TraceCheckUtils]: 28: Hoare triple {144533#(<= ~counter~0 2)} ~cond := #in~cond; {144533#(<= ~counter~0 2)} is VALID [2022-04-28 06:05:06,766 INFO L290 TraceCheckUtils]: 29: Hoare triple {144533#(<= ~counter~0 2)} assume !(0 == ~cond); {144533#(<= ~counter~0 2)} is VALID [2022-04-28 06:05:06,766 INFO L290 TraceCheckUtils]: 30: Hoare triple {144533#(<= ~counter~0 2)} assume true; {144533#(<= ~counter~0 2)} is VALID [2022-04-28 06:05:06,767 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {144533#(<= ~counter~0 2)} {144533#(<= ~counter~0 2)} #96#return; {144533#(<= ~counter~0 2)} is VALID [2022-04-28 06:05:06,767 INFO L290 TraceCheckUtils]: 32: Hoare triple {144533#(<= ~counter~0 2)} assume !(~r~0 > 0); {144533#(<= ~counter~0 2)} is VALID [2022-04-28 06:05:06,768 INFO L290 TraceCheckUtils]: 33: Hoare triple {144533#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {144558#(<= ~counter~0 3)} is VALID [2022-04-28 06:05:06,769 INFO L290 TraceCheckUtils]: 34: Hoare triple {144558#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {144558#(<= ~counter~0 3)} is VALID [2022-04-28 06:05:06,769 INFO L272 TraceCheckUtils]: 35: Hoare triple {144558#(<= ~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)); {144558#(<= ~counter~0 3)} is VALID [2022-04-28 06:05:06,769 INFO L290 TraceCheckUtils]: 36: Hoare triple {144558#(<= ~counter~0 3)} ~cond := #in~cond; {144558#(<= ~counter~0 3)} is VALID [2022-04-28 06:05:06,770 INFO L290 TraceCheckUtils]: 37: Hoare triple {144558#(<= ~counter~0 3)} assume !(0 == ~cond); {144558#(<= ~counter~0 3)} is VALID [2022-04-28 06:05:06,770 INFO L290 TraceCheckUtils]: 38: Hoare triple {144558#(<= ~counter~0 3)} assume true; {144558#(<= ~counter~0 3)} is VALID [2022-04-28 06:05:06,770 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {144558#(<= ~counter~0 3)} {144558#(<= ~counter~0 3)} #98#return; {144558#(<= ~counter~0 3)} is VALID [2022-04-28 06:05:06,771 INFO L290 TraceCheckUtils]: 40: Hoare triple {144558#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {144558#(<= ~counter~0 3)} is VALID [2022-04-28 06:05:06,772 INFO L290 TraceCheckUtils]: 41: Hoare triple {144558#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {144583#(<= ~counter~0 4)} is VALID [2022-04-28 06:05:06,772 INFO L290 TraceCheckUtils]: 42: Hoare triple {144583#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {144583#(<= ~counter~0 4)} is VALID [2022-04-28 06:05:06,773 INFO L272 TraceCheckUtils]: 43: Hoare triple {144583#(<= ~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)); {144583#(<= ~counter~0 4)} is VALID [2022-04-28 06:05:06,773 INFO L290 TraceCheckUtils]: 44: Hoare triple {144583#(<= ~counter~0 4)} ~cond := #in~cond; {144583#(<= ~counter~0 4)} is VALID [2022-04-28 06:05:06,773 INFO L290 TraceCheckUtils]: 45: Hoare triple {144583#(<= ~counter~0 4)} assume !(0 == ~cond); {144583#(<= ~counter~0 4)} is VALID [2022-04-28 06:05:06,773 INFO L290 TraceCheckUtils]: 46: Hoare triple {144583#(<= ~counter~0 4)} assume true; {144583#(<= ~counter~0 4)} is VALID [2022-04-28 06:05:06,774 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {144583#(<= ~counter~0 4)} {144583#(<= ~counter~0 4)} #98#return; {144583#(<= ~counter~0 4)} is VALID [2022-04-28 06:05:06,774 INFO L290 TraceCheckUtils]: 48: Hoare triple {144583#(<= ~counter~0 4)} assume !(~r~0 < 0); {144583#(<= ~counter~0 4)} is VALID [2022-04-28 06:05:06,775 INFO L290 TraceCheckUtils]: 49: Hoare triple {144583#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {144608#(<= ~counter~0 5)} is VALID [2022-04-28 06:05:06,776 INFO L290 TraceCheckUtils]: 50: Hoare triple {144608#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {144608#(<= ~counter~0 5)} is VALID [2022-04-28 06:05:06,776 INFO L272 TraceCheckUtils]: 51: Hoare triple {144608#(<= ~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)); {144608#(<= ~counter~0 5)} is VALID [2022-04-28 06:05:06,776 INFO L290 TraceCheckUtils]: 52: Hoare triple {144608#(<= ~counter~0 5)} ~cond := #in~cond; {144608#(<= ~counter~0 5)} is VALID [2022-04-28 06:05:06,777 INFO L290 TraceCheckUtils]: 53: Hoare triple {144608#(<= ~counter~0 5)} assume !(0 == ~cond); {144608#(<= ~counter~0 5)} is VALID [2022-04-28 06:05:06,777 INFO L290 TraceCheckUtils]: 54: Hoare triple {144608#(<= ~counter~0 5)} assume true; {144608#(<= ~counter~0 5)} is VALID [2022-04-28 06:05:06,777 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {144608#(<= ~counter~0 5)} {144608#(<= ~counter~0 5)} #94#return; {144608#(<= ~counter~0 5)} is VALID [2022-04-28 06:05:06,778 INFO L290 TraceCheckUtils]: 56: Hoare triple {144608#(<= ~counter~0 5)} assume !!(0 != ~r~0); {144608#(<= ~counter~0 5)} is VALID [2022-04-28 06:05:06,779 INFO L290 TraceCheckUtils]: 57: Hoare triple {144608#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {144633#(<= ~counter~0 6)} is VALID [2022-04-28 06:05:06,779 INFO L290 TraceCheckUtils]: 58: Hoare triple {144633#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {144633#(<= ~counter~0 6)} is VALID [2022-04-28 06:05:06,780 INFO L272 TraceCheckUtils]: 59: Hoare triple {144633#(<= ~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)); {144633#(<= ~counter~0 6)} is VALID [2022-04-28 06:05:06,780 INFO L290 TraceCheckUtils]: 60: Hoare triple {144633#(<= ~counter~0 6)} ~cond := #in~cond; {144633#(<= ~counter~0 6)} is VALID [2022-04-28 06:05:06,780 INFO L290 TraceCheckUtils]: 61: Hoare triple {144633#(<= ~counter~0 6)} assume !(0 == ~cond); {144633#(<= ~counter~0 6)} is VALID [2022-04-28 06:05:06,780 INFO L290 TraceCheckUtils]: 62: Hoare triple {144633#(<= ~counter~0 6)} assume true; {144633#(<= ~counter~0 6)} is VALID [2022-04-28 06:05:06,781 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {144633#(<= ~counter~0 6)} {144633#(<= ~counter~0 6)} #96#return; {144633#(<= ~counter~0 6)} is VALID [2022-04-28 06:05:06,781 INFO L290 TraceCheckUtils]: 64: Hoare triple {144633#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {144633#(<= ~counter~0 6)} is VALID [2022-04-28 06:05:06,782 INFO L290 TraceCheckUtils]: 65: Hoare triple {144633#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {144658#(<= ~counter~0 7)} is VALID [2022-04-28 06:05:06,783 INFO L290 TraceCheckUtils]: 66: Hoare triple {144658#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {144658#(<= ~counter~0 7)} is VALID [2022-04-28 06:05:06,783 INFO L272 TraceCheckUtils]: 67: Hoare triple {144658#(<= ~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)); {144658#(<= ~counter~0 7)} is VALID [2022-04-28 06:05:06,783 INFO L290 TraceCheckUtils]: 68: Hoare triple {144658#(<= ~counter~0 7)} ~cond := #in~cond; {144658#(<= ~counter~0 7)} is VALID [2022-04-28 06:05:06,784 INFO L290 TraceCheckUtils]: 69: Hoare triple {144658#(<= ~counter~0 7)} assume !(0 == ~cond); {144658#(<= ~counter~0 7)} is VALID [2022-04-28 06:05:06,784 INFO L290 TraceCheckUtils]: 70: Hoare triple {144658#(<= ~counter~0 7)} assume true; {144658#(<= ~counter~0 7)} is VALID [2022-04-28 06:05:06,784 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {144658#(<= ~counter~0 7)} {144658#(<= ~counter~0 7)} #96#return; {144658#(<= ~counter~0 7)} is VALID [2022-04-28 06:05:06,784 INFO L290 TraceCheckUtils]: 72: Hoare triple {144658#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {144658#(<= ~counter~0 7)} is VALID [2022-04-28 06:05:06,786 INFO L290 TraceCheckUtils]: 73: Hoare triple {144658#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {144683#(<= ~counter~0 8)} is VALID [2022-04-28 06:05:06,786 INFO L290 TraceCheckUtils]: 74: Hoare triple {144683#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {144683#(<= ~counter~0 8)} is VALID [2022-04-28 06:05:06,786 INFO L272 TraceCheckUtils]: 75: Hoare triple {144683#(<= ~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)); {144683#(<= ~counter~0 8)} is VALID [2022-04-28 06:05:06,787 INFO L290 TraceCheckUtils]: 76: Hoare triple {144683#(<= ~counter~0 8)} ~cond := #in~cond; {144683#(<= ~counter~0 8)} is VALID [2022-04-28 06:05:06,787 INFO L290 TraceCheckUtils]: 77: Hoare triple {144683#(<= ~counter~0 8)} assume !(0 == ~cond); {144683#(<= ~counter~0 8)} is VALID [2022-04-28 06:05:06,787 INFO L290 TraceCheckUtils]: 78: Hoare triple {144683#(<= ~counter~0 8)} assume true; {144683#(<= ~counter~0 8)} is VALID [2022-04-28 06:05:06,788 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {144683#(<= ~counter~0 8)} {144683#(<= ~counter~0 8)} #96#return; {144683#(<= ~counter~0 8)} is VALID [2022-04-28 06:05:06,788 INFO L290 TraceCheckUtils]: 80: Hoare triple {144683#(<= ~counter~0 8)} assume !(~r~0 > 0); {144683#(<= ~counter~0 8)} is VALID [2022-04-28 06:05:06,789 INFO L290 TraceCheckUtils]: 81: Hoare triple {144683#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {144708#(<= ~counter~0 9)} is VALID [2022-04-28 06:05:06,789 INFO L290 TraceCheckUtils]: 82: Hoare triple {144708#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {144708#(<= ~counter~0 9)} is VALID [2022-04-28 06:05:06,790 INFO L272 TraceCheckUtils]: 83: Hoare triple {144708#(<= ~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)); {144708#(<= ~counter~0 9)} is VALID [2022-04-28 06:05:06,790 INFO L290 TraceCheckUtils]: 84: Hoare triple {144708#(<= ~counter~0 9)} ~cond := #in~cond; {144708#(<= ~counter~0 9)} is VALID [2022-04-28 06:05:06,790 INFO L290 TraceCheckUtils]: 85: Hoare triple {144708#(<= ~counter~0 9)} assume !(0 == ~cond); {144708#(<= ~counter~0 9)} is VALID [2022-04-28 06:05:06,791 INFO L290 TraceCheckUtils]: 86: Hoare triple {144708#(<= ~counter~0 9)} assume true; {144708#(<= ~counter~0 9)} is VALID [2022-04-28 06:05:06,791 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {144708#(<= ~counter~0 9)} {144708#(<= ~counter~0 9)} #98#return; {144708#(<= ~counter~0 9)} is VALID [2022-04-28 06:05:06,791 INFO L290 TraceCheckUtils]: 88: Hoare triple {144708#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {144708#(<= ~counter~0 9)} is VALID [2022-04-28 06:05:06,792 INFO L290 TraceCheckUtils]: 89: Hoare triple {144708#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {144733#(<= ~counter~0 10)} is VALID [2022-04-28 06:05:06,793 INFO L290 TraceCheckUtils]: 90: Hoare triple {144733#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {144733#(<= ~counter~0 10)} is VALID [2022-04-28 06:05:06,793 INFO L272 TraceCheckUtils]: 91: Hoare triple {144733#(<= ~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)); {144733#(<= ~counter~0 10)} is VALID [2022-04-28 06:05:06,793 INFO L290 TraceCheckUtils]: 92: Hoare triple {144733#(<= ~counter~0 10)} ~cond := #in~cond; {144733#(<= ~counter~0 10)} is VALID [2022-04-28 06:05:06,794 INFO L290 TraceCheckUtils]: 93: Hoare triple {144733#(<= ~counter~0 10)} assume !(0 == ~cond); {144733#(<= ~counter~0 10)} is VALID [2022-04-28 06:05:06,794 INFO L290 TraceCheckUtils]: 94: Hoare triple {144733#(<= ~counter~0 10)} assume true; {144733#(<= ~counter~0 10)} is VALID [2022-04-28 06:05:06,794 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {144733#(<= ~counter~0 10)} {144733#(<= ~counter~0 10)} #98#return; {144733#(<= ~counter~0 10)} is VALID [2022-04-28 06:05:06,795 INFO L290 TraceCheckUtils]: 96: Hoare triple {144733#(<= ~counter~0 10)} assume !(~r~0 < 0); {144733#(<= ~counter~0 10)} is VALID [2022-04-28 06:05:06,796 INFO L290 TraceCheckUtils]: 97: Hoare triple {144733#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {144758#(<= ~counter~0 11)} is VALID [2022-04-28 06:05:06,796 INFO L290 TraceCheckUtils]: 98: Hoare triple {144758#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {144758#(<= ~counter~0 11)} is VALID [2022-04-28 06:05:06,797 INFO L272 TraceCheckUtils]: 99: Hoare triple {144758#(<= ~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)); {144758#(<= ~counter~0 11)} is VALID [2022-04-28 06:05:06,797 INFO L290 TraceCheckUtils]: 100: Hoare triple {144758#(<= ~counter~0 11)} ~cond := #in~cond; {144758#(<= ~counter~0 11)} is VALID [2022-04-28 06:05:06,797 INFO L290 TraceCheckUtils]: 101: Hoare triple {144758#(<= ~counter~0 11)} assume !(0 == ~cond); {144758#(<= ~counter~0 11)} is VALID [2022-04-28 06:05:06,797 INFO L290 TraceCheckUtils]: 102: Hoare triple {144758#(<= ~counter~0 11)} assume true; {144758#(<= ~counter~0 11)} is VALID [2022-04-28 06:05:06,798 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {144758#(<= ~counter~0 11)} {144758#(<= ~counter~0 11)} #94#return; {144758#(<= ~counter~0 11)} is VALID [2022-04-28 06:05:06,798 INFO L290 TraceCheckUtils]: 104: Hoare triple {144758#(<= ~counter~0 11)} assume !!(0 != ~r~0); {144758#(<= ~counter~0 11)} is VALID [2022-04-28 06:05:06,799 INFO L290 TraceCheckUtils]: 105: Hoare triple {144758#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {144783#(<= ~counter~0 12)} is VALID [2022-04-28 06:05:06,800 INFO L290 TraceCheckUtils]: 106: Hoare triple {144783#(<= ~counter~0 12)} assume !!(#t~post7 < 100);havoc #t~post7; {144783#(<= ~counter~0 12)} is VALID [2022-04-28 06:05:06,800 INFO L272 TraceCheckUtils]: 107: Hoare triple {144783#(<= ~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)); {144783#(<= ~counter~0 12)} is VALID [2022-04-28 06:05:06,800 INFO L290 TraceCheckUtils]: 108: Hoare triple {144783#(<= ~counter~0 12)} ~cond := #in~cond; {144783#(<= ~counter~0 12)} is VALID [2022-04-28 06:05:06,801 INFO L290 TraceCheckUtils]: 109: Hoare triple {144783#(<= ~counter~0 12)} assume !(0 == ~cond); {144783#(<= ~counter~0 12)} is VALID [2022-04-28 06:05:06,801 INFO L290 TraceCheckUtils]: 110: Hoare triple {144783#(<= ~counter~0 12)} assume true; {144783#(<= ~counter~0 12)} is VALID [2022-04-28 06:05:06,801 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {144783#(<= ~counter~0 12)} {144783#(<= ~counter~0 12)} #96#return; {144783#(<= ~counter~0 12)} is VALID [2022-04-28 06:05:06,802 INFO L290 TraceCheckUtils]: 112: Hoare triple {144783#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {144783#(<= ~counter~0 12)} is VALID [2022-04-28 06:05:06,803 INFO L290 TraceCheckUtils]: 113: Hoare triple {144783#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {144808#(<= ~counter~0 13)} is VALID [2022-04-28 06:05:06,803 INFO L290 TraceCheckUtils]: 114: Hoare triple {144808#(<= ~counter~0 13)} assume !!(#t~post7 < 100);havoc #t~post7; {144808#(<= ~counter~0 13)} is VALID [2022-04-28 06:05:06,804 INFO L272 TraceCheckUtils]: 115: Hoare triple {144808#(<= ~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)); {144808#(<= ~counter~0 13)} is VALID [2022-04-28 06:05:06,804 INFO L290 TraceCheckUtils]: 116: Hoare triple {144808#(<= ~counter~0 13)} ~cond := #in~cond; {144808#(<= ~counter~0 13)} is VALID [2022-04-28 06:05:06,804 INFO L290 TraceCheckUtils]: 117: Hoare triple {144808#(<= ~counter~0 13)} assume !(0 == ~cond); {144808#(<= ~counter~0 13)} is VALID [2022-04-28 06:05:06,804 INFO L290 TraceCheckUtils]: 118: Hoare triple {144808#(<= ~counter~0 13)} assume true; {144808#(<= ~counter~0 13)} is VALID [2022-04-28 06:05:06,805 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {144808#(<= ~counter~0 13)} {144808#(<= ~counter~0 13)} #96#return; {144808#(<= ~counter~0 13)} is VALID [2022-04-28 06:05:06,805 INFO L290 TraceCheckUtils]: 120: Hoare triple {144808#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {144808#(<= ~counter~0 13)} is VALID [2022-04-28 06:05:06,806 INFO L290 TraceCheckUtils]: 121: Hoare triple {144808#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {144833#(<= ~counter~0 14)} is VALID [2022-04-28 06:05:06,806 INFO L290 TraceCheckUtils]: 122: Hoare triple {144833#(<= ~counter~0 14)} assume !!(#t~post7 < 100);havoc #t~post7; {144833#(<= ~counter~0 14)} is VALID [2022-04-28 06:05:06,807 INFO L272 TraceCheckUtils]: 123: Hoare triple {144833#(<= ~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)); {144833#(<= ~counter~0 14)} is VALID [2022-04-28 06:05:06,807 INFO L290 TraceCheckUtils]: 124: Hoare triple {144833#(<= ~counter~0 14)} ~cond := #in~cond; {144833#(<= ~counter~0 14)} is VALID [2022-04-28 06:05:06,807 INFO L290 TraceCheckUtils]: 125: Hoare triple {144833#(<= ~counter~0 14)} assume !(0 == ~cond); {144833#(<= ~counter~0 14)} is VALID [2022-04-28 06:05:06,808 INFO L290 TraceCheckUtils]: 126: Hoare triple {144833#(<= ~counter~0 14)} assume true; {144833#(<= ~counter~0 14)} is VALID [2022-04-28 06:05:06,808 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {144833#(<= ~counter~0 14)} {144833#(<= ~counter~0 14)} #96#return; {144833#(<= ~counter~0 14)} is VALID [2022-04-28 06:05:06,808 INFO L290 TraceCheckUtils]: 128: Hoare triple {144833#(<= ~counter~0 14)} assume !(~r~0 > 0); {144833#(<= ~counter~0 14)} is VALID [2022-04-28 06:05:06,810 INFO L290 TraceCheckUtils]: 129: Hoare triple {144833#(<= ~counter~0 14)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {144858#(<= ~counter~0 15)} is VALID [2022-04-28 06:05:06,810 INFO L290 TraceCheckUtils]: 130: Hoare triple {144858#(<= ~counter~0 15)} assume !!(#t~post8 < 100);havoc #t~post8; {144858#(<= ~counter~0 15)} is VALID [2022-04-28 06:05:06,810 INFO L272 TraceCheckUtils]: 131: Hoare triple {144858#(<= ~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)); {144858#(<= ~counter~0 15)} is VALID [2022-04-28 06:05:06,811 INFO L290 TraceCheckUtils]: 132: Hoare triple {144858#(<= ~counter~0 15)} ~cond := #in~cond; {144858#(<= ~counter~0 15)} is VALID [2022-04-28 06:05:06,811 INFO L290 TraceCheckUtils]: 133: Hoare triple {144858#(<= ~counter~0 15)} assume !(0 == ~cond); {144858#(<= ~counter~0 15)} is VALID [2022-04-28 06:05:06,811 INFO L290 TraceCheckUtils]: 134: Hoare triple {144858#(<= ~counter~0 15)} assume true; {144858#(<= ~counter~0 15)} is VALID [2022-04-28 06:05:06,812 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {144858#(<= ~counter~0 15)} {144858#(<= ~counter~0 15)} #98#return; {144858#(<= ~counter~0 15)} is VALID [2022-04-28 06:05:06,812 INFO L290 TraceCheckUtils]: 136: Hoare triple {144858#(<= ~counter~0 15)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {144858#(<= ~counter~0 15)} is VALID [2022-04-28 06:05:06,813 INFO L290 TraceCheckUtils]: 137: Hoare triple {144858#(<= ~counter~0 15)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {144883#(<= ~counter~0 16)} is VALID [2022-04-28 06:05:06,813 INFO L290 TraceCheckUtils]: 138: Hoare triple {144883#(<= ~counter~0 16)} assume !!(#t~post8 < 100);havoc #t~post8; {144883#(<= ~counter~0 16)} is VALID [2022-04-28 06:05:06,814 INFO L272 TraceCheckUtils]: 139: Hoare triple {144883#(<= ~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)); {144883#(<= ~counter~0 16)} is VALID [2022-04-28 06:05:06,814 INFO L290 TraceCheckUtils]: 140: Hoare triple {144883#(<= ~counter~0 16)} ~cond := #in~cond; {144883#(<= ~counter~0 16)} is VALID [2022-04-28 06:05:06,814 INFO L290 TraceCheckUtils]: 141: Hoare triple {144883#(<= ~counter~0 16)} assume !(0 == ~cond); {144883#(<= ~counter~0 16)} is VALID [2022-04-28 06:05:06,815 INFO L290 TraceCheckUtils]: 142: Hoare triple {144883#(<= ~counter~0 16)} assume true; {144883#(<= ~counter~0 16)} is VALID [2022-04-28 06:05:06,815 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {144883#(<= ~counter~0 16)} {144883#(<= ~counter~0 16)} #98#return; {144883#(<= ~counter~0 16)} is VALID [2022-04-28 06:05:06,815 INFO L290 TraceCheckUtils]: 144: Hoare triple {144883#(<= ~counter~0 16)} assume !(~r~0 < 0); {144883#(<= ~counter~0 16)} is VALID [2022-04-28 06:05:06,816 INFO L290 TraceCheckUtils]: 145: Hoare triple {144883#(<= ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {144908#(<= |main_#t~post6| 16)} is VALID [2022-04-28 06:05:06,816 INFO L290 TraceCheckUtils]: 146: Hoare triple {144908#(<= |main_#t~post6| 16)} assume !(#t~post6 < 100);havoc #t~post6; {144452#false} is VALID [2022-04-28 06:05:06,816 INFO L272 TraceCheckUtils]: 147: Hoare triple {144452#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)); {144452#false} is VALID [2022-04-28 06:05:06,816 INFO L290 TraceCheckUtils]: 148: Hoare triple {144452#false} ~cond := #in~cond; {144452#false} is VALID [2022-04-28 06:05:06,816 INFO L290 TraceCheckUtils]: 149: Hoare triple {144452#false} assume 0 == ~cond; {144452#false} is VALID [2022-04-28 06:05:06,816 INFO L290 TraceCheckUtils]: 150: Hoare triple {144452#false} assume !false; {144452#false} is VALID [2022-04-28 06:05:06,817 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 32 proven. 642 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 06:05:06,817 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:05:07,941 INFO L290 TraceCheckUtils]: 150: Hoare triple {144452#false} assume !false; {144452#false} is VALID [2022-04-28 06:05:07,941 INFO L290 TraceCheckUtils]: 149: Hoare triple {144452#false} assume 0 == ~cond; {144452#false} is VALID [2022-04-28 06:05:07,941 INFO L290 TraceCheckUtils]: 148: Hoare triple {144452#false} ~cond := #in~cond; {144452#false} is VALID [2022-04-28 06:05:07,941 INFO L272 TraceCheckUtils]: 147: Hoare triple {144452#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)); {144452#false} is VALID [2022-04-28 06:05:07,942 INFO L290 TraceCheckUtils]: 146: Hoare triple {144936#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {144452#false} is VALID [2022-04-28 06:05:07,942 INFO L290 TraceCheckUtils]: 145: Hoare triple {144940#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {144936#(< |main_#t~post6| 100)} is VALID [2022-04-28 06:05:07,942 INFO L290 TraceCheckUtils]: 144: Hoare triple {144940#(< ~counter~0 100)} assume !(~r~0 < 0); {144940#(< ~counter~0 100)} is VALID [2022-04-28 06:05:07,943 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {144451#true} {144940#(< ~counter~0 100)} #98#return; {144940#(< ~counter~0 100)} is VALID [2022-04-28 06:05:07,943 INFO L290 TraceCheckUtils]: 142: Hoare triple {144451#true} assume true; {144451#true} is VALID [2022-04-28 06:05:07,943 INFO L290 TraceCheckUtils]: 141: Hoare triple {144451#true} assume !(0 == ~cond); {144451#true} is VALID [2022-04-28 06:05:07,943 INFO L290 TraceCheckUtils]: 140: Hoare triple {144451#true} ~cond := #in~cond; {144451#true} is VALID [2022-04-28 06:05:07,943 INFO L272 TraceCheckUtils]: 139: Hoare triple {144940#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144451#true} is VALID [2022-04-28 06:05:07,943 INFO L290 TraceCheckUtils]: 138: Hoare triple {144940#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {144940#(< ~counter~0 100)} is VALID [2022-04-28 06:05:07,946 INFO L290 TraceCheckUtils]: 137: Hoare triple {144965#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {144940#(< ~counter~0 100)} is VALID [2022-04-28 06:05:07,947 INFO L290 TraceCheckUtils]: 136: Hoare triple {144965#(< ~counter~0 99)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {144965#(< ~counter~0 99)} is VALID [2022-04-28 06:05:07,947 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {144451#true} {144965#(< ~counter~0 99)} #98#return; {144965#(< ~counter~0 99)} is VALID [2022-04-28 06:05:07,947 INFO L290 TraceCheckUtils]: 134: Hoare triple {144451#true} assume true; {144451#true} is VALID [2022-04-28 06:05:07,948 INFO L290 TraceCheckUtils]: 133: Hoare triple {144451#true} assume !(0 == ~cond); {144451#true} is VALID [2022-04-28 06:05:07,948 INFO L290 TraceCheckUtils]: 132: Hoare triple {144451#true} ~cond := #in~cond; {144451#true} is VALID [2022-04-28 06:05:07,948 INFO L272 TraceCheckUtils]: 131: Hoare triple {144965#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144451#true} is VALID [2022-04-28 06:05:07,948 INFO L290 TraceCheckUtils]: 130: Hoare triple {144965#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {144965#(< ~counter~0 99)} is VALID [2022-04-28 06:05:07,951 INFO L290 TraceCheckUtils]: 129: Hoare triple {144990#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {144965#(< ~counter~0 99)} is VALID [2022-04-28 06:05:07,952 INFO L290 TraceCheckUtils]: 128: Hoare triple {144990#(< ~counter~0 98)} assume !(~r~0 > 0); {144990#(< ~counter~0 98)} is VALID [2022-04-28 06:05:07,952 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {144451#true} {144990#(< ~counter~0 98)} #96#return; {144990#(< ~counter~0 98)} is VALID [2022-04-28 06:05:07,952 INFO L290 TraceCheckUtils]: 126: Hoare triple {144451#true} assume true; {144451#true} is VALID [2022-04-28 06:05:07,952 INFO L290 TraceCheckUtils]: 125: Hoare triple {144451#true} assume !(0 == ~cond); {144451#true} is VALID [2022-04-28 06:05:07,952 INFO L290 TraceCheckUtils]: 124: Hoare triple {144451#true} ~cond := #in~cond; {144451#true} is VALID [2022-04-28 06:05:07,953 INFO L272 TraceCheckUtils]: 123: Hoare triple {144990#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144451#true} is VALID [2022-04-28 06:05:07,953 INFO L290 TraceCheckUtils]: 122: Hoare triple {144990#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {144990#(< ~counter~0 98)} is VALID [2022-04-28 06:05:07,954 INFO L290 TraceCheckUtils]: 121: Hoare triple {145015#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {144990#(< ~counter~0 98)} is VALID [2022-04-28 06:05:07,955 INFO L290 TraceCheckUtils]: 120: Hoare triple {145015#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {145015#(< ~counter~0 97)} is VALID [2022-04-28 06:05:07,955 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {144451#true} {145015#(< ~counter~0 97)} #96#return; {145015#(< ~counter~0 97)} is VALID [2022-04-28 06:05:07,955 INFO L290 TraceCheckUtils]: 118: Hoare triple {144451#true} assume true; {144451#true} is VALID [2022-04-28 06:05:07,956 INFO L290 TraceCheckUtils]: 117: Hoare triple {144451#true} assume !(0 == ~cond); {144451#true} is VALID [2022-04-28 06:05:07,956 INFO L290 TraceCheckUtils]: 116: Hoare triple {144451#true} ~cond := #in~cond; {144451#true} is VALID [2022-04-28 06:05:07,956 INFO L272 TraceCheckUtils]: 115: Hoare triple {145015#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144451#true} is VALID [2022-04-28 06:05:07,956 INFO L290 TraceCheckUtils]: 114: Hoare triple {145015#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {145015#(< ~counter~0 97)} is VALID [2022-04-28 06:05:07,958 INFO L290 TraceCheckUtils]: 113: Hoare triple {145040#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {145015#(< ~counter~0 97)} is VALID [2022-04-28 06:05:07,958 INFO L290 TraceCheckUtils]: 112: Hoare triple {145040#(< ~counter~0 96)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {145040#(< ~counter~0 96)} is VALID [2022-04-28 06:05:07,959 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {144451#true} {145040#(< ~counter~0 96)} #96#return; {145040#(< ~counter~0 96)} is VALID [2022-04-28 06:05:07,959 INFO L290 TraceCheckUtils]: 110: Hoare triple {144451#true} assume true; {144451#true} is VALID [2022-04-28 06:05:07,959 INFO L290 TraceCheckUtils]: 109: Hoare triple {144451#true} assume !(0 == ~cond); {144451#true} is VALID [2022-04-28 06:05:07,959 INFO L290 TraceCheckUtils]: 108: Hoare triple {144451#true} ~cond := #in~cond; {144451#true} is VALID [2022-04-28 06:05:07,959 INFO L272 TraceCheckUtils]: 107: Hoare triple {145040#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144451#true} is VALID [2022-04-28 06:05:07,959 INFO L290 TraceCheckUtils]: 106: Hoare triple {145040#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {145040#(< ~counter~0 96)} is VALID [2022-04-28 06:05:07,961 INFO L290 TraceCheckUtils]: 105: Hoare triple {145065#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {145040#(< ~counter~0 96)} is VALID [2022-04-28 06:05:07,961 INFO L290 TraceCheckUtils]: 104: Hoare triple {145065#(< ~counter~0 95)} assume !!(0 != ~r~0); {145065#(< ~counter~0 95)} is VALID [2022-04-28 06:05:07,961 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {144451#true} {145065#(< ~counter~0 95)} #94#return; {145065#(< ~counter~0 95)} is VALID [2022-04-28 06:05:07,962 INFO L290 TraceCheckUtils]: 102: Hoare triple {144451#true} assume true; {144451#true} is VALID [2022-04-28 06:05:07,962 INFO L290 TraceCheckUtils]: 101: Hoare triple {144451#true} assume !(0 == ~cond); {144451#true} is VALID [2022-04-28 06:05:07,962 INFO L290 TraceCheckUtils]: 100: Hoare triple {144451#true} ~cond := #in~cond; {144451#true} is VALID [2022-04-28 06:05:07,962 INFO L272 TraceCheckUtils]: 99: Hoare triple {145065#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144451#true} is VALID [2022-04-28 06:05:07,962 INFO L290 TraceCheckUtils]: 98: Hoare triple {145065#(< ~counter~0 95)} assume !!(#t~post6 < 100);havoc #t~post6; {145065#(< ~counter~0 95)} is VALID [2022-04-28 06:05:07,963 INFO L290 TraceCheckUtils]: 97: Hoare triple {145090#(< ~counter~0 94)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {145065#(< ~counter~0 95)} is VALID [2022-04-28 06:05:07,964 INFO L290 TraceCheckUtils]: 96: Hoare triple {145090#(< ~counter~0 94)} assume !(~r~0 < 0); {145090#(< ~counter~0 94)} is VALID [2022-04-28 06:05:07,964 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {144451#true} {145090#(< ~counter~0 94)} #98#return; {145090#(< ~counter~0 94)} is VALID [2022-04-28 06:05:07,964 INFO L290 TraceCheckUtils]: 94: Hoare triple {144451#true} assume true; {144451#true} is VALID [2022-04-28 06:05:07,964 INFO L290 TraceCheckUtils]: 93: Hoare triple {144451#true} assume !(0 == ~cond); {144451#true} is VALID [2022-04-28 06:05:07,964 INFO L290 TraceCheckUtils]: 92: Hoare triple {144451#true} ~cond := #in~cond; {144451#true} is VALID [2022-04-28 06:05:07,964 INFO L272 TraceCheckUtils]: 91: Hoare triple {145090#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144451#true} is VALID [2022-04-28 06:05:07,965 INFO L290 TraceCheckUtils]: 90: Hoare triple {145090#(< ~counter~0 94)} assume !!(#t~post8 < 100);havoc #t~post8; {145090#(< ~counter~0 94)} is VALID [2022-04-28 06:05:07,966 INFO L290 TraceCheckUtils]: 89: Hoare triple {145115#(< ~counter~0 93)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {145090#(< ~counter~0 94)} is VALID [2022-04-28 06:05:07,966 INFO L290 TraceCheckUtils]: 88: Hoare triple {145115#(< ~counter~0 93)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {145115#(< ~counter~0 93)} is VALID [2022-04-28 06:05:07,967 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {144451#true} {145115#(< ~counter~0 93)} #98#return; {145115#(< ~counter~0 93)} is VALID [2022-04-28 06:05:07,967 INFO L290 TraceCheckUtils]: 86: Hoare triple {144451#true} assume true; {144451#true} is VALID [2022-04-28 06:05:07,967 INFO L290 TraceCheckUtils]: 85: Hoare triple {144451#true} assume !(0 == ~cond); {144451#true} is VALID [2022-04-28 06:05:07,967 INFO L290 TraceCheckUtils]: 84: Hoare triple {144451#true} ~cond := #in~cond; {144451#true} is VALID [2022-04-28 06:05:07,967 INFO L272 TraceCheckUtils]: 83: Hoare triple {145115#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144451#true} is VALID [2022-04-28 06:05:07,967 INFO L290 TraceCheckUtils]: 82: Hoare triple {145115#(< ~counter~0 93)} assume !!(#t~post8 < 100);havoc #t~post8; {145115#(< ~counter~0 93)} is VALID [2022-04-28 06:05:07,969 INFO L290 TraceCheckUtils]: 81: Hoare triple {145140#(< ~counter~0 92)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {145115#(< ~counter~0 93)} is VALID [2022-04-28 06:05:07,969 INFO L290 TraceCheckUtils]: 80: Hoare triple {145140#(< ~counter~0 92)} assume !(~r~0 > 0); {145140#(< ~counter~0 92)} is VALID [2022-04-28 06:05:07,969 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {144451#true} {145140#(< ~counter~0 92)} #96#return; {145140#(< ~counter~0 92)} is VALID [2022-04-28 06:05:07,969 INFO L290 TraceCheckUtils]: 78: Hoare triple {144451#true} assume true; {144451#true} is VALID [2022-04-28 06:05:07,969 INFO L290 TraceCheckUtils]: 77: Hoare triple {144451#true} assume !(0 == ~cond); {144451#true} is VALID [2022-04-28 06:05:07,969 INFO L290 TraceCheckUtils]: 76: Hoare triple {144451#true} ~cond := #in~cond; {144451#true} is VALID [2022-04-28 06:05:07,970 INFO L272 TraceCheckUtils]: 75: Hoare triple {145140#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144451#true} is VALID [2022-04-28 06:05:07,970 INFO L290 TraceCheckUtils]: 74: Hoare triple {145140#(< ~counter~0 92)} assume !!(#t~post7 < 100);havoc #t~post7; {145140#(< ~counter~0 92)} is VALID [2022-04-28 06:05:07,971 INFO L290 TraceCheckUtils]: 73: Hoare triple {145165#(< ~counter~0 91)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {145140#(< ~counter~0 92)} is VALID [2022-04-28 06:05:07,971 INFO L290 TraceCheckUtils]: 72: Hoare triple {145165#(< ~counter~0 91)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {145165#(< ~counter~0 91)} is VALID [2022-04-28 06:05:07,972 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {144451#true} {145165#(< ~counter~0 91)} #96#return; {145165#(< ~counter~0 91)} is VALID [2022-04-28 06:05:07,972 INFO L290 TraceCheckUtils]: 70: Hoare triple {144451#true} assume true; {144451#true} is VALID [2022-04-28 06:05:07,972 INFO L290 TraceCheckUtils]: 69: Hoare triple {144451#true} assume !(0 == ~cond); {144451#true} is VALID [2022-04-28 06:05:07,972 INFO L290 TraceCheckUtils]: 68: Hoare triple {144451#true} ~cond := #in~cond; {144451#true} is VALID [2022-04-28 06:05:07,972 INFO L272 TraceCheckUtils]: 67: Hoare triple {145165#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144451#true} is VALID [2022-04-28 06:05:07,972 INFO L290 TraceCheckUtils]: 66: Hoare triple {145165#(< ~counter~0 91)} assume !!(#t~post7 < 100);havoc #t~post7; {145165#(< ~counter~0 91)} is VALID [2022-04-28 06:05:07,974 INFO L290 TraceCheckUtils]: 65: Hoare triple {145190#(< ~counter~0 90)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {145165#(< ~counter~0 91)} is VALID [2022-04-28 06:05:07,974 INFO L290 TraceCheckUtils]: 64: Hoare triple {145190#(< ~counter~0 90)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {145190#(< ~counter~0 90)} is VALID [2022-04-28 06:05:07,974 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {144451#true} {145190#(< ~counter~0 90)} #96#return; {145190#(< ~counter~0 90)} is VALID [2022-04-28 06:05:07,975 INFO L290 TraceCheckUtils]: 62: Hoare triple {144451#true} assume true; {144451#true} is VALID [2022-04-28 06:05:07,975 INFO L290 TraceCheckUtils]: 61: Hoare triple {144451#true} assume !(0 == ~cond); {144451#true} is VALID [2022-04-28 06:05:07,975 INFO L290 TraceCheckUtils]: 60: Hoare triple {144451#true} ~cond := #in~cond; {144451#true} is VALID [2022-04-28 06:05:07,975 INFO L272 TraceCheckUtils]: 59: Hoare triple {145190#(< ~counter~0 90)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144451#true} is VALID [2022-04-28 06:05:07,975 INFO L290 TraceCheckUtils]: 58: Hoare triple {145190#(< ~counter~0 90)} assume !!(#t~post7 < 100);havoc #t~post7; {145190#(< ~counter~0 90)} is VALID [2022-04-28 06:05:07,976 INFO L290 TraceCheckUtils]: 57: Hoare triple {145215#(< ~counter~0 89)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {145190#(< ~counter~0 90)} is VALID [2022-04-28 06:05:07,977 INFO L290 TraceCheckUtils]: 56: Hoare triple {145215#(< ~counter~0 89)} assume !!(0 != ~r~0); {145215#(< ~counter~0 89)} is VALID [2022-04-28 06:05:07,977 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {144451#true} {145215#(< ~counter~0 89)} #94#return; {145215#(< ~counter~0 89)} is VALID [2022-04-28 06:05:07,977 INFO L290 TraceCheckUtils]: 54: Hoare triple {144451#true} assume true; {144451#true} is VALID [2022-04-28 06:05:07,977 INFO L290 TraceCheckUtils]: 53: Hoare triple {144451#true} assume !(0 == ~cond); {144451#true} is VALID [2022-04-28 06:05:07,977 INFO L290 TraceCheckUtils]: 52: Hoare triple {144451#true} ~cond := #in~cond; {144451#true} is VALID [2022-04-28 06:05:07,977 INFO L272 TraceCheckUtils]: 51: Hoare triple {145215#(< ~counter~0 89)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144451#true} is VALID [2022-04-28 06:05:07,978 INFO L290 TraceCheckUtils]: 50: Hoare triple {145215#(< ~counter~0 89)} assume !!(#t~post6 < 100);havoc #t~post6; {145215#(< ~counter~0 89)} is VALID [2022-04-28 06:05:07,979 INFO L290 TraceCheckUtils]: 49: Hoare triple {145240#(< ~counter~0 88)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {145215#(< ~counter~0 89)} is VALID [2022-04-28 06:05:07,979 INFO L290 TraceCheckUtils]: 48: Hoare triple {145240#(< ~counter~0 88)} assume !(~r~0 < 0); {145240#(< ~counter~0 88)} is VALID [2022-04-28 06:05:07,980 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {144451#true} {145240#(< ~counter~0 88)} #98#return; {145240#(< ~counter~0 88)} is VALID [2022-04-28 06:05:07,980 INFO L290 TraceCheckUtils]: 46: Hoare triple {144451#true} assume true; {144451#true} is VALID [2022-04-28 06:05:07,980 INFO L290 TraceCheckUtils]: 45: Hoare triple {144451#true} assume !(0 == ~cond); {144451#true} is VALID [2022-04-28 06:05:07,980 INFO L290 TraceCheckUtils]: 44: Hoare triple {144451#true} ~cond := #in~cond; {144451#true} is VALID [2022-04-28 06:05:07,980 INFO L272 TraceCheckUtils]: 43: Hoare triple {145240#(< ~counter~0 88)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144451#true} is VALID [2022-04-28 06:05:07,980 INFO L290 TraceCheckUtils]: 42: Hoare triple {145240#(< ~counter~0 88)} assume !!(#t~post8 < 100);havoc #t~post8; {145240#(< ~counter~0 88)} is VALID [2022-04-28 06:05:07,982 INFO L290 TraceCheckUtils]: 41: Hoare triple {145265#(< ~counter~0 87)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {145240#(< ~counter~0 88)} is VALID [2022-04-28 06:05:07,982 INFO L290 TraceCheckUtils]: 40: Hoare triple {145265#(< ~counter~0 87)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {145265#(< ~counter~0 87)} is VALID [2022-04-28 06:05:07,983 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {144451#true} {145265#(< ~counter~0 87)} #98#return; {145265#(< ~counter~0 87)} is VALID [2022-04-28 06:05:07,983 INFO L290 TraceCheckUtils]: 38: Hoare triple {144451#true} assume true; {144451#true} is VALID [2022-04-28 06:05:07,983 INFO L290 TraceCheckUtils]: 37: Hoare triple {144451#true} assume !(0 == ~cond); {144451#true} is VALID [2022-04-28 06:05:07,983 INFO L290 TraceCheckUtils]: 36: Hoare triple {144451#true} ~cond := #in~cond; {144451#true} is VALID [2022-04-28 06:05:07,983 INFO L272 TraceCheckUtils]: 35: Hoare triple {145265#(< ~counter~0 87)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144451#true} is VALID [2022-04-28 06:05:07,983 INFO L290 TraceCheckUtils]: 34: Hoare triple {145265#(< ~counter~0 87)} assume !!(#t~post8 < 100);havoc #t~post8; {145265#(< ~counter~0 87)} is VALID [2022-04-28 06:05:07,985 INFO L290 TraceCheckUtils]: 33: Hoare triple {145290#(< ~counter~0 86)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {145265#(< ~counter~0 87)} is VALID [2022-04-28 06:05:07,985 INFO L290 TraceCheckUtils]: 32: Hoare triple {145290#(< ~counter~0 86)} assume !(~r~0 > 0); {145290#(< ~counter~0 86)} is VALID [2022-04-28 06:05:07,985 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {144451#true} {145290#(< ~counter~0 86)} #96#return; {145290#(< ~counter~0 86)} is VALID [2022-04-28 06:05:07,986 INFO L290 TraceCheckUtils]: 30: Hoare triple {144451#true} assume true; {144451#true} is VALID [2022-04-28 06:05:07,986 INFO L290 TraceCheckUtils]: 29: Hoare triple {144451#true} assume !(0 == ~cond); {144451#true} is VALID [2022-04-28 06:05:07,986 INFO L290 TraceCheckUtils]: 28: Hoare triple {144451#true} ~cond := #in~cond; {144451#true} is VALID [2022-04-28 06:05:07,986 INFO L272 TraceCheckUtils]: 27: Hoare triple {145290#(< ~counter~0 86)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144451#true} is VALID [2022-04-28 06:05:07,986 INFO L290 TraceCheckUtils]: 26: Hoare triple {145290#(< ~counter~0 86)} assume !!(#t~post7 < 100);havoc #t~post7; {145290#(< ~counter~0 86)} is VALID [2022-04-28 06:05:07,987 INFO L290 TraceCheckUtils]: 25: Hoare triple {145315#(< ~counter~0 85)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {145290#(< ~counter~0 86)} is VALID [2022-04-28 06:05:07,988 INFO L290 TraceCheckUtils]: 24: Hoare triple {145315#(< ~counter~0 85)} assume !!(0 != ~r~0); {145315#(< ~counter~0 85)} is VALID [2022-04-28 06:05:07,988 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {144451#true} {145315#(< ~counter~0 85)} #94#return; {145315#(< ~counter~0 85)} is VALID [2022-04-28 06:05:07,988 INFO L290 TraceCheckUtils]: 22: Hoare triple {144451#true} assume true; {144451#true} is VALID [2022-04-28 06:05:07,988 INFO L290 TraceCheckUtils]: 21: Hoare triple {144451#true} assume !(0 == ~cond); {144451#true} is VALID [2022-04-28 06:05:07,988 INFO L290 TraceCheckUtils]: 20: Hoare triple {144451#true} ~cond := #in~cond; {144451#true} is VALID [2022-04-28 06:05:07,988 INFO L272 TraceCheckUtils]: 19: Hoare triple {145315#(< ~counter~0 85)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144451#true} is VALID [2022-04-28 06:05:07,989 INFO L290 TraceCheckUtils]: 18: Hoare triple {145315#(< ~counter~0 85)} assume !!(#t~post6 < 100);havoc #t~post6; {145315#(< ~counter~0 85)} is VALID [2022-04-28 06:05:07,990 INFO L290 TraceCheckUtils]: 17: Hoare triple {145340#(< ~counter~0 84)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {145315#(< ~counter~0 85)} is VALID [2022-04-28 06:05:07,990 INFO L290 TraceCheckUtils]: 16: Hoare triple {145340#(< ~counter~0 84)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {145340#(< ~counter~0 84)} is VALID [2022-04-28 06:05:07,991 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {144451#true} {145340#(< ~counter~0 84)} #92#return; {145340#(< ~counter~0 84)} is VALID [2022-04-28 06:05:07,991 INFO L290 TraceCheckUtils]: 14: Hoare triple {144451#true} assume true; {144451#true} is VALID [2022-04-28 06:05:07,991 INFO L290 TraceCheckUtils]: 13: Hoare triple {144451#true} assume !(0 == ~cond); {144451#true} is VALID [2022-04-28 06:05:07,991 INFO L290 TraceCheckUtils]: 12: Hoare triple {144451#true} ~cond := #in~cond; {144451#true} is VALID [2022-04-28 06:05:07,991 INFO L272 TraceCheckUtils]: 11: Hoare triple {145340#(< ~counter~0 84)} 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)); {144451#true} is VALID [2022-04-28 06:05:07,991 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {144451#true} {145340#(< ~counter~0 84)} #90#return; {145340#(< ~counter~0 84)} is VALID [2022-04-28 06:05:07,992 INFO L290 TraceCheckUtils]: 9: Hoare triple {144451#true} assume true; {144451#true} is VALID [2022-04-28 06:05:07,992 INFO L290 TraceCheckUtils]: 8: Hoare triple {144451#true} assume !(0 == ~cond); {144451#true} is VALID [2022-04-28 06:05:07,992 INFO L290 TraceCheckUtils]: 7: Hoare triple {144451#true} ~cond := #in~cond; {144451#true} is VALID [2022-04-28 06:05:07,992 INFO L272 TraceCheckUtils]: 6: Hoare triple {145340#(< ~counter~0 84)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {144451#true} is VALID [2022-04-28 06:05:07,992 INFO L290 TraceCheckUtils]: 5: Hoare triple {145340#(< ~counter~0 84)} 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; {145340#(< ~counter~0 84)} is VALID [2022-04-28 06:05:07,992 INFO L272 TraceCheckUtils]: 4: Hoare triple {145340#(< ~counter~0 84)} call #t~ret9 := main(); {145340#(< ~counter~0 84)} is VALID [2022-04-28 06:05:07,993 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {145340#(< ~counter~0 84)} {144451#true} #102#return; {145340#(< ~counter~0 84)} is VALID [2022-04-28 06:05:07,993 INFO L290 TraceCheckUtils]: 2: Hoare triple {145340#(< ~counter~0 84)} assume true; {145340#(< ~counter~0 84)} is VALID [2022-04-28 06:05:07,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {144451#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; {145340#(< ~counter~0 84)} is VALID [2022-04-28 06:05:07,993 INFO L272 TraceCheckUtils]: 0: Hoare triple {144451#true} call ULTIMATE.init(); {144451#true} is VALID [2022-04-28 06:05:07,994 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 32 proven. 162 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2022-04-28 06:05:07,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:05:07,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931504654] [2022-04-28 06:05:07,994 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:05:07,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [263061437] [2022-04-28 06:05:07,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [263061437] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:05:07,994 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:05:07,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38 [2022-04-28 06:05:07,995 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:05:07,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2116552993] [2022-04-28 06:05:07,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2116552993] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:05:07,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:05:07,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 06:05:07,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403961239] [2022-04-28 06:05:07,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:05:07,995 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.4) internal successors, (108), 19 states have internal predecessors, (108), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) Word has length 151 [2022-04-28 06:05:07,995 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:05:07,996 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 5.4) internal successors, (108), 19 states have internal predecessors, (108), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-28 06:05:08,191 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:05:08,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 06:05:08,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:05:08,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 06:05:08,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=635, Invalid=771, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 06:05:08,192 INFO L87 Difference]: Start difference. First operand 795 states and 1058 transitions. Second operand has 20 states, 20 states have (on average 5.4) internal successors, (108), 19 states have internal predecessors, (108), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-28 06:05:14,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:05:14,555 INFO L93 Difference]: Finished difference Result 846 states and 1128 transitions. [2022-04-28 06:05:14,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-28 06:05:14,556 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.4) internal successors, (108), 19 states have internal predecessors, (108), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) Word has length 151 [2022-04-28 06:05:14,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:05:14,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 5.4) internal successors, (108), 19 states have internal predecessors, (108), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-28 06:05:14,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 334 transitions. [2022-04-28 06:05:14,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 5.4) internal successors, (108), 19 states have internal predecessors, (108), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-28 06:05:14,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 334 transitions. [2022-04-28 06:05:14,560 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 334 transitions. [2022-04-28 06:05:14,975 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 334 edges. 334 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:05:15,005 INFO L225 Difference]: With dead ends: 846 [2022-04-28 06:05:15,005 INFO L226 Difference]: Without dead ends: 841 [2022-04-28 06:05:15,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1080, Invalid=1470, Unknown=0, NotChecked=0, Total=2550 [2022-04-28 06:05:15,006 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 251 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-28 06:05:15,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 384 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-28 06:05:15,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2022-04-28 06:05:17,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 819. [2022-04-28 06:05:17,976 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:05:17,977 INFO L82 GeneralOperation]: Start isEquivalent. First operand 841 states. Second operand has 819 states, 609 states have (on average 1.1822660098522169) internal successors, (720), 626 states have internal predecessors, (720), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 170 states have call predecessors, (187), 187 states have call successors, (187) [2022-04-28 06:05:17,978 INFO L74 IsIncluded]: Start isIncluded. First operand 841 states. Second operand has 819 states, 609 states have (on average 1.1822660098522169) internal successors, (720), 626 states have internal predecessors, (720), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 170 states have call predecessors, (187), 187 states have call successors, (187) [2022-04-28 06:05:17,978 INFO L87 Difference]: Start difference. First operand 841 states. Second operand has 819 states, 609 states have (on average 1.1822660098522169) internal successors, (720), 626 states have internal predecessors, (720), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 170 states have call predecessors, (187), 187 states have call successors, (187) [2022-04-28 06:05:18,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:05:18,002 INFO L93 Difference]: Finished difference Result 841 states and 1122 transitions. [2022-04-28 06:05:18,002 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1122 transitions. [2022-04-28 06:05:18,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:05:18,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:05:18,003 INFO L74 IsIncluded]: Start isIncluded. First operand has 819 states, 609 states have (on average 1.1822660098522169) internal successors, (720), 626 states have internal predecessors, (720), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 170 states have call predecessors, (187), 187 states have call successors, (187) Second operand 841 states. [2022-04-28 06:05:18,004 INFO L87 Difference]: Start difference. First operand has 819 states, 609 states have (on average 1.1822660098522169) internal successors, (720), 626 states have internal predecessors, (720), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 170 states have call predecessors, (187), 187 states have call successors, (187) Second operand 841 states. [2022-04-28 06:05:18,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:05:18,027 INFO L93 Difference]: Finished difference Result 841 states and 1122 transitions. [2022-04-28 06:05:18,027 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1122 transitions. [2022-04-28 06:05:18,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:05:18,028 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:05:18,028 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:05:18,028 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:05:18,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 609 states have (on average 1.1822660098522169) internal successors, (720), 626 states have internal predecessors, (720), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 170 states have call predecessors, (187), 187 states have call successors, (187) [2022-04-28 06:05:18,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1096 transitions. [2022-04-28 06:05:18,064 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1096 transitions. Word has length 151 [2022-04-28 06:05:18,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:05:18,064 INFO L495 AbstractCegarLoop]: Abstraction has 819 states and 1096 transitions. [2022-04-28 06:05:18,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.4) internal successors, (108), 19 states have internal predecessors, (108), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-28 06:05:18,064 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 819 states and 1096 transitions. [2022-04-28 06:05:34,002 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1096 edges. 1093 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 06:05:34,003 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1096 transitions. [2022-04-28 06:05:34,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-04-28 06:05:34,004 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:05:34,004 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 8, 8, 8, 8, 6, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:05:34,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Forceful destruction successful, exit code 0 [2022-04-28 06:05:34,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2022-04-28 06:05:34,205 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:05:34,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:05:34,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1031451968, now seen corresponding path program 27 times [2022-04-28 06:05:34,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:05:34,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [821082956] [2022-04-28 06:05:34,205 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:05:34,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1031451968, now seen corresponding path program 28 times [2022-04-28 06:05:34,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:05:34,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669700349] [2022-04-28 06:05:34,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:05:34,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:05:34,220 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:05:34,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1733413832] [2022-04-28 06:05:34,220 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 06:05:34,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:05:34,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:05:34,222 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:05:34,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2022-04-28 06:05:34,300 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 06:05:34,300 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:05:34,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-28 06:05:34,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:05:34,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:05:35,249 INFO L272 TraceCheckUtils]: 0: Hoare triple {150432#true} call ULTIMATE.init(); {150432#true} is VALID [2022-04-28 06:05:35,250 INFO L290 TraceCheckUtils]: 1: Hoare triple {150432#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; {150440#(<= ~counter~0 0)} is VALID [2022-04-28 06:05:35,250 INFO L290 TraceCheckUtils]: 2: Hoare triple {150440#(<= ~counter~0 0)} assume true; {150440#(<= ~counter~0 0)} is VALID [2022-04-28 06:05:35,250 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {150440#(<= ~counter~0 0)} {150432#true} #102#return; {150440#(<= ~counter~0 0)} is VALID [2022-04-28 06:05:35,251 INFO L272 TraceCheckUtils]: 4: Hoare triple {150440#(<= ~counter~0 0)} call #t~ret9 := main(); {150440#(<= ~counter~0 0)} is VALID [2022-04-28 06:05:35,251 INFO L290 TraceCheckUtils]: 5: Hoare triple {150440#(<= ~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; {150440#(<= ~counter~0 0)} is VALID [2022-04-28 06:05:35,251 INFO L272 TraceCheckUtils]: 6: Hoare triple {150440#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {150440#(<= ~counter~0 0)} is VALID [2022-04-28 06:05:35,252 INFO L290 TraceCheckUtils]: 7: Hoare triple {150440#(<= ~counter~0 0)} ~cond := #in~cond; {150440#(<= ~counter~0 0)} is VALID [2022-04-28 06:05:35,252 INFO L290 TraceCheckUtils]: 8: Hoare triple {150440#(<= ~counter~0 0)} assume !(0 == ~cond); {150440#(<= ~counter~0 0)} is VALID [2022-04-28 06:05:35,252 INFO L290 TraceCheckUtils]: 9: Hoare triple {150440#(<= ~counter~0 0)} assume true; {150440#(<= ~counter~0 0)} is VALID [2022-04-28 06:05:35,253 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {150440#(<= ~counter~0 0)} {150440#(<= ~counter~0 0)} #90#return; {150440#(<= ~counter~0 0)} is VALID [2022-04-28 06:05:35,253 INFO L272 TraceCheckUtils]: 11: Hoare triple {150440#(<= ~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)); {150440#(<= ~counter~0 0)} is VALID [2022-04-28 06:05:35,254 INFO L290 TraceCheckUtils]: 12: Hoare triple {150440#(<= ~counter~0 0)} ~cond := #in~cond; {150440#(<= ~counter~0 0)} is VALID [2022-04-28 06:05:35,254 INFO L290 TraceCheckUtils]: 13: Hoare triple {150440#(<= ~counter~0 0)} assume !(0 == ~cond); {150440#(<= ~counter~0 0)} is VALID [2022-04-28 06:05:35,254 INFO L290 TraceCheckUtils]: 14: Hoare triple {150440#(<= ~counter~0 0)} assume true; {150440#(<= ~counter~0 0)} is VALID [2022-04-28 06:05:35,255 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {150440#(<= ~counter~0 0)} {150440#(<= ~counter~0 0)} #92#return; {150440#(<= ~counter~0 0)} is VALID [2022-04-28 06:05:35,255 INFO L290 TraceCheckUtils]: 16: Hoare triple {150440#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {150440#(<= ~counter~0 0)} is VALID [2022-04-28 06:05:35,259 INFO L290 TraceCheckUtils]: 17: Hoare triple {150440#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {150489#(<= ~counter~0 1)} is VALID [2022-04-28 06:05:35,260 INFO L290 TraceCheckUtils]: 18: Hoare triple {150489#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {150489#(<= ~counter~0 1)} is VALID [2022-04-28 06:05:35,261 INFO L272 TraceCheckUtils]: 19: Hoare triple {150489#(<= ~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)); {150489#(<= ~counter~0 1)} is VALID [2022-04-28 06:05:35,261 INFO L290 TraceCheckUtils]: 20: Hoare triple {150489#(<= ~counter~0 1)} ~cond := #in~cond; {150489#(<= ~counter~0 1)} is VALID [2022-04-28 06:05:35,261 INFO L290 TraceCheckUtils]: 21: Hoare triple {150489#(<= ~counter~0 1)} assume !(0 == ~cond); {150489#(<= ~counter~0 1)} is VALID [2022-04-28 06:05:35,261 INFO L290 TraceCheckUtils]: 22: Hoare triple {150489#(<= ~counter~0 1)} assume true; {150489#(<= ~counter~0 1)} is VALID [2022-04-28 06:05:35,262 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {150489#(<= ~counter~0 1)} {150489#(<= ~counter~0 1)} #94#return; {150489#(<= ~counter~0 1)} is VALID [2022-04-28 06:05:35,262 INFO L290 TraceCheckUtils]: 24: Hoare triple {150489#(<= ~counter~0 1)} assume !!(0 != ~r~0); {150489#(<= ~counter~0 1)} is VALID [2022-04-28 06:05:35,265 INFO L290 TraceCheckUtils]: 25: Hoare triple {150489#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {150514#(<= ~counter~0 2)} is VALID [2022-04-28 06:05:35,265 INFO L290 TraceCheckUtils]: 26: Hoare triple {150514#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {150514#(<= ~counter~0 2)} is VALID [2022-04-28 06:05:35,266 INFO L272 TraceCheckUtils]: 27: Hoare triple {150514#(<= ~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)); {150514#(<= ~counter~0 2)} is VALID [2022-04-28 06:05:35,266 INFO L290 TraceCheckUtils]: 28: Hoare triple {150514#(<= ~counter~0 2)} ~cond := #in~cond; {150514#(<= ~counter~0 2)} is VALID [2022-04-28 06:05:35,266 INFO L290 TraceCheckUtils]: 29: Hoare triple {150514#(<= ~counter~0 2)} assume !(0 == ~cond); {150514#(<= ~counter~0 2)} is VALID [2022-04-28 06:05:35,266 INFO L290 TraceCheckUtils]: 30: Hoare triple {150514#(<= ~counter~0 2)} assume true; {150514#(<= ~counter~0 2)} is VALID [2022-04-28 06:05:35,267 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {150514#(<= ~counter~0 2)} {150514#(<= ~counter~0 2)} #96#return; {150514#(<= ~counter~0 2)} is VALID [2022-04-28 06:05:35,267 INFO L290 TraceCheckUtils]: 32: Hoare triple {150514#(<= ~counter~0 2)} assume !(~r~0 > 0); {150514#(<= ~counter~0 2)} is VALID [2022-04-28 06:05:35,269 INFO L290 TraceCheckUtils]: 33: Hoare triple {150514#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {150539#(<= ~counter~0 3)} is VALID [2022-04-28 06:05:35,269 INFO L290 TraceCheckUtils]: 34: Hoare triple {150539#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {150539#(<= ~counter~0 3)} is VALID [2022-04-28 06:05:35,270 INFO L272 TraceCheckUtils]: 35: Hoare triple {150539#(<= ~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)); {150539#(<= ~counter~0 3)} is VALID [2022-04-28 06:05:35,270 INFO L290 TraceCheckUtils]: 36: Hoare triple {150539#(<= ~counter~0 3)} ~cond := #in~cond; {150539#(<= ~counter~0 3)} is VALID [2022-04-28 06:05:35,270 INFO L290 TraceCheckUtils]: 37: Hoare triple {150539#(<= ~counter~0 3)} assume !(0 == ~cond); {150539#(<= ~counter~0 3)} is VALID [2022-04-28 06:05:35,271 INFO L290 TraceCheckUtils]: 38: Hoare triple {150539#(<= ~counter~0 3)} assume true; {150539#(<= ~counter~0 3)} is VALID [2022-04-28 06:05:35,271 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {150539#(<= ~counter~0 3)} {150539#(<= ~counter~0 3)} #98#return; {150539#(<= ~counter~0 3)} is VALID [2022-04-28 06:05:35,271 INFO L290 TraceCheckUtils]: 40: Hoare triple {150539#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {150539#(<= ~counter~0 3)} is VALID [2022-04-28 06:05:35,274 INFO L290 TraceCheckUtils]: 41: Hoare triple {150539#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {150564#(<= ~counter~0 4)} is VALID [2022-04-28 06:05:35,274 INFO L290 TraceCheckUtils]: 42: Hoare triple {150564#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {150564#(<= ~counter~0 4)} is VALID [2022-04-28 06:05:35,275 INFO L272 TraceCheckUtils]: 43: Hoare triple {150564#(<= ~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)); {150564#(<= ~counter~0 4)} is VALID [2022-04-28 06:05:35,275 INFO L290 TraceCheckUtils]: 44: Hoare triple {150564#(<= ~counter~0 4)} ~cond := #in~cond; {150564#(<= ~counter~0 4)} is VALID [2022-04-28 06:05:35,276 INFO L290 TraceCheckUtils]: 45: Hoare triple {150564#(<= ~counter~0 4)} assume !(0 == ~cond); {150564#(<= ~counter~0 4)} is VALID [2022-04-28 06:05:35,276 INFO L290 TraceCheckUtils]: 46: Hoare triple {150564#(<= ~counter~0 4)} assume true; {150564#(<= ~counter~0 4)} is VALID [2022-04-28 06:05:35,276 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {150564#(<= ~counter~0 4)} {150564#(<= ~counter~0 4)} #98#return; {150564#(<= ~counter~0 4)} is VALID [2022-04-28 06:05:35,277 INFO L290 TraceCheckUtils]: 48: Hoare triple {150564#(<= ~counter~0 4)} assume !(~r~0 < 0); {150564#(<= ~counter~0 4)} is VALID [2022-04-28 06:05:35,280 INFO L290 TraceCheckUtils]: 49: Hoare triple {150564#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {150589#(<= ~counter~0 5)} is VALID [2022-04-28 06:05:35,281 INFO L290 TraceCheckUtils]: 50: Hoare triple {150589#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {150589#(<= ~counter~0 5)} is VALID [2022-04-28 06:05:35,281 INFO L272 TraceCheckUtils]: 51: Hoare triple {150589#(<= ~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)); {150589#(<= ~counter~0 5)} is VALID [2022-04-28 06:05:35,281 INFO L290 TraceCheckUtils]: 52: Hoare triple {150589#(<= ~counter~0 5)} ~cond := #in~cond; {150589#(<= ~counter~0 5)} is VALID [2022-04-28 06:05:35,282 INFO L290 TraceCheckUtils]: 53: Hoare triple {150589#(<= ~counter~0 5)} assume !(0 == ~cond); {150589#(<= ~counter~0 5)} is VALID [2022-04-28 06:05:35,282 INFO L290 TraceCheckUtils]: 54: Hoare triple {150589#(<= ~counter~0 5)} assume true; {150589#(<= ~counter~0 5)} is VALID [2022-04-28 06:05:35,282 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {150589#(<= ~counter~0 5)} {150589#(<= ~counter~0 5)} #94#return; {150589#(<= ~counter~0 5)} is VALID [2022-04-28 06:05:35,283 INFO L290 TraceCheckUtils]: 56: Hoare triple {150589#(<= ~counter~0 5)} assume !!(0 != ~r~0); {150589#(<= ~counter~0 5)} is VALID [2022-04-28 06:05:35,286 INFO L290 TraceCheckUtils]: 57: Hoare triple {150589#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {150614#(<= ~counter~0 6)} is VALID [2022-04-28 06:05:35,286 INFO L290 TraceCheckUtils]: 58: Hoare triple {150614#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {150614#(<= ~counter~0 6)} is VALID [2022-04-28 06:05:35,286 INFO L272 TraceCheckUtils]: 59: Hoare triple {150614#(<= ~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)); {150614#(<= ~counter~0 6)} is VALID [2022-04-28 06:05:35,287 INFO L290 TraceCheckUtils]: 60: Hoare triple {150614#(<= ~counter~0 6)} ~cond := #in~cond; {150614#(<= ~counter~0 6)} is VALID [2022-04-28 06:05:35,287 INFO L290 TraceCheckUtils]: 61: Hoare triple {150614#(<= ~counter~0 6)} assume !(0 == ~cond); {150614#(<= ~counter~0 6)} is VALID [2022-04-28 06:05:35,287 INFO L290 TraceCheckUtils]: 62: Hoare triple {150614#(<= ~counter~0 6)} assume true; {150614#(<= ~counter~0 6)} is VALID [2022-04-28 06:05:35,288 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {150614#(<= ~counter~0 6)} {150614#(<= ~counter~0 6)} #96#return; {150614#(<= ~counter~0 6)} is VALID [2022-04-28 06:05:35,288 INFO L290 TraceCheckUtils]: 64: Hoare triple {150614#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {150614#(<= ~counter~0 6)} is VALID [2022-04-28 06:05:35,290 INFO L290 TraceCheckUtils]: 65: Hoare triple {150614#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {150639#(<= ~counter~0 7)} is VALID [2022-04-28 06:05:35,290 INFO L290 TraceCheckUtils]: 66: Hoare triple {150639#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {150639#(<= ~counter~0 7)} is VALID [2022-04-28 06:05:35,290 INFO L272 TraceCheckUtils]: 67: Hoare triple {150639#(<= ~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)); {150639#(<= ~counter~0 7)} is VALID [2022-04-28 06:05:35,291 INFO L290 TraceCheckUtils]: 68: Hoare triple {150639#(<= ~counter~0 7)} ~cond := #in~cond; {150639#(<= ~counter~0 7)} is VALID [2022-04-28 06:05:35,291 INFO L290 TraceCheckUtils]: 69: Hoare triple {150639#(<= ~counter~0 7)} assume !(0 == ~cond); {150639#(<= ~counter~0 7)} is VALID [2022-04-28 06:05:35,291 INFO L290 TraceCheckUtils]: 70: Hoare triple {150639#(<= ~counter~0 7)} assume true; {150639#(<= ~counter~0 7)} is VALID [2022-04-28 06:05:35,292 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {150639#(<= ~counter~0 7)} {150639#(<= ~counter~0 7)} #96#return; {150639#(<= ~counter~0 7)} is VALID [2022-04-28 06:05:35,292 INFO L290 TraceCheckUtils]: 72: Hoare triple {150639#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {150639#(<= ~counter~0 7)} is VALID [2022-04-28 06:05:35,294 INFO L290 TraceCheckUtils]: 73: Hoare triple {150639#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {150664#(<= ~counter~0 8)} is VALID [2022-04-28 06:05:35,295 INFO L290 TraceCheckUtils]: 74: Hoare triple {150664#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {150664#(<= ~counter~0 8)} is VALID [2022-04-28 06:05:35,295 INFO L272 TraceCheckUtils]: 75: Hoare triple {150664#(<= ~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)); {150664#(<= ~counter~0 8)} is VALID [2022-04-28 06:05:35,296 INFO L290 TraceCheckUtils]: 76: Hoare triple {150664#(<= ~counter~0 8)} ~cond := #in~cond; {150664#(<= ~counter~0 8)} is VALID [2022-04-28 06:05:35,296 INFO L290 TraceCheckUtils]: 77: Hoare triple {150664#(<= ~counter~0 8)} assume !(0 == ~cond); {150664#(<= ~counter~0 8)} is VALID [2022-04-28 06:05:35,296 INFO L290 TraceCheckUtils]: 78: Hoare triple {150664#(<= ~counter~0 8)} assume true; {150664#(<= ~counter~0 8)} is VALID [2022-04-28 06:05:35,297 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {150664#(<= ~counter~0 8)} {150664#(<= ~counter~0 8)} #96#return; {150664#(<= ~counter~0 8)} is VALID [2022-04-28 06:05:35,297 INFO L290 TraceCheckUtils]: 80: Hoare triple {150664#(<= ~counter~0 8)} assume !(~r~0 > 0); {150664#(<= ~counter~0 8)} is VALID [2022-04-28 06:05:35,299 INFO L290 TraceCheckUtils]: 81: Hoare triple {150664#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {150689#(<= ~counter~0 9)} is VALID [2022-04-28 06:05:35,299 INFO L290 TraceCheckUtils]: 82: Hoare triple {150689#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {150689#(<= ~counter~0 9)} is VALID [2022-04-28 06:05:35,300 INFO L272 TraceCheckUtils]: 83: Hoare triple {150689#(<= ~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)); {150689#(<= ~counter~0 9)} is VALID [2022-04-28 06:05:35,300 INFO L290 TraceCheckUtils]: 84: Hoare triple {150689#(<= ~counter~0 9)} ~cond := #in~cond; {150689#(<= ~counter~0 9)} is VALID [2022-04-28 06:05:35,300 INFO L290 TraceCheckUtils]: 85: Hoare triple {150689#(<= ~counter~0 9)} assume !(0 == ~cond); {150689#(<= ~counter~0 9)} is VALID [2022-04-28 06:05:35,301 INFO L290 TraceCheckUtils]: 86: Hoare triple {150689#(<= ~counter~0 9)} assume true; {150689#(<= ~counter~0 9)} is VALID [2022-04-28 06:05:35,301 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {150689#(<= ~counter~0 9)} {150689#(<= ~counter~0 9)} #98#return; {150689#(<= ~counter~0 9)} is VALID [2022-04-28 06:05:35,301 INFO L290 TraceCheckUtils]: 88: Hoare triple {150689#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {150689#(<= ~counter~0 9)} is VALID [2022-04-28 06:05:35,303 INFO L290 TraceCheckUtils]: 89: Hoare triple {150689#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {150714#(<= ~counter~0 10)} is VALID [2022-04-28 06:05:35,303 INFO L290 TraceCheckUtils]: 90: Hoare triple {150714#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {150714#(<= ~counter~0 10)} is VALID [2022-04-28 06:05:35,304 INFO L272 TraceCheckUtils]: 91: Hoare triple {150714#(<= ~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)); {150714#(<= ~counter~0 10)} is VALID [2022-04-28 06:05:35,304 INFO L290 TraceCheckUtils]: 92: Hoare triple {150714#(<= ~counter~0 10)} ~cond := #in~cond; {150714#(<= ~counter~0 10)} is VALID [2022-04-28 06:05:35,304 INFO L290 TraceCheckUtils]: 93: Hoare triple {150714#(<= ~counter~0 10)} assume !(0 == ~cond); {150714#(<= ~counter~0 10)} is VALID [2022-04-28 06:05:35,304 INFO L290 TraceCheckUtils]: 94: Hoare triple {150714#(<= ~counter~0 10)} assume true; {150714#(<= ~counter~0 10)} is VALID [2022-04-28 06:05:35,305 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {150714#(<= ~counter~0 10)} {150714#(<= ~counter~0 10)} #98#return; {150714#(<= ~counter~0 10)} is VALID [2022-04-28 06:05:35,305 INFO L290 TraceCheckUtils]: 96: Hoare triple {150714#(<= ~counter~0 10)} assume !(~r~0 < 0); {150714#(<= ~counter~0 10)} is VALID [2022-04-28 06:05:35,306 INFO L290 TraceCheckUtils]: 97: Hoare triple {150714#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {150739#(<= ~counter~0 11)} is VALID [2022-04-28 06:05:35,307 INFO L290 TraceCheckUtils]: 98: Hoare triple {150739#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {150739#(<= ~counter~0 11)} is VALID [2022-04-28 06:05:35,307 INFO L272 TraceCheckUtils]: 99: Hoare triple {150739#(<= ~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)); {150739#(<= ~counter~0 11)} is VALID [2022-04-28 06:05:35,307 INFO L290 TraceCheckUtils]: 100: Hoare triple {150739#(<= ~counter~0 11)} ~cond := #in~cond; {150739#(<= ~counter~0 11)} is VALID [2022-04-28 06:05:35,308 INFO L290 TraceCheckUtils]: 101: Hoare triple {150739#(<= ~counter~0 11)} assume !(0 == ~cond); {150739#(<= ~counter~0 11)} is VALID [2022-04-28 06:05:35,308 INFO L290 TraceCheckUtils]: 102: Hoare triple {150739#(<= ~counter~0 11)} assume true; {150739#(<= ~counter~0 11)} is VALID [2022-04-28 06:05:35,308 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {150739#(<= ~counter~0 11)} {150739#(<= ~counter~0 11)} #94#return; {150739#(<= ~counter~0 11)} is VALID [2022-04-28 06:05:35,309 INFO L290 TraceCheckUtils]: 104: Hoare triple {150739#(<= ~counter~0 11)} assume !!(0 != ~r~0); {150739#(<= ~counter~0 11)} is VALID [2022-04-28 06:05:35,315 INFO L290 TraceCheckUtils]: 105: Hoare triple {150739#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {150764#(<= ~counter~0 12)} is VALID [2022-04-28 06:05:35,316 INFO L290 TraceCheckUtils]: 106: Hoare triple {150764#(<= ~counter~0 12)} assume !!(#t~post7 < 100);havoc #t~post7; {150764#(<= ~counter~0 12)} is VALID [2022-04-28 06:05:35,316 INFO L272 TraceCheckUtils]: 107: Hoare triple {150764#(<= ~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)); {150764#(<= ~counter~0 12)} is VALID [2022-04-28 06:05:35,316 INFO L290 TraceCheckUtils]: 108: Hoare triple {150764#(<= ~counter~0 12)} ~cond := #in~cond; {150764#(<= ~counter~0 12)} is VALID [2022-04-28 06:05:35,317 INFO L290 TraceCheckUtils]: 109: Hoare triple {150764#(<= ~counter~0 12)} assume !(0 == ~cond); {150764#(<= ~counter~0 12)} is VALID [2022-04-28 06:05:35,317 INFO L290 TraceCheckUtils]: 110: Hoare triple {150764#(<= ~counter~0 12)} assume true; {150764#(<= ~counter~0 12)} is VALID [2022-04-28 06:05:35,317 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {150764#(<= ~counter~0 12)} {150764#(<= ~counter~0 12)} #96#return; {150764#(<= ~counter~0 12)} is VALID [2022-04-28 06:05:35,318 INFO L290 TraceCheckUtils]: 112: Hoare triple {150764#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {150764#(<= ~counter~0 12)} is VALID [2022-04-28 06:05:35,320 INFO L290 TraceCheckUtils]: 113: Hoare triple {150764#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {150789#(<= ~counter~0 13)} is VALID [2022-04-28 06:05:35,320 INFO L290 TraceCheckUtils]: 114: Hoare triple {150789#(<= ~counter~0 13)} assume !!(#t~post7 < 100);havoc #t~post7; {150789#(<= ~counter~0 13)} is VALID [2022-04-28 06:05:35,320 INFO L272 TraceCheckUtils]: 115: Hoare triple {150789#(<= ~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)); {150789#(<= ~counter~0 13)} is VALID [2022-04-28 06:05:35,321 INFO L290 TraceCheckUtils]: 116: Hoare triple {150789#(<= ~counter~0 13)} ~cond := #in~cond; {150789#(<= ~counter~0 13)} is VALID [2022-04-28 06:05:35,321 INFO L290 TraceCheckUtils]: 117: Hoare triple {150789#(<= ~counter~0 13)} assume !(0 == ~cond); {150789#(<= ~counter~0 13)} is VALID [2022-04-28 06:05:35,321 INFO L290 TraceCheckUtils]: 118: Hoare triple {150789#(<= ~counter~0 13)} assume true; {150789#(<= ~counter~0 13)} is VALID [2022-04-28 06:05:35,322 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {150789#(<= ~counter~0 13)} {150789#(<= ~counter~0 13)} #96#return; {150789#(<= ~counter~0 13)} is VALID [2022-04-28 06:05:35,322 INFO L290 TraceCheckUtils]: 120: Hoare triple {150789#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {150789#(<= ~counter~0 13)} is VALID [2022-04-28 06:05:35,324 INFO L290 TraceCheckUtils]: 121: Hoare triple {150789#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {150814#(<= ~counter~0 14)} is VALID [2022-04-28 06:05:35,324 INFO L290 TraceCheckUtils]: 122: Hoare triple {150814#(<= ~counter~0 14)} assume !!(#t~post7 < 100);havoc #t~post7; {150814#(<= ~counter~0 14)} is VALID [2022-04-28 06:05:35,324 INFO L272 TraceCheckUtils]: 123: Hoare triple {150814#(<= ~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)); {150814#(<= ~counter~0 14)} is VALID [2022-04-28 06:05:35,325 INFO L290 TraceCheckUtils]: 124: Hoare triple {150814#(<= ~counter~0 14)} ~cond := #in~cond; {150814#(<= ~counter~0 14)} is VALID [2022-04-28 06:05:35,325 INFO L290 TraceCheckUtils]: 125: Hoare triple {150814#(<= ~counter~0 14)} assume !(0 == ~cond); {150814#(<= ~counter~0 14)} is VALID [2022-04-28 06:05:35,325 INFO L290 TraceCheckUtils]: 126: Hoare triple {150814#(<= ~counter~0 14)} assume true; {150814#(<= ~counter~0 14)} is VALID [2022-04-28 06:05:35,326 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {150814#(<= ~counter~0 14)} {150814#(<= ~counter~0 14)} #96#return; {150814#(<= ~counter~0 14)} is VALID [2022-04-28 06:05:35,326 INFO L290 TraceCheckUtils]: 128: Hoare triple {150814#(<= ~counter~0 14)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {150814#(<= ~counter~0 14)} is VALID [2022-04-28 06:05:35,328 INFO L290 TraceCheckUtils]: 129: Hoare triple {150814#(<= ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {150839#(<= ~counter~0 15)} is VALID [2022-04-28 06:05:35,329 INFO L290 TraceCheckUtils]: 130: Hoare triple {150839#(<= ~counter~0 15)} assume !!(#t~post7 < 100);havoc #t~post7; {150839#(<= ~counter~0 15)} is VALID [2022-04-28 06:05:35,329 INFO L272 TraceCheckUtils]: 131: Hoare triple {150839#(<= ~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)); {150839#(<= ~counter~0 15)} is VALID [2022-04-28 06:05:35,330 INFO L290 TraceCheckUtils]: 132: Hoare triple {150839#(<= ~counter~0 15)} ~cond := #in~cond; {150839#(<= ~counter~0 15)} is VALID [2022-04-28 06:05:35,330 INFO L290 TraceCheckUtils]: 133: Hoare triple {150839#(<= ~counter~0 15)} assume !(0 == ~cond); {150839#(<= ~counter~0 15)} is VALID [2022-04-28 06:05:35,330 INFO L290 TraceCheckUtils]: 134: Hoare triple {150839#(<= ~counter~0 15)} assume true; {150839#(<= ~counter~0 15)} is VALID [2022-04-28 06:05:35,331 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {150839#(<= ~counter~0 15)} {150839#(<= ~counter~0 15)} #96#return; {150839#(<= ~counter~0 15)} is VALID [2022-04-28 06:05:35,331 INFO L290 TraceCheckUtils]: 136: Hoare triple {150839#(<= ~counter~0 15)} assume !(~r~0 > 0); {150839#(<= ~counter~0 15)} is VALID [2022-04-28 06:05:35,333 INFO L290 TraceCheckUtils]: 137: Hoare triple {150839#(<= ~counter~0 15)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {150864#(<= ~counter~0 16)} is VALID [2022-04-28 06:05:35,334 INFO L290 TraceCheckUtils]: 138: Hoare triple {150864#(<= ~counter~0 16)} assume !!(#t~post8 < 100);havoc #t~post8; {150864#(<= ~counter~0 16)} is VALID [2022-04-28 06:05:35,334 INFO L272 TraceCheckUtils]: 139: Hoare triple {150864#(<= ~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)); {150864#(<= ~counter~0 16)} is VALID [2022-04-28 06:05:35,334 INFO L290 TraceCheckUtils]: 140: Hoare triple {150864#(<= ~counter~0 16)} ~cond := #in~cond; {150864#(<= ~counter~0 16)} is VALID [2022-04-28 06:05:35,335 INFO L290 TraceCheckUtils]: 141: Hoare triple {150864#(<= ~counter~0 16)} assume !(0 == ~cond); {150864#(<= ~counter~0 16)} is VALID [2022-04-28 06:05:35,335 INFO L290 TraceCheckUtils]: 142: Hoare triple {150864#(<= ~counter~0 16)} assume true; {150864#(<= ~counter~0 16)} is VALID [2022-04-28 06:05:35,335 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {150864#(<= ~counter~0 16)} {150864#(<= ~counter~0 16)} #98#return; {150864#(<= ~counter~0 16)} is VALID [2022-04-28 06:05:35,336 INFO L290 TraceCheckUtils]: 144: Hoare triple {150864#(<= ~counter~0 16)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {150864#(<= ~counter~0 16)} is VALID [2022-04-28 06:05:35,336 INFO L290 TraceCheckUtils]: 145: Hoare triple {150864#(<= ~counter~0 16)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {150889#(<= |main_#t~post8| 16)} is VALID [2022-04-28 06:05:35,336 INFO L290 TraceCheckUtils]: 146: Hoare triple {150889#(<= |main_#t~post8| 16)} assume !(#t~post8 < 100);havoc #t~post8; {150433#false} is VALID [2022-04-28 06:05:35,336 INFO L290 TraceCheckUtils]: 147: Hoare triple {150433#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {150433#false} is VALID [2022-04-28 06:05:35,336 INFO L290 TraceCheckUtils]: 148: Hoare triple {150433#false} assume !(#t~post6 < 100);havoc #t~post6; {150433#false} is VALID [2022-04-28 06:05:35,336 INFO L272 TraceCheckUtils]: 149: Hoare triple {150433#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)); {150433#false} is VALID [2022-04-28 06:05:35,337 INFO L290 TraceCheckUtils]: 150: Hoare triple {150433#false} ~cond := #in~cond; {150433#false} is VALID [2022-04-28 06:05:35,337 INFO L290 TraceCheckUtils]: 151: Hoare triple {150433#false} assume 0 == ~cond; {150433#false} is VALID [2022-04-28 06:05:35,337 INFO L290 TraceCheckUtils]: 152: Hoare triple {150433#false} assume !false; {150433#false} is VALID [2022-04-28 06:05:35,337 INFO L134 CoverageAnalysis]: Checked inductivity of 696 backedges. 38 proven. 654 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 06:05:35,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:05:36,436 INFO L290 TraceCheckUtils]: 152: Hoare triple {150433#false} assume !false; {150433#false} is VALID [2022-04-28 06:05:36,436 INFO L290 TraceCheckUtils]: 151: Hoare triple {150433#false} assume 0 == ~cond; {150433#false} is VALID [2022-04-28 06:05:36,436 INFO L290 TraceCheckUtils]: 150: Hoare triple {150433#false} ~cond := #in~cond; {150433#false} is VALID [2022-04-28 06:05:36,436 INFO L272 TraceCheckUtils]: 149: Hoare triple {150433#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)); {150433#false} is VALID [2022-04-28 06:05:36,436 INFO L290 TraceCheckUtils]: 148: Hoare triple {150433#false} assume !(#t~post6 < 100);havoc #t~post6; {150433#false} is VALID [2022-04-28 06:05:36,436 INFO L290 TraceCheckUtils]: 147: Hoare triple {150433#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {150433#false} is VALID [2022-04-28 06:05:36,436 INFO L290 TraceCheckUtils]: 146: Hoare triple {150929#(< |main_#t~post8| 100)} assume !(#t~post8 < 100);havoc #t~post8; {150433#false} is VALID [2022-04-28 06:05:36,437 INFO L290 TraceCheckUtils]: 145: Hoare triple {150933#(< ~counter~0 100)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {150929#(< |main_#t~post8| 100)} is VALID [2022-04-28 06:05:36,437 INFO L290 TraceCheckUtils]: 144: Hoare triple {150933#(< ~counter~0 100)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {150933#(< ~counter~0 100)} is VALID [2022-04-28 06:05:36,437 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {150432#true} {150933#(< ~counter~0 100)} #98#return; {150933#(< ~counter~0 100)} is VALID [2022-04-28 06:05:36,438 INFO L290 TraceCheckUtils]: 142: Hoare triple {150432#true} assume true; {150432#true} is VALID [2022-04-28 06:05:36,438 INFO L290 TraceCheckUtils]: 141: Hoare triple {150432#true} assume !(0 == ~cond); {150432#true} is VALID [2022-04-28 06:05:36,438 INFO L290 TraceCheckUtils]: 140: Hoare triple {150432#true} ~cond := #in~cond; {150432#true} is VALID [2022-04-28 06:05:36,438 INFO L272 TraceCheckUtils]: 139: Hoare triple {150933#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150432#true} is VALID [2022-04-28 06:05:36,438 INFO L290 TraceCheckUtils]: 138: Hoare triple {150933#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {150933#(< ~counter~0 100)} is VALID [2022-04-28 06:05:36,441 INFO L290 TraceCheckUtils]: 137: Hoare triple {150958#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {150933#(< ~counter~0 100)} is VALID [2022-04-28 06:05:36,441 INFO L290 TraceCheckUtils]: 136: Hoare triple {150958#(< ~counter~0 99)} assume !(~r~0 > 0); {150958#(< ~counter~0 99)} is VALID [2022-04-28 06:05:36,442 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {150432#true} {150958#(< ~counter~0 99)} #96#return; {150958#(< ~counter~0 99)} is VALID [2022-04-28 06:05:36,442 INFO L290 TraceCheckUtils]: 134: Hoare triple {150432#true} assume true; {150432#true} is VALID [2022-04-28 06:05:36,442 INFO L290 TraceCheckUtils]: 133: Hoare triple {150432#true} assume !(0 == ~cond); {150432#true} is VALID [2022-04-28 06:05:36,442 INFO L290 TraceCheckUtils]: 132: Hoare triple {150432#true} ~cond := #in~cond; {150432#true} is VALID [2022-04-28 06:05:36,442 INFO L272 TraceCheckUtils]: 131: Hoare triple {150958#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150432#true} is VALID [2022-04-28 06:05:36,442 INFO L290 TraceCheckUtils]: 130: Hoare triple {150958#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {150958#(< ~counter~0 99)} is VALID [2022-04-28 06:05:36,444 INFO L290 TraceCheckUtils]: 129: Hoare triple {150983#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {150958#(< ~counter~0 99)} is VALID [2022-04-28 06:05:36,444 INFO L290 TraceCheckUtils]: 128: Hoare triple {150983#(< ~counter~0 98)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {150983#(< ~counter~0 98)} is VALID [2022-04-28 06:05:36,445 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {150432#true} {150983#(< ~counter~0 98)} #96#return; {150983#(< ~counter~0 98)} is VALID [2022-04-28 06:05:36,445 INFO L290 TraceCheckUtils]: 126: Hoare triple {150432#true} assume true; {150432#true} is VALID [2022-04-28 06:05:36,445 INFO L290 TraceCheckUtils]: 125: Hoare triple {150432#true} assume !(0 == ~cond); {150432#true} is VALID [2022-04-28 06:05:36,445 INFO L290 TraceCheckUtils]: 124: Hoare triple {150432#true} ~cond := #in~cond; {150432#true} is VALID [2022-04-28 06:05:36,445 INFO L272 TraceCheckUtils]: 123: Hoare triple {150983#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150432#true} is VALID [2022-04-28 06:05:36,445 INFO L290 TraceCheckUtils]: 122: Hoare triple {150983#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {150983#(< ~counter~0 98)} is VALID [2022-04-28 06:05:36,446 INFO L290 TraceCheckUtils]: 121: Hoare triple {151008#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {150983#(< ~counter~0 98)} is VALID [2022-04-28 06:05:36,447 INFO L290 TraceCheckUtils]: 120: Hoare triple {151008#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {151008#(< ~counter~0 97)} is VALID [2022-04-28 06:05:36,447 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {150432#true} {151008#(< ~counter~0 97)} #96#return; {151008#(< ~counter~0 97)} is VALID [2022-04-28 06:05:36,447 INFO L290 TraceCheckUtils]: 118: Hoare triple {150432#true} assume true; {150432#true} is VALID [2022-04-28 06:05:36,447 INFO L290 TraceCheckUtils]: 117: Hoare triple {150432#true} assume !(0 == ~cond); {150432#true} is VALID [2022-04-28 06:05:36,447 INFO L290 TraceCheckUtils]: 116: Hoare triple {150432#true} ~cond := #in~cond; {150432#true} is VALID [2022-04-28 06:05:36,448 INFO L272 TraceCheckUtils]: 115: Hoare triple {151008#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150432#true} is VALID [2022-04-28 06:05:36,448 INFO L290 TraceCheckUtils]: 114: Hoare triple {151008#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {151008#(< ~counter~0 97)} is VALID [2022-04-28 06:05:36,449 INFO L290 TraceCheckUtils]: 113: Hoare triple {151033#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {151008#(< ~counter~0 97)} is VALID [2022-04-28 06:05:36,449 INFO L290 TraceCheckUtils]: 112: Hoare triple {151033#(< ~counter~0 96)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {151033#(< ~counter~0 96)} is VALID [2022-04-28 06:05:36,450 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {150432#true} {151033#(< ~counter~0 96)} #96#return; {151033#(< ~counter~0 96)} is VALID [2022-04-28 06:05:36,450 INFO L290 TraceCheckUtils]: 110: Hoare triple {150432#true} assume true; {150432#true} is VALID [2022-04-28 06:05:36,450 INFO L290 TraceCheckUtils]: 109: Hoare triple {150432#true} assume !(0 == ~cond); {150432#true} is VALID [2022-04-28 06:05:36,450 INFO L290 TraceCheckUtils]: 108: Hoare triple {150432#true} ~cond := #in~cond; {150432#true} is VALID [2022-04-28 06:05:36,450 INFO L272 TraceCheckUtils]: 107: Hoare triple {151033#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150432#true} is VALID [2022-04-28 06:05:36,450 INFO L290 TraceCheckUtils]: 106: Hoare triple {151033#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {151033#(< ~counter~0 96)} is VALID [2022-04-28 06:05:36,452 INFO L290 TraceCheckUtils]: 105: Hoare triple {151058#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {151033#(< ~counter~0 96)} is VALID [2022-04-28 06:05:36,452 INFO L290 TraceCheckUtils]: 104: Hoare triple {151058#(< ~counter~0 95)} assume !!(0 != ~r~0); {151058#(< ~counter~0 95)} is VALID [2022-04-28 06:05:36,452 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {150432#true} {151058#(< ~counter~0 95)} #94#return; {151058#(< ~counter~0 95)} is VALID [2022-04-28 06:05:36,452 INFO L290 TraceCheckUtils]: 102: Hoare triple {150432#true} assume true; {150432#true} is VALID [2022-04-28 06:05:36,452 INFO L290 TraceCheckUtils]: 101: Hoare triple {150432#true} assume !(0 == ~cond); {150432#true} is VALID [2022-04-28 06:05:36,453 INFO L290 TraceCheckUtils]: 100: Hoare triple {150432#true} ~cond := #in~cond; {150432#true} is VALID [2022-04-28 06:05:36,453 INFO L272 TraceCheckUtils]: 99: Hoare triple {151058#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150432#true} is VALID [2022-04-28 06:05:36,453 INFO L290 TraceCheckUtils]: 98: Hoare triple {151058#(< ~counter~0 95)} assume !!(#t~post6 < 100);havoc #t~post6; {151058#(< ~counter~0 95)} is VALID [2022-04-28 06:05:36,454 INFO L290 TraceCheckUtils]: 97: Hoare triple {151083#(< ~counter~0 94)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {151058#(< ~counter~0 95)} is VALID [2022-04-28 06:05:36,454 INFO L290 TraceCheckUtils]: 96: Hoare triple {151083#(< ~counter~0 94)} assume !(~r~0 < 0); {151083#(< ~counter~0 94)} is VALID [2022-04-28 06:05:36,455 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {150432#true} {151083#(< ~counter~0 94)} #98#return; {151083#(< ~counter~0 94)} is VALID [2022-04-28 06:05:36,455 INFO L290 TraceCheckUtils]: 94: Hoare triple {150432#true} assume true; {150432#true} is VALID [2022-04-28 06:05:36,455 INFO L290 TraceCheckUtils]: 93: Hoare triple {150432#true} assume !(0 == ~cond); {150432#true} is VALID [2022-04-28 06:05:36,455 INFO L290 TraceCheckUtils]: 92: Hoare triple {150432#true} ~cond := #in~cond; {150432#true} is VALID [2022-04-28 06:05:36,455 INFO L272 TraceCheckUtils]: 91: Hoare triple {151083#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150432#true} is VALID [2022-04-28 06:05:36,455 INFO L290 TraceCheckUtils]: 90: Hoare triple {151083#(< ~counter~0 94)} assume !!(#t~post8 < 100);havoc #t~post8; {151083#(< ~counter~0 94)} is VALID [2022-04-28 06:05:36,457 INFO L290 TraceCheckUtils]: 89: Hoare triple {151108#(< ~counter~0 93)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {151083#(< ~counter~0 94)} is VALID [2022-04-28 06:05:36,457 INFO L290 TraceCheckUtils]: 88: Hoare triple {151108#(< ~counter~0 93)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {151108#(< ~counter~0 93)} is VALID [2022-04-28 06:05:36,457 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {150432#true} {151108#(< ~counter~0 93)} #98#return; {151108#(< ~counter~0 93)} is VALID [2022-04-28 06:05:36,457 INFO L290 TraceCheckUtils]: 86: Hoare triple {150432#true} assume true; {150432#true} is VALID [2022-04-28 06:05:36,457 INFO L290 TraceCheckUtils]: 85: Hoare triple {150432#true} assume !(0 == ~cond); {150432#true} is VALID [2022-04-28 06:05:36,457 INFO L290 TraceCheckUtils]: 84: Hoare triple {150432#true} ~cond := #in~cond; {150432#true} is VALID [2022-04-28 06:05:36,458 INFO L272 TraceCheckUtils]: 83: Hoare triple {151108#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150432#true} is VALID [2022-04-28 06:05:36,458 INFO L290 TraceCheckUtils]: 82: Hoare triple {151108#(< ~counter~0 93)} assume !!(#t~post8 < 100);havoc #t~post8; {151108#(< ~counter~0 93)} is VALID [2022-04-28 06:05:36,459 INFO L290 TraceCheckUtils]: 81: Hoare triple {151133#(< ~counter~0 92)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {151108#(< ~counter~0 93)} is VALID [2022-04-28 06:05:36,459 INFO L290 TraceCheckUtils]: 80: Hoare triple {151133#(< ~counter~0 92)} assume !(~r~0 > 0); {151133#(< ~counter~0 92)} is VALID [2022-04-28 06:05:36,460 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {150432#true} {151133#(< ~counter~0 92)} #96#return; {151133#(< ~counter~0 92)} is VALID [2022-04-28 06:05:36,460 INFO L290 TraceCheckUtils]: 78: Hoare triple {150432#true} assume true; {150432#true} is VALID [2022-04-28 06:05:36,460 INFO L290 TraceCheckUtils]: 77: Hoare triple {150432#true} assume !(0 == ~cond); {150432#true} is VALID [2022-04-28 06:05:36,460 INFO L290 TraceCheckUtils]: 76: Hoare triple {150432#true} ~cond := #in~cond; {150432#true} is VALID [2022-04-28 06:05:36,460 INFO L272 TraceCheckUtils]: 75: Hoare triple {151133#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150432#true} is VALID [2022-04-28 06:05:36,460 INFO L290 TraceCheckUtils]: 74: Hoare triple {151133#(< ~counter~0 92)} assume !!(#t~post7 < 100);havoc #t~post7; {151133#(< ~counter~0 92)} is VALID [2022-04-28 06:05:36,462 INFO L290 TraceCheckUtils]: 73: Hoare triple {151158#(< ~counter~0 91)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {151133#(< ~counter~0 92)} is VALID [2022-04-28 06:05:36,462 INFO L290 TraceCheckUtils]: 72: Hoare triple {151158#(< ~counter~0 91)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {151158#(< ~counter~0 91)} is VALID [2022-04-28 06:05:36,462 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {150432#true} {151158#(< ~counter~0 91)} #96#return; {151158#(< ~counter~0 91)} is VALID [2022-04-28 06:05:36,462 INFO L290 TraceCheckUtils]: 70: Hoare triple {150432#true} assume true; {150432#true} is VALID [2022-04-28 06:05:36,462 INFO L290 TraceCheckUtils]: 69: Hoare triple {150432#true} assume !(0 == ~cond); {150432#true} is VALID [2022-04-28 06:05:36,462 INFO L290 TraceCheckUtils]: 68: Hoare triple {150432#true} ~cond := #in~cond; {150432#true} is VALID [2022-04-28 06:05:36,463 INFO L272 TraceCheckUtils]: 67: Hoare triple {151158#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150432#true} is VALID [2022-04-28 06:05:36,463 INFO L290 TraceCheckUtils]: 66: Hoare triple {151158#(< ~counter~0 91)} assume !!(#t~post7 < 100);havoc #t~post7; {151158#(< ~counter~0 91)} is VALID [2022-04-28 06:05:36,464 INFO L290 TraceCheckUtils]: 65: Hoare triple {151183#(< ~counter~0 90)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {151158#(< ~counter~0 91)} is VALID [2022-04-28 06:05:36,464 INFO L290 TraceCheckUtils]: 64: Hoare triple {151183#(< ~counter~0 90)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {151183#(< ~counter~0 90)} is VALID [2022-04-28 06:05:36,465 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {150432#true} {151183#(< ~counter~0 90)} #96#return; {151183#(< ~counter~0 90)} is VALID [2022-04-28 06:05:36,465 INFO L290 TraceCheckUtils]: 62: Hoare triple {150432#true} assume true; {150432#true} is VALID [2022-04-28 06:05:36,465 INFO L290 TraceCheckUtils]: 61: Hoare triple {150432#true} assume !(0 == ~cond); {150432#true} is VALID [2022-04-28 06:05:36,465 INFO L290 TraceCheckUtils]: 60: Hoare triple {150432#true} ~cond := #in~cond; {150432#true} is VALID [2022-04-28 06:05:36,465 INFO L272 TraceCheckUtils]: 59: Hoare triple {151183#(< ~counter~0 90)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150432#true} is VALID [2022-04-28 06:05:36,465 INFO L290 TraceCheckUtils]: 58: Hoare triple {151183#(< ~counter~0 90)} assume !!(#t~post7 < 100);havoc #t~post7; {151183#(< ~counter~0 90)} is VALID [2022-04-28 06:05:36,467 INFO L290 TraceCheckUtils]: 57: Hoare triple {151208#(< ~counter~0 89)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {151183#(< ~counter~0 90)} is VALID [2022-04-28 06:05:36,467 INFO L290 TraceCheckUtils]: 56: Hoare triple {151208#(< ~counter~0 89)} assume !!(0 != ~r~0); {151208#(< ~counter~0 89)} is VALID [2022-04-28 06:05:36,467 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {150432#true} {151208#(< ~counter~0 89)} #94#return; {151208#(< ~counter~0 89)} is VALID [2022-04-28 06:05:36,467 INFO L290 TraceCheckUtils]: 54: Hoare triple {150432#true} assume true; {150432#true} is VALID [2022-04-28 06:05:36,467 INFO L290 TraceCheckUtils]: 53: Hoare triple {150432#true} assume !(0 == ~cond); {150432#true} is VALID [2022-04-28 06:05:36,468 INFO L290 TraceCheckUtils]: 52: Hoare triple {150432#true} ~cond := #in~cond; {150432#true} is VALID [2022-04-28 06:05:36,468 INFO L272 TraceCheckUtils]: 51: Hoare triple {151208#(< ~counter~0 89)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150432#true} is VALID [2022-04-28 06:05:36,468 INFO L290 TraceCheckUtils]: 50: Hoare triple {151208#(< ~counter~0 89)} assume !!(#t~post6 < 100);havoc #t~post6; {151208#(< ~counter~0 89)} is VALID [2022-04-28 06:05:36,469 INFO L290 TraceCheckUtils]: 49: Hoare triple {151233#(< ~counter~0 88)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {151208#(< ~counter~0 89)} is VALID [2022-04-28 06:05:36,469 INFO L290 TraceCheckUtils]: 48: Hoare triple {151233#(< ~counter~0 88)} assume !(~r~0 < 0); {151233#(< ~counter~0 88)} is VALID [2022-04-28 06:05:36,470 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {150432#true} {151233#(< ~counter~0 88)} #98#return; {151233#(< ~counter~0 88)} is VALID [2022-04-28 06:05:36,470 INFO L290 TraceCheckUtils]: 46: Hoare triple {150432#true} assume true; {150432#true} is VALID [2022-04-28 06:05:36,470 INFO L290 TraceCheckUtils]: 45: Hoare triple {150432#true} assume !(0 == ~cond); {150432#true} is VALID [2022-04-28 06:05:36,470 INFO L290 TraceCheckUtils]: 44: Hoare triple {150432#true} ~cond := #in~cond; {150432#true} is VALID [2022-04-28 06:05:36,470 INFO L272 TraceCheckUtils]: 43: Hoare triple {151233#(< ~counter~0 88)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150432#true} is VALID [2022-04-28 06:05:36,470 INFO L290 TraceCheckUtils]: 42: Hoare triple {151233#(< ~counter~0 88)} assume !!(#t~post8 < 100);havoc #t~post8; {151233#(< ~counter~0 88)} is VALID [2022-04-28 06:05:36,472 INFO L290 TraceCheckUtils]: 41: Hoare triple {151258#(< ~counter~0 87)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {151233#(< ~counter~0 88)} is VALID [2022-04-28 06:05:36,472 INFO L290 TraceCheckUtils]: 40: Hoare triple {151258#(< ~counter~0 87)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {151258#(< ~counter~0 87)} is VALID [2022-04-28 06:05:36,483 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {150432#true} {151258#(< ~counter~0 87)} #98#return; {151258#(< ~counter~0 87)} is VALID [2022-04-28 06:05:36,483 INFO L290 TraceCheckUtils]: 38: Hoare triple {150432#true} assume true; {150432#true} is VALID [2022-04-28 06:05:36,483 INFO L290 TraceCheckUtils]: 37: Hoare triple {150432#true} assume !(0 == ~cond); {150432#true} is VALID [2022-04-28 06:05:36,483 INFO L290 TraceCheckUtils]: 36: Hoare triple {150432#true} ~cond := #in~cond; {150432#true} is VALID [2022-04-28 06:05:36,483 INFO L272 TraceCheckUtils]: 35: Hoare triple {151258#(< ~counter~0 87)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150432#true} is VALID [2022-04-28 06:05:36,483 INFO L290 TraceCheckUtils]: 34: Hoare triple {151258#(< ~counter~0 87)} assume !!(#t~post8 < 100);havoc #t~post8; {151258#(< ~counter~0 87)} is VALID [2022-04-28 06:05:36,487 INFO L290 TraceCheckUtils]: 33: Hoare triple {151283#(< ~counter~0 86)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {151258#(< ~counter~0 87)} is VALID [2022-04-28 06:05:36,487 INFO L290 TraceCheckUtils]: 32: Hoare triple {151283#(< ~counter~0 86)} assume !(~r~0 > 0); {151283#(< ~counter~0 86)} is VALID [2022-04-28 06:05:36,488 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {150432#true} {151283#(< ~counter~0 86)} #96#return; {151283#(< ~counter~0 86)} is VALID [2022-04-28 06:05:36,488 INFO L290 TraceCheckUtils]: 30: Hoare triple {150432#true} assume true; {150432#true} is VALID [2022-04-28 06:05:36,488 INFO L290 TraceCheckUtils]: 29: Hoare triple {150432#true} assume !(0 == ~cond); {150432#true} is VALID [2022-04-28 06:05:36,488 INFO L290 TraceCheckUtils]: 28: Hoare triple {150432#true} ~cond := #in~cond; {150432#true} is VALID [2022-04-28 06:05:36,488 INFO L272 TraceCheckUtils]: 27: Hoare triple {151283#(< ~counter~0 86)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150432#true} is VALID [2022-04-28 06:05:36,488 INFO L290 TraceCheckUtils]: 26: Hoare triple {151283#(< ~counter~0 86)} assume !!(#t~post7 < 100);havoc #t~post7; {151283#(< ~counter~0 86)} is VALID [2022-04-28 06:05:36,490 INFO L290 TraceCheckUtils]: 25: Hoare triple {151308#(< ~counter~0 85)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {151283#(< ~counter~0 86)} is VALID [2022-04-28 06:05:36,490 INFO L290 TraceCheckUtils]: 24: Hoare triple {151308#(< ~counter~0 85)} assume !!(0 != ~r~0); {151308#(< ~counter~0 85)} is VALID [2022-04-28 06:05:36,490 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {150432#true} {151308#(< ~counter~0 85)} #94#return; {151308#(< ~counter~0 85)} is VALID [2022-04-28 06:05:36,490 INFO L290 TraceCheckUtils]: 22: Hoare triple {150432#true} assume true; {150432#true} is VALID [2022-04-28 06:05:36,491 INFO L290 TraceCheckUtils]: 21: Hoare triple {150432#true} assume !(0 == ~cond); {150432#true} is VALID [2022-04-28 06:05:36,491 INFO L290 TraceCheckUtils]: 20: Hoare triple {150432#true} ~cond := #in~cond; {150432#true} is VALID [2022-04-28 06:05:36,491 INFO L272 TraceCheckUtils]: 19: Hoare triple {151308#(< ~counter~0 85)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150432#true} is VALID [2022-04-28 06:05:36,491 INFO L290 TraceCheckUtils]: 18: Hoare triple {151308#(< ~counter~0 85)} assume !!(#t~post6 < 100);havoc #t~post6; {151308#(< ~counter~0 85)} is VALID [2022-04-28 06:05:36,493 INFO L290 TraceCheckUtils]: 17: Hoare triple {151333#(< ~counter~0 84)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {151308#(< ~counter~0 85)} is VALID [2022-04-28 06:05:36,493 INFO L290 TraceCheckUtils]: 16: Hoare triple {151333#(< ~counter~0 84)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {151333#(< ~counter~0 84)} is VALID [2022-04-28 06:05:36,493 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {150432#true} {151333#(< ~counter~0 84)} #92#return; {151333#(< ~counter~0 84)} is VALID [2022-04-28 06:05:36,493 INFO L290 TraceCheckUtils]: 14: Hoare triple {150432#true} assume true; {150432#true} is VALID [2022-04-28 06:05:36,493 INFO L290 TraceCheckUtils]: 13: Hoare triple {150432#true} assume !(0 == ~cond); {150432#true} is VALID [2022-04-28 06:05:36,493 INFO L290 TraceCheckUtils]: 12: Hoare triple {150432#true} ~cond := #in~cond; {150432#true} is VALID [2022-04-28 06:05:36,493 INFO L272 TraceCheckUtils]: 11: Hoare triple {151333#(< ~counter~0 84)} 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)); {150432#true} is VALID [2022-04-28 06:05:36,494 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {150432#true} {151333#(< ~counter~0 84)} #90#return; {151333#(< ~counter~0 84)} is VALID [2022-04-28 06:05:36,494 INFO L290 TraceCheckUtils]: 9: Hoare triple {150432#true} assume true; {150432#true} is VALID [2022-04-28 06:05:36,494 INFO L290 TraceCheckUtils]: 8: Hoare triple {150432#true} assume !(0 == ~cond); {150432#true} is VALID [2022-04-28 06:05:36,494 INFO L290 TraceCheckUtils]: 7: Hoare triple {150432#true} ~cond := #in~cond; {150432#true} is VALID [2022-04-28 06:05:36,494 INFO L272 TraceCheckUtils]: 6: Hoare triple {151333#(< ~counter~0 84)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {150432#true} is VALID [2022-04-28 06:05:36,494 INFO L290 TraceCheckUtils]: 5: Hoare triple {151333#(< ~counter~0 84)} 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; {151333#(< ~counter~0 84)} is VALID [2022-04-28 06:05:36,495 INFO L272 TraceCheckUtils]: 4: Hoare triple {151333#(< ~counter~0 84)} call #t~ret9 := main(); {151333#(< ~counter~0 84)} is VALID [2022-04-28 06:05:36,495 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {151333#(< ~counter~0 84)} {150432#true} #102#return; {151333#(< ~counter~0 84)} is VALID [2022-04-28 06:05:36,495 INFO L290 TraceCheckUtils]: 2: Hoare triple {151333#(< ~counter~0 84)} assume true; {151333#(< ~counter~0 84)} is VALID [2022-04-28 06:05:36,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {150432#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; {151333#(< ~counter~0 84)} is VALID [2022-04-28 06:05:36,496 INFO L272 TraceCheckUtils]: 0: Hoare triple {150432#true} call ULTIMATE.init(); {150432#true} is VALID [2022-04-28 06:05:36,496 INFO L134 CoverageAnalysis]: Checked inductivity of 696 backedges. 38 proven. 174 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2022-04-28 06:05:36,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:05:36,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669700349] [2022-04-28 06:05:36,496 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:05:36,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733413832] [2022-04-28 06:05:36,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733413832] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:05:36,497 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:05:36,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38 [2022-04-28 06:05:36,497 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:05:36,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [821082956] [2022-04-28 06:05:36,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [821082956] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:05:36,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:05:36,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 06:05:36,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952034138] [2022-04-28 06:05:36,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:05:36,498 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.5) internal successors, (110), 19 states have internal predecessors, (110), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) Word has length 153 [2022-04-28 06:05:36,498 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:05:36,498 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 5.5) internal successors, (110), 19 states have internal predecessors, (110), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-28 06:05:36,696 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:05:36,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 06:05:36,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:05:36,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 06:05:36,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=635, Invalid=771, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 06:05:36,698 INFO L87 Difference]: Start difference. First operand 819 states and 1096 transitions. Second operand has 20 states, 20 states have (on average 5.5) internal successors, (110), 19 states have internal predecessors, (110), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-28 06:05:42,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:05:42,698 INFO L93 Difference]: Finished difference Result 1023 states and 1398 transitions. [2022-04-28 06:05:42,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-28 06:05:42,698 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.5) internal successors, (110), 19 states have internal predecessors, (110), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) Word has length 153 [2022-04-28 06:05:42,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:05:42,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 5.5) internal successors, (110), 19 states have internal predecessors, (110), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-28 06:05:42,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 356 transitions. [2022-04-28 06:05:42,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 5.5) internal successors, (110), 19 states have internal predecessors, (110), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-28 06:05:42,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 356 transitions. [2022-04-28 06:05:42,703 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 356 transitions. [2022-04-28 06:05:43,180 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 356 edges. 356 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:05:43,215 INFO L225 Difference]: With dead ends: 1023 [2022-04-28 06:05:43,215 INFO L226 Difference]: Without dead ends: 845 [2022-04-28 06:05:43,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1125, Invalid=1527, Unknown=0, NotChecked=0, Total=2652 [2022-04-28 06:05:43,216 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 287 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 245 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 06:05:43,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 359 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [245 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 06:05:43,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2022-04-28 06:05:46,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 834. [2022-04-28 06:05:46,277 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:05:46,278 INFO L82 GeneralOperation]: Start isEquivalent. First operand 845 states. Second operand has 834 states, 624 states have (on average 1.1826923076923077) internal successors, (738), 636 states have internal predecessors, (738), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 175 states have call predecessors, (187), 187 states have call successors, (187) [2022-04-28 06:05:46,278 INFO L74 IsIncluded]: Start isIncluded. First operand 845 states. Second operand has 834 states, 624 states have (on average 1.1826923076923077) internal successors, (738), 636 states have internal predecessors, (738), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 175 states have call predecessors, (187), 187 states have call successors, (187) [2022-04-28 06:05:46,279 INFO L87 Difference]: Start difference. First operand 845 states. Second operand has 834 states, 624 states have (on average 1.1826923076923077) internal successors, (738), 636 states have internal predecessors, (738), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 175 states have call predecessors, (187), 187 states have call successors, (187) [2022-04-28 06:05:46,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:05:46,303 INFO L93 Difference]: Finished difference Result 845 states and 1125 transitions. [2022-04-28 06:05:46,303 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1125 transitions. [2022-04-28 06:05:46,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:05:46,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:05:46,305 INFO L74 IsIncluded]: Start isIncluded. First operand has 834 states, 624 states have (on average 1.1826923076923077) internal successors, (738), 636 states have internal predecessors, (738), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 175 states have call predecessors, (187), 187 states have call successors, (187) Second operand 845 states. [2022-04-28 06:05:46,305 INFO L87 Difference]: Start difference. First operand has 834 states, 624 states have (on average 1.1826923076923077) internal successors, (738), 636 states have internal predecessors, (738), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 175 states have call predecessors, (187), 187 states have call successors, (187) Second operand 845 states. [2022-04-28 06:05:46,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:05:46,329 INFO L93 Difference]: Finished difference Result 845 states and 1125 transitions. [2022-04-28 06:05:46,329 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1125 transitions. [2022-04-28 06:05:46,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:05:46,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:05:46,330 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:05:46,330 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:05:46,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 834 states, 624 states have (on average 1.1826923076923077) internal successors, (738), 636 states have internal predecessors, (738), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 175 states have call predecessors, (187), 187 states have call successors, (187) [2022-04-28 06:05:46,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1114 transitions. [2022-04-28 06:05:46,361 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1114 transitions. Word has length 153 [2022-04-28 06:05:46,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:05:46,362 INFO L495 AbstractCegarLoop]: Abstraction has 834 states and 1114 transitions. [2022-04-28 06:05:46,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.5) internal successors, (110), 19 states have internal predecessors, (110), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-28 06:05:46,362 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 834 states and 1114 transitions. [2022-04-28 06:05:59,706 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1114 edges. 1113 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 06:05:59,707 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1114 transitions. [2022-04-28 06:05:59,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-04-28 06:05:59,708 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:05:59,708 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 10, 9, 9, 9, 7, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:05:59,727 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-28 06:05:59,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:05:59,909 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:05:59,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:05:59,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1196851319, now seen corresponding path program 23 times [2022-04-28 06:05:59,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:05:59,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [932702448] [2022-04-28 06:05:59,909 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:05:59,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1196851319, now seen corresponding path program 24 times [2022-04-28 06:05:59,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:05:59,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172355138] [2022-04-28 06:05:59,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:05:59,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:05:59,922 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:05:59,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [191205342] [2022-04-28 06:05:59,922 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 06:05:59,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:05:59,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:05:59,923 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:05:59,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2022-04-28 06:06:00,158 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-28 06:06:00,158 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:06:00,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-28 06:06:00,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:06:00,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:06:01,011 INFO L272 TraceCheckUtils]: 0: Hoare triple {156819#true} call ULTIMATE.init(); {156819#true} is VALID [2022-04-28 06:06:01,012 INFO L290 TraceCheckUtils]: 1: Hoare triple {156819#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; {156827#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:01,012 INFO L290 TraceCheckUtils]: 2: Hoare triple {156827#(<= ~counter~0 0)} assume true; {156827#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:01,013 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {156827#(<= ~counter~0 0)} {156819#true} #102#return; {156827#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:01,013 INFO L272 TraceCheckUtils]: 4: Hoare triple {156827#(<= ~counter~0 0)} call #t~ret9 := main(); {156827#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:01,013 INFO L290 TraceCheckUtils]: 5: Hoare triple {156827#(<= ~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; {156827#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:01,014 INFO L272 TraceCheckUtils]: 6: Hoare triple {156827#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {156827#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:01,014 INFO L290 TraceCheckUtils]: 7: Hoare triple {156827#(<= ~counter~0 0)} ~cond := #in~cond; {156827#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:01,014 INFO L290 TraceCheckUtils]: 8: Hoare triple {156827#(<= ~counter~0 0)} assume !(0 == ~cond); {156827#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:01,014 INFO L290 TraceCheckUtils]: 9: Hoare triple {156827#(<= ~counter~0 0)} assume true; {156827#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:01,015 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {156827#(<= ~counter~0 0)} {156827#(<= ~counter~0 0)} #90#return; {156827#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:01,015 INFO L272 TraceCheckUtils]: 11: Hoare triple {156827#(<= ~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)); {156827#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:01,015 INFO L290 TraceCheckUtils]: 12: Hoare triple {156827#(<= ~counter~0 0)} ~cond := #in~cond; {156827#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:01,016 INFO L290 TraceCheckUtils]: 13: Hoare triple {156827#(<= ~counter~0 0)} assume !(0 == ~cond); {156827#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:01,016 INFO L290 TraceCheckUtils]: 14: Hoare triple {156827#(<= ~counter~0 0)} assume true; {156827#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:01,016 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {156827#(<= ~counter~0 0)} {156827#(<= ~counter~0 0)} #92#return; {156827#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:01,016 INFO L290 TraceCheckUtils]: 16: Hoare triple {156827#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {156827#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:01,020 INFO L290 TraceCheckUtils]: 17: Hoare triple {156827#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {156876#(<= ~counter~0 1)} is VALID [2022-04-28 06:06:01,020 INFO L290 TraceCheckUtils]: 18: Hoare triple {156876#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {156876#(<= ~counter~0 1)} is VALID [2022-04-28 06:06:01,020 INFO L272 TraceCheckUtils]: 19: Hoare triple {156876#(<= ~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)); {156876#(<= ~counter~0 1)} is VALID [2022-04-28 06:06:01,021 INFO L290 TraceCheckUtils]: 20: Hoare triple {156876#(<= ~counter~0 1)} ~cond := #in~cond; {156876#(<= ~counter~0 1)} is VALID [2022-04-28 06:06:01,021 INFO L290 TraceCheckUtils]: 21: Hoare triple {156876#(<= ~counter~0 1)} assume !(0 == ~cond); {156876#(<= ~counter~0 1)} is VALID [2022-04-28 06:06:01,021 INFO L290 TraceCheckUtils]: 22: Hoare triple {156876#(<= ~counter~0 1)} assume true; {156876#(<= ~counter~0 1)} is VALID [2022-04-28 06:06:01,022 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {156876#(<= ~counter~0 1)} {156876#(<= ~counter~0 1)} #94#return; {156876#(<= ~counter~0 1)} is VALID [2022-04-28 06:06:01,022 INFO L290 TraceCheckUtils]: 24: Hoare triple {156876#(<= ~counter~0 1)} assume !!(0 != ~r~0); {156876#(<= ~counter~0 1)} is VALID [2022-04-28 06:06:01,023 INFO L290 TraceCheckUtils]: 25: Hoare triple {156876#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {156901#(<= ~counter~0 2)} is VALID [2022-04-28 06:06:01,024 INFO L290 TraceCheckUtils]: 26: Hoare triple {156901#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {156901#(<= ~counter~0 2)} is VALID [2022-04-28 06:06:01,024 INFO L272 TraceCheckUtils]: 27: Hoare triple {156901#(<= ~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)); {156901#(<= ~counter~0 2)} is VALID [2022-04-28 06:06:01,025 INFO L290 TraceCheckUtils]: 28: Hoare triple {156901#(<= ~counter~0 2)} ~cond := #in~cond; {156901#(<= ~counter~0 2)} is VALID [2022-04-28 06:06:01,025 INFO L290 TraceCheckUtils]: 29: Hoare triple {156901#(<= ~counter~0 2)} assume !(0 == ~cond); {156901#(<= ~counter~0 2)} is VALID [2022-04-28 06:06:01,025 INFO L290 TraceCheckUtils]: 30: Hoare triple {156901#(<= ~counter~0 2)} assume true; {156901#(<= ~counter~0 2)} is VALID [2022-04-28 06:06:01,026 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {156901#(<= ~counter~0 2)} {156901#(<= ~counter~0 2)} #96#return; {156901#(<= ~counter~0 2)} is VALID [2022-04-28 06:06:01,026 INFO L290 TraceCheckUtils]: 32: Hoare triple {156901#(<= ~counter~0 2)} assume !(~r~0 > 0); {156901#(<= ~counter~0 2)} is VALID [2022-04-28 06:06:01,028 INFO L290 TraceCheckUtils]: 33: Hoare triple {156901#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {156926#(<= ~counter~0 3)} is VALID [2022-04-28 06:06:01,028 INFO L290 TraceCheckUtils]: 34: Hoare triple {156926#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {156926#(<= ~counter~0 3)} is VALID [2022-04-28 06:06:01,029 INFO L272 TraceCheckUtils]: 35: Hoare triple {156926#(<= ~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)); {156926#(<= ~counter~0 3)} is VALID [2022-04-28 06:06:01,029 INFO L290 TraceCheckUtils]: 36: Hoare triple {156926#(<= ~counter~0 3)} ~cond := #in~cond; {156926#(<= ~counter~0 3)} is VALID [2022-04-28 06:06:01,029 INFO L290 TraceCheckUtils]: 37: Hoare triple {156926#(<= ~counter~0 3)} assume !(0 == ~cond); {156926#(<= ~counter~0 3)} is VALID [2022-04-28 06:06:01,030 INFO L290 TraceCheckUtils]: 38: Hoare triple {156926#(<= ~counter~0 3)} assume true; {156926#(<= ~counter~0 3)} is VALID [2022-04-28 06:06:01,030 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {156926#(<= ~counter~0 3)} {156926#(<= ~counter~0 3)} #98#return; {156926#(<= ~counter~0 3)} is VALID [2022-04-28 06:06:01,030 INFO L290 TraceCheckUtils]: 40: Hoare triple {156926#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {156926#(<= ~counter~0 3)} is VALID [2022-04-28 06:06:01,032 INFO L290 TraceCheckUtils]: 41: Hoare triple {156926#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {156951#(<= ~counter~0 4)} is VALID [2022-04-28 06:06:01,032 INFO L290 TraceCheckUtils]: 42: Hoare triple {156951#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {156951#(<= ~counter~0 4)} is VALID [2022-04-28 06:06:01,033 INFO L272 TraceCheckUtils]: 43: Hoare triple {156951#(<= ~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)); {156951#(<= ~counter~0 4)} is VALID [2022-04-28 06:06:01,033 INFO L290 TraceCheckUtils]: 44: Hoare triple {156951#(<= ~counter~0 4)} ~cond := #in~cond; {156951#(<= ~counter~0 4)} is VALID [2022-04-28 06:06:01,033 INFO L290 TraceCheckUtils]: 45: Hoare triple {156951#(<= ~counter~0 4)} assume !(0 == ~cond); {156951#(<= ~counter~0 4)} is VALID [2022-04-28 06:06:01,034 INFO L290 TraceCheckUtils]: 46: Hoare triple {156951#(<= ~counter~0 4)} assume true; {156951#(<= ~counter~0 4)} is VALID [2022-04-28 06:06:01,034 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {156951#(<= ~counter~0 4)} {156951#(<= ~counter~0 4)} #98#return; {156951#(<= ~counter~0 4)} is VALID [2022-04-28 06:06:01,042 INFO L290 TraceCheckUtils]: 48: Hoare triple {156951#(<= ~counter~0 4)} assume !(~r~0 < 0); {156951#(<= ~counter~0 4)} is VALID [2022-04-28 06:06:01,045 INFO L290 TraceCheckUtils]: 49: Hoare triple {156951#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {156976#(<= ~counter~0 5)} is VALID [2022-04-28 06:06:01,046 INFO L290 TraceCheckUtils]: 50: Hoare triple {156976#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {156976#(<= ~counter~0 5)} is VALID [2022-04-28 06:06:01,046 INFO L272 TraceCheckUtils]: 51: Hoare triple {156976#(<= ~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)); {156976#(<= ~counter~0 5)} is VALID [2022-04-28 06:06:01,047 INFO L290 TraceCheckUtils]: 52: Hoare triple {156976#(<= ~counter~0 5)} ~cond := #in~cond; {156976#(<= ~counter~0 5)} is VALID [2022-04-28 06:06:01,047 INFO L290 TraceCheckUtils]: 53: Hoare triple {156976#(<= ~counter~0 5)} assume !(0 == ~cond); {156976#(<= ~counter~0 5)} is VALID [2022-04-28 06:06:01,047 INFO L290 TraceCheckUtils]: 54: Hoare triple {156976#(<= ~counter~0 5)} assume true; {156976#(<= ~counter~0 5)} is VALID [2022-04-28 06:06:01,048 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {156976#(<= ~counter~0 5)} {156976#(<= ~counter~0 5)} #94#return; {156976#(<= ~counter~0 5)} is VALID [2022-04-28 06:06:01,048 INFO L290 TraceCheckUtils]: 56: Hoare triple {156976#(<= ~counter~0 5)} assume !!(0 != ~r~0); {156976#(<= ~counter~0 5)} is VALID [2022-04-28 06:06:01,049 INFO L290 TraceCheckUtils]: 57: Hoare triple {156976#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157001#(<= ~counter~0 6)} is VALID [2022-04-28 06:06:01,050 INFO L290 TraceCheckUtils]: 58: Hoare triple {157001#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {157001#(<= ~counter~0 6)} is VALID [2022-04-28 06:06:01,050 INFO L272 TraceCheckUtils]: 59: Hoare triple {157001#(<= ~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)); {157001#(<= ~counter~0 6)} is VALID [2022-04-28 06:06:01,050 INFO L290 TraceCheckUtils]: 60: Hoare triple {157001#(<= ~counter~0 6)} ~cond := #in~cond; {157001#(<= ~counter~0 6)} is VALID [2022-04-28 06:06:01,051 INFO L290 TraceCheckUtils]: 61: Hoare triple {157001#(<= ~counter~0 6)} assume !(0 == ~cond); {157001#(<= ~counter~0 6)} is VALID [2022-04-28 06:06:01,051 INFO L290 TraceCheckUtils]: 62: Hoare triple {157001#(<= ~counter~0 6)} assume true; {157001#(<= ~counter~0 6)} is VALID [2022-04-28 06:06:01,051 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {157001#(<= ~counter~0 6)} {157001#(<= ~counter~0 6)} #96#return; {157001#(<= ~counter~0 6)} is VALID [2022-04-28 06:06:01,052 INFO L290 TraceCheckUtils]: 64: Hoare triple {157001#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {157001#(<= ~counter~0 6)} is VALID [2022-04-28 06:06:01,053 INFO L290 TraceCheckUtils]: 65: Hoare triple {157001#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157026#(<= ~counter~0 7)} is VALID [2022-04-28 06:06:01,053 INFO L290 TraceCheckUtils]: 66: Hoare triple {157026#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {157026#(<= ~counter~0 7)} is VALID [2022-04-28 06:06:01,054 INFO L272 TraceCheckUtils]: 67: Hoare triple {157026#(<= ~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)); {157026#(<= ~counter~0 7)} is VALID [2022-04-28 06:06:01,054 INFO L290 TraceCheckUtils]: 68: Hoare triple {157026#(<= ~counter~0 7)} ~cond := #in~cond; {157026#(<= ~counter~0 7)} is VALID [2022-04-28 06:06:01,054 INFO L290 TraceCheckUtils]: 69: Hoare triple {157026#(<= ~counter~0 7)} assume !(0 == ~cond); {157026#(<= ~counter~0 7)} is VALID [2022-04-28 06:06:01,054 INFO L290 TraceCheckUtils]: 70: Hoare triple {157026#(<= ~counter~0 7)} assume true; {157026#(<= ~counter~0 7)} is VALID [2022-04-28 06:06:01,055 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {157026#(<= ~counter~0 7)} {157026#(<= ~counter~0 7)} #96#return; {157026#(<= ~counter~0 7)} is VALID [2022-04-28 06:06:01,055 INFO L290 TraceCheckUtils]: 72: Hoare triple {157026#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {157026#(<= ~counter~0 7)} is VALID [2022-04-28 06:06:01,057 INFO L290 TraceCheckUtils]: 73: Hoare triple {157026#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157051#(<= ~counter~0 8)} is VALID [2022-04-28 06:06:01,057 INFO L290 TraceCheckUtils]: 74: Hoare triple {157051#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {157051#(<= ~counter~0 8)} is VALID [2022-04-28 06:06:01,057 INFO L272 TraceCheckUtils]: 75: Hoare triple {157051#(<= ~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)); {157051#(<= ~counter~0 8)} is VALID [2022-04-28 06:06:01,058 INFO L290 TraceCheckUtils]: 76: Hoare triple {157051#(<= ~counter~0 8)} ~cond := #in~cond; {157051#(<= ~counter~0 8)} is VALID [2022-04-28 06:06:01,058 INFO L290 TraceCheckUtils]: 77: Hoare triple {157051#(<= ~counter~0 8)} assume !(0 == ~cond); {157051#(<= ~counter~0 8)} is VALID [2022-04-28 06:06:01,058 INFO L290 TraceCheckUtils]: 78: Hoare triple {157051#(<= ~counter~0 8)} assume true; {157051#(<= ~counter~0 8)} is VALID [2022-04-28 06:06:01,059 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {157051#(<= ~counter~0 8)} {157051#(<= ~counter~0 8)} #96#return; {157051#(<= ~counter~0 8)} is VALID [2022-04-28 06:06:01,059 INFO L290 TraceCheckUtils]: 80: Hoare triple {157051#(<= ~counter~0 8)} assume !(~r~0 > 0); {157051#(<= ~counter~0 8)} is VALID [2022-04-28 06:06:01,062 INFO L290 TraceCheckUtils]: 81: Hoare triple {157051#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {157076#(<= ~counter~0 9)} is VALID [2022-04-28 06:06:01,062 INFO L290 TraceCheckUtils]: 82: Hoare triple {157076#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {157076#(<= ~counter~0 9)} is VALID [2022-04-28 06:06:01,062 INFO L272 TraceCheckUtils]: 83: Hoare triple {157076#(<= ~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)); {157076#(<= ~counter~0 9)} is VALID [2022-04-28 06:06:01,063 INFO L290 TraceCheckUtils]: 84: Hoare triple {157076#(<= ~counter~0 9)} ~cond := #in~cond; {157076#(<= ~counter~0 9)} is VALID [2022-04-28 06:06:01,063 INFO L290 TraceCheckUtils]: 85: Hoare triple {157076#(<= ~counter~0 9)} assume !(0 == ~cond); {157076#(<= ~counter~0 9)} is VALID [2022-04-28 06:06:01,063 INFO L290 TraceCheckUtils]: 86: Hoare triple {157076#(<= ~counter~0 9)} assume true; {157076#(<= ~counter~0 9)} is VALID [2022-04-28 06:06:01,064 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {157076#(<= ~counter~0 9)} {157076#(<= ~counter~0 9)} #98#return; {157076#(<= ~counter~0 9)} is VALID [2022-04-28 06:06:01,064 INFO L290 TraceCheckUtils]: 88: Hoare triple {157076#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {157076#(<= ~counter~0 9)} is VALID [2022-04-28 06:06:01,065 INFO L290 TraceCheckUtils]: 89: Hoare triple {157076#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {157101#(<= ~counter~0 10)} is VALID [2022-04-28 06:06:01,066 INFO L290 TraceCheckUtils]: 90: Hoare triple {157101#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {157101#(<= ~counter~0 10)} is VALID [2022-04-28 06:06:01,066 INFO L272 TraceCheckUtils]: 91: Hoare triple {157101#(<= ~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)); {157101#(<= ~counter~0 10)} is VALID [2022-04-28 06:06:01,066 INFO L290 TraceCheckUtils]: 92: Hoare triple {157101#(<= ~counter~0 10)} ~cond := #in~cond; {157101#(<= ~counter~0 10)} is VALID [2022-04-28 06:06:01,067 INFO L290 TraceCheckUtils]: 93: Hoare triple {157101#(<= ~counter~0 10)} assume !(0 == ~cond); {157101#(<= ~counter~0 10)} is VALID [2022-04-28 06:06:01,067 INFO L290 TraceCheckUtils]: 94: Hoare triple {157101#(<= ~counter~0 10)} assume true; {157101#(<= ~counter~0 10)} is VALID [2022-04-28 06:06:01,067 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {157101#(<= ~counter~0 10)} {157101#(<= ~counter~0 10)} #98#return; {157101#(<= ~counter~0 10)} is VALID [2022-04-28 06:06:01,068 INFO L290 TraceCheckUtils]: 96: Hoare triple {157101#(<= ~counter~0 10)} assume !(~r~0 < 0); {157101#(<= ~counter~0 10)} is VALID [2022-04-28 06:06:01,069 INFO L290 TraceCheckUtils]: 97: Hoare triple {157101#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {157126#(<= ~counter~0 11)} is VALID [2022-04-28 06:06:01,069 INFO L290 TraceCheckUtils]: 98: Hoare triple {157126#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {157126#(<= ~counter~0 11)} is VALID [2022-04-28 06:06:01,070 INFO L272 TraceCheckUtils]: 99: Hoare triple {157126#(<= ~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)); {157126#(<= ~counter~0 11)} is VALID [2022-04-28 06:06:01,070 INFO L290 TraceCheckUtils]: 100: Hoare triple {157126#(<= ~counter~0 11)} ~cond := #in~cond; {157126#(<= ~counter~0 11)} is VALID [2022-04-28 06:06:01,070 INFO L290 TraceCheckUtils]: 101: Hoare triple {157126#(<= ~counter~0 11)} assume !(0 == ~cond); {157126#(<= ~counter~0 11)} is VALID [2022-04-28 06:06:01,070 INFO L290 TraceCheckUtils]: 102: Hoare triple {157126#(<= ~counter~0 11)} assume true; {157126#(<= ~counter~0 11)} is VALID [2022-04-28 06:06:01,071 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {157126#(<= ~counter~0 11)} {157126#(<= ~counter~0 11)} #94#return; {157126#(<= ~counter~0 11)} is VALID [2022-04-28 06:06:01,071 INFO L290 TraceCheckUtils]: 104: Hoare triple {157126#(<= ~counter~0 11)} assume !!(0 != ~r~0); {157126#(<= ~counter~0 11)} is VALID [2022-04-28 06:06:01,072 INFO L290 TraceCheckUtils]: 105: Hoare triple {157126#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157151#(<= ~counter~0 12)} is VALID [2022-04-28 06:06:01,073 INFO L290 TraceCheckUtils]: 106: Hoare triple {157151#(<= ~counter~0 12)} assume !!(#t~post7 < 100);havoc #t~post7; {157151#(<= ~counter~0 12)} is VALID [2022-04-28 06:06:01,073 INFO L272 TraceCheckUtils]: 107: Hoare triple {157151#(<= ~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)); {157151#(<= ~counter~0 12)} is VALID [2022-04-28 06:06:01,073 INFO L290 TraceCheckUtils]: 108: Hoare triple {157151#(<= ~counter~0 12)} ~cond := #in~cond; {157151#(<= ~counter~0 12)} is VALID [2022-04-28 06:06:01,074 INFO L290 TraceCheckUtils]: 109: Hoare triple {157151#(<= ~counter~0 12)} assume !(0 == ~cond); {157151#(<= ~counter~0 12)} is VALID [2022-04-28 06:06:01,074 INFO L290 TraceCheckUtils]: 110: Hoare triple {157151#(<= ~counter~0 12)} assume true; {157151#(<= ~counter~0 12)} is VALID [2022-04-28 06:06:01,074 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {157151#(<= ~counter~0 12)} {157151#(<= ~counter~0 12)} #96#return; {157151#(<= ~counter~0 12)} is VALID [2022-04-28 06:06:01,075 INFO L290 TraceCheckUtils]: 112: Hoare triple {157151#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {157151#(<= ~counter~0 12)} is VALID [2022-04-28 06:06:01,076 INFO L290 TraceCheckUtils]: 113: Hoare triple {157151#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157176#(<= ~counter~0 13)} is VALID [2022-04-28 06:06:01,076 INFO L290 TraceCheckUtils]: 114: Hoare triple {157176#(<= ~counter~0 13)} assume !!(#t~post7 < 100);havoc #t~post7; {157176#(<= ~counter~0 13)} is VALID [2022-04-28 06:06:01,077 INFO L272 TraceCheckUtils]: 115: Hoare triple {157176#(<= ~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)); {157176#(<= ~counter~0 13)} is VALID [2022-04-28 06:06:01,077 INFO L290 TraceCheckUtils]: 116: Hoare triple {157176#(<= ~counter~0 13)} ~cond := #in~cond; {157176#(<= ~counter~0 13)} is VALID [2022-04-28 06:06:01,077 INFO L290 TraceCheckUtils]: 117: Hoare triple {157176#(<= ~counter~0 13)} assume !(0 == ~cond); {157176#(<= ~counter~0 13)} is VALID [2022-04-28 06:06:01,078 INFO L290 TraceCheckUtils]: 118: Hoare triple {157176#(<= ~counter~0 13)} assume true; {157176#(<= ~counter~0 13)} is VALID [2022-04-28 06:06:01,078 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {157176#(<= ~counter~0 13)} {157176#(<= ~counter~0 13)} #96#return; {157176#(<= ~counter~0 13)} is VALID [2022-04-28 06:06:01,078 INFO L290 TraceCheckUtils]: 120: Hoare triple {157176#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {157176#(<= ~counter~0 13)} is VALID [2022-04-28 06:06:01,080 INFO L290 TraceCheckUtils]: 121: Hoare triple {157176#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157201#(<= ~counter~0 14)} is VALID [2022-04-28 06:06:01,080 INFO L290 TraceCheckUtils]: 122: Hoare triple {157201#(<= ~counter~0 14)} assume !!(#t~post7 < 100);havoc #t~post7; {157201#(<= ~counter~0 14)} is VALID [2022-04-28 06:06:01,080 INFO L272 TraceCheckUtils]: 123: Hoare triple {157201#(<= ~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)); {157201#(<= ~counter~0 14)} is VALID [2022-04-28 06:06:01,081 INFO L290 TraceCheckUtils]: 124: Hoare triple {157201#(<= ~counter~0 14)} ~cond := #in~cond; {157201#(<= ~counter~0 14)} is VALID [2022-04-28 06:06:01,081 INFO L290 TraceCheckUtils]: 125: Hoare triple {157201#(<= ~counter~0 14)} assume !(0 == ~cond); {157201#(<= ~counter~0 14)} is VALID [2022-04-28 06:06:01,081 INFO L290 TraceCheckUtils]: 126: Hoare triple {157201#(<= ~counter~0 14)} assume true; {157201#(<= ~counter~0 14)} is VALID [2022-04-28 06:06:01,081 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {157201#(<= ~counter~0 14)} {157201#(<= ~counter~0 14)} #96#return; {157201#(<= ~counter~0 14)} is VALID [2022-04-28 06:06:01,082 INFO L290 TraceCheckUtils]: 128: Hoare triple {157201#(<= ~counter~0 14)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {157201#(<= ~counter~0 14)} is VALID [2022-04-28 06:06:01,083 INFO L290 TraceCheckUtils]: 129: Hoare triple {157201#(<= ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157226#(<= ~counter~0 15)} is VALID [2022-04-28 06:06:01,083 INFO L290 TraceCheckUtils]: 130: Hoare triple {157226#(<= ~counter~0 15)} assume !!(#t~post7 < 100);havoc #t~post7; {157226#(<= ~counter~0 15)} is VALID [2022-04-28 06:06:01,084 INFO L272 TraceCheckUtils]: 131: Hoare triple {157226#(<= ~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)); {157226#(<= ~counter~0 15)} is VALID [2022-04-28 06:06:01,084 INFO L290 TraceCheckUtils]: 132: Hoare triple {157226#(<= ~counter~0 15)} ~cond := #in~cond; {157226#(<= ~counter~0 15)} is VALID [2022-04-28 06:06:01,084 INFO L290 TraceCheckUtils]: 133: Hoare triple {157226#(<= ~counter~0 15)} assume !(0 == ~cond); {157226#(<= ~counter~0 15)} is VALID [2022-04-28 06:06:01,085 INFO L290 TraceCheckUtils]: 134: Hoare triple {157226#(<= ~counter~0 15)} assume true; {157226#(<= ~counter~0 15)} is VALID [2022-04-28 06:06:01,085 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {157226#(<= ~counter~0 15)} {157226#(<= ~counter~0 15)} #96#return; {157226#(<= ~counter~0 15)} is VALID [2022-04-28 06:06:01,085 INFO L290 TraceCheckUtils]: 136: Hoare triple {157226#(<= ~counter~0 15)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {157226#(<= ~counter~0 15)} is VALID [2022-04-28 06:06:01,087 INFO L290 TraceCheckUtils]: 137: Hoare triple {157226#(<= ~counter~0 15)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157251#(<= ~counter~0 16)} is VALID [2022-04-28 06:06:01,087 INFO L290 TraceCheckUtils]: 138: Hoare triple {157251#(<= ~counter~0 16)} assume !!(#t~post7 < 100);havoc #t~post7; {157251#(<= ~counter~0 16)} is VALID [2022-04-28 06:06:01,087 INFO L272 TraceCheckUtils]: 139: Hoare triple {157251#(<= ~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)); {157251#(<= ~counter~0 16)} is VALID [2022-04-28 06:06:01,088 INFO L290 TraceCheckUtils]: 140: Hoare triple {157251#(<= ~counter~0 16)} ~cond := #in~cond; {157251#(<= ~counter~0 16)} is VALID [2022-04-28 06:06:01,088 INFO L290 TraceCheckUtils]: 141: Hoare triple {157251#(<= ~counter~0 16)} assume !(0 == ~cond); {157251#(<= ~counter~0 16)} is VALID [2022-04-28 06:06:01,088 INFO L290 TraceCheckUtils]: 142: Hoare triple {157251#(<= ~counter~0 16)} assume true; {157251#(<= ~counter~0 16)} is VALID [2022-04-28 06:06:01,089 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {157251#(<= ~counter~0 16)} {157251#(<= ~counter~0 16)} #96#return; {157251#(<= ~counter~0 16)} is VALID [2022-04-28 06:06:01,089 INFO L290 TraceCheckUtils]: 144: Hoare triple {157251#(<= ~counter~0 16)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {157251#(<= ~counter~0 16)} is VALID [2022-04-28 06:06:01,089 INFO L290 TraceCheckUtils]: 145: Hoare triple {157251#(<= ~counter~0 16)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157276#(<= |main_#t~post7| 16)} is VALID [2022-04-28 06:06:01,089 INFO L290 TraceCheckUtils]: 146: Hoare triple {157276#(<= |main_#t~post7| 16)} assume !(#t~post7 < 100);havoc #t~post7; {156820#false} is VALID [2022-04-28 06:06:01,090 INFO L290 TraceCheckUtils]: 147: Hoare triple {156820#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {156820#false} is VALID [2022-04-28 06:06:01,090 INFO L290 TraceCheckUtils]: 148: Hoare triple {156820#false} assume !(#t~post8 < 100);havoc #t~post8; {156820#false} is VALID [2022-04-28 06:06:01,090 INFO L290 TraceCheckUtils]: 149: Hoare triple {156820#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {156820#false} is VALID [2022-04-28 06:06:01,090 INFO L290 TraceCheckUtils]: 150: Hoare triple {156820#false} assume !(#t~post6 < 100);havoc #t~post6; {156820#false} is VALID [2022-04-28 06:06:01,090 INFO L272 TraceCheckUtils]: 151: Hoare triple {156820#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)); {156820#false} is VALID [2022-04-28 06:06:01,090 INFO L290 TraceCheckUtils]: 152: Hoare triple {156820#false} ~cond := #in~cond; {156820#false} is VALID [2022-04-28 06:06:01,090 INFO L290 TraceCheckUtils]: 153: Hoare triple {156820#false} assume 0 == ~cond; {156820#false} is VALID [2022-04-28 06:06:01,090 INFO L290 TraceCheckUtils]: 154: Hoare triple {156820#false} assume !false; {156820#false} is VALID [2022-04-28 06:06:01,091 INFO L134 CoverageAnalysis]: Checked inductivity of 728 backedges. 46 proven. 678 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 06:06:01,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:06:02,130 INFO L290 TraceCheckUtils]: 154: Hoare triple {156820#false} assume !false; {156820#false} is VALID [2022-04-28 06:06:02,130 INFO L290 TraceCheckUtils]: 153: Hoare triple {156820#false} assume 0 == ~cond; {156820#false} is VALID [2022-04-28 06:06:02,130 INFO L290 TraceCheckUtils]: 152: Hoare triple {156820#false} ~cond := #in~cond; {156820#false} is VALID [2022-04-28 06:06:02,130 INFO L272 TraceCheckUtils]: 151: Hoare triple {156820#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)); {156820#false} is VALID [2022-04-28 06:06:02,130 INFO L290 TraceCheckUtils]: 150: Hoare triple {156820#false} assume !(#t~post6 < 100);havoc #t~post6; {156820#false} is VALID [2022-04-28 06:06:02,130 INFO L290 TraceCheckUtils]: 149: Hoare triple {156820#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {156820#false} is VALID [2022-04-28 06:06:02,130 INFO L290 TraceCheckUtils]: 148: Hoare triple {156820#false} assume !(#t~post8 < 100);havoc #t~post8; {156820#false} is VALID [2022-04-28 06:06:02,130 INFO L290 TraceCheckUtils]: 147: Hoare triple {156820#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {156820#false} is VALID [2022-04-28 06:06:02,131 INFO L290 TraceCheckUtils]: 146: Hoare triple {157328#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {156820#false} is VALID [2022-04-28 06:06:02,131 INFO L290 TraceCheckUtils]: 145: Hoare triple {157332#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157328#(< |main_#t~post7| 100)} is VALID [2022-04-28 06:06:02,131 INFO L290 TraceCheckUtils]: 144: Hoare triple {157332#(< ~counter~0 100)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {157332#(< ~counter~0 100)} is VALID [2022-04-28 06:06:02,132 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {156819#true} {157332#(< ~counter~0 100)} #96#return; {157332#(< ~counter~0 100)} is VALID [2022-04-28 06:06:02,132 INFO L290 TraceCheckUtils]: 142: Hoare triple {156819#true} assume true; {156819#true} is VALID [2022-04-28 06:06:02,132 INFO L290 TraceCheckUtils]: 141: Hoare triple {156819#true} assume !(0 == ~cond); {156819#true} is VALID [2022-04-28 06:06:02,132 INFO L290 TraceCheckUtils]: 140: Hoare triple {156819#true} ~cond := #in~cond; {156819#true} is VALID [2022-04-28 06:06:02,132 INFO L272 TraceCheckUtils]: 139: Hoare triple {157332#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156819#true} is VALID [2022-04-28 06:06:02,132 INFO L290 TraceCheckUtils]: 138: Hoare triple {157332#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {157332#(< ~counter~0 100)} is VALID [2022-04-28 06:06:02,135 INFO L290 TraceCheckUtils]: 137: Hoare triple {157357#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157332#(< ~counter~0 100)} is VALID [2022-04-28 06:06:02,136 INFO L290 TraceCheckUtils]: 136: Hoare triple {157357#(< ~counter~0 99)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {157357#(< ~counter~0 99)} is VALID [2022-04-28 06:06:02,136 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {156819#true} {157357#(< ~counter~0 99)} #96#return; {157357#(< ~counter~0 99)} is VALID [2022-04-28 06:06:02,136 INFO L290 TraceCheckUtils]: 134: Hoare triple {156819#true} assume true; {156819#true} is VALID [2022-04-28 06:06:02,136 INFO L290 TraceCheckUtils]: 133: Hoare triple {156819#true} assume !(0 == ~cond); {156819#true} is VALID [2022-04-28 06:06:02,137 INFO L290 TraceCheckUtils]: 132: Hoare triple {156819#true} ~cond := #in~cond; {156819#true} is VALID [2022-04-28 06:06:02,137 INFO L272 TraceCheckUtils]: 131: Hoare triple {157357#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156819#true} is VALID [2022-04-28 06:06:02,137 INFO L290 TraceCheckUtils]: 130: Hoare triple {157357#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {157357#(< ~counter~0 99)} is VALID [2022-04-28 06:06:02,138 INFO L290 TraceCheckUtils]: 129: Hoare triple {157382#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157357#(< ~counter~0 99)} is VALID [2022-04-28 06:06:02,138 INFO L290 TraceCheckUtils]: 128: Hoare triple {157382#(< ~counter~0 98)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {157382#(< ~counter~0 98)} is VALID [2022-04-28 06:06:02,139 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {156819#true} {157382#(< ~counter~0 98)} #96#return; {157382#(< ~counter~0 98)} is VALID [2022-04-28 06:06:02,139 INFO L290 TraceCheckUtils]: 126: Hoare triple {156819#true} assume true; {156819#true} is VALID [2022-04-28 06:06:02,139 INFO L290 TraceCheckUtils]: 125: Hoare triple {156819#true} assume !(0 == ~cond); {156819#true} is VALID [2022-04-28 06:06:02,139 INFO L290 TraceCheckUtils]: 124: Hoare triple {156819#true} ~cond := #in~cond; {156819#true} is VALID [2022-04-28 06:06:02,139 INFO L272 TraceCheckUtils]: 123: Hoare triple {157382#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156819#true} is VALID [2022-04-28 06:06:02,139 INFO L290 TraceCheckUtils]: 122: Hoare triple {157382#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {157382#(< ~counter~0 98)} is VALID [2022-04-28 06:06:02,141 INFO L290 TraceCheckUtils]: 121: Hoare triple {157407#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157382#(< ~counter~0 98)} is VALID [2022-04-28 06:06:02,141 INFO L290 TraceCheckUtils]: 120: Hoare triple {157407#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {157407#(< ~counter~0 97)} is VALID [2022-04-28 06:06:02,141 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {156819#true} {157407#(< ~counter~0 97)} #96#return; {157407#(< ~counter~0 97)} is VALID [2022-04-28 06:06:02,142 INFO L290 TraceCheckUtils]: 118: Hoare triple {156819#true} assume true; {156819#true} is VALID [2022-04-28 06:06:02,142 INFO L290 TraceCheckUtils]: 117: Hoare triple {156819#true} assume !(0 == ~cond); {156819#true} is VALID [2022-04-28 06:06:02,142 INFO L290 TraceCheckUtils]: 116: Hoare triple {156819#true} ~cond := #in~cond; {156819#true} is VALID [2022-04-28 06:06:02,142 INFO L272 TraceCheckUtils]: 115: Hoare triple {157407#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156819#true} is VALID [2022-04-28 06:06:02,142 INFO L290 TraceCheckUtils]: 114: Hoare triple {157407#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {157407#(< ~counter~0 97)} is VALID [2022-04-28 06:06:02,143 INFO L290 TraceCheckUtils]: 113: Hoare triple {157432#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157407#(< ~counter~0 97)} is VALID [2022-04-28 06:06:02,144 INFO L290 TraceCheckUtils]: 112: Hoare triple {157432#(< ~counter~0 96)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {157432#(< ~counter~0 96)} is VALID [2022-04-28 06:06:02,144 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {156819#true} {157432#(< ~counter~0 96)} #96#return; {157432#(< ~counter~0 96)} is VALID [2022-04-28 06:06:02,144 INFO L290 TraceCheckUtils]: 110: Hoare triple {156819#true} assume true; {156819#true} is VALID [2022-04-28 06:06:02,144 INFO L290 TraceCheckUtils]: 109: Hoare triple {156819#true} assume !(0 == ~cond); {156819#true} is VALID [2022-04-28 06:06:02,144 INFO L290 TraceCheckUtils]: 108: Hoare triple {156819#true} ~cond := #in~cond; {156819#true} is VALID [2022-04-28 06:06:02,144 INFO L272 TraceCheckUtils]: 107: Hoare triple {157432#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156819#true} is VALID [2022-04-28 06:06:02,145 INFO L290 TraceCheckUtils]: 106: Hoare triple {157432#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {157432#(< ~counter~0 96)} is VALID [2022-04-28 06:06:02,146 INFO L290 TraceCheckUtils]: 105: Hoare triple {157457#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157432#(< ~counter~0 96)} is VALID [2022-04-28 06:06:02,146 INFO L290 TraceCheckUtils]: 104: Hoare triple {157457#(< ~counter~0 95)} assume !!(0 != ~r~0); {157457#(< ~counter~0 95)} is VALID [2022-04-28 06:06:02,147 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {156819#true} {157457#(< ~counter~0 95)} #94#return; {157457#(< ~counter~0 95)} is VALID [2022-04-28 06:06:02,147 INFO L290 TraceCheckUtils]: 102: Hoare triple {156819#true} assume true; {156819#true} is VALID [2022-04-28 06:06:02,147 INFO L290 TraceCheckUtils]: 101: Hoare triple {156819#true} assume !(0 == ~cond); {156819#true} is VALID [2022-04-28 06:06:02,147 INFO L290 TraceCheckUtils]: 100: Hoare triple {156819#true} ~cond := #in~cond; {156819#true} is VALID [2022-04-28 06:06:02,147 INFO L272 TraceCheckUtils]: 99: Hoare triple {157457#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156819#true} is VALID [2022-04-28 06:06:02,147 INFO L290 TraceCheckUtils]: 98: Hoare triple {157457#(< ~counter~0 95)} assume !!(#t~post6 < 100);havoc #t~post6; {157457#(< ~counter~0 95)} is VALID [2022-04-28 06:06:02,148 INFO L290 TraceCheckUtils]: 97: Hoare triple {157482#(< ~counter~0 94)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {157457#(< ~counter~0 95)} is VALID [2022-04-28 06:06:02,149 INFO L290 TraceCheckUtils]: 96: Hoare triple {157482#(< ~counter~0 94)} assume !(~r~0 < 0); {157482#(< ~counter~0 94)} is VALID [2022-04-28 06:06:02,149 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {156819#true} {157482#(< ~counter~0 94)} #98#return; {157482#(< ~counter~0 94)} is VALID [2022-04-28 06:06:02,149 INFO L290 TraceCheckUtils]: 94: Hoare triple {156819#true} assume true; {156819#true} is VALID [2022-04-28 06:06:02,149 INFO L290 TraceCheckUtils]: 93: Hoare triple {156819#true} assume !(0 == ~cond); {156819#true} is VALID [2022-04-28 06:06:02,149 INFO L290 TraceCheckUtils]: 92: Hoare triple {156819#true} ~cond := #in~cond; {156819#true} is VALID [2022-04-28 06:06:02,149 INFO L272 TraceCheckUtils]: 91: Hoare triple {157482#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156819#true} is VALID [2022-04-28 06:06:02,150 INFO L290 TraceCheckUtils]: 90: Hoare triple {157482#(< ~counter~0 94)} assume !!(#t~post8 < 100);havoc #t~post8; {157482#(< ~counter~0 94)} is VALID [2022-04-28 06:06:02,151 INFO L290 TraceCheckUtils]: 89: Hoare triple {157507#(< ~counter~0 93)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {157482#(< ~counter~0 94)} is VALID [2022-04-28 06:06:02,151 INFO L290 TraceCheckUtils]: 88: Hoare triple {157507#(< ~counter~0 93)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {157507#(< ~counter~0 93)} is VALID [2022-04-28 06:06:02,152 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {156819#true} {157507#(< ~counter~0 93)} #98#return; {157507#(< ~counter~0 93)} is VALID [2022-04-28 06:06:02,152 INFO L290 TraceCheckUtils]: 86: Hoare triple {156819#true} assume true; {156819#true} is VALID [2022-04-28 06:06:02,152 INFO L290 TraceCheckUtils]: 85: Hoare triple {156819#true} assume !(0 == ~cond); {156819#true} is VALID [2022-04-28 06:06:02,152 INFO L290 TraceCheckUtils]: 84: Hoare triple {156819#true} ~cond := #in~cond; {156819#true} is VALID [2022-04-28 06:06:02,152 INFO L272 TraceCheckUtils]: 83: Hoare triple {157507#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156819#true} is VALID [2022-04-28 06:06:02,152 INFO L290 TraceCheckUtils]: 82: Hoare triple {157507#(< ~counter~0 93)} assume !!(#t~post8 < 100);havoc #t~post8; {157507#(< ~counter~0 93)} is VALID [2022-04-28 06:06:02,153 INFO L290 TraceCheckUtils]: 81: Hoare triple {157532#(< ~counter~0 92)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {157507#(< ~counter~0 93)} is VALID [2022-04-28 06:06:02,154 INFO L290 TraceCheckUtils]: 80: Hoare triple {157532#(< ~counter~0 92)} assume !(~r~0 > 0); {157532#(< ~counter~0 92)} is VALID [2022-04-28 06:06:02,154 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {156819#true} {157532#(< ~counter~0 92)} #96#return; {157532#(< ~counter~0 92)} is VALID [2022-04-28 06:06:02,154 INFO L290 TraceCheckUtils]: 78: Hoare triple {156819#true} assume true; {156819#true} is VALID [2022-04-28 06:06:02,154 INFO L290 TraceCheckUtils]: 77: Hoare triple {156819#true} assume !(0 == ~cond); {156819#true} is VALID [2022-04-28 06:06:02,154 INFO L290 TraceCheckUtils]: 76: Hoare triple {156819#true} ~cond := #in~cond; {156819#true} is VALID [2022-04-28 06:06:02,155 INFO L272 TraceCheckUtils]: 75: Hoare triple {157532#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156819#true} is VALID [2022-04-28 06:06:02,155 INFO L290 TraceCheckUtils]: 74: Hoare triple {157532#(< ~counter~0 92)} assume !!(#t~post7 < 100);havoc #t~post7; {157532#(< ~counter~0 92)} is VALID [2022-04-28 06:06:02,156 INFO L290 TraceCheckUtils]: 73: Hoare triple {157557#(< ~counter~0 91)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157532#(< ~counter~0 92)} is VALID [2022-04-28 06:06:02,156 INFO L290 TraceCheckUtils]: 72: Hoare triple {157557#(< ~counter~0 91)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {157557#(< ~counter~0 91)} is VALID [2022-04-28 06:06:02,157 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {156819#true} {157557#(< ~counter~0 91)} #96#return; {157557#(< ~counter~0 91)} is VALID [2022-04-28 06:06:02,157 INFO L290 TraceCheckUtils]: 70: Hoare triple {156819#true} assume true; {156819#true} is VALID [2022-04-28 06:06:02,157 INFO L290 TraceCheckUtils]: 69: Hoare triple {156819#true} assume !(0 == ~cond); {156819#true} is VALID [2022-04-28 06:06:02,157 INFO L290 TraceCheckUtils]: 68: Hoare triple {156819#true} ~cond := #in~cond; {156819#true} is VALID [2022-04-28 06:06:02,157 INFO L272 TraceCheckUtils]: 67: Hoare triple {157557#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156819#true} is VALID [2022-04-28 06:06:02,157 INFO L290 TraceCheckUtils]: 66: Hoare triple {157557#(< ~counter~0 91)} assume !!(#t~post7 < 100);havoc #t~post7; {157557#(< ~counter~0 91)} is VALID [2022-04-28 06:06:02,159 INFO L290 TraceCheckUtils]: 65: Hoare triple {157582#(< ~counter~0 90)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157557#(< ~counter~0 91)} is VALID [2022-04-28 06:06:02,159 INFO L290 TraceCheckUtils]: 64: Hoare triple {157582#(< ~counter~0 90)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {157582#(< ~counter~0 90)} is VALID [2022-04-28 06:06:02,159 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {156819#true} {157582#(< ~counter~0 90)} #96#return; {157582#(< ~counter~0 90)} is VALID [2022-04-28 06:06:02,159 INFO L290 TraceCheckUtils]: 62: Hoare triple {156819#true} assume true; {156819#true} is VALID [2022-04-28 06:06:02,159 INFO L290 TraceCheckUtils]: 61: Hoare triple {156819#true} assume !(0 == ~cond); {156819#true} is VALID [2022-04-28 06:06:02,160 INFO L290 TraceCheckUtils]: 60: Hoare triple {156819#true} ~cond := #in~cond; {156819#true} is VALID [2022-04-28 06:06:02,160 INFO L272 TraceCheckUtils]: 59: Hoare triple {157582#(< ~counter~0 90)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156819#true} is VALID [2022-04-28 06:06:02,160 INFO L290 TraceCheckUtils]: 58: Hoare triple {157582#(< ~counter~0 90)} assume !!(#t~post7 < 100);havoc #t~post7; {157582#(< ~counter~0 90)} is VALID [2022-04-28 06:06:02,161 INFO L290 TraceCheckUtils]: 57: Hoare triple {157607#(< ~counter~0 89)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157582#(< ~counter~0 90)} is VALID [2022-04-28 06:06:02,161 INFO L290 TraceCheckUtils]: 56: Hoare triple {157607#(< ~counter~0 89)} assume !!(0 != ~r~0); {157607#(< ~counter~0 89)} is VALID [2022-04-28 06:06:02,162 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {156819#true} {157607#(< ~counter~0 89)} #94#return; {157607#(< ~counter~0 89)} is VALID [2022-04-28 06:06:02,162 INFO L290 TraceCheckUtils]: 54: Hoare triple {156819#true} assume true; {156819#true} is VALID [2022-04-28 06:06:02,162 INFO L290 TraceCheckUtils]: 53: Hoare triple {156819#true} assume !(0 == ~cond); {156819#true} is VALID [2022-04-28 06:06:02,162 INFO L290 TraceCheckUtils]: 52: Hoare triple {156819#true} ~cond := #in~cond; {156819#true} is VALID [2022-04-28 06:06:02,162 INFO L272 TraceCheckUtils]: 51: Hoare triple {157607#(< ~counter~0 89)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156819#true} is VALID [2022-04-28 06:06:02,162 INFO L290 TraceCheckUtils]: 50: Hoare triple {157607#(< ~counter~0 89)} assume !!(#t~post6 < 100);havoc #t~post6; {157607#(< ~counter~0 89)} is VALID [2022-04-28 06:06:02,164 INFO L290 TraceCheckUtils]: 49: Hoare triple {157632#(< ~counter~0 88)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {157607#(< ~counter~0 89)} is VALID [2022-04-28 06:06:02,164 INFO L290 TraceCheckUtils]: 48: Hoare triple {157632#(< ~counter~0 88)} assume !(~r~0 < 0); {157632#(< ~counter~0 88)} is VALID [2022-04-28 06:06:02,164 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {156819#true} {157632#(< ~counter~0 88)} #98#return; {157632#(< ~counter~0 88)} is VALID [2022-04-28 06:06:02,165 INFO L290 TraceCheckUtils]: 46: Hoare triple {156819#true} assume true; {156819#true} is VALID [2022-04-28 06:06:02,165 INFO L290 TraceCheckUtils]: 45: Hoare triple {156819#true} assume !(0 == ~cond); {156819#true} is VALID [2022-04-28 06:06:02,165 INFO L290 TraceCheckUtils]: 44: Hoare triple {156819#true} ~cond := #in~cond; {156819#true} is VALID [2022-04-28 06:06:02,165 INFO L272 TraceCheckUtils]: 43: Hoare triple {157632#(< ~counter~0 88)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156819#true} is VALID [2022-04-28 06:06:02,165 INFO L290 TraceCheckUtils]: 42: Hoare triple {157632#(< ~counter~0 88)} assume !!(#t~post8 < 100);havoc #t~post8; {157632#(< ~counter~0 88)} is VALID [2022-04-28 06:06:02,166 INFO L290 TraceCheckUtils]: 41: Hoare triple {157657#(< ~counter~0 87)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {157632#(< ~counter~0 88)} is VALID [2022-04-28 06:06:02,166 INFO L290 TraceCheckUtils]: 40: Hoare triple {157657#(< ~counter~0 87)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {157657#(< ~counter~0 87)} is VALID [2022-04-28 06:06:02,167 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {156819#true} {157657#(< ~counter~0 87)} #98#return; {157657#(< ~counter~0 87)} is VALID [2022-04-28 06:06:02,167 INFO L290 TraceCheckUtils]: 38: Hoare triple {156819#true} assume true; {156819#true} is VALID [2022-04-28 06:06:02,167 INFO L290 TraceCheckUtils]: 37: Hoare triple {156819#true} assume !(0 == ~cond); {156819#true} is VALID [2022-04-28 06:06:02,167 INFO L290 TraceCheckUtils]: 36: Hoare triple {156819#true} ~cond := #in~cond; {156819#true} is VALID [2022-04-28 06:06:02,167 INFO L272 TraceCheckUtils]: 35: Hoare triple {157657#(< ~counter~0 87)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156819#true} is VALID [2022-04-28 06:06:02,168 INFO L290 TraceCheckUtils]: 34: Hoare triple {157657#(< ~counter~0 87)} assume !!(#t~post8 < 100);havoc #t~post8; {157657#(< ~counter~0 87)} is VALID [2022-04-28 06:06:02,169 INFO L290 TraceCheckUtils]: 33: Hoare triple {157682#(< ~counter~0 86)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {157657#(< ~counter~0 87)} is VALID [2022-04-28 06:06:02,169 INFO L290 TraceCheckUtils]: 32: Hoare triple {157682#(< ~counter~0 86)} assume !(~r~0 > 0); {157682#(< ~counter~0 86)} is VALID [2022-04-28 06:06:02,170 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {156819#true} {157682#(< ~counter~0 86)} #96#return; {157682#(< ~counter~0 86)} is VALID [2022-04-28 06:06:02,170 INFO L290 TraceCheckUtils]: 30: Hoare triple {156819#true} assume true; {156819#true} is VALID [2022-04-28 06:06:02,170 INFO L290 TraceCheckUtils]: 29: Hoare triple {156819#true} assume !(0 == ~cond); {156819#true} is VALID [2022-04-28 06:06:02,170 INFO L290 TraceCheckUtils]: 28: Hoare triple {156819#true} ~cond := #in~cond; {156819#true} is VALID [2022-04-28 06:06:02,170 INFO L272 TraceCheckUtils]: 27: Hoare triple {157682#(< ~counter~0 86)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156819#true} is VALID [2022-04-28 06:06:02,170 INFO L290 TraceCheckUtils]: 26: Hoare triple {157682#(< ~counter~0 86)} assume !!(#t~post7 < 100);havoc #t~post7; {157682#(< ~counter~0 86)} is VALID [2022-04-28 06:06:02,172 INFO L290 TraceCheckUtils]: 25: Hoare triple {157707#(< ~counter~0 85)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157682#(< ~counter~0 86)} is VALID [2022-04-28 06:06:02,172 INFO L290 TraceCheckUtils]: 24: Hoare triple {157707#(< ~counter~0 85)} assume !!(0 != ~r~0); {157707#(< ~counter~0 85)} is VALID [2022-04-28 06:06:02,173 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {156819#true} {157707#(< ~counter~0 85)} #94#return; {157707#(< ~counter~0 85)} is VALID [2022-04-28 06:06:02,173 INFO L290 TraceCheckUtils]: 22: Hoare triple {156819#true} assume true; {156819#true} is VALID [2022-04-28 06:06:02,173 INFO L290 TraceCheckUtils]: 21: Hoare triple {156819#true} assume !(0 == ~cond); {156819#true} is VALID [2022-04-28 06:06:02,173 INFO L290 TraceCheckUtils]: 20: Hoare triple {156819#true} ~cond := #in~cond; {156819#true} is VALID [2022-04-28 06:06:02,173 INFO L272 TraceCheckUtils]: 19: Hoare triple {157707#(< ~counter~0 85)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {156819#true} is VALID [2022-04-28 06:06:02,173 INFO L290 TraceCheckUtils]: 18: Hoare triple {157707#(< ~counter~0 85)} assume !!(#t~post6 < 100);havoc #t~post6; {157707#(< ~counter~0 85)} is VALID [2022-04-28 06:06:02,175 INFO L290 TraceCheckUtils]: 17: Hoare triple {157732#(< ~counter~0 84)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {157707#(< ~counter~0 85)} is VALID [2022-04-28 06:06:02,175 INFO L290 TraceCheckUtils]: 16: Hoare triple {157732#(< ~counter~0 84)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {157732#(< ~counter~0 84)} is VALID [2022-04-28 06:06:02,176 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {156819#true} {157732#(< ~counter~0 84)} #92#return; {157732#(< ~counter~0 84)} is VALID [2022-04-28 06:06:02,176 INFO L290 TraceCheckUtils]: 14: Hoare triple {156819#true} assume true; {156819#true} is VALID [2022-04-28 06:06:02,176 INFO L290 TraceCheckUtils]: 13: Hoare triple {156819#true} assume !(0 == ~cond); {156819#true} is VALID [2022-04-28 06:06:02,176 INFO L290 TraceCheckUtils]: 12: Hoare triple {156819#true} ~cond := #in~cond; {156819#true} is VALID [2022-04-28 06:06:02,176 INFO L272 TraceCheckUtils]: 11: Hoare triple {157732#(< ~counter~0 84)} 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)); {156819#true} is VALID [2022-04-28 06:06:02,176 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {156819#true} {157732#(< ~counter~0 84)} #90#return; {157732#(< ~counter~0 84)} is VALID [2022-04-28 06:06:02,176 INFO L290 TraceCheckUtils]: 9: Hoare triple {156819#true} assume true; {156819#true} is VALID [2022-04-28 06:06:02,177 INFO L290 TraceCheckUtils]: 8: Hoare triple {156819#true} assume !(0 == ~cond); {156819#true} is VALID [2022-04-28 06:06:02,177 INFO L290 TraceCheckUtils]: 7: Hoare triple {156819#true} ~cond := #in~cond; {156819#true} is VALID [2022-04-28 06:06:02,177 INFO L272 TraceCheckUtils]: 6: Hoare triple {157732#(< ~counter~0 84)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {156819#true} is VALID [2022-04-28 06:06:02,177 INFO L290 TraceCheckUtils]: 5: Hoare triple {157732#(< ~counter~0 84)} 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; {157732#(< ~counter~0 84)} is VALID [2022-04-28 06:06:02,177 INFO L272 TraceCheckUtils]: 4: Hoare triple {157732#(< ~counter~0 84)} call #t~ret9 := main(); {157732#(< ~counter~0 84)} is VALID [2022-04-28 06:06:02,178 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {157732#(< ~counter~0 84)} {156819#true} #102#return; {157732#(< ~counter~0 84)} is VALID [2022-04-28 06:06:02,178 INFO L290 TraceCheckUtils]: 2: Hoare triple {157732#(< ~counter~0 84)} assume true; {157732#(< ~counter~0 84)} is VALID [2022-04-28 06:06:02,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {156819#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; {157732#(< ~counter~0 84)} is VALID [2022-04-28 06:06:02,178 INFO L272 TraceCheckUtils]: 0: Hoare triple {156819#true} call ULTIMATE.init(); {156819#true} is VALID [2022-04-28 06:06:02,179 INFO L134 CoverageAnalysis]: Checked inductivity of 728 backedges. 46 proven. 198 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2022-04-28 06:06:02,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:06:02,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172355138] [2022-04-28 06:06:02,179 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:06:02,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191205342] [2022-04-28 06:06:02,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [191205342] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:06:02,180 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:06:02,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38 [2022-04-28 06:06:02,180 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:06:02,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [932702448] [2022-04-28 06:06:02,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [932702448] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:06:02,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:06:02,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 06:06:02,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835154428] [2022-04-28 06:06:02,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:06:02,181 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.6) internal successors, (112), 19 states have internal predecessors, (112), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) Word has length 155 [2022-04-28 06:06:02,181 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:06:02,181 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 5.6) internal successors, (112), 19 states have internal predecessors, (112), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-28 06:06:02,355 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:06:02,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 06:06:02,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:06:02,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 06:06:02,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=635, Invalid=771, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 06:06:02,356 INFO L87 Difference]: Start difference. First operand 834 states and 1114 transitions. Second operand has 20 states, 20 states have (on average 5.6) internal successors, (112), 19 states have internal predecessors, (112), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-28 06:06:07,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:06:07,955 INFO L93 Difference]: Finished difference Result 1021 states and 1392 transitions. [2022-04-28 06:06:07,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-28 06:06:07,955 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.6) internal successors, (112), 19 states have internal predecessors, (112), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) Word has length 155 [2022-04-28 06:06:07,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:06:07,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 5.6) internal successors, (112), 19 states have internal predecessors, (112), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-28 06:06:07,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 356 transitions. [2022-04-28 06:06:07,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 5.6) internal successors, (112), 19 states have internal predecessors, (112), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-28 06:06:07,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 356 transitions. [2022-04-28 06:06:07,961 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 356 transitions. [2022-04-28 06:06:08,412 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 356 edges. 356 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:06:08,442 INFO L225 Difference]: With dead ends: 1021 [2022-04-28 06:06:08,442 INFO L226 Difference]: Without dead ends: 851 [2022-04-28 06:06:08,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1175, Invalid=1581, Unknown=0, NotChecked=0, Total=2756 [2022-04-28 06:06:08,443 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 243 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 06:06:08,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 357 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 06:06:08,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2022-04-28 06:06:11,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 851. [2022-04-28 06:06:11,695 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:06:11,696 INFO L82 GeneralOperation]: Start isEquivalent. First operand 851 states. Second operand has 851 states, 641 states have (on average 1.1778471138845554) internal successors, (755), 648 states have internal predecessors, (755), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 180 states have call predecessors, (187), 187 states have call successors, (187) [2022-04-28 06:06:11,697 INFO L74 IsIncluded]: Start isIncluded. First operand 851 states. Second operand has 851 states, 641 states have (on average 1.1778471138845554) internal successors, (755), 648 states have internal predecessors, (755), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 180 states have call predecessors, (187), 187 states have call successors, (187) [2022-04-28 06:06:11,697 INFO L87 Difference]: Start difference. First operand 851 states. Second operand has 851 states, 641 states have (on average 1.1778471138845554) internal successors, (755), 648 states have internal predecessors, (755), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 180 states have call predecessors, (187), 187 states have call successors, (187) [2022-04-28 06:06:11,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:06:11,723 INFO L93 Difference]: Finished difference Result 851 states and 1131 transitions. [2022-04-28 06:06:11,723 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1131 transitions. [2022-04-28 06:06:11,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:06:11,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:06:11,725 INFO L74 IsIncluded]: Start isIncluded. First operand has 851 states, 641 states have (on average 1.1778471138845554) internal successors, (755), 648 states have internal predecessors, (755), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 180 states have call predecessors, (187), 187 states have call successors, (187) Second operand 851 states. [2022-04-28 06:06:11,725 INFO L87 Difference]: Start difference. First operand has 851 states, 641 states have (on average 1.1778471138845554) internal successors, (755), 648 states have internal predecessors, (755), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 180 states have call predecessors, (187), 187 states have call successors, (187) Second operand 851 states. [2022-04-28 06:06:11,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:06:11,749 INFO L93 Difference]: Finished difference Result 851 states and 1131 transitions. [2022-04-28 06:06:11,749 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1131 transitions. [2022-04-28 06:06:11,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:06:11,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:06:11,750 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:06:11,750 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:06:11,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 851 states, 641 states have (on average 1.1778471138845554) internal successors, (755), 648 states have internal predecessors, (755), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 180 states have call predecessors, (187), 187 states have call successors, (187) [2022-04-28 06:06:11,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1131 transitions. [2022-04-28 06:06:11,782 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1131 transitions. Word has length 155 [2022-04-28 06:06:11,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:06:11,782 INFO L495 AbstractCegarLoop]: Abstraction has 851 states and 1131 transitions. [2022-04-28 06:06:11,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.6) internal successors, (112), 19 states have internal predecessors, (112), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-28 06:06:11,783 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 851 states and 1131 transitions. [2022-04-28 06:06:24,247 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1131 edges. 1131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:06:24,247 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1131 transitions. [2022-04-28 06:06:24,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-04-28 06:06:24,249 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:06:24,249 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 8, 8, 8, 8, 6, 6, 6, 6, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:06:24,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Ended with exit code 0 [2022-04-28 06:06:24,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:06:24,449 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:06:24,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:06:24,450 INFO L85 PathProgramCache]: Analyzing trace with hash -61113684, now seen corresponding path program 17 times [2022-04-28 06:06:24,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:06:24,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [648030772] [2022-04-28 06:06:24,450 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:06:24,450 INFO L85 PathProgramCache]: Analyzing trace with hash -61113684, now seen corresponding path program 18 times [2022-04-28 06:06:24,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:06:24,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651985916] [2022-04-28 06:06:24,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:06:24,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:06:24,463 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:06:24,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2044091947] [2022-04-28 06:06:24,463 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 06:06:24,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:06:24,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:06:24,464 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:06:24,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2022-04-28 06:06:25,169 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-28 06:06:25,169 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:06:25,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-28 06:06:25,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:06:25,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:06:26,121 INFO L272 TraceCheckUtils]: 0: Hoare triple {163262#true} call ULTIMATE.init(); {163262#true} is VALID [2022-04-28 06:06:26,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {163262#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; {163270#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:26,122 INFO L290 TraceCheckUtils]: 2: Hoare triple {163270#(<= ~counter~0 0)} assume true; {163270#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:26,122 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {163270#(<= ~counter~0 0)} {163262#true} #102#return; {163270#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:26,123 INFO L272 TraceCheckUtils]: 4: Hoare triple {163270#(<= ~counter~0 0)} call #t~ret9 := main(); {163270#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:26,123 INFO L290 TraceCheckUtils]: 5: Hoare triple {163270#(<= ~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; {163270#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:26,123 INFO L272 TraceCheckUtils]: 6: Hoare triple {163270#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {163270#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:26,124 INFO L290 TraceCheckUtils]: 7: Hoare triple {163270#(<= ~counter~0 0)} ~cond := #in~cond; {163270#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:26,124 INFO L290 TraceCheckUtils]: 8: Hoare triple {163270#(<= ~counter~0 0)} assume !(0 == ~cond); {163270#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:26,124 INFO L290 TraceCheckUtils]: 9: Hoare triple {163270#(<= ~counter~0 0)} assume true; {163270#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:26,125 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {163270#(<= ~counter~0 0)} {163270#(<= ~counter~0 0)} #90#return; {163270#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:26,125 INFO L272 TraceCheckUtils]: 11: Hoare triple {163270#(<= ~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)); {163270#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:26,125 INFO L290 TraceCheckUtils]: 12: Hoare triple {163270#(<= ~counter~0 0)} ~cond := #in~cond; {163270#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:26,125 INFO L290 TraceCheckUtils]: 13: Hoare triple {163270#(<= ~counter~0 0)} assume !(0 == ~cond); {163270#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:26,126 INFO L290 TraceCheckUtils]: 14: Hoare triple {163270#(<= ~counter~0 0)} assume true; {163270#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:26,126 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {163270#(<= ~counter~0 0)} {163270#(<= ~counter~0 0)} #92#return; {163270#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:26,126 INFO L290 TraceCheckUtils]: 16: Hoare triple {163270#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {163270#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:26,129 INFO L290 TraceCheckUtils]: 17: Hoare triple {163270#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {163319#(<= ~counter~0 1)} is VALID [2022-04-28 06:06:26,130 INFO L290 TraceCheckUtils]: 18: Hoare triple {163319#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {163319#(<= ~counter~0 1)} is VALID [2022-04-28 06:06:26,130 INFO L272 TraceCheckUtils]: 19: Hoare triple {163319#(<= ~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)); {163319#(<= ~counter~0 1)} is VALID [2022-04-28 06:06:26,130 INFO L290 TraceCheckUtils]: 20: Hoare triple {163319#(<= ~counter~0 1)} ~cond := #in~cond; {163319#(<= ~counter~0 1)} is VALID [2022-04-28 06:06:26,131 INFO L290 TraceCheckUtils]: 21: Hoare triple {163319#(<= ~counter~0 1)} assume !(0 == ~cond); {163319#(<= ~counter~0 1)} is VALID [2022-04-28 06:06:26,131 INFO L290 TraceCheckUtils]: 22: Hoare triple {163319#(<= ~counter~0 1)} assume true; {163319#(<= ~counter~0 1)} is VALID [2022-04-28 06:06:26,131 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {163319#(<= ~counter~0 1)} {163319#(<= ~counter~0 1)} #94#return; {163319#(<= ~counter~0 1)} is VALID [2022-04-28 06:06:26,132 INFO L290 TraceCheckUtils]: 24: Hoare triple {163319#(<= ~counter~0 1)} assume !!(0 != ~r~0); {163319#(<= ~counter~0 1)} is VALID [2022-04-28 06:06:26,133 INFO L290 TraceCheckUtils]: 25: Hoare triple {163319#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {163344#(<= ~counter~0 2)} is VALID [2022-04-28 06:06:26,133 INFO L290 TraceCheckUtils]: 26: Hoare triple {163344#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {163344#(<= ~counter~0 2)} is VALID [2022-04-28 06:06:26,134 INFO L272 TraceCheckUtils]: 27: Hoare triple {163344#(<= ~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)); {163344#(<= ~counter~0 2)} is VALID [2022-04-28 06:06:26,134 INFO L290 TraceCheckUtils]: 28: Hoare triple {163344#(<= ~counter~0 2)} ~cond := #in~cond; {163344#(<= ~counter~0 2)} is VALID [2022-04-28 06:06:26,134 INFO L290 TraceCheckUtils]: 29: Hoare triple {163344#(<= ~counter~0 2)} assume !(0 == ~cond); {163344#(<= ~counter~0 2)} is VALID [2022-04-28 06:06:26,135 INFO L290 TraceCheckUtils]: 30: Hoare triple {163344#(<= ~counter~0 2)} assume true; {163344#(<= ~counter~0 2)} is VALID [2022-04-28 06:06:26,135 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {163344#(<= ~counter~0 2)} {163344#(<= ~counter~0 2)} #96#return; {163344#(<= ~counter~0 2)} is VALID [2022-04-28 06:06:26,135 INFO L290 TraceCheckUtils]: 32: Hoare triple {163344#(<= ~counter~0 2)} assume !(~r~0 > 0); {163344#(<= ~counter~0 2)} is VALID [2022-04-28 06:06:26,137 INFO L290 TraceCheckUtils]: 33: Hoare triple {163344#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {163369#(<= ~counter~0 3)} is VALID [2022-04-28 06:06:26,137 INFO L290 TraceCheckUtils]: 34: Hoare triple {163369#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {163369#(<= ~counter~0 3)} is VALID [2022-04-28 06:06:26,137 INFO L272 TraceCheckUtils]: 35: Hoare triple {163369#(<= ~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)); {163369#(<= ~counter~0 3)} is VALID [2022-04-28 06:06:26,138 INFO L290 TraceCheckUtils]: 36: Hoare triple {163369#(<= ~counter~0 3)} ~cond := #in~cond; {163369#(<= ~counter~0 3)} is VALID [2022-04-28 06:06:26,138 INFO L290 TraceCheckUtils]: 37: Hoare triple {163369#(<= ~counter~0 3)} assume !(0 == ~cond); {163369#(<= ~counter~0 3)} is VALID [2022-04-28 06:06:26,138 INFO L290 TraceCheckUtils]: 38: Hoare triple {163369#(<= ~counter~0 3)} assume true; {163369#(<= ~counter~0 3)} is VALID [2022-04-28 06:06:26,139 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {163369#(<= ~counter~0 3)} {163369#(<= ~counter~0 3)} #98#return; {163369#(<= ~counter~0 3)} is VALID [2022-04-28 06:06:26,139 INFO L290 TraceCheckUtils]: 40: Hoare triple {163369#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {163369#(<= ~counter~0 3)} is VALID [2022-04-28 06:06:26,140 INFO L290 TraceCheckUtils]: 41: Hoare triple {163369#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {163394#(<= ~counter~0 4)} is VALID [2022-04-28 06:06:26,140 INFO L290 TraceCheckUtils]: 42: Hoare triple {163394#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {163394#(<= ~counter~0 4)} is VALID [2022-04-28 06:06:26,141 INFO L272 TraceCheckUtils]: 43: Hoare triple {163394#(<= ~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)); {163394#(<= ~counter~0 4)} is VALID [2022-04-28 06:06:26,147 INFO L290 TraceCheckUtils]: 44: Hoare triple {163394#(<= ~counter~0 4)} ~cond := #in~cond; {163394#(<= ~counter~0 4)} is VALID [2022-04-28 06:06:26,148 INFO L290 TraceCheckUtils]: 45: Hoare triple {163394#(<= ~counter~0 4)} assume !(0 == ~cond); {163394#(<= ~counter~0 4)} is VALID [2022-04-28 06:06:26,148 INFO L290 TraceCheckUtils]: 46: Hoare triple {163394#(<= ~counter~0 4)} assume true; {163394#(<= ~counter~0 4)} is VALID [2022-04-28 06:06:26,149 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {163394#(<= ~counter~0 4)} {163394#(<= ~counter~0 4)} #98#return; {163394#(<= ~counter~0 4)} is VALID [2022-04-28 06:06:26,149 INFO L290 TraceCheckUtils]: 48: Hoare triple {163394#(<= ~counter~0 4)} assume !(~r~0 < 0); {163394#(<= ~counter~0 4)} is VALID [2022-04-28 06:06:26,152 INFO L290 TraceCheckUtils]: 49: Hoare triple {163394#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {163419#(<= ~counter~0 5)} is VALID [2022-04-28 06:06:26,153 INFO L290 TraceCheckUtils]: 50: Hoare triple {163419#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {163419#(<= ~counter~0 5)} is VALID [2022-04-28 06:06:26,153 INFO L272 TraceCheckUtils]: 51: Hoare triple {163419#(<= ~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)); {163419#(<= ~counter~0 5)} is VALID [2022-04-28 06:06:26,153 INFO L290 TraceCheckUtils]: 52: Hoare triple {163419#(<= ~counter~0 5)} ~cond := #in~cond; {163419#(<= ~counter~0 5)} is VALID [2022-04-28 06:06:26,154 INFO L290 TraceCheckUtils]: 53: Hoare triple {163419#(<= ~counter~0 5)} assume !(0 == ~cond); {163419#(<= ~counter~0 5)} is VALID [2022-04-28 06:06:26,154 INFO L290 TraceCheckUtils]: 54: Hoare triple {163419#(<= ~counter~0 5)} assume true; {163419#(<= ~counter~0 5)} is VALID [2022-04-28 06:06:26,154 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {163419#(<= ~counter~0 5)} {163419#(<= ~counter~0 5)} #94#return; {163419#(<= ~counter~0 5)} is VALID [2022-04-28 06:06:26,155 INFO L290 TraceCheckUtils]: 56: Hoare triple {163419#(<= ~counter~0 5)} assume !!(0 != ~r~0); {163419#(<= ~counter~0 5)} is VALID [2022-04-28 06:06:26,156 INFO L290 TraceCheckUtils]: 57: Hoare triple {163419#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {163444#(<= ~counter~0 6)} is VALID [2022-04-28 06:06:26,156 INFO L290 TraceCheckUtils]: 58: Hoare triple {163444#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {163444#(<= ~counter~0 6)} is VALID [2022-04-28 06:06:26,157 INFO L272 TraceCheckUtils]: 59: Hoare triple {163444#(<= ~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)); {163444#(<= ~counter~0 6)} is VALID [2022-04-28 06:06:26,157 INFO L290 TraceCheckUtils]: 60: Hoare triple {163444#(<= ~counter~0 6)} ~cond := #in~cond; {163444#(<= ~counter~0 6)} is VALID [2022-04-28 06:06:26,157 INFO L290 TraceCheckUtils]: 61: Hoare triple {163444#(<= ~counter~0 6)} assume !(0 == ~cond); {163444#(<= ~counter~0 6)} is VALID [2022-04-28 06:06:26,157 INFO L290 TraceCheckUtils]: 62: Hoare triple {163444#(<= ~counter~0 6)} assume true; {163444#(<= ~counter~0 6)} is VALID [2022-04-28 06:06:26,158 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {163444#(<= ~counter~0 6)} {163444#(<= ~counter~0 6)} #96#return; {163444#(<= ~counter~0 6)} is VALID [2022-04-28 06:06:26,158 INFO L290 TraceCheckUtils]: 64: Hoare triple {163444#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {163444#(<= ~counter~0 6)} is VALID [2022-04-28 06:06:26,159 INFO L290 TraceCheckUtils]: 65: Hoare triple {163444#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {163469#(<= ~counter~0 7)} is VALID [2022-04-28 06:06:26,160 INFO L290 TraceCheckUtils]: 66: Hoare triple {163469#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {163469#(<= ~counter~0 7)} is VALID [2022-04-28 06:06:26,160 INFO L272 TraceCheckUtils]: 67: Hoare triple {163469#(<= ~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)); {163469#(<= ~counter~0 7)} is VALID [2022-04-28 06:06:26,160 INFO L290 TraceCheckUtils]: 68: Hoare triple {163469#(<= ~counter~0 7)} ~cond := #in~cond; {163469#(<= ~counter~0 7)} is VALID [2022-04-28 06:06:26,161 INFO L290 TraceCheckUtils]: 69: Hoare triple {163469#(<= ~counter~0 7)} assume !(0 == ~cond); {163469#(<= ~counter~0 7)} is VALID [2022-04-28 06:06:26,161 INFO L290 TraceCheckUtils]: 70: Hoare triple {163469#(<= ~counter~0 7)} assume true; {163469#(<= ~counter~0 7)} is VALID [2022-04-28 06:06:26,161 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {163469#(<= ~counter~0 7)} {163469#(<= ~counter~0 7)} #96#return; {163469#(<= ~counter~0 7)} is VALID [2022-04-28 06:06:26,162 INFO L290 TraceCheckUtils]: 72: Hoare triple {163469#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {163469#(<= ~counter~0 7)} is VALID [2022-04-28 06:06:26,163 INFO L290 TraceCheckUtils]: 73: Hoare triple {163469#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {163494#(<= ~counter~0 8)} is VALID [2022-04-28 06:06:26,163 INFO L290 TraceCheckUtils]: 74: Hoare triple {163494#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {163494#(<= ~counter~0 8)} is VALID [2022-04-28 06:06:26,164 INFO L272 TraceCheckUtils]: 75: Hoare triple {163494#(<= ~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)); {163494#(<= ~counter~0 8)} is VALID [2022-04-28 06:06:26,164 INFO L290 TraceCheckUtils]: 76: Hoare triple {163494#(<= ~counter~0 8)} ~cond := #in~cond; {163494#(<= ~counter~0 8)} is VALID [2022-04-28 06:06:26,164 INFO L290 TraceCheckUtils]: 77: Hoare triple {163494#(<= ~counter~0 8)} assume !(0 == ~cond); {163494#(<= ~counter~0 8)} is VALID [2022-04-28 06:06:26,164 INFO L290 TraceCheckUtils]: 78: Hoare triple {163494#(<= ~counter~0 8)} assume true; {163494#(<= ~counter~0 8)} is VALID [2022-04-28 06:06:26,165 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {163494#(<= ~counter~0 8)} {163494#(<= ~counter~0 8)} #96#return; {163494#(<= ~counter~0 8)} is VALID [2022-04-28 06:06:26,165 INFO L290 TraceCheckUtils]: 80: Hoare triple {163494#(<= ~counter~0 8)} assume !(~r~0 > 0); {163494#(<= ~counter~0 8)} is VALID [2022-04-28 06:06:26,166 INFO L290 TraceCheckUtils]: 81: Hoare triple {163494#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {163519#(<= ~counter~0 9)} is VALID [2022-04-28 06:06:26,167 INFO L290 TraceCheckUtils]: 82: Hoare triple {163519#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {163519#(<= ~counter~0 9)} is VALID [2022-04-28 06:06:26,167 INFO L272 TraceCheckUtils]: 83: Hoare triple {163519#(<= ~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)); {163519#(<= ~counter~0 9)} is VALID [2022-04-28 06:06:26,167 INFO L290 TraceCheckUtils]: 84: Hoare triple {163519#(<= ~counter~0 9)} ~cond := #in~cond; {163519#(<= ~counter~0 9)} is VALID [2022-04-28 06:06:26,168 INFO L290 TraceCheckUtils]: 85: Hoare triple {163519#(<= ~counter~0 9)} assume !(0 == ~cond); {163519#(<= ~counter~0 9)} is VALID [2022-04-28 06:06:26,168 INFO L290 TraceCheckUtils]: 86: Hoare triple {163519#(<= ~counter~0 9)} assume true; {163519#(<= ~counter~0 9)} is VALID [2022-04-28 06:06:26,168 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {163519#(<= ~counter~0 9)} {163519#(<= ~counter~0 9)} #98#return; {163519#(<= ~counter~0 9)} is VALID [2022-04-28 06:06:26,168 INFO L290 TraceCheckUtils]: 88: Hoare triple {163519#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {163519#(<= ~counter~0 9)} is VALID [2022-04-28 06:06:26,170 INFO L290 TraceCheckUtils]: 89: Hoare triple {163519#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {163544#(<= ~counter~0 10)} is VALID [2022-04-28 06:06:26,170 INFO L290 TraceCheckUtils]: 90: Hoare triple {163544#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {163544#(<= ~counter~0 10)} is VALID [2022-04-28 06:06:26,170 INFO L272 TraceCheckUtils]: 91: Hoare triple {163544#(<= ~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)); {163544#(<= ~counter~0 10)} is VALID [2022-04-28 06:06:26,171 INFO L290 TraceCheckUtils]: 92: Hoare triple {163544#(<= ~counter~0 10)} ~cond := #in~cond; {163544#(<= ~counter~0 10)} is VALID [2022-04-28 06:06:26,171 INFO L290 TraceCheckUtils]: 93: Hoare triple {163544#(<= ~counter~0 10)} assume !(0 == ~cond); {163544#(<= ~counter~0 10)} is VALID [2022-04-28 06:06:26,171 INFO L290 TraceCheckUtils]: 94: Hoare triple {163544#(<= ~counter~0 10)} assume true; {163544#(<= ~counter~0 10)} is VALID [2022-04-28 06:06:26,172 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {163544#(<= ~counter~0 10)} {163544#(<= ~counter~0 10)} #98#return; {163544#(<= ~counter~0 10)} is VALID [2022-04-28 06:06:26,172 INFO L290 TraceCheckUtils]: 96: Hoare triple {163544#(<= ~counter~0 10)} assume !(~r~0 < 0); {163544#(<= ~counter~0 10)} is VALID [2022-04-28 06:06:26,173 INFO L290 TraceCheckUtils]: 97: Hoare triple {163544#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {163569#(<= ~counter~0 11)} is VALID [2022-04-28 06:06:26,174 INFO L290 TraceCheckUtils]: 98: Hoare triple {163569#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {163569#(<= ~counter~0 11)} is VALID [2022-04-28 06:06:26,174 INFO L272 TraceCheckUtils]: 99: Hoare triple {163569#(<= ~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)); {163569#(<= ~counter~0 11)} is VALID [2022-04-28 06:06:26,174 INFO L290 TraceCheckUtils]: 100: Hoare triple {163569#(<= ~counter~0 11)} ~cond := #in~cond; {163569#(<= ~counter~0 11)} is VALID [2022-04-28 06:06:26,174 INFO L290 TraceCheckUtils]: 101: Hoare triple {163569#(<= ~counter~0 11)} assume !(0 == ~cond); {163569#(<= ~counter~0 11)} is VALID [2022-04-28 06:06:26,175 INFO L290 TraceCheckUtils]: 102: Hoare triple {163569#(<= ~counter~0 11)} assume true; {163569#(<= ~counter~0 11)} is VALID [2022-04-28 06:06:26,175 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {163569#(<= ~counter~0 11)} {163569#(<= ~counter~0 11)} #94#return; {163569#(<= ~counter~0 11)} is VALID [2022-04-28 06:06:26,175 INFO L290 TraceCheckUtils]: 104: Hoare triple {163569#(<= ~counter~0 11)} assume !!(0 != ~r~0); {163569#(<= ~counter~0 11)} is VALID [2022-04-28 06:06:26,177 INFO L290 TraceCheckUtils]: 105: Hoare triple {163569#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {163594#(<= ~counter~0 12)} is VALID [2022-04-28 06:06:26,177 INFO L290 TraceCheckUtils]: 106: Hoare triple {163594#(<= ~counter~0 12)} assume !!(#t~post7 < 100);havoc #t~post7; {163594#(<= ~counter~0 12)} is VALID [2022-04-28 06:06:26,177 INFO L272 TraceCheckUtils]: 107: Hoare triple {163594#(<= ~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)); {163594#(<= ~counter~0 12)} is VALID [2022-04-28 06:06:26,178 INFO L290 TraceCheckUtils]: 108: Hoare triple {163594#(<= ~counter~0 12)} ~cond := #in~cond; {163594#(<= ~counter~0 12)} is VALID [2022-04-28 06:06:26,178 INFO L290 TraceCheckUtils]: 109: Hoare triple {163594#(<= ~counter~0 12)} assume !(0 == ~cond); {163594#(<= ~counter~0 12)} is VALID [2022-04-28 06:06:26,178 INFO L290 TraceCheckUtils]: 110: Hoare triple {163594#(<= ~counter~0 12)} assume true; {163594#(<= ~counter~0 12)} is VALID [2022-04-28 06:06:26,179 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {163594#(<= ~counter~0 12)} {163594#(<= ~counter~0 12)} #96#return; {163594#(<= ~counter~0 12)} is VALID [2022-04-28 06:06:26,179 INFO L290 TraceCheckUtils]: 112: Hoare triple {163594#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {163594#(<= ~counter~0 12)} is VALID [2022-04-28 06:06:26,180 INFO L290 TraceCheckUtils]: 113: Hoare triple {163594#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {163619#(<= ~counter~0 13)} is VALID [2022-04-28 06:06:26,180 INFO L290 TraceCheckUtils]: 114: Hoare triple {163619#(<= ~counter~0 13)} assume !!(#t~post7 < 100);havoc #t~post7; {163619#(<= ~counter~0 13)} is VALID [2022-04-28 06:06:26,181 INFO L272 TraceCheckUtils]: 115: Hoare triple {163619#(<= ~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)); {163619#(<= ~counter~0 13)} is VALID [2022-04-28 06:06:26,181 INFO L290 TraceCheckUtils]: 116: Hoare triple {163619#(<= ~counter~0 13)} ~cond := #in~cond; {163619#(<= ~counter~0 13)} is VALID [2022-04-28 06:06:26,181 INFO L290 TraceCheckUtils]: 117: Hoare triple {163619#(<= ~counter~0 13)} assume !(0 == ~cond); {163619#(<= ~counter~0 13)} is VALID [2022-04-28 06:06:26,182 INFO L290 TraceCheckUtils]: 118: Hoare triple {163619#(<= ~counter~0 13)} assume true; {163619#(<= ~counter~0 13)} is VALID [2022-04-28 06:06:26,182 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {163619#(<= ~counter~0 13)} {163619#(<= ~counter~0 13)} #96#return; {163619#(<= ~counter~0 13)} is VALID [2022-04-28 06:06:26,182 INFO L290 TraceCheckUtils]: 120: Hoare triple {163619#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {163619#(<= ~counter~0 13)} is VALID [2022-04-28 06:06:26,184 INFO L290 TraceCheckUtils]: 121: Hoare triple {163619#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {163644#(<= ~counter~0 14)} is VALID [2022-04-28 06:06:26,184 INFO L290 TraceCheckUtils]: 122: Hoare triple {163644#(<= ~counter~0 14)} assume !!(#t~post7 < 100);havoc #t~post7; {163644#(<= ~counter~0 14)} is VALID [2022-04-28 06:06:26,184 INFO L272 TraceCheckUtils]: 123: Hoare triple {163644#(<= ~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)); {163644#(<= ~counter~0 14)} is VALID [2022-04-28 06:06:26,185 INFO L290 TraceCheckUtils]: 124: Hoare triple {163644#(<= ~counter~0 14)} ~cond := #in~cond; {163644#(<= ~counter~0 14)} is VALID [2022-04-28 06:06:26,185 INFO L290 TraceCheckUtils]: 125: Hoare triple {163644#(<= ~counter~0 14)} assume !(0 == ~cond); {163644#(<= ~counter~0 14)} is VALID [2022-04-28 06:06:26,185 INFO L290 TraceCheckUtils]: 126: Hoare triple {163644#(<= ~counter~0 14)} assume true; {163644#(<= ~counter~0 14)} is VALID [2022-04-28 06:06:26,186 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {163644#(<= ~counter~0 14)} {163644#(<= ~counter~0 14)} #96#return; {163644#(<= ~counter~0 14)} is VALID [2022-04-28 06:06:26,186 INFO L290 TraceCheckUtils]: 128: Hoare triple {163644#(<= ~counter~0 14)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {163644#(<= ~counter~0 14)} is VALID [2022-04-28 06:06:26,187 INFO L290 TraceCheckUtils]: 129: Hoare triple {163644#(<= ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {163669#(<= ~counter~0 15)} is VALID [2022-04-28 06:06:26,187 INFO L290 TraceCheckUtils]: 130: Hoare triple {163669#(<= ~counter~0 15)} assume !!(#t~post7 < 100);havoc #t~post7; {163669#(<= ~counter~0 15)} is VALID [2022-04-28 06:06:26,188 INFO L272 TraceCheckUtils]: 131: Hoare triple {163669#(<= ~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)); {163669#(<= ~counter~0 15)} is VALID [2022-04-28 06:06:26,188 INFO L290 TraceCheckUtils]: 132: Hoare triple {163669#(<= ~counter~0 15)} ~cond := #in~cond; {163669#(<= ~counter~0 15)} is VALID [2022-04-28 06:06:26,188 INFO L290 TraceCheckUtils]: 133: Hoare triple {163669#(<= ~counter~0 15)} assume !(0 == ~cond); {163669#(<= ~counter~0 15)} is VALID [2022-04-28 06:06:26,189 INFO L290 TraceCheckUtils]: 134: Hoare triple {163669#(<= ~counter~0 15)} assume true; {163669#(<= ~counter~0 15)} is VALID [2022-04-28 06:06:26,189 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {163669#(<= ~counter~0 15)} {163669#(<= ~counter~0 15)} #96#return; {163669#(<= ~counter~0 15)} is VALID [2022-04-28 06:06:26,189 INFO L290 TraceCheckUtils]: 136: Hoare triple {163669#(<= ~counter~0 15)} assume !(~r~0 > 0); {163669#(<= ~counter~0 15)} is VALID [2022-04-28 06:06:26,191 INFO L290 TraceCheckUtils]: 137: Hoare triple {163669#(<= ~counter~0 15)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {163694#(<= ~counter~0 16)} is VALID [2022-04-28 06:06:26,191 INFO L290 TraceCheckUtils]: 138: Hoare triple {163694#(<= ~counter~0 16)} assume !!(#t~post8 < 100);havoc #t~post8; {163694#(<= ~counter~0 16)} is VALID [2022-04-28 06:06:26,191 INFO L272 TraceCheckUtils]: 139: Hoare triple {163694#(<= ~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)); {163694#(<= ~counter~0 16)} is VALID [2022-04-28 06:06:26,191 INFO L290 TraceCheckUtils]: 140: Hoare triple {163694#(<= ~counter~0 16)} ~cond := #in~cond; {163694#(<= ~counter~0 16)} is VALID [2022-04-28 06:06:26,192 INFO L290 TraceCheckUtils]: 141: Hoare triple {163694#(<= ~counter~0 16)} assume !(0 == ~cond); {163694#(<= ~counter~0 16)} is VALID [2022-04-28 06:06:26,192 INFO L290 TraceCheckUtils]: 142: Hoare triple {163694#(<= ~counter~0 16)} assume true; {163694#(<= ~counter~0 16)} is VALID [2022-04-28 06:06:26,192 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {163694#(<= ~counter~0 16)} {163694#(<= ~counter~0 16)} #98#return; {163694#(<= ~counter~0 16)} is VALID [2022-04-28 06:06:26,193 INFO L290 TraceCheckUtils]: 144: Hoare triple {163694#(<= ~counter~0 16)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {163694#(<= ~counter~0 16)} is VALID [2022-04-28 06:06:26,194 INFO L290 TraceCheckUtils]: 145: Hoare triple {163694#(<= ~counter~0 16)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {163719#(<= ~counter~0 17)} is VALID [2022-04-28 06:06:26,194 INFO L290 TraceCheckUtils]: 146: Hoare triple {163719#(<= ~counter~0 17)} assume !!(#t~post8 < 100);havoc #t~post8; {163719#(<= ~counter~0 17)} is VALID [2022-04-28 06:06:26,195 INFO L272 TraceCheckUtils]: 147: Hoare triple {163719#(<= ~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)); {163719#(<= ~counter~0 17)} is VALID [2022-04-28 06:06:26,195 INFO L290 TraceCheckUtils]: 148: Hoare triple {163719#(<= ~counter~0 17)} ~cond := #in~cond; {163719#(<= ~counter~0 17)} is VALID [2022-04-28 06:06:26,195 INFO L290 TraceCheckUtils]: 149: Hoare triple {163719#(<= ~counter~0 17)} assume !(0 == ~cond); {163719#(<= ~counter~0 17)} is VALID [2022-04-28 06:06:26,196 INFO L290 TraceCheckUtils]: 150: Hoare triple {163719#(<= ~counter~0 17)} assume true; {163719#(<= ~counter~0 17)} is VALID [2022-04-28 06:06:26,196 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {163719#(<= ~counter~0 17)} {163719#(<= ~counter~0 17)} #98#return; {163719#(<= ~counter~0 17)} is VALID [2022-04-28 06:06:26,196 INFO L290 TraceCheckUtils]: 152: Hoare triple {163719#(<= ~counter~0 17)} assume !(~r~0 < 0); {163719#(<= ~counter~0 17)} is VALID [2022-04-28 06:06:26,197 INFO L290 TraceCheckUtils]: 153: Hoare triple {163719#(<= ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {163744#(<= |main_#t~post6| 17)} is VALID [2022-04-28 06:06:26,197 INFO L290 TraceCheckUtils]: 154: Hoare triple {163744#(<= |main_#t~post6| 17)} assume !(#t~post6 < 100);havoc #t~post6; {163263#false} is VALID [2022-04-28 06:06:26,197 INFO L272 TraceCheckUtils]: 155: Hoare triple {163263#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)); {163263#false} is VALID [2022-04-28 06:06:26,197 INFO L290 TraceCheckUtils]: 156: Hoare triple {163263#false} ~cond := #in~cond; {163263#false} is VALID [2022-04-28 06:06:26,197 INFO L290 TraceCheckUtils]: 157: Hoare triple {163263#false} assume 0 == ~cond; {163263#false} is VALID [2022-04-28 06:06:26,197 INFO L290 TraceCheckUtils]: 158: Hoare triple {163263#false} assume !false; {163263#false} is VALID [2022-04-28 06:06:26,198 INFO L134 CoverageAnalysis]: Checked inductivity of 772 backedges. 34 proven. 734 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 06:06:26,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:06:27,286 INFO L290 TraceCheckUtils]: 158: Hoare triple {163263#false} assume !false; {163263#false} is VALID [2022-04-28 06:06:27,286 INFO L290 TraceCheckUtils]: 157: Hoare triple {163263#false} assume 0 == ~cond; {163263#false} is VALID [2022-04-28 06:06:27,286 INFO L290 TraceCheckUtils]: 156: Hoare triple {163263#false} ~cond := #in~cond; {163263#false} is VALID [2022-04-28 06:06:27,286 INFO L272 TraceCheckUtils]: 155: Hoare triple {163263#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)); {163263#false} is VALID [2022-04-28 06:06:27,286 INFO L290 TraceCheckUtils]: 154: Hoare triple {163772#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {163263#false} is VALID [2022-04-28 06:06:27,287 INFO L290 TraceCheckUtils]: 153: Hoare triple {163776#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {163772#(< |main_#t~post6| 100)} is VALID [2022-04-28 06:06:27,287 INFO L290 TraceCheckUtils]: 152: Hoare triple {163776#(< ~counter~0 100)} assume !(~r~0 < 0); {163776#(< ~counter~0 100)} is VALID [2022-04-28 06:06:27,287 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {163262#true} {163776#(< ~counter~0 100)} #98#return; {163776#(< ~counter~0 100)} is VALID [2022-04-28 06:06:27,287 INFO L290 TraceCheckUtils]: 150: Hoare triple {163262#true} assume true; {163262#true} is VALID [2022-04-28 06:06:27,287 INFO L290 TraceCheckUtils]: 149: Hoare triple {163262#true} assume !(0 == ~cond); {163262#true} is VALID [2022-04-28 06:06:27,288 INFO L290 TraceCheckUtils]: 148: Hoare triple {163262#true} ~cond := #in~cond; {163262#true} is VALID [2022-04-28 06:06:27,288 INFO L272 TraceCheckUtils]: 147: Hoare triple {163776#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163262#true} is VALID [2022-04-28 06:06:27,288 INFO L290 TraceCheckUtils]: 146: Hoare triple {163776#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {163776#(< ~counter~0 100)} is VALID [2022-04-28 06:06:27,291 INFO L290 TraceCheckUtils]: 145: Hoare triple {163801#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {163776#(< ~counter~0 100)} is VALID [2022-04-28 06:06:27,291 INFO L290 TraceCheckUtils]: 144: Hoare triple {163801#(< ~counter~0 99)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {163801#(< ~counter~0 99)} is VALID [2022-04-28 06:06:27,292 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {163262#true} {163801#(< ~counter~0 99)} #98#return; {163801#(< ~counter~0 99)} is VALID [2022-04-28 06:06:27,292 INFO L290 TraceCheckUtils]: 142: Hoare triple {163262#true} assume true; {163262#true} is VALID [2022-04-28 06:06:27,292 INFO L290 TraceCheckUtils]: 141: Hoare triple {163262#true} assume !(0 == ~cond); {163262#true} is VALID [2022-04-28 06:06:27,292 INFO L290 TraceCheckUtils]: 140: Hoare triple {163262#true} ~cond := #in~cond; {163262#true} is VALID [2022-04-28 06:06:27,292 INFO L272 TraceCheckUtils]: 139: Hoare triple {163801#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163262#true} is VALID [2022-04-28 06:06:27,292 INFO L290 TraceCheckUtils]: 138: Hoare triple {163801#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {163801#(< ~counter~0 99)} is VALID [2022-04-28 06:06:27,294 INFO L290 TraceCheckUtils]: 137: Hoare triple {163826#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {163801#(< ~counter~0 99)} is VALID [2022-04-28 06:06:27,294 INFO L290 TraceCheckUtils]: 136: Hoare triple {163826#(< ~counter~0 98)} assume !(~r~0 > 0); {163826#(< ~counter~0 98)} is VALID [2022-04-28 06:06:27,294 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {163262#true} {163826#(< ~counter~0 98)} #96#return; {163826#(< ~counter~0 98)} is VALID [2022-04-28 06:06:27,294 INFO L290 TraceCheckUtils]: 134: Hoare triple {163262#true} assume true; {163262#true} is VALID [2022-04-28 06:06:27,294 INFO L290 TraceCheckUtils]: 133: Hoare triple {163262#true} assume !(0 == ~cond); {163262#true} is VALID [2022-04-28 06:06:27,294 INFO L290 TraceCheckUtils]: 132: Hoare triple {163262#true} ~cond := #in~cond; {163262#true} is VALID [2022-04-28 06:06:27,295 INFO L272 TraceCheckUtils]: 131: Hoare triple {163826#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163262#true} is VALID [2022-04-28 06:06:27,295 INFO L290 TraceCheckUtils]: 130: Hoare triple {163826#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {163826#(< ~counter~0 98)} is VALID [2022-04-28 06:06:27,296 INFO L290 TraceCheckUtils]: 129: Hoare triple {163851#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {163826#(< ~counter~0 98)} is VALID [2022-04-28 06:06:27,296 INFO L290 TraceCheckUtils]: 128: Hoare triple {163851#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {163851#(< ~counter~0 97)} is VALID [2022-04-28 06:06:27,297 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {163262#true} {163851#(< ~counter~0 97)} #96#return; {163851#(< ~counter~0 97)} is VALID [2022-04-28 06:06:27,297 INFO L290 TraceCheckUtils]: 126: Hoare triple {163262#true} assume true; {163262#true} is VALID [2022-04-28 06:06:27,297 INFO L290 TraceCheckUtils]: 125: Hoare triple {163262#true} assume !(0 == ~cond); {163262#true} is VALID [2022-04-28 06:06:27,297 INFO L290 TraceCheckUtils]: 124: Hoare triple {163262#true} ~cond := #in~cond; {163262#true} is VALID [2022-04-28 06:06:27,297 INFO L272 TraceCheckUtils]: 123: Hoare triple {163851#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163262#true} is VALID [2022-04-28 06:06:27,297 INFO L290 TraceCheckUtils]: 122: Hoare triple {163851#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {163851#(< ~counter~0 97)} is VALID [2022-04-28 06:06:27,299 INFO L290 TraceCheckUtils]: 121: Hoare triple {163876#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {163851#(< ~counter~0 97)} is VALID [2022-04-28 06:06:27,299 INFO L290 TraceCheckUtils]: 120: Hoare triple {163876#(< ~counter~0 96)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {163876#(< ~counter~0 96)} is VALID [2022-04-28 06:06:27,299 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {163262#true} {163876#(< ~counter~0 96)} #96#return; {163876#(< ~counter~0 96)} is VALID [2022-04-28 06:06:27,300 INFO L290 TraceCheckUtils]: 118: Hoare triple {163262#true} assume true; {163262#true} is VALID [2022-04-28 06:06:27,300 INFO L290 TraceCheckUtils]: 117: Hoare triple {163262#true} assume !(0 == ~cond); {163262#true} is VALID [2022-04-28 06:06:27,300 INFO L290 TraceCheckUtils]: 116: Hoare triple {163262#true} ~cond := #in~cond; {163262#true} is VALID [2022-04-28 06:06:27,300 INFO L272 TraceCheckUtils]: 115: Hoare triple {163876#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163262#true} is VALID [2022-04-28 06:06:27,300 INFO L290 TraceCheckUtils]: 114: Hoare triple {163876#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {163876#(< ~counter~0 96)} is VALID [2022-04-28 06:06:27,301 INFO L290 TraceCheckUtils]: 113: Hoare triple {163901#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {163876#(< ~counter~0 96)} is VALID [2022-04-28 06:06:27,302 INFO L290 TraceCheckUtils]: 112: Hoare triple {163901#(< ~counter~0 95)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {163901#(< ~counter~0 95)} is VALID [2022-04-28 06:06:27,302 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {163262#true} {163901#(< ~counter~0 95)} #96#return; {163901#(< ~counter~0 95)} is VALID [2022-04-28 06:06:27,302 INFO L290 TraceCheckUtils]: 110: Hoare triple {163262#true} assume true; {163262#true} is VALID [2022-04-28 06:06:27,302 INFO L290 TraceCheckUtils]: 109: Hoare triple {163262#true} assume !(0 == ~cond); {163262#true} is VALID [2022-04-28 06:06:27,302 INFO L290 TraceCheckUtils]: 108: Hoare triple {163262#true} ~cond := #in~cond; {163262#true} is VALID [2022-04-28 06:06:27,302 INFO L272 TraceCheckUtils]: 107: Hoare triple {163901#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163262#true} is VALID [2022-04-28 06:06:27,303 INFO L290 TraceCheckUtils]: 106: Hoare triple {163901#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {163901#(< ~counter~0 95)} is VALID [2022-04-28 06:06:27,304 INFO L290 TraceCheckUtils]: 105: Hoare triple {163926#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {163901#(< ~counter~0 95)} is VALID [2022-04-28 06:06:27,304 INFO L290 TraceCheckUtils]: 104: Hoare triple {163926#(< ~counter~0 94)} assume !!(0 != ~r~0); {163926#(< ~counter~0 94)} is VALID [2022-04-28 06:06:27,305 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {163262#true} {163926#(< ~counter~0 94)} #94#return; {163926#(< ~counter~0 94)} is VALID [2022-04-28 06:06:27,305 INFO L290 TraceCheckUtils]: 102: Hoare triple {163262#true} assume true; {163262#true} is VALID [2022-04-28 06:06:27,305 INFO L290 TraceCheckUtils]: 101: Hoare triple {163262#true} assume !(0 == ~cond); {163262#true} is VALID [2022-04-28 06:06:27,305 INFO L290 TraceCheckUtils]: 100: Hoare triple {163262#true} ~cond := #in~cond; {163262#true} is VALID [2022-04-28 06:06:27,305 INFO L272 TraceCheckUtils]: 99: Hoare triple {163926#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163262#true} is VALID [2022-04-28 06:06:27,305 INFO L290 TraceCheckUtils]: 98: Hoare triple {163926#(< ~counter~0 94)} assume !!(#t~post6 < 100);havoc #t~post6; {163926#(< ~counter~0 94)} is VALID [2022-04-28 06:06:27,307 INFO L290 TraceCheckUtils]: 97: Hoare triple {163951#(< ~counter~0 93)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {163926#(< ~counter~0 94)} is VALID [2022-04-28 06:06:27,307 INFO L290 TraceCheckUtils]: 96: Hoare triple {163951#(< ~counter~0 93)} assume !(~r~0 < 0); {163951#(< ~counter~0 93)} is VALID [2022-04-28 06:06:27,307 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {163262#true} {163951#(< ~counter~0 93)} #98#return; {163951#(< ~counter~0 93)} is VALID [2022-04-28 06:06:27,307 INFO L290 TraceCheckUtils]: 94: Hoare triple {163262#true} assume true; {163262#true} is VALID [2022-04-28 06:06:27,307 INFO L290 TraceCheckUtils]: 93: Hoare triple {163262#true} assume !(0 == ~cond); {163262#true} is VALID [2022-04-28 06:06:27,308 INFO L290 TraceCheckUtils]: 92: Hoare triple {163262#true} ~cond := #in~cond; {163262#true} is VALID [2022-04-28 06:06:27,308 INFO L272 TraceCheckUtils]: 91: Hoare triple {163951#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163262#true} is VALID [2022-04-28 06:06:27,308 INFO L290 TraceCheckUtils]: 90: Hoare triple {163951#(< ~counter~0 93)} assume !!(#t~post8 < 100);havoc #t~post8; {163951#(< ~counter~0 93)} is VALID [2022-04-28 06:06:27,309 INFO L290 TraceCheckUtils]: 89: Hoare triple {163976#(< ~counter~0 92)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {163951#(< ~counter~0 93)} is VALID [2022-04-28 06:06:27,309 INFO L290 TraceCheckUtils]: 88: Hoare triple {163976#(< ~counter~0 92)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {163976#(< ~counter~0 92)} is VALID [2022-04-28 06:06:27,310 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {163262#true} {163976#(< ~counter~0 92)} #98#return; {163976#(< ~counter~0 92)} is VALID [2022-04-28 06:06:27,310 INFO L290 TraceCheckUtils]: 86: Hoare triple {163262#true} assume true; {163262#true} is VALID [2022-04-28 06:06:27,310 INFO L290 TraceCheckUtils]: 85: Hoare triple {163262#true} assume !(0 == ~cond); {163262#true} is VALID [2022-04-28 06:06:27,310 INFO L290 TraceCheckUtils]: 84: Hoare triple {163262#true} ~cond := #in~cond; {163262#true} is VALID [2022-04-28 06:06:27,310 INFO L272 TraceCheckUtils]: 83: Hoare triple {163976#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163262#true} is VALID [2022-04-28 06:06:27,310 INFO L290 TraceCheckUtils]: 82: Hoare triple {163976#(< ~counter~0 92)} assume !!(#t~post8 < 100);havoc #t~post8; {163976#(< ~counter~0 92)} is VALID [2022-04-28 06:06:27,312 INFO L290 TraceCheckUtils]: 81: Hoare triple {164001#(< ~counter~0 91)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {163976#(< ~counter~0 92)} is VALID [2022-04-28 06:06:27,312 INFO L290 TraceCheckUtils]: 80: Hoare triple {164001#(< ~counter~0 91)} assume !(~r~0 > 0); {164001#(< ~counter~0 91)} is VALID [2022-04-28 06:06:27,312 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {163262#true} {164001#(< ~counter~0 91)} #96#return; {164001#(< ~counter~0 91)} is VALID [2022-04-28 06:06:27,312 INFO L290 TraceCheckUtils]: 78: Hoare triple {163262#true} assume true; {163262#true} is VALID [2022-04-28 06:06:27,313 INFO L290 TraceCheckUtils]: 77: Hoare triple {163262#true} assume !(0 == ~cond); {163262#true} is VALID [2022-04-28 06:06:27,313 INFO L290 TraceCheckUtils]: 76: Hoare triple {163262#true} ~cond := #in~cond; {163262#true} is VALID [2022-04-28 06:06:27,313 INFO L272 TraceCheckUtils]: 75: Hoare triple {164001#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163262#true} is VALID [2022-04-28 06:06:27,313 INFO L290 TraceCheckUtils]: 74: Hoare triple {164001#(< ~counter~0 91)} assume !!(#t~post7 < 100);havoc #t~post7; {164001#(< ~counter~0 91)} is VALID [2022-04-28 06:06:27,314 INFO L290 TraceCheckUtils]: 73: Hoare triple {164026#(< ~counter~0 90)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {164001#(< ~counter~0 91)} is VALID [2022-04-28 06:06:27,314 INFO L290 TraceCheckUtils]: 72: Hoare triple {164026#(< ~counter~0 90)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {164026#(< ~counter~0 90)} is VALID [2022-04-28 06:06:27,315 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {163262#true} {164026#(< ~counter~0 90)} #96#return; {164026#(< ~counter~0 90)} is VALID [2022-04-28 06:06:27,315 INFO L290 TraceCheckUtils]: 70: Hoare triple {163262#true} assume true; {163262#true} is VALID [2022-04-28 06:06:27,315 INFO L290 TraceCheckUtils]: 69: Hoare triple {163262#true} assume !(0 == ~cond); {163262#true} is VALID [2022-04-28 06:06:27,315 INFO L290 TraceCheckUtils]: 68: Hoare triple {163262#true} ~cond := #in~cond; {163262#true} is VALID [2022-04-28 06:06:27,315 INFO L272 TraceCheckUtils]: 67: Hoare triple {164026#(< ~counter~0 90)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163262#true} is VALID [2022-04-28 06:06:27,315 INFO L290 TraceCheckUtils]: 66: Hoare triple {164026#(< ~counter~0 90)} assume !!(#t~post7 < 100);havoc #t~post7; {164026#(< ~counter~0 90)} is VALID [2022-04-28 06:06:27,317 INFO L290 TraceCheckUtils]: 65: Hoare triple {164051#(< ~counter~0 89)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {164026#(< ~counter~0 90)} is VALID [2022-04-28 06:06:27,317 INFO L290 TraceCheckUtils]: 64: Hoare triple {164051#(< ~counter~0 89)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {164051#(< ~counter~0 89)} is VALID [2022-04-28 06:06:27,318 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {163262#true} {164051#(< ~counter~0 89)} #96#return; {164051#(< ~counter~0 89)} is VALID [2022-04-28 06:06:27,318 INFO L290 TraceCheckUtils]: 62: Hoare triple {163262#true} assume true; {163262#true} is VALID [2022-04-28 06:06:27,318 INFO L290 TraceCheckUtils]: 61: Hoare triple {163262#true} assume !(0 == ~cond); {163262#true} is VALID [2022-04-28 06:06:27,318 INFO L290 TraceCheckUtils]: 60: Hoare triple {163262#true} ~cond := #in~cond; {163262#true} is VALID [2022-04-28 06:06:27,318 INFO L272 TraceCheckUtils]: 59: Hoare triple {164051#(< ~counter~0 89)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163262#true} is VALID [2022-04-28 06:06:27,318 INFO L290 TraceCheckUtils]: 58: Hoare triple {164051#(< ~counter~0 89)} assume !!(#t~post7 < 100);havoc #t~post7; {164051#(< ~counter~0 89)} is VALID [2022-04-28 06:06:27,319 INFO L290 TraceCheckUtils]: 57: Hoare triple {164076#(< ~counter~0 88)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {164051#(< ~counter~0 89)} is VALID [2022-04-28 06:06:27,320 INFO L290 TraceCheckUtils]: 56: Hoare triple {164076#(< ~counter~0 88)} assume !!(0 != ~r~0); {164076#(< ~counter~0 88)} is VALID [2022-04-28 06:06:27,320 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {163262#true} {164076#(< ~counter~0 88)} #94#return; {164076#(< ~counter~0 88)} is VALID [2022-04-28 06:06:27,320 INFO L290 TraceCheckUtils]: 54: Hoare triple {163262#true} assume true; {163262#true} is VALID [2022-04-28 06:06:27,320 INFO L290 TraceCheckUtils]: 53: Hoare triple {163262#true} assume !(0 == ~cond); {163262#true} is VALID [2022-04-28 06:06:27,320 INFO L290 TraceCheckUtils]: 52: Hoare triple {163262#true} ~cond := #in~cond; {163262#true} is VALID [2022-04-28 06:06:27,320 INFO L272 TraceCheckUtils]: 51: Hoare triple {164076#(< ~counter~0 88)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163262#true} is VALID [2022-04-28 06:06:27,321 INFO L290 TraceCheckUtils]: 50: Hoare triple {164076#(< ~counter~0 88)} assume !!(#t~post6 < 100);havoc #t~post6; {164076#(< ~counter~0 88)} is VALID [2022-04-28 06:06:27,322 INFO L290 TraceCheckUtils]: 49: Hoare triple {164101#(< ~counter~0 87)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {164076#(< ~counter~0 88)} is VALID [2022-04-28 06:06:27,322 INFO L290 TraceCheckUtils]: 48: Hoare triple {164101#(< ~counter~0 87)} assume !(~r~0 < 0); {164101#(< ~counter~0 87)} is VALID [2022-04-28 06:06:27,323 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {163262#true} {164101#(< ~counter~0 87)} #98#return; {164101#(< ~counter~0 87)} is VALID [2022-04-28 06:06:27,323 INFO L290 TraceCheckUtils]: 46: Hoare triple {163262#true} assume true; {163262#true} is VALID [2022-04-28 06:06:27,323 INFO L290 TraceCheckUtils]: 45: Hoare triple {163262#true} assume !(0 == ~cond); {163262#true} is VALID [2022-04-28 06:06:27,323 INFO L290 TraceCheckUtils]: 44: Hoare triple {163262#true} ~cond := #in~cond; {163262#true} is VALID [2022-04-28 06:06:27,323 INFO L272 TraceCheckUtils]: 43: Hoare triple {164101#(< ~counter~0 87)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163262#true} is VALID [2022-04-28 06:06:27,323 INFO L290 TraceCheckUtils]: 42: Hoare triple {164101#(< ~counter~0 87)} assume !!(#t~post8 < 100);havoc #t~post8; {164101#(< ~counter~0 87)} is VALID [2022-04-28 06:06:27,325 INFO L290 TraceCheckUtils]: 41: Hoare triple {164126#(< ~counter~0 86)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {164101#(< ~counter~0 87)} is VALID [2022-04-28 06:06:27,325 INFO L290 TraceCheckUtils]: 40: Hoare triple {164126#(< ~counter~0 86)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {164126#(< ~counter~0 86)} is VALID [2022-04-28 06:06:27,325 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {163262#true} {164126#(< ~counter~0 86)} #98#return; {164126#(< ~counter~0 86)} is VALID [2022-04-28 06:06:27,325 INFO L290 TraceCheckUtils]: 38: Hoare triple {163262#true} assume true; {163262#true} is VALID [2022-04-28 06:06:27,325 INFO L290 TraceCheckUtils]: 37: Hoare triple {163262#true} assume !(0 == ~cond); {163262#true} is VALID [2022-04-28 06:06:27,325 INFO L290 TraceCheckUtils]: 36: Hoare triple {163262#true} ~cond := #in~cond; {163262#true} is VALID [2022-04-28 06:06:27,326 INFO L272 TraceCheckUtils]: 35: Hoare triple {164126#(< ~counter~0 86)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163262#true} is VALID [2022-04-28 06:06:27,326 INFO L290 TraceCheckUtils]: 34: Hoare triple {164126#(< ~counter~0 86)} assume !!(#t~post8 < 100);havoc #t~post8; {164126#(< ~counter~0 86)} is VALID [2022-04-28 06:06:27,327 INFO L290 TraceCheckUtils]: 33: Hoare triple {164151#(< ~counter~0 85)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {164126#(< ~counter~0 86)} is VALID [2022-04-28 06:06:27,327 INFO L290 TraceCheckUtils]: 32: Hoare triple {164151#(< ~counter~0 85)} assume !(~r~0 > 0); {164151#(< ~counter~0 85)} is VALID [2022-04-28 06:06:27,328 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {163262#true} {164151#(< ~counter~0 85)} #96#return; {164151#(< ~counter~0 85)} is VALID [2022-04-28 06:06:27,328 INFO L290 TraceCheckUtils]: 30: Hoare triple {163262#true} assume true; {163262#true} is VALID [2022-04-28 06:06:27,328 INFO L290 TraceCheckUtils]: 29: Hoare triple {163262#true} assume !(0 == ~cond); {163262#true} is VALID [2022-04-28 06:06:27,328 INFO L290 TraceCheckUtils]: 28: Hoare triple {163262#true} ~cond := #in~cond; {163262#true} is VALID [2022-04-28 06:06:27,328 INFO L272 TraceCheckUtils]: 27: Hoare triple {164151#(< ~counter~0 85)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163262#true} is VALID [2022-04-28 06:06:27,328 INFO L290 TraceCheckUtils]: 26: Hoare triple {164151#(< ~counter~0 85)} assume !!(#t~post7 < 100);havoc #t~post7; {164151#(< ~counter~0 85)} is VALID [2022-04-28 06:06:27,330 INFO L290 TraceCheckUtils]: 25: Hoare triple {164176#(< ~counter~0 84)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {164151#(< ~counter~0 85)} is VALID [2022-04-28 06:06:27,330 INFO L290 TraceCheckUtils]: 24: Hoare triple {164176#(< ~counter~0 84)} assume !!(0 != ~r~0); {164176#(< ~counter~0 84)} is VALID [2022-04-28 06:06:27,330 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {163262#true} {164176#(< ~counter~0 84)} #94#return; {164176#(< ~counter~0 84)} is VALID [2022-04-28 06:06:27,330 INFO L290 TraceCheckUtils]: 22: Hoare triple {163262#true} assume true; {163262#true} is VALID [2022-04-28 06:06:27,331 INFO L290 TraceCheckUtils]: 21: Hoare triple {163262#true} assume !(0 == ~cond); {163262#true} is VALID [2022-04-28 06:06:27,331 INFO L290 TraceCheckUtils]: 20: Hoare triple {163262#true} ~cond := #in~cond; {163262#true} is VALID [2022-04-28 06:06:27,331 INFO L272 TraceCheckUtils]: 19: Hoare triple {164176#(< ~counter~0 84)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163262#true} is VALID [2022-04-28 06:06:27,331 INFO L290 TraceCheckUtils]: 18: Hoare triple {164176#(< ~counter~0 84)} assume !!(#t~post6 < 100);havoc #t~post6; {164176#(< ~counter~0 84)} is VALID [2022-04-28 06:06:27,332 INFO L290 TraceCheckUtils]: 17: Hoare triple {164201#(< ~counter~0 83)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {164176#(< ~counter~0 84)} is VALID [2022-04-28 06:06:27,332 INFO L290 TraceCheckUtils]: 16: Hoare triple {164201#(< ~counter~0 83)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {164201#(< ~counter~0 83)} is VALID [2022-04-28 06:06:27,333 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {163262#true} {164201#(< ~counter~0 83)} #92#return; {164201#(< ~counter~0 83)} is VALID [2022-04-28 06:06:27,333 INFO L290 TraceCheckUtils]: 14: Hoare triple {163262#true} assume true; {163262#true} is VALID [2022-04-28 06:06:27,333 INFO L290 TraceCheckUtils]: 13: Hoare triple {163262#true} assume !(0 == ~cond); {163262#true} is VALID [2022-04-28 06:06:27,333 INFO L290 TraceCheckUtils]: 12: Hoare triple {163262#true} ~cond := #in~cond; {163262#true} is VALID [2022-04-28 06:06:27,333 INFO L272 TraceCheckUtils]: 11: Hoare triple {164201#(< ~counter~0 83)} 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)); {163262#true} is VALID [2022-04-28 06:06:27,333 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {163262#true} {164201#(< ~counter~0 83)} #90#return; {164201#(< ~counter~0 83)} is VALID [2022-04-28 06:06:27,334 INFO L290 TraceCheckUtils]: 9: Hoare triple {163262#true} assume true; {163262#true} is VALID [2022-04-28 06:06:27,334 INFO L290 TraceCheckUtils]: 8: Hoare triple {163262#true} assume !(0 == ~cond); {163262#true} is VALID [2022-04-28 06:06:27,334 INFO L290 TraceCheckUtils]: 7: Hoare triple {163262#true} ~cond := #in~cond; {163262#true} is VALID [2022-04-28 06:06:27,334 INFO L272 TraceCheckUtils]: 6: Hoare triple {164201#(< ~counter~0 83)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {163262#true} is VALID [2022-04-28 06:06:27,334 INFO L290 TraceCheckUtils]: 5: Hoare triple {164201#(< ~counter~0 83)} 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; {164201#(< ~counter~0 83)} is VALID [2022-04-28 06:06:27,334 INFO L272 TraceCheckUtils]: 4: Hoare triple {164201#(< ~counter~0 83)} call #t~ret9 := main(); {164201#(< ~counter~0 83)} is VALID [2022-04-28 06:06:27,335 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {164201#(< ~counter~0 83)} {163262#true} #102#return; {164201#(< ~counter~0 83)} is VALID [2022-04-28 06:06:27,335 INFO L290 TraceCheckUtils]: 2: Hoare triple {164201#(< ~counter~0 83)} assume true; {164201#(< ~counter~0 83)} is VALID [2022-04-28 06:06:27,335 INFO L290 TraceCheckUtils]: 1: Hoare triple {163262#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; {164201#(< ~counter~0 83)} is VALID [2022-04-28 06:06:27,335 INFO L272 TraceCheckUtils]: 0: Hoare triple {163262#true} call ULTIMATE.init(); {163262#true} is VALID [2022-04-28 06:06:27,336 INFO L134 CoverageAnalysis]: Checked inductivity of 772 backedges. 34 proven. 190 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2022-04-28 06:06:27,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:06:27,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651985916] [2022-04-28 06:06:27,336 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:06:27,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044091947] [2022-04-28 06:06:27,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2044091947] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:06:27,336 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:06:27,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 40 [2022-04-28 06:06:27,336 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:06:27,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [648030772] [2022-04-28 06:06:27,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [648030772] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:06:27,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:06:27,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 06:06:27,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508399545] [2022-04-28 06:06:27,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:06:27,337 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.428571428571429) internal successors, (114), 20 states have internal predecessors, (114), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) Word has length 159 [2022-04-28 06:06:27,337 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:06:27,337 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 5.428571428571429) internal successors, (114), 20 states have internal predecessors, (114), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-28 06:06:27,554 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:06:27,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 06:06:27,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:06:27,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 06:06:27,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=708, Invalid=852, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 06:06:27,555 INFO L87 Difference]: Start difference. First operand 851 states and 1131 transitions. Second operand has 21 states, 21 states have (on average 5.428571428571429) internal successors, (114), 20 states have internal predecessors, (114), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-28 06:06:33,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:06:33,633 INFO L93 Difference]: Finished difference Result 902 states and 1201 transitions. [2022-04-28 06:06:33,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-28 06:06:33,633 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.428571428571429) internal successors, (114), 20 states have internal predecessors, (114), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) Word has length 159 [2022-04-28 06:06:33,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:06:33,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 5.428571428571429) internal successors, (114), 20 states have internal predecessors, (114), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-28 06:06:33,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 354 transitions. [2022-04-28 06:06:33,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 5.428571428571429) internal successors, (114), 20 states have internal predecessors, (114), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-28 06:06:33,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 354 transitions. [2022-04-28 06:06:33,638 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 354 transitions. [2022-04-28 06:06:34,112 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 354 edges. 354 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:06:34,148 INFO L225 Difference]: With dead ends: 902 [2022-04-28 06:06:34,148 INFO L226 Difference]: Without dead ends: 897 [2022-04-28 06:06:34,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1215, Invalid=1647, Unknown=0, NotChecked=0, Total=2862 [2022-04-28 06:06:34,149 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 272 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 06:06:34,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 385 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [253 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 06:06:34,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2022-04-28 06:06:37,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 875. [2022-04-28 06:06:37,386 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:06:37,387 INFO L82 GeneralOperation]: Start isEquivalent. First operand 897 states. Second operand has 875 states, 651 states have (on average 1.1781874039938556) internal successors, (767), 668 states have internal predecessors, (767), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 183 states have call predecessors, (200), 200 states have call successors, (200) [2022-04-28 06:06:37,387 INFO L74 IsIncluded]: Start isIncluded. First operand 897 states. Second operand has 875 states, 651 states have (on average 1.1781874039938556) internal successors, (767), 668 states have internal predecessors, (767), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 183 states have call predecessors, (200), 200 states have call successors, (200) [2022-04-28 06:06:37,388 INFO L87 Difference]: Start difference. First operand 897 states. Second operand has 875 states, 651 states have (on average 1.1781874039938556) internal successors, (767), 668 states have internal predecessors, (767), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 183 states have call predecessors, (200), 200 states have call successors, (200) [2022-04-28 06:06:37,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:06:37,413 INFO L93 Difference]: Finished difference Result 897 states and 1195 transitions. [2022-04-28 06:06:37,414 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1195 transitions. [2022-04-28 06:06:37,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:06:37,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:06:37,415 INFO L74 IsIncluded]: Start isIncluded. First operand has 875 states, 651 states have (on average 1.1781874039938556) internal successors, (767), 668 states have internal predecessors, (767), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 183 states have call predecessors, (200), 200 states have call successors, (200) Second operand 897 states. [2022-04-28 06:06:37,420 INFO L87 Difference]: Start difference. First operand has 875 states, 651 states have (on average 1.1781874039938556) internal successors, (767), 668 states have internal predecessors, (767), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 183 states have call predecessors, (200), 200 states have call successors, (200) Second operand 897 states. [2022-04-28 06:06:37,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:06:37,446 INFO L93 Difference]: Finished difference Result 897 states and 1195 transitions. [2022-04-28 06:06:37,446 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1195 transitions. [2022-04-28 06:06:37,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:06:37,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:06:37,447 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:06:37,447 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:06:37,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 875 states, 651 states have (on average 1.1781874039938556) internal successors, (767), 668 states have internal predecessors, (767), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 183 states have call predecessors, (200), 200 states have call successors, (200) [2022-04-28 06:06:37,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1169 transitions. [2022-04-28 06:06:37,481 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1169 transitions. Word has length 159 [2022-04-28 06:06:37,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:06:37,481 INFO L495 AbstractCegarLoop]: Abstraction has 875 states and 1169 transitions. [2022-04-28 06:06:37,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.428571428571429) internal successors, (114), 20 states have internal predecessors, (114), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-28 06:06:37,481 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 875 states and 1169 transitions. [2022-04-28 06:06:50,179 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1169 edges. 1168 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 06:06:50,180 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1169 transitions. [2022-04-28 06:06:50,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-04-28 06:06:50,181 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:06:50,181 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 9, 9, 9, 9, 6, 6, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:06:50,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Forceful destruction successful, exit code 0 [2022-04-28 06:06:50,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:06:50,382 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:06:50,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:06:50,382 INFO L85 PathProgramCache]: Analyzing trace with hash -160708573, now seen corresponding path program 29 times [2022-04-28 06:06:50,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:06:50,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [87551201] [2022-04-28 06:06:50,382 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:06:50,382 INFO L85 PathProgramCache]: Analyzing trace with hash -160708573, now seen corresponding path program 30 times [2022-04-28 06:06:50,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:06:50,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641421282] [2022-04-28 06:06:50,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:06:50,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:06:50,396 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:06:50,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [215318880] [2022-04-28 06:06:50,397 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 06:06:50,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:06:50,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:06:50,398 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:06:50,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2022-04-28 06:06:51,432 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-28 06:06:51,432 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:06:51,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-28 06:06:51,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:06:51,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:06:52,431 INFO L272 TraceCheckUtils]: 0: Hoare triple {169631#true} call ULTIMATE.init(); {169631#true} is VALID [2022-04-28 06:06:52,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {169631#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; {169639#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:52,432 INFO L290 TraceCheckUtils]: 2: Hoare triple {169639#(<= ~counter~0 0)} assume true; {169639#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:52,432 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {169639#(<= ~counter~0 0)} {169631#true} #102#return; {169639#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:52,433 INFO L272 TraceCheckUtils]: 4: Hoare triple {169639#(<= ~counter~0 0)} call #t~ret9 := main(); {169639#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:52,433 INFO L290 TraceCheckUtils]: 5: Hoare triple {169639#(<= ~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; {169639#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:52,433 INFO L272 TraceCheckUtils]: 6: Hoare triple {169639#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {169639#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:52,434 INFO L290 TraceCheckUtils]: 7: Hoare triple {169639#(<= ~counter~0 0)} ~cond := #in~cond; {169639#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:52,434 INFO L290 TraceCheckUtils]: 8: Hoare triple {169639#(<= ~counter~0 0)} assume !(0 == ~cond); {169639#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:52,434 INFO L290 TraceCheckUtils]: 9: Hoare triple {169639#(<= ~counter~0 0)} assume true; {169639#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:52,435 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {169639#(<= ~counter~0 0)} {169639#(<= ~counter~0 0)} #90#return; {169639#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:52,435 INFO L272 TraceCheckUtils]: 11: Hoare triple {169639#(<= ~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)); {169639#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:52,435 INFO L290 TraceCheckUtils]: 12: Hoare triple {169639#(<= ~counter~0 0)} ~cond := #in~cond; {169639#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:52,435 INFO L290 TraceCheckUtils]: 13: Hoare triple {169639#(<= ~counter~0 0)} assume !(0 == ~cond); {169639#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:52,436 INFO L290 TraceCheckUtils]: 14: Hoare triple {169639#(<= ~counter~0 0)} assume true; {169639#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:52,436 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {169639#(<= ~counter~0 0)} {169639#(<= ~counter~0 0)} #92#return; {169639#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:52,436 INFO L290 TraceCheckUtils]: 16: Hoare triple {169639#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {169639#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:52,440 INFO L290 TraceCheckUtils]: 17: Hoare triple {169639#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {169688#(<= ~counter~0 1)} is VALID [2022-04-28 06:06:52,441 INFO L290 TraceCheckUtils]: 18: Hoare triple {169688#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {169688#(<= ~counter~0 1)} is VALID [2022-04-28 06:06:52,441 INFO L272 TraceCheckUtils]: 19: Hoare triple {169688#(<= ~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)); {169688#(<= ~counter~0 1)} is VALID [2022-04-28 06:06:52,441 INFO L290 TraceCheckUtils]: 20: Hoare triple {169688#(<= ~counter~0 1)} ~cond := #in~cond; {169688#(<= ~counter~0 1)} is VALID [2022-04-28 06:06:52,442 INFO L290 TraceCheckUtils]: 21: Hoare triple {169688#(<= ~counter~0 1)} assume !(0 == ~cond); {169688#(<= ~counter~0 1)} is VALID [2022-04-28 06:06:52,442 INFO L290 TraceCheckUtils]: 22: Hoare triple {169688#(<= ~counter~0 1)} assume true; {169688#(<= ~counter~0 1)} is VALID [2022-04-28 06:06:52,442 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {169688#(<= ~counter~0 1)} {169688#(<= ~counter~0 1)} #94#return; {169688#(<= ~counter~0 1)} is VALID [2022-04-28 06:06:52,443 INFO L290 TraceCheckUtils]: 24: Hoare triple {169688#(<= ~counter~0 1)} assume !!(0 != ~r~0); {169688#(<= ~counter~0 1)} is VALID [2022-04-28 06:06:52,444 INFO L290 TraceCheckUtils]: 25: Hoare triple {169688#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {169713#(<= ~counter~0 2)} is VALID [2022-04-28 06:06:52,444 INFO L290 TraceCheckUtils]: 26: Hoare triple {169713#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {169713#(<= ~counter~0 2)} is VALID [2022-04-28 06:06:52,445 INFO L272 TraceCheckUtils]: 27: Hoare triple {169713#(<= ~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)); {169713#(<= ~counter~0 2)} is VALID [2022-04-28 06:06:52,445 INFO L290 TraceCheckUtils]: 28: Hoare triple {169713#(<= ~counter~0 2)} ~cond := #in~cond; {169713#(<= ~counter~0 2)} is VALID [2022-04-28 06:06:52,445 INFO L290 TraceCheckUtils]: 29: Hoare triple {169713#(<= ~counter~0 2)} assume !(0 == ~cond); {169713#(<= ~counter~0 2)} is VALID [2022-04-28 06:06:52,446 INFO L290 TraceCheckUtils]: 30: Hoare triple {169713#(<= ~counter~0 2)} assume true; {169713#(<= ~counter~0 2)} is VALID [2022-04-28 06:06:52,446 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {169713#(<= ~counter~0 2)} {169713#(<= ~counter~0 2)} #96#return; {169713#(<= ~counter~0 2)} is VALID [2022-04-28 06:06:52,446 INFO L290 TraceCheckUtils]: 32: Hoare triple {169713#(<= ~counter~0 2)} assume !(~r~0 > 0); {169713#(<= ~counter~0 2)} is VALID [2022-04-28 06:06:52,448 INFO L290 TraceCheckUtils]: 33: Hoare triple {169713#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {169738#(<= ~counter~0 3)} is VALID [2022-04-28 06:06:52,448 INFO L290 TraceCheckUtils]: 34: Hoare triple {169738#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {169738#(<= ~counter~0 3)} is VALID [2022-04-28 06:06:52,449 INFO L272 TraceCheckUtils]: 35: Hoare triple {169738#(<= ~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)); {169738#(<= ~counter~0 3)} is VALID [2022-04-28 06:06:52,449 INFO L290 TraceCheckUtils]: 36: Hoare triple {169738#(<= ~counter~0 3)} ~cond := #in~cond; {169738#(<= ~counter~0 3)} is VALID [2022-04-28 06:06:52,449 INFO L290 TraceCheckUtils]: 37: Hoare triple {169738#(<= ~counter~0 3)} assume !(0 == ~cond); {169738#(<= ~counter~0 3)} is VALID [2022-04-28 06:06:52,449 INFO L290 TraceCheckUtils]: 38: Hoare triple {169738#(<= ~counter~0 3)} assume true; {169738#(<= ~counter~0 3)} is VALID [2022-04-28 06:06:52,450 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {169738#(<= ~counter~0 3)} {169738#(<= ~counter~0 3)} #98#return; {169738#(<= ~counter~0 3)} is VALID [2022-04-28 06:06:52,450 INFO L290 TraceCheckUtils]: 40: Hoare triple {169738#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {169738#(<= ~counter~0 3)} is VALID [2022-04-28 06:06:52,452 INFO L290 TraceCheckUtils]: 41: Hoare triple {169738#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {169763#(<= ~counter~0 4)} is VALID [2022-04-28 06:06:52,452 INFO L290 TraceCheckUtils]: 42: Hoare triple {169763#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {169763#(<= ~counter~0 4)} is VALID [2022-04-28 06:06:52,452 INFO L272 TraceCheckUtils]: 43: Hoare triple {169763#(<= ~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)); {169763#(<= ~counter~0 4)} is VALID [2022-04-28 06:06:52,453 INFO L290 TraceCheckUtils]: 44: Hoare triple {169763#(<= ~counter~0 4)} ~cond := #in~cond; {169763#(<= ~counter~0 4)} is VALID [2022-04-28 06:06:52,453 INFO L290 TraceCheckUtils]: 45: Hoare triple {169763#(<= ~counter~0 4)} assume !(0 == ~cond); {169763#(<= ~counter~0 4)} is VALID [2022-04-28 06:06:52,453 INFO L290 TraceCheckUtils]: 46: Hoare triple {169763#(<= ~counter~0 4)} assume true; {169763#(<= ~counter~0 4)} is VALID [2022-04-28 06:06:52,454 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {169763#(<= ~counter~0 4)} {169763#(<= ~counter~0 4)} #98#return; {169763#(<= ~counter~0 4)} is VALID [2022-04-28 06:06:52,454 INFO L290 TraceCheckUtils]: 48: Hoare triple {169763#(<= ~counter~0 4)} assume !(~r~0 < 0); {169763#(<= ~counter~0 4)} is VALID [2022-04-28 06:06:52,455 INFO L290 TraceCheckUtils]: 49: Hoare triple {169763#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {169788#(<= ~counter~0 5)} is VALID [2022-04-28 06:06:52,455 INFO L290 TraceCheckUtils]: 50: Hoare triple {169788#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {169788#(<= ~counter~0 5)} is VALID [2022-04-28 06:06:52,456 INFO L272 TraceCheckUtils]: 51: Hoare triple {169788#(<= ~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)); {169788#(<= ~counter~0 5)} is VALID [2022-04-28 06:06:52,456 INFO L290 TraceCheckUtils]: 52: Hoare triple {169788#(<= ~counter~0 5)} ~cond := #in~cond; {169788#(<= ~counter~0 5)} is VALID [2022-04-28 06:06:52,457 INFO L290 TraceCheckUtils]: 53: Hoare triple {169788#(<= ~counter~0 5)} assume !(0 == ~cond); {169788#(<= ~counter~0 5)} is VALID [2022-04-28 06:06:52,457 INFO L290 TraceCheckUtils]: 54: Hoare triple {169788#(<= ~counter~0 5)} assume true; {169788#(<= ~counter~0 5)} is VALID [2022-04-28 06:06:52,457 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {169788#(<= ~counter~0 5)} {169788#(<= ~counter~0 5)} #94#return; {169788#(<= ~counter~0 5)} is VALID [2022-04-28 06:06:52,458 INFO L290 TraceCheckUtils]: 56: Hoare triple {169788#(<= ~counter~0 5)} assume !!(0 != ~r~0); {169788#(<= ~counter~0 5)} is VALID [2022-04-28 06:06:52,459 INFO L290 TraceCheckUtils]: 57: Hoare triple {169788#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {169813#(<= ~counter~0 6)} is VALID [2022-04-28 06:06:52,459 INFO L290 TraceCheckUtils]: 58: Hoare triple {169813#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {169813#(<= ~counter~0 6)} is VALID [2022-04-28 06:06:52,460 INFO L272 TraceCheckUtils]: 59: Hoare triple {169813#(<= ~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)); {169813#(<= ~counter~0 6)} is VALID [2022-04-28 06:06:52,460 INFO L290 TraceCheckUtils]: 60: Hoare triple {169813#(<= ~counter~0 6)} ~cond := #in~cond; {169813#(<= ~counter~0 6)} is VALID [2022-04-28 06:06:52,460 INFO L290 TraceCheckUtils]: 61: Hoare triple {169813#(<= ~counter~0 6)} assume !(0 == ~cond); {169813#(<= ~counter~0 6)} is VALID [2022-04-28 06:06:52,461 INFO L290 TraceCheckUtils]: 62: Hoare triple {169813#(<= ~counter~0 6)} assume true; {169813#(<= ~counter~0 6)} is VALID [2022-04-28 06:06:52,461 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {169813#(<= ~counter~0 6)} {169813#(<= ~counter~0 6)} #96#return; {169813#(<= ~counter~0 6)} is VALID [2022-04-28 06:06:52,461 INFO L290 TraceCheckUtils]: 64: Hoare triple {169813#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {169813#(<= ~counter~0 6)} is VALID [2022-04-28 06:06:52,463 INFO L290 TraceCheckUtils]: 65: Hoare triple {169813#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {169838#(<= ~counter~0 7)} is VALID [2022-04-28 06:06:52,463 INFO L290 TraceCheckUtils]: 66: Hoare triple {169838#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {169838#(<= ~counter~0 7)} is VALID [2022-04-28 06:06:52,464 INFO L272 TraceCheckUtils]: 67: Hoare triple {169838#(<= ~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)); {169838#(<= ~counter~0 7)} is VALID [2022-04-28 06:06:52,464 INFO L290 TraceCheckUtils]: 68: Hoare triple {169838#(<= ~counter~0 7)} ~cond := #in~cond; {169838#(<= ~counter~0 7)} is VALID [2022-04-28 06:06:52,464 INFO L290 TraceCheckUtils]: 69: Hoare triple {169838#(<= ~counter~0 7)} assume !(0 == ~cond); {169838#(<= ~counter~0 7)} is VALID [2022-04-28 06:06:52,464 INFO L290 TraceCheckUtils]: 70: Hoare triple {169838#(<= ~counter~0 7)} assume true; {169838#(<= ~counter~0 7)} is VALID [2022-04-28 06:06:52,465 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {169838#(<= ~counter~0 7)} {169838#(<= ~counter~0 7)} #96#return; {169838#(<= ~counter~0 7)} is VALID [2022-04-28 06:06:52,465 INFO L290 TraceCheckUtils]: 72: Hoare triple {169838#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {169838#(<= ~counter~0 7)} is VALID [2022-04-28 06:06:52,467 INFO L290 TraceCheckUtils]: 73: Hoare triple {169838#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {169863#(<= ~counter~0 8)} is VALID [2022-04-28 06:06:52,468 INFO L290 TraceCheckUtils]: 74: Hoare triple {169863#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {169863#(<= ~counter~0 8)} is VALID [2022-04-28 06:06:52,468 INFO L272 TraceCheckUtils]: 75: Hoare triple {169863#(<= ~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)); {169863#(<= ~counter~0 8)} is VALID [2022-04-28 06:06:52,468 INFO L290 TraceCheckUtils]: 76: Hoare triple {169863#(<= ~counter~0 8)} ~cond := #in~cond; {169863#(<= ~counter~0 8)} is VALID [2022-04-28 06:06:52,469 INFO L290 TraceCheckUtils]: 77: Hoare triple {169863#(<= ~counter~0 8)} assume !(0 == ~cond); {169863#(<= ~counter~0 8)} is VALID [2022-04-28 06:06:52,469 INFO L290 TraceCheckUtils]: 78: Hoare triple {169863#(<= ~counter~0 8)} assume true; {169863#(<= ~counter~0 8)} is VALID [2022-04-28 06:06:52,469 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {169863#(<= ~counter~0 8)} {169863#(<= ~counter~0 8)} #96#return; {169863#(<= ~counter~0 8)} is VALID [2022-04-28 06:06:52,470 INFO L290 TraceCheckUtils]: 80: Hoare triple {169863#(<= ~counter~0 8)} assume !(~r~0 > 0); {169863#(<= ~counter~0 8)} is VALID [2022-04-28 06:06:52,471 INFO L290 TraceCheckUtils]: 81: Hoare triple {169863#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {169888#(<= ~counter~0 9)} is VALID [2022-04-28 06:06:52,471 INFO L290 TraceCheckUtils]: 82: Hoare triple {169888#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {169888#(<= ~counter~0 9)} is VALID [2022-04-28 06:06:52,472 INFO L272 TraceCheckUtils]: 83: Hoare triple {169888#(<= ~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)); {169888#(<= ~counter~0 9)} is VALID [2022-04-28 06:06:52,472 INFO L290 TraceCheckUtils]: 84: Hoare triple {169888#(<= ~counter~0 9)} ~cond := #in~cond; {169888#(<= ~counter~0 9)} is VALID [2022-04-28 06:06:52,472 INFO L290 TraceCheckUtils]: 85: Hoare triple {169888#(<= ~counter~0 9)} assume !(0 == ~cond); {169888#(<= ~counter~0 9)} is VALID [2022-04-28 06:06:52,473 INFO L290 TraceCheckUtils]: 86: Hoare triple {169888#(<= ~counter~0 9)} assume true; {169888#(<= ~counter~0 9)} is VALID [2022-04-28 06:06:52,473 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {169888#(<= ~counter~0 9)} {169888#(<= ~counter~0 9)} #98#return; {169888#(<= ~counter~0 9)} is VALID [2022-04-28 06:06:52,473 INFO L290 TraceCheckUtils]: 88: Hoare triple {169888#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {169888#(<= ~counter~0 9)} is VALID [2022-04-28 06:06:52,475 INFO L290 TraceCheckUtils]: 89: Hoare triple {169888#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {169913#(<= ~counter~0 10)} is VALID [2022-04-28 06:06:52,475 INFO L290 TraceCheckUtils]: 90: Hoare triple {169913#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {169913#(<= ~counter~0 10)} is VALID [2022-04-28 06:06:52,476 INFO L272 TraceCheckUtils]: 91: Hoare triple {169913#(<= ~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)); {169913#(<= ~counter~0 10)} is VALID [2022-04-28 06:06:52,476 INFO L290 TraceCheckUtils]: 92: Hoare triple {169913#(<= ~counter~0 10)} ~cond := #in~cond; {169913#(<= ~counter~0 10)} is VALID [2022-04-28 06:06:52,476 INFO L290 TraceCheckUtils]: 93: Hoare triple {169913#(<= ~counter~0 10)} assume !(0 == ~cond); {169913#(<= ~counter~0 10)} is VALID [2022-04-28 06:06:52,476 INFO L290 TraceCheckUtils]: 94: Hoare triple {169913#(<= ~counter~0 10)} assume true; {169913#(<= ~counter~0 10)} is VALID [2022-04-28 06:06:52,477 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {169913#(<= ~counter~0 10)} {169913#(<= ~counter~0 10)} #98#return; {169913#(<= ~counter~0 10)} is VALID [2022-04-28 06:06:52,477 INFO L290 TraceCheckUtils]: 96: Hoare triple {169913#(<= ~counter~0 10)} assume !(~r~0 < 0); {169913#(<= ~counter~0 10)} is VALID [2022-04-28 06:06:52,479 INFO L290 TraceCheckUtils]: 97: Hoare triple {169913#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {169938#(<= ~counter~0 11)} is VALID [2022-04-28 06:06:52,479 INFO L290 TraceCheckUtils]: 98: Hoare triple {169938#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {169938#(<= ~counter~0 11)} is VALID [2022-04-28 06:06:52,479 INFO L272 TraceCheckUtils]: 99: Hoare triple {169938#(<= ~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)); {169938#(<= ~counter~0 11)} is VALID [2022-04-28 06:06:52,480 INFO L290 TraceCheckUtils]: 100: Hoare triple {169938#(<= ~counter~0 11)} ~cond := #in~cond; {169938#(<= ~counter~0 11)} is VALID [2022-04-28 06:06:52,480 INFO L290 TraceCheckUtils]: 101: Hoare triple {169938#(<= ~counter~0 11)} assume !(0 == ~cond); {169938#(<= ~counter~0 11)} is VALID [2022-04-28 06:06:52,480 INFO L290 TraceCheckUtils]: 102: Hoare triple {169938#(<= ~counter~0 11)} assume true; {169938#(<= ~counter~0 11)} is VALID [2022-04-28 06:06:52,481 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {169938#(<= ~counter~0 11)} {169938#(<= ~counter~0 11)} #94#return; {169938#(<= ~counter~0 11)} is VALID [2022-04-28 06:06:52,481 INFO L290 TraceCheckUtils]: 104: Hoare triple {169938#(<= ~counter~0 11)} assume !!(0 != ~r~0); {169938#(<= ~counter~0 11)} is VALID [2022-04-28 06:06:52,482 INFO L290 TraceCheckUtils]: 105: Hoare triple {169938#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {169963#(<= ~counter~0 12)} is VALID [2022-04-28 06:06:52,483 INFO L290 TraceCheckUtils]: 106: Hoare triple {169963#(<= ~counter~0 12)} assume !!(#t~post7 < 100);havoc #t~post7; {169963#(<= ~counter~0 12)} is VALID [2022-04-28 06:06:52,483 INFO L272 TraceCheckUtils]: 107: Hoare triple {169963#(<= ~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)); {169963#(<= ~counter~0 12)} is VALID [2022-04-28 06:06:52,483 INFO L290 TraceCheckUtils]: 108: Hoare triple {169963#(<= ~counter~0 12)} ~cond := #in~cond; {169963#(<= ~counter~0 12)} is VALID [2022-04-28 06:06:52,484 INFO L290 TraceCheckUtils]: 109: Hoare triple {169963#(<= ~counter~0 12)} assume !(0 == ~cond); {169963#(<= ~counter~0 12)} is VALID [2022-04-28 06:06:52,484 INFO L290 TraceCheckUtils]: 110: Hoare triple {169963#(<= ~counter~0 12)} assume true; {169963#(<= ~counter~0 12)} is VALID [2022-04-28 06:06:52,484 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {169963#(<= ~counter~0 12)} {169963#(<= ~counter~0 12)} #96#return; {169963#(<= ~counter~0 12)} is VALID [2022-04-28 06:06:52,485 INFO L290 TraceCheckUtils]: 112: Hoare triple {169963#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {169963#(<= ~counter~0 12)} is VALID [2022-04-28 06:06:52,486 INFO L290 TraceCheckUtils]: 113: Hoare triple {169963#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {169988#(<= ~counter~0 13)} is VALID [2022-04-28 06:06:52,486 INFO L290 TraceCheckUtils]: 114: Hoare triple {169988#(<= ~counter~0 13)} assume !!(#t~post7 < 100);havoc #t~post7; {169988#(<= ~counter~0 13)} is VALID [2022-04-28 06:06:52,487 INFO L272 TraceCheckUtils]: 115: Hoare triple {169988#(<= ~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)); {169988#(<= ~counter~0 13)} is VALID [2022-04-28 06:06:52,487 INFO L290 TraceCheckUtils]: 116: Hoare triple {169988#(<= ~counter~0 13)} ~cond := #in~cond; {169988#(<= ~counter~0 13)} is VALID [2022-04-28 06:06:52,487 INFO L290 TraceCheckUtils]: 117: Hoare triple {169988#(<= ~counter~0 13)} assume !(0 == ~cond); {169988#(<= ~counter~0 13)} is VALID [2022-04-28 06:06:52,488 INFO L290 TraceCheckUtils]: 118: Hoare triple {169988#(<= ~counter~0 13)} assume true; {169988#(<= ~counter~0 13)} is VALID [2022-04-28 06:06:52,488 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {169988#(<= ~counter~0 13)} {169988#(<= ~counter~0 13)} #96#return; {169988#(<= ~counter~0 13)} is VALID [2022-04-28 06:06:52,489 INFO L290 TraceCheckUtils]: 120: Hoare triple {169988#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {169988#(<= ~counter~0 13)} is VALID [2022-04-28 06:06:52,490 INFO L290 TraceCheckUtils]: 121: Hoare triple {169988#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {170013#(<= ~counter~0 14)} is VALID [2022-04-28 06:06:52,490 INFO L290 TraceCheckUtils]: 122: Hoare triple {170013#(<= ~counter~0 14)} assume !!(#t~post7 < 100);havoc #t~post7; {170013#(<= ~counter~0 14)} is VALID [2022-04-28 06:06:52,491 INFO L272 TraceCheckUtils]: 123: Hoare triple {170013#(<= ~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)); {170013#(<= ~counter~0 14)} is VALID [2022-04-28 06:06:52,491 INFO L290 TraceCheckUtils]: 124: Hoare triple {170013#(<= ~counter~0 14)} ~cond := #in~cond; {170013#(<= ~counter~0 14)} is VALID [2022-04-28 06:06:52,491 INFO L290 TraceCheckUtils]: 125: Hoare triple {170013#(<= ~counter~0 14)} assume !(0 == ~cond); {170013#(<= ~counter~0 14)} is VALID [2022-04-28 06:06:52,492 INFO L290 TraceCheckUtils]: 126: Hoare triple {170013#(<= ~counter~0 14)} assume true; {170013#(<= ~counter~0 14)} is VALID [2022-04-28 06:06:52,492 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {170013#(<= ~counter~0 14)} {170013#(<= ~counter~0 14)} #96#return; {170013#(<= ~counter~0 14)} is VALID [2022-04-28 06:06:52,492 INFO L290 TraceCheckUtils]: 128: Hoare triple {170013#(<= ~counter~0 14)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {170013#(<= ~counter~0 14)} is VALID [2022-04-28 06:06:52,494 INFO L290 TraceCheckUtils]: 129: Hoare triple {170013#(<= ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {170038#(<= ~counter~0 15)} is VALID [2022-04-28 06:06:52,494 INFO L290 TraceCheckUtils]: 130: Hoare triple {170038#(<= ~counter~0 15)} assume !!(#t~post7 < 100);havoc #t~post7; {170038#(<= ~counter~0 15)} is VALID [2022-04-28 06:06:52,495 INFO L272 TraceCheckUtils]: 131: Hoare triple {170038#(<= ~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)); {170038#(<= ~counter~0 15)} is VALID [2022-04-28 06:06:52,495 INFO L290 TraceCheckUtils]: 132: Hoare triple {170038#(<= ~counter~0 15)} ~cond := #in~cond; {170038#(<= ~counter~0 15)} is VALID [2022-04-28 06:06:52,495 INFO L290 TraceCheckUtils]: 133: Hoare triple {170038#(<= ~counter~0 15)} assume !(0 == ~cond); {170038#(<= ~counter~0 15)} is VALID [2022-04-28 06:06:52,496 INFO L290 TraceCheckUtils]: 134: Hoare triple {170038#(<= ~counter~0 15)} assume true; {170038#(<= ~counter~0 15)} is VALID [2022-04-28 06:06:52,496 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {170038#(<= ~counter~0 15)} {170038#(<= ~counter~0 15)} #96#return; {170038#(<= ~counter~0 15)} is VALID [2022-04-28 06:06:52,496 INFO L290 TraceCheckUtils]: 136: Hoare triple {170038#(<= ~counter~0 15)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {170038#(<= ~counter~0 15)} is VALID [2022-04-28 06:06:52,498 INFO L290 TraceCheckUtils]: 137: Hoare triple {170038#(<= ~counter~0 15)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {170063#(<= ~counter~0 16)} is VALID [2022-04-28 06:06:52,498 INFO L290 TraceCheckUtils]: 138: Hoare triple {170063#(<= ~counter~0 16)} assume !!(#t~post7 < 100);havoc #t~post7; {170063#(<= ~counter~0 16)} is VALID [2022-04-28 06:06:52,499 INFO L272 TraceCheckUtils]: 139: Hoare triple {170063#(<= ~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)); {170063#(<= ~counter~0 16)} is VALID [2022-04-28 06:06:52,499 INFO L290 TraceCheckUtils]: 140: Hoare triple {170063#(<= ~counter~0 16)} ~cond := #in~cond; {170063#(<= ~counter~0 16)} is VALID [2022-04-28 06:06:52,499 INFO L290 TraceCheckUtils]: 141: Hoare triple {170063#(<= ~counter~0 16)} assume !(0 == ~cond); {170063#(<= ~counter~0 16)} is VALID [2022-04-28 06:06:52,499 INFO L290 TraceCheckUtils]: 142: Hoare triple {170063#(<= ~counter~0 16)} assume true; {170063#(<= ~counter~0 16)} is VALID [2022-04-28 06:06:52,500 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {170063#(<= ~counter~0 16)} {170063#(<= ~counter~0 16)} #96#return; {170063#(<= ~counter~0 16)} is VALID [2022-04-28 06:06:52,500 INFO L290 TraceCheckUtils]: 144: Hoare triple {170063#(<= ~counter~0 16)} assume !(~r~0 > 0); {170063#(<= ~counter~0 16)} is VALID [2022-04-28 06:06:52,501 INFO L290 TraceCheckUtils]: 145: Hoare triple {170063#(<= ~counter~0 16)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {170088#(<= ~counter~0 17)} is VALID [2022-04-28 06:06:52,502 INFO L290 TraceCheckUtils]: 146: Hoare triple {170088#(<= ~counter~0 17)} assume !!(#t~post8 < 100);havoc #t~post8; {170088#(<= ~counter~0 17)} is VALID [2022-04-28 06:06:52,502 INFO L272 TraceCheckUtils]: 147: Hoare triple {170088#(<= ~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)); {170088#(<= ~counter~0 17)} is VALID [2022-04-28 06:06:52,502 INFO L290 TraceCheckUtils]: 148: Hoare triple {170088#(<= ~counter~0 17)} ~cond := #in~cond; {170088#(<= ~counter~0 17)} is VALID [2022-04-28 06:06:52,503 INFO L290 TraceCheckUtils]: 149: Hoare triple {170088#(<= ~counter~0 17)} assume !(0 == ~cond); {170088#(<= ~counter~0 17)} is VALID [2022-04-28 06:06:52,503 INFO L290 TraceCheckUtils]: 150: Hoare triple {170088#(<= ~counter~0 17)} assume true; {170088#(<= ~counter~0 17)} is VALID [2022-04-28 06:06:52,503 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {170088#(<= ~counter~0 17)} {170088#(<= ~counter~0 17)} #98#return; {170088#(<= ~counter~0 17)} is VALID [2022-04-28 06:06:52,504 INFO L290 TraceCheckUtils]: 152: Hoare triple {170088#(<= ~counter~0 17)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {170088#(<= ~counter~0 17)} is VALID [2022-04-28 06:06:52,504 INFO L290 TraceCheckUtils]: 153: Hoare triple {170088#(<= ~counter~0 17)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {170113#(<= |main_#t~post8| 17)} is VALID [2022-04-28 06:06:52,504 INFO L290 TraceCheckUtils]: 154: Hoare triple {170113#(<= |main_#t~post8| 17)} assume !(#t~post8 < 100);havoc #t~post8; {169632#false} is VALID [2022-04-28 06:06:52,504 INFO L290 TraceCheckUtils]: 155: Hoare triple {169632#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {169632#false} is VALID [2022-04-28 06:06:52,504 INFO L290 TraceCheckUtils]: 156: Hoare triple {169632#false} assume !(#t~post6 < 100);havoc #t~post6; {169632#false} is VALID [2022-04-28 06:06:52,505 INFO L272 TraceCheckUtils]: 157: Hoare triple {169632#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)); {169632#false} is VALID [2022-04-28 06:06:52,505 INFO L290 TraceCheckUtils]: 158: Hoare triple {169632#false} ~cond := #in~cond; {169632#false} is VALID [2022-04-28 06:06:52,505 INFO L290 TraceCheckUtils]: 159: Hoare triple {169632#false} assume 0 == ~cond; {169632#false} is VALID [2022-04-28 06:06:52,505 INFO L290 TraceCheckUtils]: 160: Hoare triple {169632#false} assume !false; {169632#false} is VALID [2022-04-28 06:06:52,505 INFO L134 CoverageAnalysis]: Checked inductivity of 794 backedges. 40 proven. 750 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 06:06:52,505 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:06:53,637 INFO L290 TraceCheckUtils]: 160: Hoare triple {169632#false} assume !false; {169632#false} is VALID [2022-04-28 06:06:53,637 INFO L290 TraceCheckUtils]: 159: Hoare triple {169632#false} assume 0 == ~cond; {169632#false} is VALID [2022-04-28 06:06:53,637 INFO L290 TraceCheckUtils]: 158: Hoare triple {169632#false} ~cond := #in~cond; {169632#false} is VALID [2022-04-28 06:06:53,637 INFO L272 TraceCheckUtils]: 157: Hoare triple {169632#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)); {169632#false} is VALID [2022-04-28 06:06:53,637 INFO L290 TraceCheckUtils]: 156: Hoare triple {169632#false} assume !(#t~post6 < 100);havoc #t~post6; {169632#false} is VALID [2022-04-28 06:06:53,637 INFO L290 TraceCheckUtils]: 155: Hoare triple {169632#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {169632#false} is VALID [2022-04-28 06:06:53,638 INFO L290 TraceCheckUtils]: 154: Hoare triple {170153#(< |main_#t~post8| 100)} assume !(#t~post8 < 100);havoc #t~post8; {169632#false} is VALID [2022-04-28 06:06:53,638 INFO L290 TraceCheckUtils]: 153: Hoare triple {170157#(< ~counter~0 100)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {170153#(< |main_#t~post8| 100)} is VALID [2022-04-28 06:06:53,638 INFO L290 TraceCheckUtils]: 152: Hoare triple {170157#(< ~counter~0 100)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {170157#(< ~counter~0 100)} is VALID [2022-04-28 06:06:53,639 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {169631#true} {170157#(< ~counter~0 100)} #98#return; {170157#(< ~counter~0 100)} is VALID [2022-04-28 06:06:53,639 INFO L290 TraceCheckUtils]: 150: Hoare triple {169631#true} assume true; {169631#true} is VALID [2022-04-28 06:06:53,639 INFO L290 TraceCheckUtils]: 149: Hoare triple {169631#true} assume !(0 == ~cond); {169631#true} is VALID [2022-04-28 06:06:53,639 INFO L290 TraceCheckUtils]: 148: Hoare triple {169631#true} ~cond := #in~cond; {169631#true} is VALID [2022-04-28 06:06:53,639 INFO L272 TraceCheckUtils]: 147: Hoare triple {170157#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169631#true} is VALID [2022-04-28 06:06:53,640 INFO L290 TraceCheckUtils]: 146: Hoare triple {170157#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {170157#(< ~counter~0 100)} is VALID [2022-04-28 06:06:53,643 INFO L290 TraceCheckUtils]: 145: Hoare triple {170182#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {170157#(< ~counter~0 100)} is VALID [2022-04-28 06:06:53,643 INFO L290 TraceCheckUtils]: 144: Hoare triple {170182#(< ~counter~0 99)} assume !(~r~0 > 0); {170182#(< ~counter~0 99)} is VALID [2022-04-28 06:06:53,644 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {169631#true} {170182#(< ~counter~0 99)} #96#return; {170182#(< ~counter~0 99)} is VALID [2022-04-28 06:06:53,644 INFO L290 TraceCheckUtils]: 142: Hoare triple {169631#true} assume true; {169631#true} is VALID [2022-04-28 06:06:53,644 INFO L290 TraceCheckUtils]: 141: Hoare triple {169631#true} assume !(0 == ~cond); {169631#true} is VALID [2022-04-28 06:06:53,644 INFO L290 TraceCheckUtils]: 140: Hoare triple {169631#true} ~cond := #in~cond; {169631#true} is VALID [2022-04-28 06:06:53,644 INFO L272 TraceCheckUtils]: 139: Hoare triple {170182#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169631#true} is VALID [2022-04-28 06:06:53,644 INFO L290 TraceCheckUtils]: 138: Hoare triple {170182#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {170182#(< ~counter~0 99)} is VALID [2022-04-28 06:06:53,646 INFO L290 TraceCheckUtils]: 137: Hoare triple {170207#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {170182#(< ~counter~0 99)} is VALID [2022-04-28 06:06:53,646 INFO L290 TraceCheckUtils]: 136: Hoare triple {170207#(< ~counter~0 98)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {170207#(< ~counter~0 98)} is VALID [2022-04-28 06:06:53,647 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {169631#true} {170207#(< ~counter~0 98)} #96#return; {170207#(< ~counter~0 98)} is VALID [2022-04-28 06:06:53,647 INFO L290 TraceCheckUtils]: 134: Hoare triple {169631#true} assume true; {169631#true} is VALID [2022-04-28 06:06:53,647 INFO L290 TraceCheckUtils]: 133: Hoare triple {169631#true} assume !(0 == ~cond); {169631#true} is VALID [2022-04-28 06:06:53,647 INFO L290 TraceCheckUtils]: 132: Hoare triple {169631#true} ~cond := #in~cond; {169631#true} is VALID [2022-04-28 06:06:53,647 INFO L272 TraceCheckUtils]: 131: Hoare triple {170207#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169631#true} is VALID [2022-04-28 06:06:53,647 INFO L290 TraceCheckUtils]: 130: Hoare triple {170207#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {170207#(< ~counter~0 98)} is VALID [2022-04-28 06:06:53,649 INFO L290 TraceCheckUtils]: 129: Hoare triple {170232#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {170207#(< ~counter~0 98)} is VALID [2022-04-28 06:06:53,649 INFO L290 TraceCheckUtils]: 128: Hoare triple {170232#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {170232#(< ~counter~0 97)} is VALID [2022-04-28 06:06:53,649 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {169631#true} {170232#(< ~counter~0 97)} #96#return; {170232#(< ~counter~0 97)} is VALID [2022-04-28 06:06:53,649 INFO L290 TraceCheckUtils]: 126: Hoare triple {169631#true} assume true; {169631#true} is VALID [2022-04-28 06:06:53,650 INFO L290 TraceCheckUtils]: 125: Hoare triple {169631#true} assume !(0 == ~cond); {169631#true} is VALID [2022-04-28 06:06:53,650 INFO L290 TraceCheckUtils]: 124: Hoare triple {169631#true} ~cond := #in~cond; {169631#true} is VALID [2022-04-28 06:06:53,650 INFO L272 TraceCheckUtils]: 123: Hoare triple {170232#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169631#true} is VALID [2022-04-28 06:06:53,650 INFO L290 TraceCheckUtils]: 122: Hoare triple {170232#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {170232#(< ~counter~0 97)} is VALID [2022-04-28 06:06:53,651 INFO L290 TraceCheckUtils]: 121: Hoare triple {170257#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {170232#(< ~counter~0 97)} is VALID [2022-04-28 06:06:53,652 INFO L290 TraceCheckUtils]: 120: Hoare triple {170257#(< ~counter~0 96)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {170257#(< ~counter~0 96)} is VALID [2022-04-28 06:06:53,652 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {169631#true} {170257#(< ~counter~0 96)} #96#return; {170257#(< ~counter~0 96)} is VALID [2022-04-28 06:06:53,652 INFO L290 TraceCheckUtils]: 118: Hoare triple {169631#true} assume true; {169631#true} is VALID [2022-04-28 06:06:53,652 INFO L290 TraceCheckUtils]: 117: Hoare triple {169631#true} assume !(0 == ~cond); {169631#true} is VALID [2022-04-28 06:06:53,652 INFO L290 TraceCheckUtils]: 116: Hoare triple {169631#true} ~cond := #in~cond; {169631#true} is VALID [2022-04-28 06:06:53,652 INFO L272 TraceCheckUtils]: 115: Hoare triple {170257#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169631#true} is VALID [2022-04-28 06:06:53,653 INFO L290 TraceCheckUtils]: 114: Hoare triple {170257#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {170257#(< ~counter~0 96)} is VALID [2022-04-28 06:06:53,654 INFO L290 TraceCheckUtils]: 113: Hoare triple {170282#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {170257#(< ~counter~0 96)} is VALID [2022-04-28 06:06:53,654 INFO L290 TraceCheckUtils]: 112: Hoare triple {170282#(< ~counter~0 95)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {170282#(< ~counter~0 95)} is VALID [2022-04-28 06:06:53,655 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {169631#true} {170282#(< ~counter~0 95)} #96#return; {170282#(< ~counter~0 95)} is VALID [2022-04-28 06:06:53,655 INFO L290 TraceCheckUtils]: 110: Hoare triple {169631#true} assume true; {169631#true} is VALID [2022-04-28 06:06:53,655 INFO L290 TraceCheckUtils]: 109: Hoare triple {169631#true} assume !(0 == ~cond); {169631#true} is VALID [2022-04-28 06:06:53,655 INFO L290 TraceCheckUtils]: 108: Hoare triple {169631#true} ~cond := #in~cond; {169631#true} is VALID [2022-04-28 06:06:53,655 INFO L272 TraceCheckUtils]: 107: Hoare triple {170282#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169631#true} is VALID [2022-04-28 06:06:53,655 INFO L290 TraceCheckUtils]: 106: Hoare triple {170282#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {170282#(< ~counter~0 95)} is VALID [2022-04-28 06:06:53,657 INFO L290 TraceCheckUtils]: 105: Hoare triple {170307#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {170282#(< ~counter~0 95)} is VALID [2022-04-28 06:06:53,657 INFO L290 TraceCheckUtils]: 104: Hoare triple {170307#(< ~counter~0 94)} assume !!(0 != ~r~0); {170307#(< ~counter~0 94)} is VALID [2022-04-28 06:06:53,658 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {169631#true} {170307#(< ~counter~0 94)} #94#return; {170307#(< ~counter~0 94)} is VALID [2022-04-28 06:06:53,658 INFO L290 TraceCheckUtils]: 102: Hoare triple {169631#true} assume true; {169631#true} is VALID [2022-04-28 06:06:53,658 INFO L290 TraceCheckUtils]: 101: Hoare triple {169631#true} assume !(0 == ~cond); {169631#true} is VALID [2022-04-28 06:06:53,658 INFO L290 TraceCheckUtils]: 100: Hoare triple {169631#true} ~cond := #in~cond; {169631#true} is VALID [2022-04-28 06:06:53,658 INFO L272 TraceCheckUtils]: 99: Hoare triple {170307#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169631#true} is VALID [2022-04-28 06:06:53,658 INFO L290 TraceCheckUtils]: 98: Hoare triple {170307#(< ~counter~0 94)} assume !!(#t~post6 < 100);havoc #t~post6; {170307#(< ~counter~0 94)} is VALID [2022-04-28 06:06:53,660 INFO L290 TraceCheckUtils]: 97: Hoare triple {170332#(< ~counter~0 93)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {170307#(< ~counter~0 94)} is VALID [2022-04-28 06:06:53,660 INFO L290 TraceCheckUtils]: 96: Hoare triple {170332#(< ~counter~0 93)} assume !(~r~0 < 0); {170332#(< ~counter~0 93)} is VALID [2022-04-28 06:06:53,660 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {169631#true} {170332#(< ~counter~0 93)} #98#return; {170332#(< ~counter~0 93)} is VALID [2022-04-28 06:06:53,660 INFO L290 TraceCheckUtils]: 94: Hoare triple {169631#true} assume true; {169631#true} is VALID [2022-04-28 06:06:53,660 INFO L290 TraceCheckUtils]: 93: Hoare triple {169631#true} assume !(0 == ~cond); {169631#true} is VALID [2022-04-28 06:06:53,661 INFO L290 TraceCheckUtils]: 92: Hoare triple {169631#true} ~cond := #in~cond; {169631#true} is VALID [2022-04-28 06:06:53,661 INFO L272 TraceCheckUtils]: 91: Hoare triple {170332#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169631#true} is VALID [2022-04-28 06:06:53,661 INFO L290 TraceCheckUtils]: 90: Hoare triple {170332#(< ~counter~0 93)} assume !!(#t~post8 < 100);havoc #t~post8; {170332#(< ~counter~0 93)} is VALID [2022-04-28 06:06:53,662 INFO L290 TraceCheckUtils]: 89: Hoare triple {170357#(< ~counter~0 92)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {170332#(< ~counter~0 93)} is VALID [2022-04-28 06:06:53,663 INFO L290 TraceCheckUtils]: 88: Hoare triple {170357#(< ~counter~0 92)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {170357#(< ~counter~0 92)} is VALID [2022-04-28 06:06:53,663 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {169631#true} {170357#(< ~counter~0 92)} #98#return; {170357#(< ~counter~0 92)} is VALID [2022-04-28 06:06:53,663 INFO L290 TraceCheckUtils]: 86: Hoare triple {169631#true} assume true; {169631#true} is VALID [2022-04-28 06:06:53,663 INFO L290 TraceCheckUtils]: 85: Hoare triple {169631#true} assume !(0 == ~cond); {169631#true} is VALID [2022-04-28 06:06:53,663 INFO L290 TraceCheckUtils]: 84: Hoare triple {169631#true} ~cond := #in~cond; {169631#true} is VALID [2022-04-28 06:06:53,663 INFO L272 TraceCheckUtils]: 83: Hoare triple {170357#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169631#true} is VALID [2022-04-28 06:06:53,664 INFO L290 TraceCheckUtils]: 82: Hoare triple {170357#(< ~counter~0 92)} assume !!(#t~post8 < 100);havoc #t~post8; {170357#(< ~counter~0 92)} is VALID [2022-04-28 06:06:53,665 INFO L290 TraceCheckUtils]: 81: Hoare triple {170382#(< ~counter~0 91)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {170357#(< ~counter~0 92)} is VALID [2022-04-28 06:06:53,665 INFO L290 TraceCheckUtils]: 80: Hoare triple {170382#(< ~counter~0 91)} assume !(~r~0 > 0); {170382#(< ~counter~0 91)} is VALID [2022-04-28 06:06:53,666 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {169631#true} {170382#(< ~counter~0 91)} #96#return; {170382#(< ~counter~0 91)} is VALID [2022-04-28 06:06:53,666 INFO L290 TraceCheckUtils]: 78: Hoare triple {169631#true} assume true; {169631#true} is VALID [2022-04-28 06:06:53,666 INFO L290 TraceCheckUtils]: 77: Hoare triple {169631#true} assume !(0 == ~cond); {169631#true} is VALID [2022-04-28 06:06:53,666 INFO L290 TraceCheckUtils]: 76: Hoare triple {169631#true} ~cond := #in~cond; {169631#true} is VALID [2022-04-28 06:06:53,666 INFO L272 TraceCheckUtils]: 75: Hoare triple {170382#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169631#true} is VALID [2022-04-28 06:06:53,667 INFO L290 TraceCheckUtils]: 74: Hoare triple {170382#(< ~counter~0 91)} assume !!(#t~post7 < 100);havoc #t~post7; {170382#(< ~counter~0 91)} is VALID [2022-04-28 06:06:53,668 INFO L290 TraceCheckUtils]: 73: Hoare triple {170407#(< ~counter~0 90)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {170382#(< ~counter~0 91)} is VALID [2022-04-28 06:06:53,668 INFO L290 TraceCheckUtils]: 72: Hoare triple {170407#(< ~counter~0 90)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {170407#(< ~counter~0 90)} is VALID [2022-04-28 06:06:53,669 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {169631#true} {170407#(< ~counter~0 90)} #96#return; {170407#(< ~counter~0 90)} is VALID [2022-04-28 06:06:53,669 INFO L290 TraceCheckUtils]: 70: Hoare triple {169631#true} assume true; {169631#true} is VALID [2022-04-28 06:06:53,669 INFO L290 TraceCheckUtils]: 69: Hoare triple {169631#true} assume !(0 == ~cond); {169631#true} is VALID [2022-04-28 06:06:53,669 INFO L290 TraceCheckUtils]: 68: Hoare triple {169631#true} ~cond := #in~cond; {169631#true} is VALID [2022-04-28 06:06:53,669 INFO L272 TraceCheckUtils]: 67: Hoare triple {170407#(< ~counter~0 90)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169631#true} is VALID [2022-04-28 06:06:53,670 INFO L290 TraceCheckUtils]: 66: Hoare triple {170407#(< ~counter~0 90)} assume !!(#t~post7 < 100);havoc #t~post7; {170407#(< ~counter~0 90)} is VALID [2022-04-28 06:06:53,671 INFO L290 TraceCheckUtils]: 65: Hoare triple {170432#(< ~counter~0 89)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {170407#(< ~counter~0 90)} is VALID [2022-04-28 06:06:53,671 INFO L290 TraceCheckUtils]: 64: Hoare triple {170432#(< ~counter~0 89)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {170432#(< ~counter~0 89)} is VALID [2022-04-28 06:06:53,672 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {169631#true} {170432#(< ~counter~0 89)} #96#return; {170432#(< ~counter~0 89)} is VALID [2022-04-28 06:06:53,672 INFO L290 TraceCheckUtils]: 62: Hoare triple {169631#true} assume true; {169631#true} is VALID [2022-04-28 06:06:53,672 INFO L290 TraceCheckUtils]: 61: Hoare triple {169631#true} assume !(0 == ~cond); {169631#true} is VALID [2022-04-28 06:06:53,672 INFO L290 TraceCheckUtils]: 60: Hoare triple {169631#true} ~cond := #in~cond; {169631#true} is VALID [2022-04-28 06:06:53,672 INFO L272 TraceCheckUtils]: 59: Hoare triple {170432#(< ~counter~0 89)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169631#true} is VALID [2022-04-28 06:06:53,673 INFO L290 TraceCheckUtils]: 58: Hoare triple {170432#(< ~counter~0 89)} assume !!(#t~post7 < 100);havoc #t~post7; {170432#(< ~counter~0 89)} is VALID [2022-04-28 06:06:53,674 INFO L290 TraceCheckUtils]: 57: Hoare triple {170457#(< ~counter~0 88)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {170432#(< ~counter~0 89)} is VALID [2022-04-28 06:06:53,674 INFO L290 TraceCheckUtils]: 56: Hoare triple {170457#(< ~counter~0 88)} assume !!(0 != ~r~0); {170457#(< ~counter~0 88)} is VALID [2022-04-28 06:06:53,675 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {169631#true} {170457#(< ~counter~0 88)} #94#return; {170457#(< ~counter~0 88)} is VALID [2022-04-28 06:06:53,675 INFO L290 TraceCheckUtils]: 54: Hoare triple {169631#true} assume true; {169631#true} is VALID [2022-04-28 06:06:53,675 INFO L290 TraceCheckUtils]: 53: Hoare triple {169631#true} assume !(0 == ~cond); {169631#true} is VALID [2022-04-28 06:06:53,675 INFO L290 TraceCheckUtils]: 52: Hoare triple {169631#true} ~cond := #in~cond; {169631#true} is VALID [2022-04-28 06:06:53,675 INFO L272 TraceCheckUtils]: 51: Hoare triple {170457#(< ~counter~0 88)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169631#true} is VALID [2022-04-28 06:06:53,676 INFO L290 TraceCheckUtils]: 50: Hoare triple {170457#(< ~counter~0 88)} assume !!(#t~post6 < 100);havoc #t~post6; {170457#(< ~counter~0 88)} is VALID [2022-04-28 06:06:53,677 INFO L290 TraceCheckUtils]: 49: Hoare triple {170482#(< ~counter~0 87)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {170457#(< ~counter~0 88)} is VALID [2022-04-28 06:06:53,677 INFO L290 TraceCheckUtils]: 48: Hoare triple {170482#(< ~counter~0 87)} assume !(~r~0 < 0); {170482#(< ~counter~0 87)} is VALID [2022-04-28 06:06:53,678 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {169631#true} {170482#(< ~counter~0 87)} #98#return; {170482#(< ~counter~0 87)} is VALID [2022-04-28 06:06:53,678 INFO L290 TraceCheckUtils]: 46: Hoare triple {169631#true} assume true; {169631#true} is VALID [2022-04-28 06:06:53,678 INFO L290 TraceCheckUtils]: 45: Hoare triple {169631#true} assume !(0 == ~cond); {169631#true} is VALID [2022-04-28 06:06:53,678 INFO L290 TraceCheckUtils]: 44: Hoare triple {169631#true} ~cond := #in~cond; {169631#true} is VALID [2022-04-28 06:06:53,678 INFO L272 TraceCheckUtils]: 43: Hoare triple {170482#(< ~counter~0 87)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169631#true} is VALID [2022-04-28 06:06:53,679 INFO L290 TraceCheckUtils]: 42: Hoare triple {170482#(< ~counter~0 87)} assume !!(#t~post8 < 100);havoc #t~post8; {170482#(< ~counter~0 87)} is VALID [2022-04-28 06:06:53,680 INFO L290 TraceCheckUtils]: 41: Hoare triple {170507#(< ~counter~0 86)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {170482#(< ~counter~0 87)} is VALID [2022-04-28 06:06:53,681 INFO L290 TraceCheckUtils]: 40: Hoare triple {170507#(< ~counter~0 86)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {170507#(< ~counter~0 86)} is VALID [2022-04-28 06:06:53,681 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {169631#true} {170507#(< ~counter~0 86)} #98#return; {170507#(< ~counter~0 86)} is VALID [2022-04-28 06:06:53,681 INFO L290 TraceCheckUtils]: 38: Hoare triple {169631#true} assume true; {169631#true} is VALID [2022-04-28 06:06:53,681 INFO L290 TraceCheckUtils]: 37: Hoare triple {169631#true} assume !(0 == ~cond); {169631#true} is VALID [2022-04-28 06:06:53,681 INFO L290 TraceCheckUtils]: 36: Hoare triple {169631#true} ~cond := #in~cond; {169631#true} is VALID [2022-04-28 06:06:53,682 INFO L272 TraceCheckUtils]: 35: Hoare triple {170507#(< ~counter~0 86)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169631#true} is VALID [2022-04-28 06:06:53,682 INFO L290 TraceCheckUtils]: 34: Hoare triple {170507#(< ~counter~0 86)} assume !!(#t~post8 < 100);havoc #t~post8; {170507#(< ~counter~0 86)} is VALID [2022-04-28 06:06:53,683 INFO L290 TraceCheckUtils]: 33: Hoare triple {170532#(< ~counter~0 85)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {170507#(< ~counter~0 86)} is VALID [2022-04-28 06:06:53,684 INFO L290 TraceCheckUtils]: 32: Hoare triple {170532#(< ~counter~0 85)} assume !(~r~0 > 0); {170532#(< ~counter~0 85)} is VALID [2022-04-28 06:06:53,684 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {169631#true} {170532#(< ~counter~0 85)} #96#return; {170532#(< ~counter~0 85)} is VALID [2022-04-28 06:06:53,684 INFO L290 TraceCheckUtils]: 30: Hoare triple {169631#true} assume true; {169631#true} is VALID [2022-04-28 06:06:53,684 INFO L290 TraceCheckUtils]: 29: Hoare triple {169631#true} assume !(0 == ~cond); {169631#true} is VALID [2022-04-28 06:06:53,684 INFO L290 TraceCheckUtils]: 28: Hoare triple {169631#true} ~cond := #in~cond; {169631#true} is VALID [2022-04-28 06:06:53,685 INFO L272 TraceCheckUtils]: 27: Hoare triple {170532#(< ~counter~0 85)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169631#true} is VALID [2022-04-28 06:06:53,685 INFO L290 TraceCheckUtils]: 26: Hoare triple {170532#(< ~counter~0 85)} assume !!(#t~post7 < 100);havoc #t~post7; {170532#(< ~counter~0 85)} is VALID [2022-04-28 06:06:53,686 INFO L290 TraceCheckUtils]: 25: Hoare triple {170557#(< ~counter~0 84)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {170532#(< ~counter~0 85)} is VALID [2022-04-28 06:06:53,687 INFO L290 TraceCheckUtils]: 24: Hoare triple {170557#(< ~counter~0 84)} assume !!(0 != ~r~0); {170557#(< ~counter~0 84)} is VALID [2022-04-28 06:06:53,687 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {169631#true} {170557#(< ~counter~0 84)} #94#return; {170557#(< ~counter~0 84)} is VALID [2022-04-28 06:06:53,687 INFO L290 TraceCheckUtils]: 22: Hoare triple {169631#true} assume true; {169631#true} is VALID [2022-04-28 06:06:53,687 INFO L290 TraceCheckUtils]: 21: Hoare triple {169631#true} assume !(0 == ~cond); {169631#true} is VALID [2022-04-28 06:06:53,687 INFO L290 TraceCheckUtils]: 20: Hoare triple {169631#true} ~cond := #in~cond; {169631#true} is VALID [2022-04-28 06:06:53,688 INFO L272 TraceCheckUtils]: 19: Hoare triple {170557#(< ~counter~0 84)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {169631#true} is VALID [2022-04-28 06:06:53,688 INFO L290 TraceCheckUtils]: 18: Hoare triple {170557#(< ~counter~0 84)} assume !!(#t~post6 < 100);havoc #t~post6; {170557#(< ~counter~0 84)} is VALID [2022-04-28 06:06:53,689 INFO L290 TraceCheckUtils]: 17: Hoare triple {170582#(< ~counter~0 83)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {170557#(< ~counter~0 84)} is VALID [2022-04-28 06:06:53,690 INFO L290 TraceCheckUtils]: 16: Hoare triple {170582#(< ~counter~0 83)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {170582#(< ~counter~0 83)} is VALID [2022-04-28 06:06:53,690 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {169631#true} {170582#(< ~counter~0 83)} #92#return; {170582#(< ~counter~0 83)} is VALID [2022-04-28 06:06:53,690 INFO L290 TraceCheckUtils]: 14: Hoare triple {169631#true} assume true; {169631#true} is VALID [2022-04-28 06:06:53,690 INFO L290 TraceCheckUtils]: 13: Hoare triple {169631#true} assume !(0 == ~cond); {169631#true} is VALID [2022-04-28 06:06:53,690 INFO L290 TraceCheckUtils]: 12: Hoare triple {169631#true} ~cond := #in~cond; {169631#true} is VALID [2022-04-28 06:06:53,690 INFO L272 TraceCheckUtils]: 11: Hoare triple {170582#(< ~counter~0 83)} 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)); {169631#true} is VALID [2022-04-28 06:06:53,691 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {169631#true} {170582#(< ~counter~0 83)} #90#return; {170582#(< ~counter~0 83)} is VALID [2022-04-28 06:06:53,691 INFO L290 TraceCheckUtils]: 9: Hoare triple {169631#true} assume true; {169631#true} is VALID [2022-04-28 06:06:53,691 INFO L290 TraceCheckUtils]: 8: Hoare triple {169631#true} assume !(0 == ~cond); {169631#true} is VALID [2022-04-28 06:06:53,691 INFO L290 TraceCheckUtils]: 7: Hoare triple {169631#true} ~cond := #in~cond; {169631#true} is VALID [2022-04-28 06:06:53,691 INFO L272 TraceCheckUtils]: 6: Hoare triple {170582#(< ~counter~0 83)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {169631#true} is VALID [2022-04-28 06:06:53,691 INFO L290 TraceCheckUtils]: 5: Hoare triple {170582#(< ~counter~0 83)} 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; {170582#(< ~counter~0 83)} is VALID [2022-04-28 06:06:53,692 INFO L272 TraceCheckUtils]: 4: Hoare triple {170582#(< ~counter~0 83)} call #t~ret9 := main(); {170582#(< ~counter~0 83)} is VALID [2022-04-28 06:06:53,692 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {170582#(< ~counter~0 83)} {169631#true} #102#return; {170582#(< ~counter~0 83)} is VALID [2022-04-28 06:06:53,692 INFO L290 TraceCheckUtils]: 2: Hoare triple {170582#(< ~counter~0 83)} assume true; {170582#(< ~counter~0 83)} is VALID [2022-04-28 06:06:53,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {169631#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; {170582#(< ~counter~0 83)} is VALID [2022-04-28 06:06:53,693 INFO L272 TraceCheckUtils]: 0: Hoare triple {169631#true} call ULTIMATE.init(); {169631#true} is VALID [2022-04-28 06:06:53,693 INFO L134 CoverageAnalysis]: Checked inductivity of 794 backedges. 40 proven. 206 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2022-04-28 06:06:53,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:06:53,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641421282] [2022-04-28 06:06:53,694 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:06:53,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215318880] [2022-04-28 06:06:53,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [215318880] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:06:53,694 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:06:53,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 40 [2022-04-28 06:06:53,694 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:06:53,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [87551201] [2022-04-28 06:06:53,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [87551201] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:06:53,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:06:53,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 06:06:53,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241321970] [2022-04-28 06:06:53,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:06:53,695 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.523809523809524) internal successors, (116), 20 states have internal predecessors, (116), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) Word has length 161 [2022-04-28 06:06:53,695 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:06:53,695 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 5.523809523809524) internal successors, (116), 20 states have internal predecessors, (116), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-28 06:06:53,912 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:06:53,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 06:06:53,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:06:53,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 06:06:53,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=708, Invalid=852, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 06:06:53,914 INFO L87 Difference]: Start difference. First operand 875 states and 1169 transitions. Second operand has 21 states, 21 states have (on average 5.523809523809524) internal successors, (116), 20 states have internal predecessors, (116), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-28 06:07:01,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:07:01,330 INFO L93 Difference]: Finished difference Result 1079 states and 1471 transitions. [2022-04-28 06:07:01,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-28 06:07:01,330 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.523809523809524) internal successors, (116), 20 states have internal predecessors, (116), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) Word has length 161 [2022-04-28 06:07:01,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:07:01,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 5.523809523809524) internal successors, (116), 20 states have internal predecessors, (116), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-28 06:07:01,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 376 transitions. [2022-04-28 06:07:01,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 5.523809523809524) internal successors, (116), 20 states have internal predecessors, (116), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-28 06:07:01,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 376 transitions. [2022-04-28 06:07:01,335 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 376 transitions. [2022-04-28 06:07:01,798 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 376 edges. 376 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:07:01,831 INFO L225 Difference]: With dead ends: 1079 [2022-04-28 06:07:01,831 INFO L226 Difference]: Without dead ends: 901 [2022-04-28 06:07:01,832 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1263, Invalid=1707, Unknown=0, NotChecked=0, Total=2970 [2022-04-28 06:07:01,832 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 274 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-28 06:07:01,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 365 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-28 06:07:01,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2022-04-28 06:07:05,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 890. [2022-04-28 06:07:05,203 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:07:05,204 INFO L82 GeneralOperation]: Start isEquivalent. First operand 901 states. Second operand has 890 states, 666 states have (on average 1.1786786786786787) internal successors, (785), 678 states have internal predecessors, (785), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 188 states have call predecessors, (200), 200 states have call successors, (200) [2022-04-28 06:07:05,204 INFO L74 IsIncluded]: Start isIncluded. First operand 901 states. Second operand has 890 states, 666 states have (on average 1.1786786786786787) internal successors, (785), 678 states have internal predecessors, (785), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 188 states have call predecessors, (200), 200 states have call successors, (200) [2022-04-28 06:07:05,205 INFO L87 Difference]: Start difference. First operand 901 states. Second operand has 890 states, 666 states have (on average 1.1786786786786787) internal successors, (785), 678 states have internal predecessors, (785), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 188 states have call predecessors, (200), 200 states have call successors, (200) [2022-04-28 06:07:05,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:07:05,231 INFO L93 Difference]: Finished difference Result 901 states and 1198 transitions. [2022-04-28 06:07:05,231 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1198 transitions. [2022-04-28 06:07:05,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:07:05,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:07:05,233 INFO L74 IsIncluded]: Start isIncluded. First operand has 890 states, 666 states have (on average 1.1786786786786787) internal successors, (785), 678 states have internal predecessors, (785), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 188 states have call predecessors, (200), 200 states have call successors, (200) Second operand 901 states. [2022-04-28 06:07:05,234 INFO L87 Difference]: Start difference. First operand has 890 states, 666 states have (on average 1.1786786786786787) internal successors, (785), 678 states have internal predecessors, (785), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 188 states have call predecessors, (200), 200 states have call successors, (200) Second operand 901 states. [2022-04-28 06:07:05,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:07:05,263 INFO L93 Difference]: Finished difference Result 901 states and 1198 transitions. [2022-04-28 06:07:05,263 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1198 transitions. [2022-04-28 06:07:05,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:07:05,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:07:05,264 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:07:05,264 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:07:05,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 890 states, 666 states have (on average 1.1786786786786787) internal successors, (785), 678 states have internal predecessors, (785), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 188 states have call predecessors, (200), 200 states have call successors, (200) [2022-04-28 06:07:05,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1187 transitions. [2022-04-28 06:07:05,305 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1187 transitions. Word has length 161 [2022-04-28 06:07:05,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:07:05,305 INFO L495 AbstractCegarLoop]: Abstraction has 890 states and 1187 transitions. [2022-04-28 06:07:05,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.523809523809524) internal successors, (116), 20 states have internal predecessors, (116), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-28 06:07:05,306 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 890 states and 1187 transitions. [2022-04-28 06:07:16,698 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-28 06:07:16,698 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1187 transitions. [2022-04-28 06:07:16,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-04-28 06:07:16,700 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:07:16,700 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 8, 7, 7, 7, 7, 6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:07:16,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Forceful destruction successful, exit code 0 [2022-04-28 06:07:16,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55,57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:07:16,908 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:07:16,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:07:16,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1942329766, now seen corresponding path program 25 times [2022-04-28 06:07:16,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:07:16,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [629009893] [2022-04-28 06:07:16,909 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:07:16,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1942329766, now seen corresponding path program 26 times [2022-04-28 06:07:16,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:07:16,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376717951] [2022-04-28 06:07:16,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:07:16,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:07:16,922 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:07:16,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2048909758] [2022-04-28 06:07:16,922 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 06:07:16,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:07:16,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:07:16,923 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:07:16,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2022-04-28 06:07:16,992 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 06:07:16,992 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:07:16,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-28 06:07:17,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:07:17,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:07:18,041 INFO L272 TraceCheckUtils]: 0: Hoare triple {176406#true} call ULTIMATE.init(); {176406#true} is VALID [2022-04-28 06:07:18,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {176406#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; {176414#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:18,042 INFO L290 TraceCheckUtils]: 2: Hoare triple {176414#(<= ~counter~0 0)} assume true; {176414#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:18,042 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {176414#(<= ~counter~0 0)} {176406#true} #102#return; {176414#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:18,043 INFO L272 TraceCheckUtils]: 4: Hoare triple {176414#(<= ~counter~0 0)} call #t~ret9 := main(); {176414#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:18,043 INFO L290 TraceCheckUtils]: 5: Hoare triple {176414#(<= ~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; {176414#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:18,043 INFO L272 TraceCheckUtils]: 6: Hoare triple {176414#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {176414#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:18,044 INFO L290 TraceCheckUtils]: 7: Hoare triple {176414#(<= ~counter~0 0)} ~cond := #in~cond; {176414#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:18,044 INFO L290 TraceCheckUtils]: 8: Hoare triple {176414#(<= ~counter~0 0)} assume !(0 == ~cond); {176414#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:18,044 INFO L290 TraceCheckUtils]: 9: Hoare triple {176414#(<= ~counter~0 0)} assume true; {176414#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:18,045 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {176414#(<= ~counter~0 0)} {176414#(<= ~counter~0 0)} #90#return; {176414#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:18,045 INFO L272 TraceCheckUtils]: 11: Hoare triple {176414#(<= ~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)); {176414#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:18,045 INFO L290 TraceCheckUtils]: 12: Hoare triple {176414#(<= ~counter~0 0)} ~cond := #in~cond; {176414#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:18,045 INFO L290 TraceCheckUtils]: 13: Hoare triple {176414#(<= ~counter~0 0)} assume !(0 == ~cond); {176414#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:18,046 INFO L290 TraceCheckUtils]: 14: Hoare triple {176414#(<= ~counter~0 0)} assume true; {176414#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:18,046 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {176414#(<= ~counter~0 0)} {176414#(<= ~counter~0 0)} #92#return; {176414#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:18,046 INFO L290 TraceCheckUtils]: 16: Hoare triple {176414#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {176414#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:18,050 INFO L290 TraceCheckUtils]: 17: Hoare triple {176414#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {176463#(<= ~counter~0 1)} is VALID [2022-04-28 06:07:18,050 INFO L290 TraceCheckUtils]: 18: Hoare triple {176463#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {176463#(<= ~counter~0 1)} is VALID [2022-04-28 06:07:18,051 INFO L272 TraceCheckUtils]: 19: Hoare triple {176463#(<= ~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)); {176463#(<= ~counter~0 1)} is VALID [2022-04-28 06:07:18,051 INFO L290 TraceCheckUtils]: 20: Hoare triple {176463#(<= ~counter~0 1)} ~cond := #in~cond; {176463#(<= ~counter~0 1)} is VALID [2022-04-28 06:07:18,051 INFO L290 TraceCheckUtils]: 21: Hoare triple {176463#(<= ~counter~0 1)} assume !(0 == ~cond); {176463#(<= ~counter~0 1)} is VALID [2022-04-28 06:07:18,051 INFO L290 TraceCheckUtils]: 22: Hoare triple {176463#(<= ~counter~0 1)} assume true; {176463#(<= ~counter~0 1)} is VALID [2022-04-28 06:07:18,052 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {176463#(<= ~counter~0 1)} {176463#(<= ~counter~0 1)} #94#return; {176463#(<= ~counter~0 1)} is VALID [2022-04-28 06:07:18,052 INFO L290 TraceCheckUtils]: 24: Hoare triple {176463#(<= ~counter~0 1)} assume !!(0 != ~r~0); {176463#(<= ~counter~0 1)} is VALID [2022-04-28 06:07:18,053 INFO L290 TraceCheckUtils]: 25: Hoare triple {176463#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {176488#(<= ~counter~0 2)} is VALID [2022-04-28 06:07:18,054 INFO L290 TraceCheckUtils]: 26: Hoare triple {176488#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {176488#(<= ~counter~0 2)} is VALID [2022-04-28 06:07:18,054 INFO L272 TraceCheckUtils]: 27: Hoare triple {176488#(<= ~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)); {176488#(<= ~counter~0 2)} is VALID [2022-04-28 06:07:18,054 INFO L290 TraceCheckUtils]: 28: Hoare triple {176488#(<= ~counter~0 2)} ~cond := #in~cond; {176488#(<= ~counter~0 2)} is VALID [2022-04-28 06:07:18,055 INFO L290 TraceCheckUtils]: 29: Hoare triple {176488#(<= ~counter~0 2)} assume !(0 == ~cond); {176488#(<= ~counter~0 2)} is VALID [2022-04-28 06:07:18,055 INFO L290 TraceCheckUtils]: 30: Hoare triple {176488#(<= ~counter~0 2)} assume true; {176488#(<= ~counter~0 2)} is VALID [2022-04-28 06:07:18,055 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {176488#(<= ~counter~0 2)} {176488#(<= ~counter~0 2)} #96#return; {176488#(<= ~counter~0 2)} is VALID [2022-04-28 06:07:18,056 INFO L290 TraceCheckUtils]: 32: Hoare triple {176488#(<= ~counter~0 2)} assume !(~r~0 > 0); {176488#(<= ~counter~0 2)} is VALID [2022-04-28 06:07:18,057 INFO L290 TraceCheckUtils]: 33: Hoare triple {176488#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {176513#(<= ~counter~0 3)} is VALID [2022-04-28 06:07:18,057 INFO L290 TraceCheckUtils]: 34: Hoare triple {176513#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {176513#(<= ~counter~0 3)} is VALID [2022-04-28 06:07:18,058 INFO L272 TraceCheckUtils]: 35: Hoare triple {176513#(<= ~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)); {176513#(<= ~counter~0 3)} is VALID [2022-04-28 06:07:18,058 INFO L290 TraceCheckUtils]: 36: Hoare triple {176513#(<= ~counter~0 3)} ~cond := #in~cond; {176513#(<= ~counter~0 3)} is VALID [2022-04-28 06:07:18,058 INFO L290 TraceCheckUtils]: 37: Hoare triple {176513#(<= ~counter~0 3)} assume !(0 == ~cond); {176513#(<= ~counter~0 3)} is VALID [2022-04-28 06:07:18,059 INFO L290 TraceCheckUtils]: 38: Hoare triple {176513#(<= ~counter~0 3)} assume true; {176513#(<= ~counter~0 3)} is VALID [2022-04-28 06:07:18,059 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {176513#(<= ~counter~0 3)} {176513#(<= ~counter~0 3)} #98#return; {176513#(<= ~counter~0 3)} is VALID [2022-04-28 06:07:18,059 INFO L290 TraceCheckUtils]: 40: Hoare triple {176513#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {176513#(<= ~counter~0 3)} is VALID [2022-04-28 06:07:18,061 INFO L290 TraceCheckUtils]: 41: Hoare triple {176513#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {176538#(<= ~counter~0 4)} is VALID [2022-04-28 06:07:18,061 INFO L290 TraceCheckUtils]: 42: Hoare triple {176538#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {176538#(<= ~counter~0 4)} is VALID [2022-04-28 06:07:18,061 INFO L272 TraceCheckUtils]: 43: Hoare triple {176538#(<= ~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)); {176538#(<= ~counter~0 4)} is VALID [2022-04-28 06:07:18,062 INFO L290 TraceCheckUtils]: 44: Hoare triple {176538#(<= ~counter~0 4)} ~cond := #in~cond; {176538#(<= ~counter~0 4)} is VALID [2022-04-28 06:07:18,062 INFO L290 TraceCheckUtils]: 45: Hoare triple {176538#(<= ~counter~0 4)} assume !(0 == ~cond); {176538#(<= ~counter~0 4)} is VALID [2022-04-28 06:07:18,062 INFO L290 TraceCheckUtils]: 46: Hoare triple {176538#(<= ~counter~0 4)} assume true; {176538#(<= ~counter~0 4)} is VALID [2022-04-28 06:07:18,063 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {176538#(<= ~counter~0 4)} {176538#(<= ~counter~0 4)} #98#return; {176538#(<= ~counter~0 4)} is VALID [2022-04-28 06:07:18,063 INFO L290 TraceCheckUtils]: 48: Hoare triple {176538#(<= ~counter~0 4)} assume !(~r~0 < 0); {176538#(<= ~counter~0 4)} is VALID [2022-04-28 06:07:18,065 INFO L290 TraceCheckUtils]: 49: Hoare triple {176538#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {176563#(<= ~counter~0 5)} is VALID [2022-04-28 06:07:18,065 INFO L290 TraceCheckUtils]: 50: Hoare triple {176563#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {176563#(<= ~counter~0 5)} is VALID [2022-04-28 06:07:18,065 INFO L272 TraceCheckUtils]: 51: Hoare triple {176563#(<= ~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)); {176563#(<= ~counter~0 5)} is VALID [2022-04-28 06:07:18,066 INFO L290 TraceCheckUtils]: 52: Hoare triple {176563#(<= ~counter~0 5)} ~cond := #in~cond; {176563#(<= ~counter~0 5)} is VALID [2022-04-28 06:07:18,066 INFO L290 TraceCheckUtils]: 53: Hoare triple {176563#(<= ~counter~0 5)} assume !(0 == ~cond); {176563#(<= ~counter~0 5)} is VALID [2022-04-28 06:07:18,066 INFO L290 TraceCheckUtils]: 54: Hoare triple {176563#(<= ~counter~0 5)} assume true; {176563#(<= ~counter~0 5)} is VALID [2022-04-28 06:07:18,067 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {176563#(<= ~counter~0 5)} {176563#(<= ~counter~0 5)} #94#return; {176563#(<= ~counter~0 5)} is VALID [2022-04-28 06:07:18,067 INFO L290 TraceCheckUtils]: 56: Hoare triple {176563#(<= ~counter~0 5)} assume !!(0 != ~r~0); {176563#(<= ~counter~0 5)} is VALID [2022-04-28 06:07:18,068 INFO L290 TraceCheckUtils]: 57: Hoare triple {176563#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {176588#(<= ~counter~0 6)} is VALID [2022-04-28 06:07:18,069 INFO L290 TraceCheckUtils]: 58: Hoare triple {176588#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {176588#(<= ~counter~0 6)} is VALID [2022-04-28 06:07:18,069 INFO L272 TraceCheckUtils]: 59: Hoare triple {176588#(<= ~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)); {176588#(<= ~counter~0 6)} is VALID [2022-04-28 06:07:18,069 INFO L290 TraceCheckUtils]: 60: Hoare triple {176588#(<= ~counter~0 6)} ~cond := #in~cond; {176588#(<= ~counter~0 6)} is VALID [2022-04-28 06:07:18,069 INFO L290 TraceCheckUtils]: 61: Hoare triple {176588#(<= ~counter~0 6)} assume !(0 == ~cond); {176588#(<= ~counter~0 6)} is VALID [2022-04-28 06:07:18,070 INFO L290 TraceCheckUtils]: 62: Hoare triple {176588#(<= ~counter~0 6)} assume true; {176588#(<= ~counter~0 6)} is VALID [2022-04-28 06:07:18,070 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {176588#(<= ~counter~0 6)} {176588#(<= ~counter~0 6)} #96#return; {176588#(<= ~counter~0 6)} is VALID [2022-04-28 06:07:18,070 INFO L290 TraceCheckUtils]: 64: Hoare triple {176588#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {176588#(<= ~counter~0 6)} is VALID [2022-04-28 06:07:18,072 INFO L290 TraceCheckUtils]: 65: Hoare triple {176588#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {176613#(<= ~counter~0 7)} is VALID [2022-04-28 06:07:18,072 INFO L290 TraceCheckUtils]: 66: Hoare triple {176613#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {176613#(<= ~counter~0 7)} is VALID [2022-04-28 06:07:18,073 INFO L272 TraceCheckUtils]: 67: Hoare triple {176613#(<= ~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)); {176613#(<= ~counter~0 7)} is VALID [2022-04-28 06:07:18,073 INFO L290 TraceCheckUtils]: 68: Hoare triple {176613#(<= ~counter~0 7)} ~cond := #in~cond; {176613#(<= ~counter~0 7)} is VALID [2022-04-28 06:07:18,073 INFO L290 TraceCheckUtils]: 69: Hoare triple {176613#(<= ~counter~0 7)} assume !(0 == ~cond); {176613#(<= ~counter~0 7)} is VALID [2022-04-28 06:07:18,073 INFO L290 TraceCheckUtils]: 70: Hoare triple {176613#(<= ~counter~0 7)} assume true; {176613#(<= ~counter~0 7)} is VALID [2022-04-28 06:07:18,074 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {176613#(<= ~counter~0 7)} {176613#(<= ~counter~0 7)} #96#return; {176613#(<= ~counter~0 7)} is VALID [2022-04-28 06:07:18,074 INFO L290 TraceCheckUtils]: 72: Hoare triple {176613#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {176613#(<= ~counter~0 7)} is VALID [2022-04-28 06:07:18,075 INFO L290 TraceCheckUtils]: 73: Hoare triple {176613#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {176638#(<= ~counter~0 8)} is VALID [2022-04-28 06:07:18,076 INFO L290 TraceCheckUtils]: 74: Hoare triple {176638#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {176638#(<= ~counter~0 8)} is VALID [2022-04-28 06:07:18,076 INFO L272 TraceCheckUtils]: 75: Hoare triple {176638#(<= ~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)); {176638#(<= ~counter~0 8)} is VALID [2022-04-28 06:07:18,076 INFO L290 TraceCheckUtils]: 76: Hoare triple {176638#(<= ~counter~0 8)} ~cond := #in~cond; {176638#(<= ~counter~0 8)} is VALID [2022-04-28 06:07:18,077 INFO L290 TraceCheckUtils]: 77: Hoare triple {176638#(<= ~counter~0 8)} assume !(0 == ~cond); {176638#(<= ~counter~0 8)} is VALID [2022-04-28 06:07:18,077 INFO L290 TraceCheckUtils]: 78: Hoare triple {176638#(<= ~counter~0 8)} assume true; {176638#(<= ~counter~0 8)} is VALID [2022-04-28 06:07:18,077 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {176638#(<= ~counter~0 8)} {176638#(<= ~counter~0 8)} #96#return; {176638#(<= ~counter~0 8)} is VALID [2022-04-28 06:07:18,078 INFO L290 TraceCheckUtils]: 80: Hoare triple {176638#(<= ~counter~0 8)} assume !(~r~0 > 0); {176638#(<= ~counter~0 8)} is VALID [2022-04-28 06:07:18,079 INFO L290 TraceCheckUtils]: 81: Hoare triple {176638#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {176663#(<= ~counter~0 9)} is VALID [2022-04-28 06:07:18,079 INFO L290 TraceCheckUtils]: 82: Hoare triple {176663#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {176663#(<= ~counter~0 9)} is VALID [2022-04-28 06:07:18,080 INFO L272 TraceCheckUtils]: 83: Hoare triple {176663#(<= ~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)); {176663#(<= ~counter~0 9)} is VALID [2022-04-28 06:07:18,080 INFO L290 TraceCheckUtils]: 84: Hoare triple {176663#(<= ~counter~0 9)} ~cond := #in~cond; {176663#(<= ~counter~0 9)} is VALID [2022-04-28 06:07:18,080 INFO L290 TraceCheckUtils]: 85: Hoare triple {176663#(<= ~counter~0 9)} assume !(0 == ~cond); {176663#(<= ~counter~0 9)} is VALID [2022-04-28 06:07:18,081 INFO L290 TraceCheckUtils]: 86: Hoare triple {176663#(<= ~counter~0 9)} assume true; {176663#(<= ~counter~0 9)} is VALID [2022-04-28 06:07:18,081 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {176663#(<= ~counter~0 9)} {176663#(<= ~counter~0 9)} #98#return; {176663#(<= ~counter~0 9)} is VALID [2022-04-28 06:07:18,081 INFO L290 TraceCheckUtils]: 88: Hoare triple {176663#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {176663#(<= ~counter~0 9)} is VALID [2022-04-28 06:07:18,083 INFO L290 TraceCheckUtils]: 89: Hoare triple {176663#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {176688#(<= ~counter~0 10)} is VALID [2022-04-28 06:07:18,083 INFO L290 TraceCheckUtils]: 90: Hoare triple {176688#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {176688#(<= ~counter~0 10)} is VALID [2022-04-28 06:07:18,083 INFO L272 TraceCheckUtils]: 91: Hoare triple {176688#(<= ~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)); {176688#(<= ~counter~0 10)} is VALID [2022-04-28 06:07:18,084 INFO L290 TraceCheckUtils]: 92: Hoare triple {176688#(<= ~counter~0 10)} ~cond := #in~cond; {176688#(<= ~counter~0 10)} is VALID [2022-04-28 06:07:18,084 INFO L290 TraceCheckUtils]: 93: Hoare triple {176688#(<= ~counter~0 10)} assume !(0 == ~cond); {176688#(<= ~counter~0 10)} is VALID [2022-04-28 06:07:18,084 INFO L290 TraceCheckUtils]: 94: Hoare triple {176688#(<= ~counter~0 10)} assume true; {176688#(<= ~counter~0 10)} is VALID [2022-04-28 06:07:18,085 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {176688#(<= ~counter~0 10)} {176688#(<= ~counter~0 10)} #98#return; {176688#(<= ~counter~0 10)} is VALID [2022-04-28 06:07:18,085 INFO L290 TraceCheckUtils]: 96: Hoare triple {176688#(<= ~counter~0 10)} assume !(~r~0 < 0); {176688#(<= ~counter~0 10)} is VALID [2022-04-28 06:07:18,086 INFO L290 TraceCheckUtils]: 97: Hoare triple {176688#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {176713#(<= ~counter~0 11)} is VALID [2022-04-28 06:07:18,087 INFO L290 TraceCheckUtils]: 98: Hoare triple {176713#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {176713#(<= ~counter~0 11)} is VALID [2022-04-28 06:07:18,087 INFO L272 TraceCheckUtils]: 99: Hoare triple {176713#(<= ~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)); {176713#(<= ~counter~0 11)} is VALID [2022-04-28 06:07:18,087 INFO L290 TraceCheckUtils]: 100: Hoare triple {176713#(<= ~counter~0 11)} ~cond := #in~cond; {176713#(<= ~counter~0 11)} is VALID [2022-04-28 06:07:18,088 INFO L290 TraceCheckUtils]: 101: Hoare triple {176713#(<= ~counter~0 11)} assume !(0 == ~cond); {176713#(<= ~counter~0 11)} is VALID [2022-04-28 06:07:18,088 INFO L290 TraceCheckUtils]: 102: Hoare triple {176713#(<= ~counter~0 11)} assume true; {176713#(<= ~counter~0 11)} is VALID [2022-04-28 06:07:18,088 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {176713#(<= ~counter~0 11)} {176713#(<= ~counter~0 11)} #94#return; {176713#(<= ~counter~0 11)} is VALID [2022-04-28 06:07:18,089 INFO L290 TraceCheckUtils]: 104: Hoare triple {176713#(<= ~counter~0 11)} assume !!(0 != ~r~0); {176713#(<= ~counter~0 11)} is VALID [2022-04-28 06:07:18,090 INFO L290 TraceCheckUtils]: 105: Hoare triple {176713#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {176738#(<= ~counter~0 12)} is VALID [2022-04-28 06:07:18,090 INFO L290 TraceCheckUtils]: 106: Hoare triple {176738#(<= ~counter~0 12)} assume !!(#t~post7 < 100);havoc #t~post7; {176738#(<= ~counter~0 12)} is VALID [2022-04-28 06:07:18,091 INFO L272 TraceCheckUtils]: 107: Hoare triple {176738#(<= ~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)); {176738#(<= ~counter~0 12)} is VALID [2022-04-28 06:07:18,091 INFO L290 TraceCheckUtils]: 108: Hoare triple {176738#(<= ~counter~0 12)} ~cond := #in~cond; {176738#(<= ~counter~0 12)} is VALID [2022-04-28 06:07:18,091 INFO L290 TraceCheckUtils]: 109: Hoare triple {176738#(<= ~counter~0 12)} assume !(0 == ~cond); {176738#(<= ~counter~0 12)} is VALID [2022-04-28 06:07:18,092 INFO L290 TraceCheckUtils]: 110: Hoare triple {176738#(<= ~counter~0 12)} assume true; {176738#(<= ~counter~0 12)} is VALID [2022-04-28 06:07:18,092 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {176738#(<= ~counter~0 12)} {176738#(<= ~counter~0 12)} #96#return; {176738#(<= ~counter~0 12)} is VALID [2022-04-28 06:07:18,092 INFO L290 TraceCheckUtils]: 112: Hoare triple {176738#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {176738#(<= ~counter~0 12)} is VALID [2022-04-28 06:07:18,094 INFO L290 TraceCheckUtils]: 113: Hoare triple {176738#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {176763#(<= ~counter~0 13)} is VALID [2022-04-28 06:07:18,094 INFO L290 TraceCheckUtils]: 114: Hoare triple {176763#(<= ~counter~0 13)} assume !!(#t~post7 < 100);havoc #t~post7; {176763#(<= ~counter~0 13)} is VALID [2022-04-28 06:07:18,095 INFO L272 TraceCheckUtils]: 115: Hoare triple {176763#(<= ~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)); {176763#(<= ~counter~0 13)} is VALID [2022-04-28 06:07:18,095 INFO L290 TraceCheckUtils]: 116: Hoare triple {176763#(<= ~counter~0 13)} ~cond := #in~cond; {176763#(<= ~counter~0 13)} is VALID [2022-04-28 06:07:18,095 INFO L290 TraceCheckUtils]: 117: Hoare triple {176763#(<= ~counter~0 13)} assume !(0 == ~cond); {176763#(<= ~counter~0 13)} is VALID [2022-04-28 06:07:18,095 INFO L290 TraceCheckUtils]: 118: Hoare triple {176763#(<= ~counter~0 13)} assume true; {176763#(<= ~counter~0 13)} is VALID [2022-04-28 06:07:18,096 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {176763#(<= ~counter~0 13)} {176763#(<= ~counter~0 13)} #96#return; {176763#(<= ~counter~0 13)} is VALID [2022-04-28 06:07:18,096 INFO L290 TraceCheckUtils]: 120: Hoare triple {176763#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {176763#(<= ~counter~0 13)} is VALID [2022-04-28 06:07:18,098 INFO L290 TraceCheckUtils]: 121: Hoare triple {176763#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {176788#(<= ~counter~0 14)} is VALID [2022-04-28 06:07:18,098 INFO L290 TraceCheckUtils]: 122: Hoare triple {176788#(<= ~counter~0 14)} assume !!(#t~post7 < 100);havoc #t~post7; {176788#(<= ~counter~0 14)} is VALID [2022-04-28 06:07:18,098 INFO L272 TraceCheckUtils]: 123: Hoare triple {176788#(<= ~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)); {176788#(<= ~counter~0 14)} is VALID [2022-04-28 06:07:18,099 INFO L290 TraceCheckUtils]: 124: Hoare triple {176788#(<= ~counter~0 14)} ~cond := #in~cond; {176788#(<= ~counter~0 14)} is VALID [2022-04-28 06:07:18,099 INFO L290 TraceCheckUtils]: 125: Hoare triple {176788#(<= ~counter~0 14)} assume !(0 == ~cond); {176788#(<= ~counter~0 14)} is VALID [2022-04-28 06:07:18,099 INFO L290 TraceCheckUtils]: 126: Hoare triple {176788#(<= ~counter~0 14)} assume true; {176788#(<= ~counter~0 14)} is VALID [2022-04-28 06:07:18,099 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {176788#(<= ~counter~0 14)} {176788#(<= ~counter~0 14)} #96#return; {176788#(<= ~counter~0 14)} is VALID [2022-04-28 06:07:18,100 INFO L290 TraceCheckUtils]: 128: Hoare triple {176788#(<= ~counter~0 14)} assume !(~r~0 > 0); {176788#(<= ~counter~0 14)} is VALID [2022-04-28 06:07:18,101 INFO L290 TraceCheckUtils]: 129: Hoare triple {176788#(<= ~counter~0 14)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {176813#(<= ~counter~0 15)} is VALID [2022-04-28 06:07:18,101 INFO L290 TraceCheckUtils]: 130: Hoare triple {176813#(<= ~counter~0 15)} assume !!(#t~post8 < 100);havoc #t~post8; {176813#(<= ~counter~0 15)} is VALID [2022-04-28 06:07:18,102 INFO L272 TraceCheckUtils]: 131: Hoare triple {176813#(<= ~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)); {176813#(<= ~counter~0 15)} is VALID [2022-04-28 06:07:18,102 INFO L290 TraceCheckUtils]: 132: Hoare triple {176813#(<= ~counter~0 15)} ~cond := #in~cond; {176813#(<= ~counter~0 15)} is VALID [2022-04-28 06:07:18,102 INFO L290 TraceCheckUtils]: 133: Hoare triple {176813#(<= ~counter~0 15)} assume !(0 == ~cond); {176813#(<= ~counter~0 15)} is VALID [2022-04-28 06:07:18,103 INFO L290 TraceCheckUtils]: 134: Hoare triple {176813#(<= ~counter~0 15)} assume true; {176813#(<= ~counter~0 15)} is VALID [2022-04-28 06:07:18,103 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {176813#(<= ~counter~0 15)} {176813#(<= ~counter~0 15)} #98#return; {176813#(<= ~counter~0 15)} is VALID [2022-04-28 06:07:18,103 INFO L290 TraceCheckUtils]: 136: Hoare triple {176813#(<= ~counter~0 15)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {176813#(<= ~counter~0 15)} is VALID [2022-04-28 06:07:18,105 INFO L290 TraceCheckUtils]: 137: Hoare triple {176813#(<= ~counter~0 15)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {176838#(<= ~counter~0 16)} is VALID [2022-04-28 06:07:18,105 INFO L290 TraceCheckUtils]: 138: Hoare triple {176838#(<= ~counter~0 16)} assume !!(#t~post8 < 100);havoc #t~post8; {176838#(<= ~counter~0 16)} is VALID [2022-04-28 06:07:18,106 INFO L272 TraceCheckUtils]: 139: Hoare triple {176838#(<= ~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)); {176838#(<= ~counter~0 16)} is VALID [2022-04-28 06:07:18,106 INFO L290 TraceCheckUtils]: 140: Hoare triple {176838#(<= ~counter~0 16)} ~cond := #in~cond; {176838#(<= ~counter~0 16)} is VALID [2022-04-28 06:07:18,106 INFO L290 TraceCheckUtils]: 141: Hoare triple {176838#(<= ~counter~0 16)} assume !(0 == ~cond); {176838#(<= ~counter~0 16)} is VALID [2022-04-28 06:07:18,106 INFO L290 TraceCheckUtils]: 142: Hoare triple {176838#(<= ~counter~0 16)} assume true; {176838#(<= ~counter~0 16)} is VALID [2022-04-28 06:07:18,107 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {176838#(<= ~counter~0 16)} {176838#(<= ~counter~0 16)} #98#return; {176838#(<= ~counter~0 16)} is VALID [2022-04-28 06:07:18,107 INFO L290 TraceCheckUtils]: 144: Hoare triple {176838#(<= ~counter~0 16)} assume !(~r~0 < 0); {176838#(<= ~counter~0 16)} is VALID [2022-04-28 06:07:18,108 INFO L290 TraceCheckUtils]: 145: Hoare triple {176838#(<= ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {176863#(<= ~counter~0 17)} is VALID [2022-04-28 06:07:18,109 INFO L290 TraceCheckUtils]: 146: Hoare triple {176863#(<= ~counter~0 17)} assume !!(#t~post6 < 100);havoc #t~post6; {176863#(<= ~counter~0 17)} is VALID [2022-04-28 06:07:18,109 INFO L272 TraceCheckUtils]: 147: Hoare triple {176863#(<= ~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)); {176863#(<= ~counter~0 17)} is VALID [2022-04-28 06:07:18,109 INFO L290 TraceCheckUtils]: 148: Hoare triple {176863#(<= ~counter~0 17)} ~cond := #in~cond; {176863#(<= ~counter~0 17)} is VALID [2022-04-28 06:07:18,110 INFO L290 TraceCheckUtils]: 149: Hoare triple {176863#(<= ~counter~0 17)} assume !(0 == ~cond); {176863#(<= ~counter~0 17)} is VALID [2022-04-28 06:07:18,110 INFO L290 TraceCheckUtils]: 150: Hoare triple {176863#(<= ~counter~0 17)} assume true; {176863#(<= ~counter~0 17)} is VALID [2022-04-28 06:07:18,110 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {176863#(<= ~counter~0 17)} {176863#(<= ~counter~0 17)} #94#return; {176863#(<= ~counter~0 17)} is VALID [2022-04-28 06:07:18,111 INFO L290 TraceCheckUtils]: 152: Hoare triple {176863#(<= ~counter~0 17)} assume !!(0 != ~r~0); {176863#(<= ~counter~0 17)} is VALID [2022-04-28 06:07:18,111 INFO L290 TraceCheckUtils]: 153: Hoare triple {176863#(<= ~counter~0 17)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {176888#(<= |main_#t~post7| 17)} is VALID [2022-04-28 06:07:18,111 INFO L290 TraceCheckUtils]: 154: Hoare triple {176888#(<= |main_#t~post7| 17)} assume !(#t~post7 < 100);havoc #t~post7; {176407#false} is VALID [2022-04-28 06:07:18,111 INFO L290 TraceCheckUtils]: 155: Hoare triple {176407#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {176407#false} is VALID [2022-04-28 06:07:18,111 INFO L290 TraceCheckUtils]: 156: Hoare triple {176407#false} assume !(#t~post8 < 100);havoc #t~post8; {176407#false} is VALID [2022-04-28 06:07:18,111 INFO L290 TraceCheckUtils]: 157: Hoare triple {176407#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {176407#false} is VALID [2022-04-28 06:07:18,112 INFO L290 TraceCheckUtils]: 158: Hoare triple {176407#false} assume !(#t~post6 < 100);havoc #t~post6; {176407#false} is VALID [2022-04-28 06:07:18,112 INFO L272 TraceCheckUtils]: 159: Hoare triple {176407#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)); {176407#false} is VALID [2022-04-28 06:07:18,112 INFO L290 TraceCheckUtils]: 160: Hoare triple {176407#false} ~cond := #in~cond; {176407#false} is VALID [2022-04-28 06:07:18,112 INFO L290 TraceCheckUtils]: 161: Hoare triple {176407#false} assume 0 == ~cond; {176407#false} is VALID [2022-04-28 06:07:18,112 INFO L290 TraceCheckUtils]: 162: Hoare triple {176407#false} assume !false; {176407#false} is VALID [2022-04-28 06:07:18,112 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 54 proven. 726 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 06:07:18,112 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:07:19,248 INFO L290 TraceCheckUtils]: 162: Hoare triple {176407#false} assume !false; {176407#false} is VALID [2022-04-28 06:07:19,248 INFO L290 TraceCheckUtils]: 161: Hoare triple {176407#false} assume 0 == ~cond; {176407#false} is VALID [2022-04-28 06:07:19,248 INFO L290 TraceCheckUtils]: 160: Hoare triple {176407#false} ~cond := #in~cond; {176407#false} is VALID [2022-04-28 06:07:19,248 INFO L272 TraceCheckUtils]: 159: Hoare triple {176407#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)); {176407#false} is VALID [2022-04-28 06:07:19,248 INFO L290 TraceCheckUtils]: 158: Hoare triple {176407#false} assume !(#t~post6 < 100);havoc #t~post6; {176407#false} is VALID [2022-04-28 06:07:19,248 INFO L290 TraceCheckUtils]: 157: Hoare triple {176407#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {176407#false} is VALID [2022-04-28 06:07:19,248 INFO L290 TraceCheckUtils]: 156: Hoare triple {176407#false} assume !(#t~post8 < 100);havoc #t~post8; {176407#false} is VALID [2022-04-28 06:07:19,248 INFO L290 TraceCheckUtils]: 155: Hoare triple {176407#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {176407#false} is VALID [2022-04-28 06:07:19,249 INFO L290 TraceCheckUtils]: 154: Hoare triple {176940#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {176407#false} is VALID [2022-04-28 06:07:19,249 INFO L290 TraceCheckUtils]: 153: Hoare triple {176944#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {176940#(< |main_#t~post7| 100)} is VALID [2022-04-28 06:07:19,249 INFO L290 TraceCheckUtils]: 152: Hoare triple {176944#(< ~counter~0 100)} assume !!(0 != ~r~0); {176944#(< ~counter~0 100)} is VALID [2022-04-28 06:07:19,250 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {176406#true} {176944#(< ~counter~0 100)} #94#return; {176944#(< ~counter~0 100)} is VALID [2022-04-28 06:07:19,250 INFO L290 TraceCheckUtils]: 150: Hoare triple {176406#true} assume true; {176406#true} is VALID [2022-04-28 06:07:19,250 INFO L290 TraceCheckUtils]: 149: Hoare triple {176406#true} assume !(0 == ~cond); {176406#true} is VALID [2022-04-28 06:07:19,250 INFO L290 TraceCheckUtils]: 148: Hoare triple {176406#true} ~cond := #in~cond; {176406#true} is VALID [2022-04-28 06:07:19,250 INFO L272 TraceCheckUtils]: 147: Hoare triple {176944#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176406#true} is VALID [2022-04-28 06:07:19,250 INFO L290 TraceCheckUtils]: 146: Hoare triple {176944#(< ~counter~0 100)} assume !!(#t~post6 < 100);havoc #t~post6; {176944#(< ~counter~0 100)} is VALID [2022-04-28 06:07:19,254 INFO L290 TraceCheckUtils]: 145: Hoare triple {176969#(< ~counter~0 99)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {176944#(< ~counter~0 100)} is VALID [2022-04-28 06:07:19,254 INFO L290 TraceCheckUtils]: 144: Hoare triple {176969#(< ~counter~0 99)} assume !(~r~0 < 0); {176969#(< ~counter~0 99)} is VALID [2022-04-28 06:07:19,254 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {176406#true} {176969#(< ~counter~0 99)} #98#return; {176969#(< ~counter~0 99)} is VALID [2022-04-28 06:07:19,255 INFO L290 TraceCheckUtils]: 142: Hoare triple {176406#true} assume true; {176406#true} is VALID [2022-04-28 06:07:19,255 INFO L290 TraceCheckUtils]: 141: Hoare triple {176406#true} assume !(0 == ~cond); {176406#true} is VALID [2022-04-28 06:07:19,255 INFO L290 TraceCheckUtils]: 140: Hoare triple {176406#true} ~cond := #in~cond; {176406#true} is VALID [2022-04-28 06:07:19,255 INFO L272 TraceCheckUtils]: 139: Hoare triple {176969#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176406#true} is VALID [2022-04-28 06:07:19,255 INFO L290 TraceCheckUtils]: 138: Hoare triple {176969#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {176969#(< ~counter~0 99)} is VALID [2022-04-28 06:07:19,257 INFO L290 TraceCheckUtils]: 137: Hoare triple {176994#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {176969#(< ~counter~0 99)} is VALID [2022-04-28 06:07:19,257 INFO L290 TraceCheckUtils]: 136: Hoare triple {176994#(< ~counter~0 98)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {176994#(< ~counter~0 98)} is VALID [2022-04-28 06:07:19,257 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {176406#true} {176994#(< ~counter~0 98)} #98#return; {176994#(< ~counter~0 98)} is VALID [2022-04-28 06:07:19,257 INFO L290 TraceCheckUtils]: 134: Hoare triple {176406#true} assume true; {176406#true} is VALID [2022-04-28 06:07:19,257 INFO L290 TraceCheckUtils]: 133: Hoare triple {176406#true} assume !(0 == ~cond); {176406#true} is VALID [2022-04-28 06:07:19,258 INFO L290 TraceCheckUtils]: 132: Hoare triple {176406#true} ~cond := #in~cond; {176406#true} is VALID [2022-04-28 06:07:19,258 INFO L272 TraceCheckUtils]: 131: Hoare triple {176994#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176406#true} is VALID [2022-04-28 06:07:19,258 INFO L290 TraceCheckUtils]: 130: Hoare triple {176994#(< ~counter~0 98)} assume !!(#t~post8 < 100);havoc #t~post8; {176994#(< ~counter~0 98)} is VALID [2022-04-28 06:07:19,259 INFO L290 TraceCheckUtils]: 129: Hoare triple {177019#(< ~counter~0 97)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {176994#(< ~counter~0 98)} is VALID [2022-04-28 06:07:19,260 INFO L290 TraceCheckUtils]: 128: Hoare triple {177019#(< ~counter~0 97)} assume !(~r~0 > 0); {177019#(< ~counter~0 97)} is VALID [2022-04-28 06:07:19,260 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {176406#true} {177019#(< ~counter~0 97)} #96#return; {177019#(< ~counter~0 97)} is VALID [2022-04-28 06:07:19,260 INFO L290 TraceCheckUtils]: 126: Hoare triple {176406#true} assume true; {176406#true} is VALID [2022-04-28 06:07:19,260 INFO L290 TraceCheckUtils]: 125: Hoare triple {176406#true} assume !(0 == ~cond); {176406#true} is VALID [2022-04-28 06:07:19,260 INFO L290 TraceCheckUtils]: 124: Hoare triple {176406#true} ~cond := #in~cond; {176406#true} is VALID [2022-04-28 06:07:19,260 INFO L272 TraceCheckUtils]: 123: Hoare triple {177019#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176406#true} is VALID [2022-04-28 06:07:19,261 INFO L290 TraceCheckUtils]: 122: Hoare triple {177019#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {177019#(< ~counter~0 97)} is VALID [2022-04-28 06:07:19,262 INFO L290 TraceCheckUtils]: 121: Hoare triple {177044#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {177019#(< ~counter~0 97)} is VALID [2022-04-28 06:07:19,262 INFO L290 TraceCheckUtils]: 120: Hoare triple {177044#(< ~counter~0 96)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {177044#(< ~counter~0 96)} is VALID [2022-04-28 06:07:19,263 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {176406#true} {177044#(< ~counter~0 96)} #96#return; {177044#(< ~counter~0 96)} is VALID [2022-04-28 06:07:19,263 INFO L290 TraceCheckUtils]: 118: Hoare triple {176406#true} assume true; {176406#true} is VALID [2022-04-28 06:07:19,263 INFO L290 TraceCheckUtils]: 117: Hoare triple {176406#true} assume !(0 == ~cond); {176406#true} is VALID [2022-04-28 06:07:19,263 INFO L290 TraceCheckUtils]: 116: Hoare triple {176406#true} ~cond := #in~cond; {176406#true} is VALID [2022-04-28 06:07:19,263 INFO L272 TraceCheckUtils]: 115: Hoare triple {177044#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176406#true} is VALID [2022-04-28 06:07:19,263 INFO L290 TraceCheckUtils]: 114: Hoare triple {177044#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {177044#(< ~counter~0 96)} is VALID [2022-04-28 06:07:19,265 INFO L290 TraceCheckUtils]: 113: Hoare triple {177069#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {177044#(< ~counter~0 96)} is VALID [2022-04-28 06:07:19,265 INFO L290 TraceCheckUtils]: 112: Hoare triple {177069#(< ~counter~0 95)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {177069#(< ~counter~0 95)} is VALID [2022-04-28 06:07:19,266 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {176406#true} {177069#(< ~counter~0 95)} #96#return; {177069#(< ~counter~0 95)} is VALID [2022-04-28 06:07:19,266 INFO L290 TraceCheckUtils]: 110: Hoare triple {176406#true} assume true; {176406#true} is VALID [2022-04-28 06:07:19,266 INFO L290 TraceCheckUtils]: 109: Hoare triple {176406#true} assume !(0 == ~cond); {176406#true} is VALID [2022-04-28 06:07:19,266 INFO L290 TraceCheckUtils]: 108: Hoare triple {176406#true} ~cond := #in~cond; {176406#true} is VALID [2022-04-28 06:07:19,266 INFO L272 TraceCheckUtils]: 107: Hoare triple {177069#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176406#true} is VALID [2022-04-28 06:07:19,266 INFO L290 TraceCheckUtils]: 106: Hoare triple {177069#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {177069#(< ~counter~0 95)} is VALID [2022-04-28 06:07:19,267 INFO L290 TraceCheckUtils]: 105: Hoare triple {177094#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {177069#(< ~counter~0 95)} is VALID [2022-04-28 06:07:19,268 INFO L290 TraceCheckUtils]: 104: Hoare triple {177094#(< ~counter~0 94)} assume !!(0 != ~r~0); {177094#(< ~counter~0 94)} is VALID [2022-04-28 06:07:19,268 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {176406#true} {177094#(< ~counter~0 94)} #94#return; {177094#(< ~counter~0 94)} is VALID [2022-04-28 06:07:19,268 INFO L290 TraceCheckUtils]: 102: Hoare triple {176406#true} assume true; {176406#true} is VALID [2022-04-28 06:07:19,268 INFO L290 TraceCheckUtils]: 101: Hoare triple {176406#true} assume !(0 == ~cond); {176406#true} is VALID [2022-04-28 06:07:19,268 INFO L290 TraceCheckUtils]: 100: Hoare triple {176406#true} ~cond := #in~cond; {176406#true} is VALID [2022-04-28 06:07:19,269 INFO L272 TraceCheckUtils]: 99: Hoare triple {177094#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176406#true} is VALID [2022-04-28 06:07:19,269 INFO L290 TraceCheckUtils]: 98: Hoare triple {177094#(< ~counter~0 94)} assume !!(#t~post6 < 100);havoc #t~post6; {177094#(< ~counter~0 94)} is VALID [2022-04-28 06:07:19,270 INFO L290 TraceCheckUtils]: 97: Hoare triple {177119#(< ~counter~0 93)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {177094#(< ~counter~0 94)} is VALID [2022-04-28 06:07:19,270 INFO L290 TraceCheckUtils]: 96: Hoare triple {177119#(< ~counter~0 93)} assume !(~r~0 < 0); {177119#(< ~counter~0 93)} is VALID [2022-04-28 06:07:19,271 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {176406#true} {177119#(< ~counter~0 93)} #98#return; {177119#(< ~counter~0 93)} is VALID [2022-04-28 06:07:19,271 INFO L290 TraceCheckUtils]: 94: Hoare triple {176406#true} assume true; {176406#true} is VALID [2022-04-28 06:07:19,271 INFO L290 TraceCheckUtils]: 93: Hoare triple {176406#true} assume !(0 == ~cond); {176406#true} is VALID [2022-04-28 06:07:19,271 INFO L290 TraceCheckUtils]: 92: Hoare triple {176406#true} ~cond := #in~cond; {176406#true} is VALID [2022-04-28 06:07:19,271 INFO L272 TraceCheckUtils]: 91: Hoare triple {177119#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176406#true} is VALID [2022-04-28 06:07:19,271 INFO L290 TraceCheckUtils]: 90: Hoare triple {177119#(< ~counter~0 93)} assume !!(#t~post8 < 100);havoc #t~post8; {177119#(< ~counter~0 93)} is VALID [2022-04-28 06:07:19,273 INFO L290 TraceCheckUtils]: 89: Hoare triple {177144#(< ~counter~0 92)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {177119#(< ~counter~0 93)} is VALID [2022-04-28 06:07:19,273 INFO L290 TraceCheckUtils]: 88: Hoare triple {177144#(< ~counter~0 92)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {177144#(< ~counter~0 92)} is VALID [2022-04-28 06:07:19,274 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {176406#true} {177144#(< ~counter~0 92)} #98#return; {177144#(< ~counter~0 92)} is VALID [2022-04-28 06:07:19,274 INFO L290 TraceCheckUtils]: 86: Hoare triple {176406#true} assume true; {176406#true} is VALID [2022-04-28 06:07:19,274 INFO L290 TraceCheckUtils]: 85: Hoare triple {176406#true} assume !(0 == ~cond); {176406#true} is VALID [2022-04-28 06:07:19,274 INFO L290 TraceCheckUtils]: 84: Hoare triple {176406#true} ~cond := #in~cond; {176406#true} is VALID [2022-04-28 06:07:19,274 INFO L272 TraceCheckUtils]: 83: Hoare triple {177144#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176406#true} is VALID [2022-04-28 06:07:19,274 INFO L290 TraceCheckUtils]: 82: Hoare triple {177144#(< ~counter~0 92)} assume !!(#t~post8 < 100);havoc #t~post8; {177144#(< ~counter~0 92)} is VALID [2022-04-28 06:07:19,276 INFO L290 TraceCheckUtils]: 81: Hoare triple {177169#(< ~counter~0 91)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {177144#(< ~counter~0 92)} is VALID [2022-04-28 06:07:19,276 INFO L290 TraceCheckUtils]: 80: Hoare triple {177169#(< ~counter~0 91)} assume !(~r~0 > 0); {177169#(< ~counter~0 91)} is VALID [2022-04-28 06:07:19,276 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {176406#true} {177169#(< ~counter~0 91)} #96#return; {177169#(< ~counter~0 91)} is VALID [2022-04-28 06:07:19,276 INFO L290 TraceCheckUtils]: 78: Hoare triple {176406#true} assume true; {176406#true} is VALID [2022-04-28 06:07:19,277 INFO L290 TraceCheckUtils]: 77: Hoare triple {176406#true} assume !(0 == ~cond); {176406#true} is VALID [2022-04-28 06:07:19,277 INFO L290 TraceCheckUtils]: 76: Hoare triple {176406#true} ~cond := #in~cond; {176406#true} is VALID [2022-04-28 06:07:19,277 INFO L272 TraceCheckUtils]: 75: Hoare triple {177169#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176406#true} is VALID [2022-04-28 06:07:19,277 INFO L290 TraceCheckUtils]: 74: Hoare triple {177169#(< ~counter~0 91)} assume !!(#t~post7 < 100);havoc #t~post7; {177169#(< ~counter~0 91)} is VALID [2022-04-28 06:07:19,278 INFO L290 TraceCheckUtils]: 73: Hoare triple {177194#(< ~counter~0 90)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {177169#(< ~counter~0 91)} is VALID [2022-04-28 06:07:19,279 INFO L290 TraceCheckUtils]: 72: Hoare triple {177194#(< ~counter~0 90)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {177194#(< ~counter~0 90)} is VALID [2022-04-28 06:07:19,279 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {176406#true} {177194#(< ~counter~0 90)} #96#return; {177194#(< ~counter~0 90)} is VALID [2022-04-28 06:07:19,279 INFO L290 TraceCheckUtils]: 70: Hoare triple {176406#true} assume true; {176406#true} is VALID [2022-04-28 06:07:19,279 INFO L290 TraceCheckUtils]: 69: Hoare triple {176406#true} assume !(0 == ~cond); {176406#true} is VALID [2022-04-28 06:07:19,279 INFO L290 TraceCheckUtils]: 68: Hoare triple {176406#true} ~cond := #in~cond; {176406#true} is VALID [2022-04-28 06:07:19,279 INFO L272 TraceCheckUtils]: 67: Hoare triple {177194#(< ~counter~0 90)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176406#true} is VALID [2022-04-28 06:07:19,280 INFO L290 TraceCheckUtils]: 66: Hoare triple {177194#(< ~counter~0 90)} assume !!(#t~post7 < 100);havoc #t~post7; {177194#(< ~counter~0 90)} is VALID [2022-04-28 06:07:19,281 INFO L290 TraceCheckUtils]: 65: Hoare triple {177219#(< ~counter~0 89)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {177194#(< ~counter~0 90)} is VALID [2022-04-28 06:07:19,281 INFO L290 TraceCheckUtils]: 64: Hoare triple {177219#(< ~counter~0 89)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {177219#(< ~counter~0 89)} is VALID [2022-04-28 06:07:19,282 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {176406#true} {177219#(< ~counter~0 89)} #96#return; {177219#(< ~counter~0 89)} is VALID [2022-04-28 06:07:19,282 INFO L290 TraceCheckUtils]: 62: Hoare triple {176406#true} assume true; {176406#true} is VALID [2022-04-28 06:07:19,282 INFO L290 TraceCheckUtils]: 61: Hoare triple {176406#true} assume !(0 == ~cond); {176406#true} is VALID [2022-04-28 06:07:19,282 INFO L290 TraceCheckUtils]: 60: Hoare triple {176406#true} ~cond := #in~cond; {176406#true} is VALID [2022-04-28 06:07:19,282 INFO L272 TraceCheckUtils]: 59: Hoare triple {177219#(< ~counter~0 89)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176406#true} is VALID [2022-04-28 06:07:19,282 INFO L290 TraceCheckUtils]: 58: Hoare triple {177219#(< ~counter~0 89)} assume !!(#t~post7 < 100);havoc #t~post7; {177219#(< ~counter~0 89)} is VALID [2022-04-28 06:07:19,284 INFO L290 TraceCheckUtils]: 57: Hoare triple {177244#(< ~counter~0 88)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {177219#(< ~counter~0 89)} is VALID [2022-04-28 06:07:19,284 INFO L290 TraceCheckUtils]: 56: Hoare triple {177244#(< ~counter~0 88)} assume !!(0 != ~r~0); {177244#(< ~counter~0 88)} is VALID [2022-04-28 06:07:19,284 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {176406#true} {177244#(< ~counter~0 88)} #94#return; {177244#(< ~counter~0 88)} is VALID [2022-04-28 06:07:19,285 INFO L290 TraceCheckUtils]: 54: Hoare triple {176406#true} assume true; {176406#true} is VALID [2022-04-28 06:07:19,285 INFO L290 TraceCheckUtils]: 53: Hoare triple {176406#true} assume !(0 == ~cond); {176406#true} is VALID [2022-04-28 06:07:19,285 INFO L290 TraceCheckUtils]: 52: Hoare triple {176406#true} ~cond := #in~cond; {176406#true} is VALID [2022-04-28 06:07:19,285 INFO L272 TraceCheckUtils]: 51: Hoare triple {177244#(< ~counter~0 88)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176406#true} is VALID [2022-04-28 06:07:19,285 INFO L290 TraceCheckUtils]: 50: Hoare triple {177244#(< ~counter~0 88)} assume !!(#t~post6 < 100);havoc #t~post6; {177244#(< ~counter~0 88)} is VALID [2022-04-28 06:07:19,286 INFO L290 TraceCheckUtils]: 49: Hoare triple {177269#(< ~counter~0 87)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {177244#(< ~counter~0 88)} is VALID [2022-04-28 06:07:19,287 INFO L290 TraceCheckUtils]: 48: Hoare triple {177269#(< ~counter~0 87)} assume !(~r~0 < 0); {177269#(< ~counter~0 87)} is VALID [2022-04-28 06:07:19,287 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {176406#true} {177269#(< ~counter~0 87)} #98#return; {177269#(< ~counter~0 87)} is VALID [2022-04-28 06:07:19,287 INFO L290 TraceCheckUtils]: 46: Hoare triple {176406#true} assume true; {176406#true} is VALID [2022-04-28 06:07:19,287 INFO L290 TraceCheckUtils]: 45: Hoare triple {176406#true} assume !(0 == ~cond); {176406#true} is VALID [2022-04-28 06:07:19,287 INFO L290 TraceCheckUtils]: 44: Hoare triple {176406#true} ~cond := #in~cond; {176406#true} is VALID [2022-04-28 06:07:19,287 INFO L272 TraceCheckUtils]: 43: Hoare triple {177269#(< ~counter~0 87)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176406#true} is VALID [2022-04-28 06:07:19,288 INFO L290 TraceCheckUtils]: 42: Hoare triple {177269#(< ~counter~0 87)} assume !!(#t~post8 < 100);havoc #t~post8; {177269#(< ~counter~0 87)} is VALID [2022-04-28 06:07:19,289 INFO L290 TraceCheckUtils]: 41: Hoare triple {177294#(< ~counter~0 86)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {177269#(< ~counter~0 87)} is VALID [2022-04-28 06:07:19,289 INFO L290 TraceCheckUtils]: 40: Hoare triple {177294#(< ~counter~0 86)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {177294#(< ~counter~0 86)} is VALID [2022-04-28 06:07:19,290 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {176406#true} {177294#(< ~counter~0 86)} #98#return; {177294#(< ~counter~0 86)} is VALID [2022-04-28 06:07:19,290 INFO L290 TraceCheckUtils]: 38: Hoare triple {176406#true} assume true; {176406#true} is VALID [2022-04-28 06:07:19,290 INFO L290 TraceCheckUtils]: 37: Hoare triple {176406#true} assume !(0 == ~cond); {176406#true} is VALID [2022-04-28 06:07:19,290 INFO L290 TraceCheckUtils]: 36: Hoare triple {176406#true} ~cond := #in~cond; {176406#true} is VALID [2022-04-28 06:07:19,290 INFO L272 TraceCheckUtils]: 35: Hoare triple {177294#(< ~counter~0 86)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176406#true} is VALID [2022-04-28 06:07:19,291 INFO L290 TraceCheckUtils]: 34: Hoare triple {177294#(< ~counter~0 86)} assume !!(#t~post8 < 100);havoc #t~post8; {177294#(< ~counter~0 86)} is VALID [2022-04-28 06:07:19,293 INFO L290 TraceCheckUtils]: 33: Hoare triple {177319#(< ~counter~0 85)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {177294#(< ~counter~0 86)} is VALID [2022-04-28 06:07:19,293 INFO L290 TraceCheckUtils]: 32: Hoare triple {177319#(< ~counter~0 85)} assume !(~r~0 > 0); {177319#(< ~counter~0 85)} is VALID [2022-04-28 06:07:19,294 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {176406#true} {177319#(< ~counter~0 85)} #96#return; {177319#(< ~counter~0 85)} is VALID [2022-04-28 06:07:19,294 INFO L290 TraceCheckUtils]: 30: Hoare triple {176406#true} assume true; {176406#true} is VALID [2022-04-28 06:07:19,294 INFO L290 TraceCheckUtils]: 29: Hoare triple {176406#true} assume !(0 == ~cond); {176406#true} is VALID [2022-04-28 06:07:19,294 INFO L290 TraceCheckUtils]: 28: Hoare triple {176406#true} ~cond := #in~cond; {176406#true} is VALID [2022-04-28 06:07:19,294 INFO L272 TraceCheckUtils]: 27: Hoare triple {177319#(< ~counter~0 85)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176406#true} is VALID [2022-04-28 06:07:19,294 INFO L290 TraceCheckUtils]: 26: Hoare triple {177319#(< ~counter~0 85)} assume !!(#t~post7 < 100);havoc #t~post7; {177319#(< ~counter~0 85)} is VALID [2022-04-28 06:07:19,296 INFO L290 TraceCheckUtils]: 25: Hoare triple {177344#(< ~counter~0 84)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {177319#(< ~counter~0 85)} is VALID [2022-04-28 06:07:19,296 INFO L290 TraceCheckUtils]: 24: Hoare triple {177344#(< ~counter~0 84)} assume !!(0 != ~r~0); {177344#(< ~counter~0 84)} is VALID [2022-04-28 06:07:19,297 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {176406#true} {177344#(< ~counter~0 84)} #94#return; {177344#(< ~counter~0 84)} is VALID [2022-04-28 06:07:19,297 INFO L290 TraceCheckUtils]: 22: Hoare triple {176406#true} assume true; {176406#true} is VALID [2022-04-28 06:07:19,297 INFO L290 TraceCheckUtils]: 21: Hoare triple {176406#true} assume !(0 == ~cond); {176406#true} is VALID [2022-04-28 06:07:19,297 INFO L290 TraceCheckUtils]: 20: Hoare triple {176406#true} ~cond := #in~cond; {176406#true} is VALID [2022-04-28 06:07:19,297 INFO L272 TraceCheckUtils]: 19: Hoare triple {177344#(< ~counter~0 84)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176406#true} is VALID [2022-04-28 06:07:19,297 INFO L290 TraceCheckUtils]: 18: Hoare triple {177344#(< ~counter~0 84)} assume !!(#t~post6 < 100);havoc #t~post6; {177344#(< ~counter~0 84)} is VALID [2022-04-28 06:07:19,299 INFO L290 TraceCheckUtils]: 17: Hoare triple {177369#(< ~counter~0 83)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {177344#(< ~counter~0 84)} is VALID [2022-04-28 06:07:19,299 INFO L290 TraceCheckUtils]: 16: Hoare triple {177369#(< ~counter~0 83)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {177369#(< ~counter~0 83)} is VALID [2022-04-28 06:07:19,299 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {176406#true} {177369#(< ~counter~0 83)} #92#return; {177369#(< ~counter~0 83)} is VALID [2022-04-28 06:07:19,300 INFO L290 TraceCheckUtils]: 14: Hoare triple {176406#true} assume true; {176406#true} is VALID [2022-04-28 06:07:19,300 INFO L290 TraceCheckUtils]: 13: Hoare triple {176406#true} assume !(0 == ~cond); {176406#true} is VALID [2022-04-28 06:07:19,300 INFO L290 TraceCheckUtils]: 12: Hoare triple {176406#true} ~cond := #in~cond; {176406#true} is VALID [2022-04-28 06:07:19,300 INFO L272 TraceCheckUtils]: 11: Hoare triple {177369#(< ~counter~0 83)} 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)); {176406#true} is VALID [2022-04-28 06:07:19,300 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {176406#true} {177369#(< ~counter~0 83)} #90#return; {177369#(< ~counter~0 83)} is VALID [2022-04-28 06:07:19,300 INFO L290 TraceCheckUtils]: 9: Hoare triple {176406#true} assume true; {176406#true} is VALID [2022-04-28 06:07:19,300 INFO L290 TraceCheckUtils]: 8: Hoare triple {176406#true} assume !(0 == ~cond); {176406#true} is VALID [2022-04-28 06:07:19,300 INFO L290 TraceCheckUtils]: 7: Hoare triple {176406#true} ~cond := #in~cond; {176406#true} is VALID [2022-04-28 06:07:19,300 INFO L272 TraceCheckUtils]: 6: Hoare triple {177369#(< ~counter~0 83)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {176406#true} is VALID [2022-04-28 06:07:19,301 INFO L290 TraceCheckUtils]: 5: Hoare triple {177369#(< ~counter~0 83)} 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; {177369#(< ~counter~0 83)} is VALID [2022-04-28 06:07:19,301 INFO L272 TraceCheckUtils]: 4: Hoare triple {177369#(< ~counter~0 83)} call #t~ret9 := main(); {177369#(< ~counter~0 83)} is VALID [2022-04-28 06:07:19,301 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {177369#(< ~counter~0 83)} {176406#true} #102#return; {177369#(< ~counter~0 83)} is VALID [2022-04-28 06:07:19,302 INFO L290 TraceCheckUtils]: 2: Hoare triple {177369#(< ~counter~0 83)} assume true; {177369#(< ~counter~0 83)} is VALID [2022-04-28 06:07:19,302 INFO L290 TraceCheckUtils]: 1: Hoare triple {176406#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; {177369#(< ~counter~0 83)} is VALID [2022-04-28 06:07:19,302 INFO L272 TraceCheckUtils]: 0: Hoare triple {176406#true} call ULTIMATE.init(); {176406#true} is VALID [2022-04-28 06:07:19,303 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 54 proven. 182 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2022-04-28 06:07:19,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:07:19,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376717951] [2022-04-28 06:07:19,303 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:07:19,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048909758] [2022-04-28 06:07:19,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2048909758] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:07:19,303 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:07:19,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 40 [2022-04-28 06:07:19,303 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:07:19,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [629009893] [2022-04-28 06:07:19,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [629009893] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:07:19,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:07:19,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 06:07:19,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756421370] [2022-04-28 06:07:19,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:07:19,304 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.619047619047619) internal successors, (118), 20 states have internal predecessors, (118), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) Word has length 163 [2022-04-28 06:07:19,304 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:07:19,304 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 5.619047619047619) internal successors, (118), 20 states have internal predecessors, (118), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-28 06:07:19,507 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:07:19,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 06:07:19,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:07:19,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 06:07:19,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=708, Invalid=852, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 06:07:19,508 INFO L87 Difference]: Start difference. First operand 890 states and 1187 transitions. Second operand has 21 states, 21 states have (on average 5.619047619047619) internal successors, (118), 20 states have internal predecessors, (118), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-28 06:07:26,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:07:26,037 INFO L93 Difference]: Finished difference Result 1077 states and 1465 transitions. [2022-04-28 06:07:26,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-28 06:07:26,037 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.619047619047619) internal successors, (118), 20 states have internal predecessors, (118), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) Word has length 163 [2022-04-28 06:07:26,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:07:26,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 5.619047619047619) internal successors, (118), 20 states have internal predecessors, (118), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-28 06:07:26,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 376 transitions. [2022-04-28 06:07:26,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 5.619047619047619) internal successors, (118), 20 states have internal predecessors, (118), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-28 06:07:26,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 376 transitions. [2022-04-28 06:07:26,042 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 376 transitions. [2022-04-28 06:07:26,531 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 376 edges. 376 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:07:26,565 INFO L225 Difference]: With dead ends: 1077 [2022-04-28 06:07:26,565 INFO L226 Difference]: Without dead ends: 907 [2022-04-28 06:07:26,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1316, Invalid=1764, Unknown=0, NotChecked=0, Total=3080 [2022-04-28 06:07:26,570 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 277 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 06:07:26,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 385 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 06:07:26,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2022-04-28 06:07:30,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 907. [2022-04-28 06:07:30,011 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:07:30,012 INFO L82 GeneralOperation]: Start isEquivalent. First operand 907 states. Second operand has 907 states, 683 states have (on average 1.1742313323572475) internal successors, (802), 690 states have internal predecessors, (802), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 193 states have call predecessors, (200), 200 states have call successors, (200) [2022-04-28 06:07:30,013 INFO L74 IsIncluded]: Start isIncluded. First operand 907 states. Second operand has 907 states, 683 states have (on average 1.1742313323572475) internal successors, (802), 690 states have internal predecessors, (802), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 193 states have call predecessors, (200), 200 states have call successors, (200) [2022-04-28 06:07:30,014 INFO L87 Difference]: Start difference. First operand 907 states. Second operand has 907 states, 683 states have (on average 1.1742313323572475) internal successors, (802), 690 states have internal predecessors, (802), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 193 states have call predecessors, (200), 200 states have call successors, (200) [2022-04-28 06:07:30,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:07:30,051 INFO L93 Difference]: Finished difference Result 907 states and 1204 transitions. [2022-04-28 06:07:30,051 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1204 transitions. [2022-04-28 06:07:30,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:07:30,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:07:30,053 INFO L74 IsIncluded]: Start isIncluded. First operand has 907 states, 683 states have (on average 1.1742313323572475) internal successors, (802), 690 states have internal predecessors, (802), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 193 states have call predecessors, (200), 200 states have call successors, (200) Second operand 907 states. [2022-04-28 06:07:30,053 INFO L87 Difference]: Start difference. First operand has 907 states, 683 states have (on average 1.1742313323572475) internal successors, (802), 690 states have internal predecessors, (802), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 193 states have call predecessors, (200), 200 states have call successors, (200) Second operand 907 states. [2022-04-28 06:07:30,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:07:30,079 INFO L93 Difference]: Finished difference Result 907 states and 1204 transitions. [2022-04-28 06:07:30,079 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1204 transitions. [2022-04-28 06:07:30,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:07:30,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:07:30,080 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:07:30,080 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:07:30,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 907 states, 683 states have (on average 1.1742313323572475) internal successors, (802), 690 states have internal predecessors, (802), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 193 states have call predecessors, (200), 200 states have call successors, (200) [2022-04-28 06:07:30,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1204 transitions. [2022-04-28 06:07:30,118 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1204 transitions. Word has length 163 [2022-04-28 06:07:30,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:07:30,118 INFO L495 AbstractCegarLoop]: Abstraction has 907 states and 1204 transitions. [2022-04-28 06:07:30,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.619047619047619) internal successors, (118), 20 states have internal predecessors, (118), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-28 06:07:30,118 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 907 states and 1204 transitions. [2022-04-28 06:07:44,848 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1204 edges. 1201 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 06:07:44,848 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1204 transitions. [2022-04-28 06:07:44,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-04-28 06:07:44,855 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:07:44,855 INFO L195 NwaCegarLoop]: trace histogram [19, 18, 18, 9, 9, 9, 9, 6, 6, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:07:44,873 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-28 06:07:45,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2022-04-28 06:07:45,059 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:07:45,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:07:45,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1797417137, now seen corresponding path program 19 times [2022-04-28 06:07:45,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:07:45,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [368590863] [2022-04-28 06:07:45,061 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:07:45,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1797417137, now seen corresponding path program 20 times [2022-04-28 06:07:45,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:07:45,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893931888] [2022-04-28 06:07:45,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:07:45,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:07:45,074 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:07:45,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [433971200] [2022-04-28 06:07:45,075 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 06:07:45,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:07:45,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:07:45,076 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:07:45,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2022-04-28 06:07:45,144 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 06:07:45,144 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:07:45,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-28 06:07:45,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:07:45,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:07:46,138 INFO L272 TraceCheckUtils]: 0: Hoare triple {183237#true} call ULTIMATE.init(); {183237#true} is VALID [2022-04-28 06:07:46,139 INFO L290 TraceCheckUtils]: 1: Hoare triple {183237#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; {183245#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:46,139 INFO L290 TraceCheckUtils]: 2: Hoare triple {183245#(<= ~counter~0 0)} assume true; {183245#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:46,139 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {183245#(<= ~counter~0 0)} {183237#true} #102#return; {183245#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:46,140 INFO L272 TraceCheckUtils]: 4: Hoare triple {183245#(<= ~counter~0 0)} call #t~ret9 := main(); {183245#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:46,140 INFO L290 TraceCheckUtils]: 5: Hoare triple {183245#(<= ~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; {183245#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:46,140 INFO L272 TraceCheckUtils]: 6: Hoare triple {183245#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {183245#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:46,141 INFO L290 TraceCheckUtils]: 7: Hoare triple {183245#(<= ~counter~0 0)} ~cond := #in~cond; {183245#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:46,141 INFO L290 TraceCheckUtils]: 8: Hoare triple {183245#(<= ~counter~0 0)} assume !(0 == ~cond); {183245#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:46,141 INFO L290 TraceCheckUtils]: 9: Hoare triple {183245#(<= ~counter~0 0)} assume true; {183245#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:46,142 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {183245#(<= ~counter~0 0)} {183245#(<= ~counter~0 0)} #90#return; {183245#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:46,142 INFO L272 TraceCheckUtils]: 11: Hoare triple {183245#(<= ~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)); {183245#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:46,142 INFO L290 TraceCheckUtils]: 12: Hoare triple {183245#(<= ~counter~0 0)} ~cond := #in~cond; {183245#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:46,142 INFO L290 TraceCheckUtils]: 13: Hoare triple {183245#(<= ~counter~0 0)} assume !(0 == ~cond); {183245#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:46,143 INFO L290 TraceCheckUtils]: 14: Hoare triple {183245#(<= ~counter~0 0)} assume true; {183245#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:46,143 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {183245#(<= ~counter~0 0)} {183245#(<= ~counter~0 0)} #92#return; {183245#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:46,143 INFO L290 TraceCheckUtils]: 16: Hoare triple {183245#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {183245#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:46,147 INFO L290 TraceCheckUtils]: 17: Hoare triple {183245#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {183294#(<= ~counter~0 1)} is VALID [2022-04-28 06:07:46,147 INFO L290 TraceCheckUtils]: 18: Hoare triple {183294#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {183294#(<= ~counter~0 1)} is VALID [2022-04-28 06:07:46,148 INFO L272 TraceCheckUtils]: 19: Hoare triple {183294#(<= ~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)); {183294#(<= ~counter~0 1)} is VALID [2022-04-28 06:07:46,148 INFO L290 TraceCheckUtils]: 20: Hoare triple {183294#(<= ~counter~0 1)} ~cond := #in~cond; {183294#(<= ~counter~0 1)} is VALID [2022-04-28 06:07:46,148 INFO L290 TraceCheckUtils]: 21: Hoare triple {183294#(<= ~counter~0 1)} assume !(0 == ~cond); {183294#(<= ~counter~0 1)} is VALID [2022-04-28 06:07:46,148 INFO L290 TraceCheckUtils]: 22: Hoare triple {183294#(<= ~counter~0 1)} assume true; {183294#(<= ~counter~0 1)} is VALID [2022-04-28 06:07:46,149 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {183294#(<= ~counter~0 1)} {183294#(<= ~counter~0 1)} #94#return; {183294#(<= ~counter~0 1)} is VALID [2022-04-28 06:07:46,149 INFO L290 TraceCheckUtils]: 24: Hoare triple {183294#(<= ~counter~0 1)} assume !!(0 != ~r~0); {183294#(<= ~counter~0 1)} is VALID [2022-04-28 06:07:46,151 INFO L290 TraceCheckUtils]: 25: Hoare triple {183294#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {183319#(<= ~counter~0 2)} is VALID [2022-04-28 06:07:46,151 INFO L290 TraceCheckUtils]: 26: Hoare triple {183319#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {183319#(<= ~counter~0 2)} is VALID [2022-04-28 06:07:46,151 INFO L272 TraceCheckUtils]: 27: Hoare triple {183319#(<= ~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)); {183319#(<= ~counter~0 2)} is VALID [2022-04-28 06:07:46,152 INFO L290 TraceCheckUtils]: 28: Hoare triple {183319#(<= ~counter~0 2)} ~cond := #in~cond; {183319#(<= ~counter~0 2)} is VALID [2022-04-28 06:07:46,152 INFO L290 TraceCheckUtils]: 29: Hoare triple {183319#(<= ~counter~0 2)} assume !(0 == ~cond); {183319#(<= ~counter~0 2)} is VALID [2022-04-28 06:07:46,152 INFO L290 TraceCheckUtils]: 30: Hoare triple {183319#(<= ~counter~0 2)} assume true; {183319#(<= ~counter~0 2)} is VALID [2022-04-28 06:07:46,153 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {183319#(<= ~counter~0 2)} {183319#(<= ~counter~0 2)} #96#return; {183319#(<= ~counter~0 2)} is VALID [2022-04-28 06:07:46,153 INFO L290 TraceCheckUtils]: 32: Hoare triple {183319#(<= ~counter~0 2)} assume !(~r~0 > 0); {183319#(<= ~counter~0 2)} is VALID [2022-04-28 06:07:46,154 INFO L290 TraceCheckUtils]: 33: Hoare triple {183319#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {183344#(<= ~counter~0 3)} is VALID [2022-04-28 06:07:46,155 INFO L290 TraceCheckUtils]: 34: Hoare triple {183344#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {183344#(<= ~counter~0 3)} is VALID [2022-04-28 06:07:46,155 INFO L272 TraceCheckUtils]: 35: Hoare triple {183344#(<= ~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)); {183344#(<= ~counter~0 3)} is VALID [2022-04-28 06:07:46,155 INFO L290 TraceCheckUtils]: 36: Hoare triple {183344#(<= ~counter~0 3)} ~cond := #in~cond; {183344#(<= ~counter~0 3)} is VALID [2022-04-28 06:07:46,156 INFO L290 TraceCheckUtils]: 37: Hoare triple {183344#(<= ~counter~0 3)} assume !(0 == ~cond); {183344#(<= ~counter~0 3)} is VALID [2022-04-28 06:07:46,156 INFO L290 TraceCheckUtils]: 38: Hoare triple {183344#(<= ~counter~0 3)} assume true; {183344#(<= ~counter~0 3)} is VALID [2022-04-28 06:07:46,156 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {183344#(<= ~counter~0 3)} {183344#(<= ~counter~0 3)} #98#return; {183344#(<= ~counter~0 3)} is VALID [2022-04-28 06:07:46,157 INFO L290 TraceCheckUtils]: 40: Hoare triple {183344#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {183344#(<= ~counter~0 3)} is VALID [2022-04-28 06:07:46,158 INFO L290 TraceCheckUtils]: 41: Hoare triple {183344#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {183369#(<= ~counter~0 4)} is VALID [2022-04-28 06:07:46,158 INFO L290 TraceCheckUtils]: 42: Hoare triple {183369#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {183369#(<= ~counter~0 4)} is VALID [2022-04-28 06:07:46,159 INFO L272 TraceCheckUtils]: 43: Hoare triple {183369#(<= ~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)); {183369#(<= ~counter~0 4)} is VALID [2022-04-28 06:07:46,159 INFO L290 TraceCheckUtils]: 44: Hoare triple {183369#(<= ~counter~0 4)} ~cond := #in~cond; {183369#(<= ~counter~0 4)} is VALID [2022-04-28 06:07:46,159 INFO L290 TraceCheckUtils]: 45: Hoare triple {183369#(<= ~counter~0 4)} assume !(0 == ~cond); {183369#(<= ~counter~0 4)} is VALID [2022-04-28 06:07:46,159 INFO L290 TraceCheckUtils]: 46: Hoare triple {183369#(<= ~counter~0 4)} assume true; {183369#(<= ~counter~0 4)} is VALID [2022-04-28 06:07:46,160 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {183369#(<= ~counter~0 4)} {183369#(<= ~counter~0 4)} #98#return; {183369#(<= ~counter~0 4)} is VALID [2022-04-28 06:07:46,160 INFO L290 TraceCheckUtils]: 48: Hoare triple {183369#(<= ~counter~0 4)} assume !(~r~0 < 0); {183369#(<= ~counter~0 4)} is VALID [2022-04-28 06:07:46,162 INFO L290 TraceCheckUtils]: 49: Hoare triple {183369#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {183394#(<= ~counter~0 5)} is VALID [2022-04-28 06:07:46,162 INFO L290 TraceCheckUtils]: 50: Hoare triple {183394#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {183394#(<= ~counter~0 5)} is VALID [2022-04-28 06:07:46,162 INFO L272 TraceCheckUtils]: 51: Hoare triple {183394#(<= ~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)); {183394#(<= ~counter~0 5)} is VALID [2022-04-28 06:07:46,163 INFO L290 TraceCheckUtils]: 52: Hoare triple {183394#(<= ~counter~0 5)} ~cond := #in~cond; {183394#(<= ~counter~0 5)} is VALID [2022-04-28 06:07:46,163 INFO L290 TraceCheckUtils]: 53: Hoare triple {183394#(<= ~counter~0 5)} assume !(0 == ~cond); {183394#(<= ~counter~0 5)} is VALID [2022-04-28 06:07:46,163 INFO L290 TraceCheckUtils]: 54: Hoare triple {183394#(<= ~counter~0 5)} assume true; {183394#(<= ~counter~0 5)} is VALID [2022-04-28 06:07:46,164 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {183394#(<= ~counter~0 5)} {183394#(<= ~counter~0 5)} #94#return; {183394#(<= ~counter~0 5)} is VALID [2022-04-28 06:07:46,164 INFO L290 TraceCheckUtils]: 56: Hoare triple {183394#(<= ~counter~0 5)} assume !!(0 != ~r~0); {183394#(<= ~counter~0 5)} is VALID [2022-04-28 06:07:46,165 INFO L290 TraceCheckUtils]: 57: Hoare triple {183394#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {183419#(<= ~counter~0 6)} is VALID [2022-04-28 06:07:46,166 INFO L290 TraceCheckUtils]: 58: Hoare triple {183419#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {183419#(<= ~counter~0 6)} is VALID [2022-04-28 06:07:46,166 INFO L272 TraceCheckUtils]: 59: Hoare triple {183419#(<= ~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)); {183419#(<= ~counter~0 6)} is VALID [2022-04-28 06:07:46,166 INFO L290 TraceCheckUtils]: 60: Hoare triple {183419#(<= ~counter~0 6)} ~cond := #in~cond; {183419#(<= ~counter~0 6)} is VALID [2022-04-28 06:07:46,167 INFO L290 TraceCheckUtils]: 61: Hoare triple {183419#(<= ~counter~0 6)} assume !(0 == ~cond); {183419#(<= ~counter~0 6)} is VALID [2022-04-28 06:07:46,167 INFO L290 TraceCheckUtils]: 62: Hoare triple {183419#(<= ~counter~0 6)} assume true; {183419#(<= ~counter~0 6)} is VALID [2022-04-28 06:07:46,167 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {183419#(<= ~counter~0 6)} {183419#(<= ~counter~0 6)} #96#return; {183419#(<= ~counter~0 6)} is VALID [2022-04-28 06:07:46,168 INFO L290 TraceCheckUtils]: 64: Hoare triple {183419#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {183419#(<= ~counter~0 6)} is VALID [2022-04-28 06:07:46,169 INFO L290 TraceCheckUtils]: 65: Hoare triple {183419#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {183444#(<= ~counter~0 7)} is VALID [2022-04-28 06:07:46,169 INFO L290 TraceCheckUtils]: 66: Hoare triple {183444#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {183444#(<= ~counter~0 7)} is VALID [2022-04-28 06:07:46,170 INFO L272 TraceCheckUtils]: 67: Hoare triple {183444#(<= ~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)); {183444#(<= ~counter~0 7)} is VALID [2022-04-28 06:07:46,170 INFO L290 TraceCheckUtils]: 68: Hoare triple {183444#(<= ~counter~0 7)} ~cond := #in~cond; {183444#(<= ~counter~0 7)} is VALID [2022-04-28 06:07:46,170 INFO L290 TraceCheckUtils]: 69: Hoare triple {183444#(<= ~counter~0 7)} assume !(0 == ~cond); {183444#(<= ~counter~0 7)} is VALID [2022-04-28 06:07:46,171 INFO L290 TraceCheckUtils]: 70: Hoare triple {183444#(<= ~counter~0 7)} assume true; {183444#(<= ~counter~0 7)} is VALID [2022-04-28 06:07:46,171 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {183444#(<= ~counter~0 7)} {183444#(<= ~counter~0 7)} #96#return; {183444#(<= ~counter~0 7)} is VALID [2022-04-28 06:07:46,171 INFO L290 TraceCheckUtils]: 72: Hoare triple {183444#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {183444#(<= ~counter~0 7)} is VALID [2022-04-28 06:07:46,173 INFO L290 TraceCheckUtils]: 73: Hoare triple {183444#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {183469#(<= ~counter~0 8)} is VALID [2022-04-28 06:07:46,173 INFO L290 TraceCheckUtils]: 74: Hoare triple {183469#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {183469#(<= ~counter~0 8)} is VALID [2022-04-28 06:07:46,174 INFO L272 TraceCheckUtils]: 75: Hoare triple {183469#(<= ~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)); {183469#(<= ~counter~0 8)} is VALID [2022-04-28 06:07:46,174 INFO L290 TraceCheckUtils]: 76: Hoare triple {183469#(<= ~counter~0 8)} ~cond := #in~cond; {183469#(<= ~counter~0 8)} is VALID [2022-04-28 06:07:46,174 INFO L290 TraceCheckUtils]: 77: Hoare triple {183469#(<= ~counter~0 8)} assume !(0 == ~cond); {183469#(<= ~counter~0 8)} is VALID [2022-04-28 06:07:46,174 INFO L290 TraceCheckUtils]: 78: Hoare triple {183469#(<= ~counter~0 8)} assume true; {183469#(<= ~counter~0 8)} is VALID [2022-04-28 06:07:46,175 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {183469#(<= ~counter~0 8)} {183469#(<= ~counter~0 8)} #96#return; {183469#(<= ~counter~0 8)} is VALID [2022-04-28 06:07:46,175 INFO L290 TraceCheckUtils]: 80: Hoare triple {183469#(<= ~counter~0 8)} assume !(~r~0 > 0); {183469#(<= ~counter~0 8)} is VALID [2022-04-28 06:07:46,176 INFO L290 TraceCheckUtils]: 81: Hoare triple {183469#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {183494#(<= ~counter~0 9)} is VALID [2022-04-28 06:07:46,177 INFO L290 TraceCheckUtils]: 82: Hoare triple {183494#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {183494#(<= ~counter~0 9)} is VALID [2022-04-28 06:07:46,177 INFO L272 TraceCheckUtils]: 83: Hoare triple {183494#(<= ~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)); {183494#(<= ~counter~0 9)} is VALID [2022-04-28 06:07:46,177 INFO L290 TraceCheckUtils]: 84: Hoare triple {183494#(<= ~counter~0 9)} ~cond := #in~cond; {183494#(<= ~counter~0 9)} is VALID [2022-04-28 06:07:46,178 INFO L290 TraceCheckUtils]: 85: Hoare triple {183494#(<= ~counter~0 9)} assume !(0 == ~cond); {183494#(<= ~counter~0 9)} is VALID [2022-04-28 06:07:46,178 INFO L290 TraceCheckUtils]: 86: Hoare triple {183494#(<= ~counter~0 9)} assume true; {183494#(<= ~counter~0 9)} is VALID [2022-04-28 06:07:46,178 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {183494#(<= ~counter~0 9)} {183494#(<= ~counter~0 9)} #98#return; {183494#(<= ~counter~0 9)} is VALID [2022-04-28 06:07:46,179 INFO L290 TraceCheckUtils]: 88: Hoare triple {183494#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {183494#(<= ~counter~0 9)} is VALID [2022-04-28 06:07:46,180 INFO L290 TraceCheckUtils]: 89: Hoare triple {183494#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {183519#(<= ~counter~0 10)} is VALID [2022-04-28 06:07:46,180 INFO L290 TraceCheckUtils]: 90: Hoare triple {183519#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {183519#(<= ~counter~0 10)} is VALID [2022-04-28 06:07:46,181 INFO L272 TraceCheckUtils]: 91: Hoare triple {183519#(<= ~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)); {183519#(<= ~counter~0 10)} is VALID [2022-04-28 06:07:46,181 INFO L290 TraceCheckUtils]: 92: Hoare triple {183519#(<= ~counter~0 10)} ~cond := #in~cond; {183519#(<= ~counter~0 10)} is VALID [2022-04-28 06:07:46,181 INFO L290 TraceCheckUtils]: 93: Hoare triple {183519#(<= ~counter~0 10)} assume !(0 == ~cond); {183519#(<= ~counter~0 10)} is VALID [2022-04-28 06:07:46,182 INFO L290 TraceCheckUtils]: 94: Hoare triple {183519#(<= ~counter~0 10)} assume true; {183519#(<= ~counter~0 10)} is VALID [2022-04-28 06:07:46,182 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {183519#(<= ~counter~0 10)} {183519#(<= ~counter~0 10)} #98#return; {183519#(<= ~counter~0 10)} is VALID [2022-04-28 06:07:46,182 INFO L290 TraceCheckUtils]: 96: Hoare triple {183519#(<= ~counter~0 10)} assume !(~r~0 < 0); {183519#(<= ~counter~0 10)} is VALID [2022-04-28 06:07:46,184 INFO L290 TraceCheckUtils]: 97: Hoare triple {183519#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {183544#(<= ~counter~0 11)} is VALID [2022-04-28 06:07:46,184 INFO L290 TraceCheckUtils]: 98: Hoare triple {183544#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {183544#(<= ~counter~0 11)} is VALID [2022-04-28 06:07:46,185 INFO L272 TraceCheckUtils]: 99: Hoare triple {183544#(<= ~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)); {183544#(<= ~counter~0 11)} is VALID [2022-04-28 06:07:46,185 INFO L290 TraceCheckUtils]: 100: Hoare triple {183544#(<= ~counter~0 11)} ~cond := #in~cond; {183544#(<= ~counter~0 11)} is VALID [2022-04-28 06:07:46,185 INFO L290 TraceCheckUtils]: 101: Hoare triple {183544#(<= ~counter~0 11)} assume !(0 == ~cond); {183544#(<= ~counter~0 11)} is VALID [2022-04-28 06:07:46,185 INFO L290 TraceCheckUtils]: 102: Hoare triple {183544#(<= ~counter~0 11)} assume true; {183544#(<= ~counter~0 11)} is VALID [2022-04-28 06:07:46,186 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {183544#(<= ~counter~0 11)} {183544#(<= ~counter~0 11)} #94#return; {183544#(<= ~counter~0 11)} is VALID [2022-04-28 06:07:46,186 INFO L290 TraceCheckUtils]: 104: Hoare triple {183544#(<= ~counter~0 11)} assume !!(0 != ~r~0); {183544#(<= ~counter~0 11)} is VALID [2022-04-28 06:07:46,187 INFO L290 TraceCheckUtils]: 105: Hoare triple {183544#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {183569#(<= ~counter~0 12)} is VALID [2022-04-28 06:07:46,188 INFO L290 TraceCheckUtils]: 106: Hoare triple {183569#(<= ~counter~0 12)} assume !!(#t~post7 < 100);havoc #t~post7; {183569#(<= ~counter~0 12)} is VALID [2022-04-28 06:07:46,188 INFO L272 TraceCheckUtils]: 107: Hoare triple {183569#(<= ~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)); {183569#(<= ~counter~0 12)} is VALID [2022-04-28 06:07:46,188 INFO L290 TraceCheckUtils]: 108: Hoare triple {183569#(<= ~counter~0 12)} ~cond := #in~cond; {183569#(<= ~counter~0 12)} is VALID [2022-04-28 06:07:46,189 INFO L290 TraceCheckUtils]: 109: Hoare triple {183569#(<= ~counter~0 12)} assume !(0 == ~cond); {183569#(<= ~counter~0 12)} is VALID [2022-04-28 06:07:46,189 INFO L290 TraceCheckUtils]: 110: Hoare triple {183569#(<= ~counter~0 12)} assume true; {183569#(<= ~counter~0 12)} is VALID [2022-04-28 06:07:46,189 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {183569#(<= ~counter~0 12)} {183569#(<= ~counter~0 12)} #96#return; {183569#(<= ~counter~0 12)} is VALID [2022-04-28 06:07:46,190 INFO L290 TraceCheckUtils]: 112: Hoare triple {183569#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {183569#(<= ~counter~0 12)} is VALID [2022-04-28 06:07:46,191 INFO L290 TraceCheckUtils]: 113: Hoare triple {183569#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {183594#(<= ~counter~0 13)} is VALID [2022-04-28 06:07:46,191 INFO L290 TraceCheckUtils]: 114: Hoare triple {183594#(<= ~counter~0 13)} assume !!(#t~post7 < 100);havoc #t~post7; {183594#(<= ~counter~0 13)} is VALID [2022-04-28 06:07:46,192 INFO L272 TraceCheckUtils]: 115: Hoare triple {183594#(<= ~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)); {183594#(<= ~counter~0 13)} is VALID [2022-04-28 06:07:46,192 INFO L290 TraceCheckUtils]: 116: Hoare triple {183594#(<= ~counter~0 13)} ~cond := #in~cond; {183594#(<= ~counter~0 13)} is VALID [2022-04-28 06:07:46,192 INFO L290 TraceCheckUtils]: 117: Hoare triple {183594#(<= ~counter~0 13)} assume !(0 == ~cond); {183594#(<= ~counter~0 13)} is VALID [2022-04-28 06:07:46,193 INFO L290 TraceCheckUtils]: 118: Hoare triple {183594#(<= ~counter~0 13)} assume true; {183594#(<= ~counter~0 13)} is VALID [2022-04-28 06:07:46,193 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {183594#(<= ~counter~0 13)} {183594#(<= ~counter~0 13)} #96#return; {183594#(<= ~counter~0 13)} is VALID [2022-04-28 06:07:46,193 INFO L290 TraceCheckUtils]: 120: Hoare triple {183594#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {183594#(<= ~counter~0 13)} is VALID [2022-04-28 06:07:46,195 INFO L290 TraceCheckUtils]: 121: Hoare triple {183594#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {183619#(<= ~counter~0 14)} is VALID [2022-04-28 06:07:46,195 INFO L290 TraceCheckUtils]: 122: Hoare triple {183619#(<= ~counter~0 14)} assume !!(#t~post7 < 100);havoc #t~post7; {183619#(<= ~counter~0 14)} is VALID [2022-04-28 06:07:46,196 INFO L272 TraceCheckUtils]: 123: Hoare triple {183619#(<= ~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)); {183619#(<= ~counter~0 14)} is VALID [2022-04-28 06:07:46,196 INFO L290 TraceCheckUtils]: 124: Hoare triple {183619#(<= ~counter~0 14)} ~cond := #in~cond; {183619#(<= ~counter~0 14)} is VALID [2022-04-28 06:07:46,196 INFO L290 TraceCheckUtils]: 125: Hoare triple {183619#(<= ~counter~0 14)} assume !(0 == ~cond); {183619#(<= ~counter~0 14)} is VALID [2022-04-28 06:07:46,196 INFO L290 TraceCheckUtils]: 126: Hoare triple {183619#(<= ~counter~0 14)} assume true; {183619#(<= ~counter~0 14)} is VALID [2022-04-28 06:07:46,197 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {183619#(<= ~counter~0 14)} {183619#(<= ~counter~0 14)} #96#return; {183619#(<= ~counter~0 14)} is VALID [2022-04-28 06:07:46,197 INFO L290 TraceCheckUtils]: 128: Hoare triple {183619#(<= ~counter~0 14)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {183619#(<= ~counter~0 14)} is VALID [2022-04-28 06:07:46,199 INFO L290 TraceCheckUtils]: 129: Hoare triple {183619#(<= ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {183644#(<= ~counter~0 15)} is VALID [2022-04-28 06:07:46,199 INFO L290 TraceCheckUtils]: 130: Hoare triple {183644#(<= ~counter~0 15)} assume !!(#t~post7 < 100);havoc #t~post7; {183644#(<= ~counter~0 15)} is VALID [2022-04-28 06:07:46,199 INFO L272 TraceCheckUtils]: 131: Hoare triple {183644#(<= ~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)); {183644#(<= ~counter~0 15)} is VALID [2022-04-28 06:07:46,200 INFO L290 TraceCheckUtils]: 132: Hoare triple {183644#(<= ~counter~0 15)} ~cond := #in~cond; {183644#(<= ~counter~0 15)} is VALID [2022-04-28 06:07:46,200 INFO L290 TraceCheckUtils]: 133: Hoare triple {183644#(<= ~counter~0 15)} assume !(0 == ~cond); {183644#(<= ~counter~0 15)} is VALID [2022-04-28 06:07:46,200 INFO L290 TraceCheckUtils]: 134: Hoare triple {183644#(<= ~counter~0 15)} assume true; {183644#(<= ~counter~0 15)} is VALID [2022-04-28 06:07:46,201 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {183644#(<= ~counter~0 15)} {183644#(<= ~counter~0 15)} #96#return; {183644#(<= ~counter~0 15)} is VALID [2022-04-28 06:07:46,201 INFO L290 TraceCheckUtils]: 136: Hoare triple {183644#(<= ~counter~0 15)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {183644#(<= ~counter~0 15)} is VALID [2022-04-28 06:07:46,202 INFO L290 TraceCheckUtils]: 137: Hoare triple {183644#(<= ~counter~0 15)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {183669#(<= ~counter~0 16)} is VALID [2022-04-28 06:07:46,203 INFO L290 TraceCheckUtils]: 138: Hoare triple {183669#(<= ~counter~0 16)} assume !!(#t~post7 < 100);havoc #t~post7; {183669#(<= ~counter~0 16)} is VALID [2022-04-28 06:07:46,203 INFO L272 TraceCheckUtils]: 139: Hoare triple {183669#(<= ~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)); {183669#(<= ~counter~0 16)} is VALID [2022-04-28 06:07:46,203 INFO L290 TraceCheckUtils]: 140: Hoare triple {183669#(<= ~counter~0 16)} ~cond := #in~cond; {183669#(<= ~counter~0 16)} is VALID [2022-04-28 06:07:46,204 INFO L290 TraceCheckUtils]: 141: Hoare triple {183669#(<= ~counter~0 16)} assume !(0 == ~cond); {183669#(<= ~counter~0 16)} is VALID [2022-04-28 06:07:46,204 INFO L290 TraceCheckUtils]: 142: Hoare triple {183669#(<= ~counter~0 16)} assume true; {183669#(<= ~counter~0 16)} is VALID [2022-04-28 06:07:46,204 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {183669#(<= ~counter~0 16)} {183669#(<= ~counter~0 16)} #96#return; {183669#(<= ~counter~0 16)} is VALID [2022-04-28 06:07:46,205 INFO L290 TraceCheckUtils]: 144: Hoare triple {183669#(<= ~counter~0 16)} assume !(~r~0 > 0); {183669#(<= ~counter~0 16)} is VALID [2022-04-28 06:07:46,206 INFO L290 TraceCheckUtils]: 145: Hoare triple {183669#(<= ~counter~0 16)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {183694#(<= ~counter~0 17)} is VALID [2022-04-28 06:07:46,207 INFO L290 TraceCheckUtils]: 146: Hoare triple {183694#(<= ~counter~0 17)} assume !!(#t~post8 < 100);havoc #t~post8; {183694#(<= ~counter~0 17)} is VALID [2022-04-28 06:07:46,207 INFO L272 TraceCheckUtils]: 147: Hoare triple {183694#(<= ~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)); {183694#(<= ~counter~0 17)} is VALID [2022-04-28 06:07:46,207 INFO L290 TraceCheckUtils]: 148: Hoare triple {183694#(<= ~counter~0 17)} ~cond := #in~cond; {183694#(<= ~counter~0 17)} is VALID [2022-04-28 06:07:46,208 INFO L290 TraceCheckUtils]: 149: Hoare triple {183694#(<= ~counter~0 17)} assume !(0 == ~cond); {183694#(<= ~counter~0 17)} is VALID [2022-04-28 06:07:46,208 INFO L290 TraceCheckUtils]: 150: Hoare triple {183694#(<= ~counter~0 17)} assume true; {183694#(<= ~counter~0 17)} is VALID [2022-04-28 06:07:46,208 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {183694#(<= ~counter~0 17)} {183694#(<= ~counter~0 17)} #98#return; {183694#(<= ~counter~0 17)} is VALID [2022-04-28 06:07:46,209 INFO L290 TraceCheckUtils]: 152: Hoare triple {183694#(<= ~counter~0 17)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {183694#(<= ~counter~0 17)} is VALID [2022-04-28 06:07:46,210 INFO L290 TraceCheckUtils]: 153: Hoare triple {183694#(<= ~counter~0 17)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {183719#(<= ~counter~0 18)} is VALID [2022-04-28 06:07:46,210 INFO L290 TraceCheckUtils]: 154: Hoare triple {183719#(<= ~counter~0 18)} assume !!(#t~post8 < 100);havoc #t~post8; {183719#(<= ~counter~0 18)} is VALID [2022-04-28 06:07:46,211 INFO L272 TraceCheckUtils]: 155: Hoare triple {183719#(<= ~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)); {183719#(<= ~counter~0 18)} is VALID [2022-04-28 06:07:46,211 INFO L290 TraceCheckUtils]: 156: Hoare triple {183719#(<= ~counter~0 18)} ~cond := #in~cond; {183719#(<= ~counter~0 18)} is VALID [2022-04-28 06:07:46,211 INFO L290 TraceCheckUtils]: 157: Hoare triple {183719#(<= ~counter~0 18)} assume !(0 == ~cond); {183719#(<= ~counter~0 18)} is VALID [2022-04-28 06:07:46,211 INFO L290 TraceCheckUtils]: 158: Hoare triple {183719#(<= ~counter~0 18)} assume true; {183719#(<= ~counter~0 18)} is VALID [2022-04-28 06:07:46,212 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {183719#(<= ~counter~0 18)} {183719#(<= ~counter~0 18)} #98#return; {183719#(<= ~counter~0 18)} is VALID [2022-04-28 06:07:46,212 INFO L290 TraceCheckUtils]: 160: Hoare triple {183719#(<= ~counter~0 18)} assume !(~r~0 < 0); {183719#(<= ~counter~0 18)} is VALID [2022-04-28 06:07:46,213 INFO L290 TraceCheckUtils]: 161: Hoare triple {183719#(<= ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {183744#(<= |main_#t~post6| 18)} is VALID [2022-04-28 06:07:46,213 INFO L290 TraceCheckUtils]: 162: Hoare triple {183744#(<= |main_#t~post6| 18)} assume !(#t~post6 < 100);havoc #t~post6; {183238#false} is VALID [2022-04-28 06:07:46,213 INFO L272 TraceCheckUtils]: 163: Hoare triple {183238#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)); {183238#false} is VALID [2022-04-28 06:07:46,213 INFO L290 TraceCheckUtils]: 164: Hoare triple {183238#false} ~cond := #in~cond; {183238#false} is VALID [2022-04-28 06:07:46,213 INFO L290 TraceCheckUtils]: 165: Hoare triple {183238#false} assume 0 == ~cond; {183238#false} is VALID [2022-04-28 06:07:46,213 INFO L290 TraceCheckUtils]: 166: Hoare triple {183238#false} assume !false; {183238#false} is VALID [2022-04-28 06:07:46,214 INFO L134 CoverageAnalysis]: Checked inductivity of 874 backedges. 36 proven. 834 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 06:07:46,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:07:47,392 INFO L290 TraceCheckUtils]: 166: Hoare triple {183238#false} assume !false; {183238#false} is VALID [2022-04-28 06:07:47,392 INFO L290 TraceCheckUtils]: 165: Hoare triple {183238#false} assume 0 == ~cond; {183238#false} is VALID [2022-04-28 06:07:47,392 INFO L290 TraceCheckUtils]: 164: Hoare triple {183238#false} ~cond := #in~cond; {183238#false} is VALID [2022-04-28 06:07:47,392 INFO L272 TraceCheckUtils]: 163: Hoare triple {183238#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)); {183238#false} is VALID [2022-04-28 06:07:47,392 INFO L290 TraceCheckUtils]: 162: Hoare triple {183772#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {183238#false} is VALID [2022-04-28 06:07:47,393 INFO L290 TraceCheckUtils]: 161: Hoare triple {183776#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {183772#(< |main_#t~post6| 100)} is VALID [2022-04-28 06:07:47,393 INFO L290 TraceCheckUtils]: 160: Hoare triple {183776#(< ~counter~0 100)} assume !(~r~0 < 0); {183776#(< ~counter~0 100)} is VALID [2022-04-28 06:07:47,393 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {183237#true} {183776#(< ~counter~0 100)} #98#return; {183776#(< ~counter~0 100)} is VALID [2022-04-28 06:07:47,394 INFO L290 TraceCheckUtils]: 158: Hoare triple {183237#true} assume true; {183237#true} is VALID [2022-04-28 06:07:47,394 INFO L290 TraceCheckUtils]: 157: Hoare triple {183237#true} assume !(0 == ~cond); {183237#true} is VALID [2022-04-28 06:07:47,394 INFO L290 TraceCheckUtils]: 156: Hoare triple {183237#true} ~cond := #in~cond; {183237#true} is VALID [2022-04-28 06:07:47,394 INFO L272 TraceCheckUtils]: 155: Hoare triple {183776#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183237#true} is VALID [2022-04-28 06:07:47,394 INFO L290 TraceCheckUtils]: 154: Hoare triple {183776#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {183776#(< ~counter~0 100)} is VALID [2022-04-28 06:07:47,398 INFO L290 TraceCheckUtils]: 153: Hoare triple {183801#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {183776#(< ~counter~0 100)} is VALID [2022-04-28 06:07:47,398 INFO L290 TraceCheckUtils]: 152: Hoare triple {183801#(< ~counter~0 99)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {183801#(< ~counter~0 99)} is VALID [2022-04-28 06:07:47,398 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {183237#true} {183801#(< ~counter~0 99)} #98#return; {183801#(< ~counter~0 99)} is VALID [2022-04-28 06:07:47,398 INFO L290 TraceCheckUtils]: 150: Hoare triple {183237#true} assume true; {183237#true} is VALID [2022-04-28 06:07:47,399 INFO L290 TraceCheckUtils]: 149: Hoare triple {183237#true} assume !(0 == ~cond); {183237#true} is VALID [2022-04-28 06:07:47,399 INFO L290 TraceCheckUtils]: 148: Hoare triple {183237#true} ~cond := #in~cond; {183237#true} is VALID [2022-04-28 06:07:47,399 INFO L272 TraceCheckUtils]: 147: Hoare triple {183801#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183237#true} is VALID [2022-04-28 06:07:47,399 INFO L290 TraceCheckUtils]: 146: Hoare triple {183801#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {183801#(< ~counter~0 99)} is VALID [2022-04-28 06:07:47,400 INFO L290 TraceCheckUtils]: 145: Hoare triple {183826#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {183801#(< ~counter~0 99)} is VALID [2022-04-28 06:07:47,401 INFO L290 TraceCheckUtils]: 144: Hoare triple {183826#(< ~counter~0 98)} assume !(~r~0 > 0); {183826#(< ~counter~0 98)} is VALID [2022-04-28 06:07:47,401 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {183237#true} {183826#(< ~counter~0 98)} #96#return; {183826#(< ~counter~0 98)} is VALID [2022-04-28 06:07:47,401 INFO L290 TraceCheckUtils]: 142: Hoare triple {183237#true} assume true; {183237#true} is VALID [2022-04-28 06:07:47,401 INFO L290 TraceCheckUtils]: 141: Hoare triple {183237#true} assume !(0 == ~cond); {183237#true} is VALID [2022-04-28 06:07:47,401 INFO L290 TraceCheckUtils]: 140: Hoare triple {183237#true} ~cond := #in~cond; {183237#true} is VALID [2022-04-28 06:07:47,401 INFO L272 TraceCheckUtils]: 139: Hoare triple {183826#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183237#true} is VALID [2022-04-28 06:07:47,402 INFO L290 TraceCheckUtils]: 138: Hoare triple {183826#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {183826#(< ~counter~0 98)} is VALID [2022-04-28 06:07:47,403 INFO L290 TraceCheckUtils]: 137: Hoare triple {183851#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {183826#(< ~counter~0 98)} is VALID [2022-04-28 06:07:47,403 INFO L290 TraceCheckUtils]: 136: Hoare triple {183851#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {183851#(< ~counter~0 97)} is VALID [2022-04-28 06:07:47,404 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {183237#true} {183851#(< ~counter~0 97)} #96#return; {183851#(< ~counter~0 97)} is VALID [2022-04-28 06:07:47,404 INFO L290 TraceCheckUtils]: 134: Hoare triple {183237#true} assume true; {183237#true} is VALID [2022-04-28 06:07:47,404 INFO L290 TraceCheckUtils]: 133: Hoare triple {183237#true} assume !(0 == ~cond); {183237#true} is VALID [2022-04-28 06:07:47,404 INFO L290 TraceCheckUtils]: 132: Hoare triple {183237#true} ~cond := #in~cond; {183237#true} is VALID [2022-04-28 06:07:47,404 INFO L272 TraceCheckUtils]: 131: Hoare triple {183851#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183237#true} is VALID [2022-04-28 06:07:47,404 INFO L290 TraceCheckUtils]: 130: Hoare triple {183851#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {183851#(< ~counter~0 97)} is VALID [2022-04-28 06:07:47,406 INFO L290 TraceCheckUtils]: 129: Hoare triple {183876#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {183851#(< ~counter~0 97)} is VALID [2022-04-28 06:07:47,406 INFO L290 TraceCheckUtils]: 128: Hoare triple {183876#(< ~counter~0 96)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {183876#(< ~counter~0 96)} is VALID [2022-04-28 06:07:47,406 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {183237#true} {183876#(< ~counter~0 96)} #96#return; {183876#(< ~counter~0 96)} is VALID [2022-04-28 06:07:47,406 INFO L290 TraceCheckUtils]: 126: Hoare triple {183237#true} assume true; {183237#true} is VALID [2022-04-28 06:07:47,406 INFO L290 TraceCheckUtils]: 125: Hoare triple {183237#true} assume !(0 == ~cond); {183237#true} is VALID [2022-04-28 06:07:47,407 INFO L290 TraceCheckUtils]: 124: Hoare triple {183237#true} ~cond := #in~cond; {183237#true} is VALID [2022-04-28 06:07:47,407 INFO L272 TraceCheckUtils]: 123: Hoare triple {183876#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183237#true} is VALID [2022-04-28 06:07:47,407 INFO L290 TraceCheckUtils]: 122: Hoare triple {183876#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {183876#(< ~counter~0 96)} is VALID [2022-04-28 06:07:47,408 INFO L290 TraceCheckUtils]: 121: Hoare triple {183901#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {183876#(< ~counter~0 96)} is VALID [2022-04-28 06:07:47,409 INFO L290 TraceCheckUtils]: 120: Hoare triple {183901#(< ~counter~0 95)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {183901#(< ~counter~0 95)} is VALID [2022-04-28 06:07:47,409 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {183237#true} {183901#(< ~counter~0 95)} #96#return; {183901#(< ~counter~0 95)} is VALID [2022-04-28 06:07:47,409 INFO L290 TraceCheckUtils]: 118: Hoare triple {183237#true} assume true; {183237#true} is VALID [2022-04-28 06:07:47,409 INFO L290 TraceCheckUtils]: 117: Hoare triple {183237#true} assume !(0 == ~cond); {183237#true} is VALID [2022-04-28 06:07:47,409 INFO L290 TraceCheckUtils]: 116: Hoare triple {183237#true} ~cond := #in~cond; {183237#true} is VALID [2022-04-28 06:07:47,409 INFO L272 TraceCheckUtils]: 115: Hoare triple {183901#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183237#true} is VALID [2022-04-28 06:07:47,411 INFO L290 TraceCheckUtils]: 114: Hoare triple {183901#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {183901#(< ~counter~0 95)} is VALID [2022-04-28 06:07:47,413 INFO L290 TraceCheckUtils]: 113: Hoare triple {183926#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {183901#(< ~counter~0 95)} is VALID [2022-04-28 06:07:47,414 INFO L290 TraceCheckUtils]: 112: Hoare triple {183926#(< ~counter~0 94)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {183926#(< ~counter~0 94)} is VALID [2022-04-28 06:07:47,414 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {183237#true} {183926#(< ~counter~0 94)} #96#return; {183926#(< ~counter~0 94)} is VALID [2022-04-28 06:07:47,414 INFO L290 TraceCheckUtils]: 110: Hoare triple {183237#true} assume true; {183237#true} is VALID [2022-04-28 06:07:47,414 INFO L290 TraceCheckUtils]: 109: Hoare triple {183237#true} assume !(0 == ~cond); {183237#true} is VALID [2022-04-28 06:07:47,414 INFO L290 TraceCheckUtils]: 108: Hoare triple {183237#true} ~cond := #in~cond; {183237#true} is VALID [2022-04-28 06:07:47,414 INFO L272 TraceCheckUtils]: 107: Hoare triple {183926#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183237#true} is VALID [2022-04-28 06:07:47,415 INFO L290 TraceCheckUtils]: 106: Hoare triple {183926#(< ~counter~0 94)} assume !!(#t~post7 < 100);havoc #t~post7; {183926#(< ~counter~0 94)} is VALID [2022-04-28 06:07:47,416 INFO L290 TraceCheckUtils]: 105: Hoare triple {183951#(< ~counter~0 93)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {183926#(< ~counter~0 94)} is VALID [2022-04-28 06:07:47,417 INFO L290 TraceCheckUtils]: 104: Hoare triple {183951#(< ~counter~0 93)} assume !!(0 != ~r~0); {183951#(< ~counter~0 93)} is VALID [2022-04-28 06:07:47,417 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {183237#true} {183951#(< ~counter~0 93)} #94#return; {183951#(< ~counter~0 93)} is VALID [2022-04-28 06:07:47,417 INFO L290 TraceCheckUtils]: 102: Hoare triple {183237#true} assume true; {183237#true} is VALID [2022-04-28 06:07:47,417 INFO L290 TraceCheckUtils]: 101: Hoare triple {183237#true} assume !(0 == ~cond); {183237#true} is VALID [2022-04-28 06:07:47,417 INFO L290 TraceCheckUtils]: 100: Hoare triple {183237#true} ~cond := #in~cond; {183237#true} is VALID [2022-04-28 06:07:47,417 INFO L272 TraceCheckUtils]: 99: Hoare triple {183951#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183237#true} is VALID [2022-04-28 06:07:47,418 INFO L290 TraceCheckUtils]: 98: Hoare triple {183951#(< ~counter~0 93)} assume !!(#t~post6 < 100);havoc #t~post6; {183951#(< ~counter~0 93)} is VALID [2022-04-28 06:07:47,419 INFO L290 TraceCheckUtils]: 97: Hoare triple {183976#(< ~counter~0 92)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {183951#(< ~counter~0 93)} is VALID [2022-04-28 06:07:47,420 INFO L290 TraceCheckUtils]: 96: Hoare triple {183976#(< ~counter~0 92)} assume !(~r~0 < 0); {183976#(< ~counter~0 92)} is VALID [2022-04-28 06:07:47,420 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {183237#true} {183976#(< ~counter~0 92)} #98#return; {183976#(< ~counter~0 92)} is VALID [2022-04-28 06:07:47,420 INFO L290 TraceCheckUtils]: 94: Hoare triple {183237#true} assume true; {183237#true} is VALID [2022-04-28 06:07:47,420 INFO L290 TraceCheckUtils]: 93: Hoare triple {183237#true} assume !(0 == ~cond); {183237#true} is VALID [2022-04-28 06:07:47,420 INFO L290 TraceCheckUtils]: 92: Hoare triple {183237#true} ~cond := #in~cond; {183237#true} is VALID [2022-04-28 06:07:47,421 INFO L272 TraceCheckUtils]: 91: Hoare triple {183976#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183237#true} is VALID [2022-04-28 06:07:47,421 INFO L290 TraceCheckUtils]: 90: Hoare triple {183976#(< ~counter~0 92)} assume !!(#t~post8 < 100);havoc #t~post8; {183976#(< ~counter~0 92)} is VALID [2022-04-28 06:07:47,423 INFO L290 TraceCheckUtils]: 89: Hoare triple {184001#(< ~counter~0 91)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {183976#(< ~counter~0 92)} is VALID [2022-04-28 06:07:47,423 INFO L290 TraceCheckUtils]: 88: Hoare triple {184001#(< ~counter~0 91)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {184001#(< ~counter~0 91)} is VALID [2022-04-28 06:07:47,423 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {183237#true} {184001#(< ~counter~0 91)} #98#return; {184001#(< ~counter~0 91)} is VALID [2022-04-28 06:07:47,423 INFO L290 TraceCheckUtils]: 86: Hoare triple {183237#true} assume true; {183237#true} is VALID [2022-04-28 06:07:47,424 INFO L290 TraceCheckUtils]: 85: Hoare triple {183237#true} assume !(0 == ~cond); {183237#true} is VALID [2022-04-28 06:07:47,424 INFO L290 TraceCheckUtils]: 84: Hoare triple {183237#true} ~cond := #in~cond; {183237#true} is VALID [2022-04-28 06:07:47,424 INFO L272 TraceCheckUtils]: 83: Hoare triple {184001#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183237#true} is VALID [2022-04-28 06:07:47,424 INFO L290 TraceCheckUtils]: 82: Hoare triple {184001#(< ~counter~0 91)} assume !!(#t~post8 < 100);havoc #t~post8; {184001#(< ~counter~0 91)} is VALID [2022-04-28 06:07:47,426 INFO L290 TraceCheckUtils]: 81: Hoare triple {184026#(< ~counter~0 90)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {184001#(< ~counter~0 91)} is VALID [2022-04-28 06:07:47,426 INFO L290 TraceCheckUtils]: 80: Hoare triple {184026#(< ~counter~0 90)} assume !(~r~0 > 0); {184026#(< ~counter~0 90)} is VALID [2022-04-28 06:07:47,427 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {183237#true} {184026#(< ~counter~0 90)} #96#return; {184026#(< ~counter~0 90)} is VALID [2022-04-28 06:07:47,427 INFO L290 TraceCheckUtils]: 78: Hoare triple {183237#true} assume true; {183237#true} is VALID [2022-04-28 06:07:47,427 INFO L290 TraceCheckUtils]: 77: Hoare triple {183237#true} assume !(0 == ~cond); {183237#true} is VALID [2022-04-28 06:07:47,427 INFO L290 TraceCheckUtils]: 76: Hoare triple {183237#true} ~cond := #in~cond; {183237#true} is VALID [2022-04-28 06:07:47,427 INFO L272 TraceCheckUtils]: 75: Hoare triple {184026#(< ~counter~0 90)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183237#true} is VALID [2022-04-28 06:07:47,427 INFO L290 TraceCheckUtils]: 74: Hoare triple {184026#(< ~counter~0 90)} assume !!(#t~post7 < 100);havoc #t~post7; {184026#(< ~counter~0 90)} is VALID [2022-04-28 06:07:47,431 INFO L290 TraceCheckUtils]: 73: Hoare triple {184051#(< ~counter~0 89)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {184026#(< ~counter~0 90)} is VALID [2022-04-28 06:07:47,431 INFO L290 TraceCheckUtils]: 72: Hoare triple {184051#(< ~counter~0 89)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {184051#(< ~counter~0 89)} is VALID [2022-04-28 06:07:47,431 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {183237#true} {184051#(< ~counter~0 89)} #96#return; {184051#(< ~counter~0 89)} is VALID [2022-04-28 06:07:47,432 INFO L290 TraceCheckUtils]: 70: Hoare triple {183237#true} assume true; {183237#true} is VALID [2022-04-28 06:07:47,432 INFO L290 TraceCheckUtils]: 69: Hoare triple {183237#true} assume !(0 == ~cond); {183237#true} is VALID [2022-04-28 06:07:47,432 INFO L290 TraceCheckUtils]: 68: Hoare triple {183237#true} ~cond := #in~cond; {183237#true} is VALID [2022-04-28 06:07:47,432 INFO L272 TraceCheckUtils]: 67: Hoare triple {184051#(< ~counter~0 89)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183237#true} is VALID [2022-04-28 06:07:47,432 INFO L290 TraceCheckUtils]: 66: Hoare triple {184051#(< ~counter~0 89)} assume !!(#t~post7 < 100);havoc #t~post7; {184051#(< ~counter~0 89)} is VALID [2022-04-28 06:07:47,434 INFO L290 TraceCheckUtils]: 65: Hoare triple {184076#(< ~counter~0 88)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {184051#(< ~counter~0 89)} is VALID [2022-04-28 06:07:47,434 INFO L290 TraceCheckUtils]: 64: Hoare triple {184076#(< ~counter~0 88)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {184076#(< ~counter~0 88)} is VALID [2022-04-28 06:07:47,435 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {183237#true} {184076#(< ~counter~0 88)} #96#return; {184076#(< ~counter~0 88)} is VALID [2022-04-28 06:07:47,435 INFO L290 TraceCheckUtils]: 62: Hoare triple {183237#true} assume true; {183237#true} is VALID [2022-04-28 06:07:47,435 INFO L290 TraceCheckUtils]: 61: Hoare triple {183237#true} assume !(0 == ~cond); {183237#true} is VALID [2022-04-28 06:07:47,435 INFO L290 TraceCheckUtils]: 60: Hoare triple {183237#true} ~cond := #in~cond; {183237#true} is VALID [2022-04-28 06:07:47,435 INFO L272 TraceCheckUtils]: 59: Hoare triple {184076#(< ~counter~0 88)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183237#true} is VALID [2022-04-28 06:07:47,435 INFO L290 TraceCheckUtils]: 58: Hoare triple {184076#(< ~counter~0 88)} assume !!(#t~post7 < 100);havoc #t~post7; {184076#(< ~counter~0 88)} is VALID [2022-04-28 06:07:47,437 INFO L290 TraceCheckUtils]: 57: Hoare triple {184101#(< ~counter~0 87)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {184076#(< ~counter~0 88)} is VALID [2022-04-28 06:07:47,438 INFO L290 TraceCheckUtils]: 56: Hoare triple {184101#(< ~counter~0 87)} assume !!(0 != ~r~0); {184101#(< ~counter~0 87)} is VALID [2022-04-28 06:07:47,438 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {183237#true} {184101#(< ~counter~0 87)} #94#return; {184101#(< ~counter~0 87)} is VALID [2022-04-28 06:07:47,438 INFO L290 TraceCheckUtils]: 54: Hoare triple {183237#true} assume true; {183237#true} is VALID [2022-04-28 06:07:47,438 INFO L290 TraceCheckUtils]: 53: Hoare triple {183237#true} assume !(0 == ~cond); {183237#true} is VALID [2022-04-28 06:07:47,438 INFO L290 TraceCheckUtils]: 52: Hoare triple {183237#true} ~cond := #in~cond; {183237#true} is VALID [2022-04-28 06:07:47,438 INFO L272 TraceCheckUtils]: 51: Hoare triple {184101#(< ~counter~0 87)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183237#true} is VALID [2022-04-28 06:07:47,439 INFO L290 TraceCheckUtils]: 50: Hoare triple {184101#(< ~counter~0 87)} assume !!(#t~post6 < 100);havoc #t~post6; {184101#(< ~counter~0 87)} is VALID [2022-04-28 06:07:47,440 INFO L290 TraceCheckUtils]: 49: Hoare triple {184126#(< ~counter~0 86)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {184101#(< ~counter~0 87)} is VALID [2022-04-28 06:07:47,441 INFO L290 TraceCheckUtils]: 48: Hoare triple {184126#(< ~counter~0 86)} assume !(~r~0 < 0); {184126#(< ~counter~0 86)} is VALID [2022-04-28 06:07:47,441 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {183237#true} {184126#(< ~counter~0 86)} #98#return; {184126#(< ~counter~0 86)} is VALID [2022-04-28 06:07:47,441 INFO L290 TraceCheckUtils]: 46: Hoare triple {183237#true} assume true; {183237#true} is VALID [2022-04-28 06:07:47,441 INFO L290 TraceCheckUtils]: 45: Hoare triple {183237#true} assume !(0 == ~cond); {183237#true} is VALID [2022-04-28 06:07:47,441 INFO L290 TraceCheckUtils]: 44: Hoare triple {183237#true} ~cond := #in~cond; {183237#true} is VALID [2022-04-28 06:07:47,442 INFO L272 TraceCheckUtils]: 43: Hoare triple {184126#(< ~counter~0 86)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183237#true} is VALID [2022-04-28 06:07:47,442 INFO L290 TraceCheckUtils]: 42: Hoare triple {184126#(< ~counter~0 86)} assume !!(#t~post8 < 100);havoc #t~post8; {184126#(< ~counter~0 86)} is VALID [2022-04-28 06:07:47,443 INFO L290 TraceCheckUtils]: 41: Hoare triple {184151#(< ~counter~0 85)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {184126#(< ~counter~0 86)} is VALID [2022-04-28 06:07:47,444 INFO L290 TraceCheckUtils]: 40: Hoare triple {184151#(< ~counter~0 85)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {184151#(< ~counter~0 85)} is VALID [2022-04-28 06:07:47,444 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {183237#true} {184151#(< ~counter~0 85)} #98#return; {184151#(< ~counter~0 85)} is VALID [2022-04-28 06:07:47,444 INFO L290 TraceCheckUtils]: 38: Hoare triple {183237#true} assume true; {183237#true} is VALID [2022-04-28 06:07:47,445 INFO L290 TraceCheckUtils]: 37: Hoare triple {183237#true} assume !(0 == ~cond); {183237#true} is VALID [2022-04-28 06:07:47,445 INFO L290 TraceCheckUtils]: 36: Hoare triple {183237#true} ~cond := #in~cond; {183237#true} is VALID [2022-04-28 06:07:47,445 INFO L272 TraceCheckUtils]: 35: Hoare triple {184151#(< ~counter~0 85)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183237#true} is VALID [2022-04-28 06:07:47,445 INFO L290 TraceCheckUtils]: 34: Hoare triple {184151#(< ~counter~0 85)} assume !!(#t~post8 < 100);havoc #t~post8; {184151#(< ~counter~0 85)} is VALID [2022-04-28 06:07:47,447 INFO L290 TraceCheckUtils]: 33: Hoare triple {184176#(< ~counter~0 84)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {184151#(< ~counter~0 85)} is VALID [2022-04-28 06:07:47,448 INFO L290 TraceCheckUtils]: 32: Hoare triple {184176#(< ~counter~0 84)} assume !(~r~0 > 0); {184176#(< ~counter~0 84)} is VALID [2022-04-28 06:07:47,448 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {183237#true} {184176#(< ~counter~0 84)} #96#return; {184176#(< ~counter~0 84)} is VALID [2022-04-28 06:07:47,448 INFO L290 TraceCheckUtils]: 30: Hoare triple {183237#true} assume true; {183237#true} is VALID [2022-04-28 06:07:47,448 INFO L290 TraceCheckUtils]: 29: Hoare triple {183237#true} assume !(0 == ~cond); {183237#true} is VALID [2022-04-28 06:07:47,449 INFO L290 TraceCheckUtils]: 28: Hoare triple {183237#true} ~cond := #in~cond; {183237#true} is VALID [2022-04-28 06:07:47,449 INFO L272 TraceCheckUtils]: 27: Hoare triple {184176#(< ~counter~0 84)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183237#true} is VALID [2022-04-28 06:07:47,449 INFO L290 TraceCheckUtils]: 26: Hoare triple {184176#(< ~counter~0 84)} assume !!(#t~post7 < 100);havoc #t~post7; {184176#(< ~counter~0 84)} is VALID [2022-04-28 06:07:47,451 INFO L290 TraceCheckUtils]: 25: Hoare triple {184201#(< ~counter~0 83)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {184176#(< ~counter~0 84)} is VALID [2022-04-28 06:07:47,451 INFO L290 TraceCheckUtils]: 24: Hoare triple {184201#(< ~counter~0 83)} assume !!(0 != ~r~0); {184201#(< ~counter~0 83)} is VALID [2022-04-28 06:07:47,452 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {183237#true} {184201#(< ~counter~0 83)} #94#return; {184201#(< ~counter~0 83)} is VALID [2022-04-28 06:07:47,452 INFO L290 TraceCheckUtils]: 22: Hoare triple {183237#true} assume true; {183237#true} is VALID [2022-04-28 06:07:47,452 INFO L290 TraceCheckUtils]: 21: Hoare triple {183237#true} assume !(0 == ~cond); {183237#true} is VALID [2022-04-28 06:07:47,452 INFO L290 TraceCheckUtils]: 20: Hoare triple {183237#true} ~cond := #in~cond; {183237#true} is VALID [2022-04-28 06:07:47,452 INFO L272 TraceCheckUtils]: 19: Hoare triple {184201#(< ~counter~0 83)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183237#true} is VALID [2022-04-28 06:07:47,452 INFO L290 TraceCheckUtils]: 18: Hoare triple {184201#(< ~counter~0 83)} assume !!(#t~post6 < 100);havoc #t~post6; {184201#(< ~counter~0 83)} is VALID [2022-04-28 06:07:47,455 INFO L290 TraceCheckUtils]: 17: Hoare triple {184226#(< ~counter~0 82)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {184201#(< ~counter~0 83)} is VALID [2022-04-28 06:07:47,455 INFO L290 TraceCheckUtils]: 16: Hoare triple {184226#(< ~counter~0 82)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {184226#(< ~counter~0 82)} is VALID [2022-04-28 06:07:47,455 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {183237#true} {184226#(< ~counter~0 82)} #92#return; {184226#(< ~counter~0 82)} is VALID [2022-04-28 06:07:47,455 INFO L290 TraceCheckUtils]: 14: Hoare triple {183237#true} assume true; {183237#true} is VALID [2022-04-28 06:07:47,456 INFO L290 TraceCheckUtils]: 13: Hoare triple {183237#true} assume !(0 == ~cond); {183237#true} is VALID [2022-04-28 06:07:47,456 INFO L290 TraceCheckUtils]: 12: Hoare triple {183237#true} ~cond := #in~cond; {183237#true} is VALID [2022-04-28 06:07:47,456 INFO L272 TraceCheckUtils]: 11: Hoare triple {184226#(< ~counter~0 82)} 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)); {183237#true} is VALID [2022-04-28 06:07:47,456 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {183237#true} {184226#(< ~counter~0 82)} #90#return; {184226#(< ~counter~0 82)} is VALID [2022-04-28 06:07:47,456 INFO L290 TraceCheckUtils]: 9: Hoare triple {183237#true} assume true; {183237#true} is VALID [2022-04-28 06:07:47,456 INFO L290 TraceCheckUtils]: 8: Hoare triple {183237#true} assume !(0 == ~cond); {183237#true} is VALID [2022-04-28 06:07:47,456 INFO L290 TraceCheckUtils]: 7: Hoare triple {183237#true} ~cond := #in~cond; {183237#true} is VALID [2022-04-28 06:07:47,456 INFO L272 TraceCheckUtils]: 6: Hoare triple {184226#(< ~counter~0 82)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {183237#true} is VALID [2022-04-28 06:07:47,457 INFO L290 TraceCheckUtils]: 5: Hoare triple {184226#(< ~counter~0 82)} 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; {184226#(< ~counter~0 82)} is VALID [2022-04-28 06:07:47,457 INFO L272 TraceCheckUtils]: 4: Hoare triple {184226#(< ~counter~0 82)} call #t~ret9 := main(); {184226#(< ~counter~0 82)} is VALID [2022-04-28 06:07:47,457 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {184226#(< ~counter~0 82)} {183237#true} #102#return; {184226#(< ~counter~0 82)} is VALID [2022-04-28 06:07:47,457 INFO L290 TraceCheckUtils]: 2: Hoare triple {184226#(< ~counter~0 82)} assume true; {184226#(< ~counter~0 82)} is VALID [2022-04-28 06:07:47,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {183237#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; {184226#(< ~counter~0 82)} is VALID [2022-04-28 06:07:47,458 INFO L272 TraceCheckUtils]: 0: Hoare triple {183237#true} call ULTIMATE.init(); {183237#true} is VALID [2022-04-28 06:07:47,458 INFO L134 CoverageAnalysis]: Checked inductivity of 874 backedges. 36 proven. 222 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2022-04-28 06:07:47,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:07:47,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893931888] [2022-04-28 06:07:47,459 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:07:47,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433971200] [2022-04-28 06:07:47,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433971200] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:07:47,459 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:07:47,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 42 [2022-04-28 06:07:47,459 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:07:47,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [368590863] [2022-04-28 06:07:47,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [368590863] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:07:47,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:07:47,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 06:07:47,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325200689] [2022-04-28 06:07:47,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:07:47,460 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.454545454545454) internal successors, (120), 21 states have internal predecessors, (120), 21 states have call successors, (23), 21 states have call predecessors, (23), 19 states have return successors, (21), 19 states have call predecessors, (21), 20 states have call successors, (21) Word has length 167 [2022-04-28 06:07:47,460 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:07:47,460 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 5.454545454545454) internal successors, (120), 21 states have internal predecessors, (120), 21 states have call successors, (23), 21 states have call predecessors, (23), 19 states have return successors, (21), 19 states have call predecessors, (21), 20 states have call successors, (21) [2022-04-28 06:07:47,731 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:07:47,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 06:07:47,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:07:47,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 06:07:47,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=785, Invalid=937, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 06:07:47,732 INFO L87 Difference]: Start difference. First operand 907 states and 1204 transitions. Second operand has 22 states, 22 states have (on average 5.454545454545454) internal successors, (120), 21 states have internal predecessors, (120), 21 states have call successors, (23), 21 states have call predecessors, (23), 19 states have return successors, (21), 19 states have call predecessors, (21), 20 states have call successors, (21) [2022-04-28 06:07:54,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:07:54,887 INFO L93 Difference]: Finished difference Result 958 states and 1274 transitions. [2022-04-28 06:07:54,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-28 06:07:54,887 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.454545454545454) internal successors, (120), 21 states have internal predecessors, (120), 21 states have call successors, (23), 21 states have call predecessors, (23), 19 states have return successors, (21), 19 states have call predecessors, (21), 20 states have call successors, (21) Word has length 167 [2022-04-28 06:07:54,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:07:54,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 5.454545454545454) internal successors, (120), 21 states have internal predecessors, (120), 21 states have call successors, (23), 21 states have call predecessors, (23), 19 states have return successors, (21), 19 states have call predecessors, (21), 20 states have call successors, (21) [2022-04-28 06:07:54,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 374 transitions. [2022-04-28 06:07:54,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 5.454545454545454) internal successors, (120), 21 states have internal predecessors, (120), 21 states have call successors, (23), 21 states have call predecessors, (23), 19 states have return successors, (21), 19 states have call predecessors, (21), 20 states have call successors, (21) [2022-04-28 06:07:54,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 374 transitions. [2022-04-28 06:07:54,894 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 374 transitions. [2022-04-28 06:07:55,443 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 374 edges. 374 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:07:55,481 INFO L225 Difference]: With dead ends: 958 [2022-04-28 06:07:55,481 INFO L226 Difference]: Without dead ends: 953 [2022-04-28 06:07:55,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1358, Invalid=1834, Unknown=0, NotChecked=0, Total=3192 [2022-04-28 06:07:55,482 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 269 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-28 06:07:55,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 413 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-28 06:07:55,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2022-04-28 06:07:59,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 931. [2022-04-28 06:07:59,079 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:07:59,080 INFO L82 GeneralOperation]: Start isEquivalent. First operand 953 states. Second operand has 931 states, 693 states have (on average 1.1746031746031746) internal successors, (814), 710 states have internal predecessors, (814), 215 states have call successors, (215), 24 states have call predecessors, (215), 22 states have return successors, (213), 196 states have call predecessors, (213), 213 states have call successors, (213) [2022-04-28 06:07:59,080 INFO L74 IsIncluded]: Start isIncluded. First operand 953 states. Second operand has 931 states, 693 states have (on average 1.1746031746031746) internal successors, (814), 710 states have internal predecessors, (814), 215 states have call successors, (215), 24 states have call predecessors, (215), 22 states have return successors, (213), 196 states have call predecessors, (213), 213 states have call successors, (213) [2022-04-28 06:07:59,081 INFO L87 Difference]: Start difference. First operand 953 states. Second operand has 931 states, 693 states have (on average 1.1746031746031746) internal successors, (814), 710 states have internal predecessors, (814), 215 states have call successors, (215), 24 states have call predecessors, (215), 22 states have return successors, (213), 196 states have call predecessors, (213), 213 states have call successors, (213) [2022-04-28 06:07:59,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:07:59,109 INFO L93 Difference]: Finished difference Result 953 states and 1268 transitions. [2022-04-28 06:07:59,109 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1268 transitions. [2022-04-28 06:07:59,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:07:59,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:07:59,111 INFO L74 IsIncluded]: Start isIncluded. First operand has 931 states, 693 states have (on average 1.1746031746031746) internal successors, (814), 710 states have internal predecessors, (814), 215 states have call successors, (215), 24 states have call predecessors, (215), 22 states have return successors, (213), 196 states have call predecessors, (213), 213 states have call successors, (213) Second operand 953 states. [2022-04-28 06:07:59,112 INFO L87 Difference]: Start difference. First operand has 931 states, 693 states have (on average 1.1746031746031746) internal successors, (814), 710 states have internal predecessors, (814), 215 states have call successors, (215), 24 states have call predecessors, (215), 22 states have return successors, (213), 196 states have call predecessors, (213), 213 states have call successors, (213) Second operand 953 states. [2022-04-28 06:07:59,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:07:59,141 INFO L93 Difference]: Finished difference Result 953 states and 1268 transitions. [2022-04-28 06:07:59,141 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1268 transitions. [2022-04-28 06:07:59,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:07:59,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:07:59,142 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:07:59,142 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:07:59,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 931 states, 693 states have (on average 1.1746031746031746) internal successors, (814), 710 states have internal predecessors, (814), 215 states have call successors, (215), 24 states have call predecessors, (215), 22 states have return successors, (213), 196 states have call predecessors, (213), 213 states have call successors, (213) [2022-04-28 06:07:59,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1242 transitions. [2022-04-28 06:07:59,187 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1242 transitions. Word has length 167 [2022-04-28 06:07:59,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:07:59,188 INFO L495 AbstractCegarLoop]: Abstraction has 931 states and 1242 transitions. [2022-04-28 06:07:59,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.454545454545454) internal successors, (120), 21 states have internal predecessors, (120), 21 states have call successors, (23), 21 states have call predecessors, (23), 19 states have return successors, (21), 19 states have call predecessors, (21), 20 states have call successors, (21) [2022-04-28 06:07:59,188 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 931 states and 1242 transitions. [2022-04-28 06:08:12,979 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1242 edges. 1240 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 06:08:12,980 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1242 transitions. [2022-04-28 06:08:12,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-04-28 06:08:12,981 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:08:12,981 INFO L195 NwaCegarLoop]: trace histogram [19, 18, 18, 10, 10, 10, 10, 7, 6, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:08:12,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Forceful destruction successful, exit code 0 [2022-04-28 06:08:13,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2022-04-28 06:08:13,182 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:08:13,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:08:13,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1993951238, now seen corresponding path program 31 times [2022-04-28 06:08:13,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:08:13,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1028865974] [2022-04-28 06:08:13,182 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:08:13,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1993951238, now seen corresponding path program 32 times [2022-04-28 06:08:13,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:08:13,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766944914] [2022-04-28 06:08:13,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:08:13,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:08:13,196 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:08:13,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [766254640] [2022-04-28 06:08:13,196 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 06:08:13,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:08:13,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:08:13,197 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:08:13,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2022-04-28 06:08:13,272 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 06:08:13,272 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:08:13,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-28 06:08:13,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:08:13,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:08:14,320 INFO L272 TraceCheckUtils]: 0: Hoare triple {189994#true} call ULTIMATE.init(); {189994#true} is VALID [2022-04-28 06:08:14,320 INFO L290 TraceCheckUtils]: 1: Hoare triple {189994#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; {190002#(<= ~counter~0 0)} is VALID [2022-04-28 06:08:14,321 INFO L290 TraceCheckUtils]: 2: Hoare triple {190002#(<= ~counter~0 0)} assume true; {190002#(<= ~counter~0 0)} is VALID [2022-04-28 06:08:14,321 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {190002#(<= ~counter~0 0)} {189994#true} #102#return; {190002#(<= ~counter~0 0)} is VALID [2022-04-28 06:08:14,321 INFO L272 TraceCheckUtils]: 4: Hoare triple {190002#(<= ~counter~0 0)} call #t~ret9 := main(); {190002#(<= ~counter~0 0)} is VALID [2022-04-28 06:08:14,321 INFO L290 TraceCheckUtils]: 5: Hoare triple {190002#(<= ~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; {190002#(<= ~counter~0 0)} is VALID [2022-04-28 06:08:14,322 INFO L272 TraceCheckUtils]: 6: Hoare triple {190002#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {190002#(<= ~counter~0 0)} is VALID [2022-04-28 06:08:14,322 INFO L290 TraceCheckUtils]: 7: Hoare triple {190002#(<= ~counter~0 0)} ~cond := #in~cond; {190002#(<= ~counter~0 0)} is VALID [2022-04-28 06:08:14,322 INFO L290 TraceCheckUtils]: 8: Hoare triple {190002#(<= ~counter~0 0)} assume !(0 == ~cond); {190002#(<= ~counter~0 0)} is VALID [2022-04-28 06:08:14,323 INFO L290 TraceCheckUtils]: 9: Hoare triple {190002#(<= ~counter~0 0)} assume true; {190002#(<= ~counter~0 0)} is VALID [2022-04-28 06:08:14,323 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {190002#(<= ~counter~0 0)} {190002#(<= ~counter~0 0)} #90#return; {190002#(<= ~counter~0 0)} is VALID [2022-04-28 06:08:14,323 INFO L272 TraceCheckUtils]: 11: Hoare triple {190002#(<= ~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)); {190002#(<= ~counter~0 0)} is VALID [2022-04-28 06:08:14,324 INFO L290 TraceCheckUtils]: 12: Hoare triple {190002#(<= ~counter~0 0)} ~cond := #in~cond; {190002#(<= ~counter~0 0)} is VALID [2022-04-28 06:08:14,324 INFO L290 TraceCheckUtils]: 13: Hoare triple {190002#(<= ~counter~0 0)} assume !(0 == ~cond); {190002#(<= ~counter~0 0)} is VALID [2022-04-28 06:08:14,324 INFO L290 TraceCheckUtils]: 14: Hoare triple {190002#(<= ~counter~0 0)} assume true; {190002#(<= ~counter~0 0)} is VALID [2022-04-28 06:08:14,324 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {190002#(<= ~counter~0 0)} {190002#(<= ~counter~0 0)} #92#return; {190002#(<= ~counter~0 0)} is VALID [2022-04-28 06:08:14,325 INFO L290 TraceCheckUtils]: 16: Hoare triple {190002#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {190002#(<= ~counter~0 0)} is VALID [2022-04-28 06:08:14,328 INFO L290 TraceCheckUtils]: 17: Hoare triple {190002#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {190051#(<= ~counter~0 1)} is VALID [2022-04-28 06:08:14,329 INFO L290 TraceCheckUtils]: 18: Hoare triple {190051#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {190051#(<= ~counter~0 1)} is VALID [2022-04-28 06:08:14,329 INFO L272 TraceCheckUtils]: 19: Hoare triple {190051#(<= ~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)); {190051#(<= ~counter~0 1)} is VALID [2022-04-28 06:08:14,329 INFO L290 TraceCheckUtils]: 20: Hoare triple {190051#(<= ~counter~0 1)} ~cond := #in~cond; {190051#(<= ~counter~0 1)} is VALID [2022-04-28 06:08:14,330 INFO L290 TraceCheckUtils]: 21: Hoare triple {190051#(<= ~counter~0 1)} assume !(0 == ~cond); {190051#(<= ~counter~0 1)} is VALID [2022-04-28 06:08:14,330 INFO L290 TraceCheckUtils]: 22: Hoare triple {190051#(<= ~counter~0 1)} assume true; {190051#(<= ~counter~0 1)} is VALID [2022-04-28 06:08:14,330 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {190051#(<= ~counter~0 1)} {190051#(<= ~counter~0 1)} #94#return; {190051#(<= ~counter~0 1)} is VALID [2022-04-28 06:08:14,331 INFO L290 TraceCheckUtils]: 24: Hoare triple {190051#(<= ~counter~0 1)} assume !!(0 != ~r~0); {190051#(<= ~counter~0 1)} is VALID [2022-04-28 06:08:14,332 INFO L290 TraceCheckUtils]: 25: Hoare triple {190051#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {190076#(<= ~counter~0 2)} is VALID [2022-04-28 06:08:14,332 INFO L290 TraceCheckUtils]: 26: Hoare triple {190076#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {190076#(<= ~counter~0 2)} is VALID [2022-04-28 06:08:14,333 INFO L272 TraceCheckUtils]: 27: Hoare triple {190076#(<= ~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)); {190076#(<= ~counter~0 2)} is VALID [2022-04-28 06:08:14,333 INFO L290 TraceCheckUtils]: 28: Hoare triple {190076#(<= ~counter~0 2)} ~cond := #in~cond; {190076#(<= ~counter~0 2)} is VALID [2022-04-28 06:08:14,333 INFO L290 TraceCheckUtils]: 29: Hoare triple {190076#(<= ~counter~0 2)} assume !(0 == ~cond); {190076#(<= ~counter~0 2)} is VALID [2022-04-28 06:08:14,334 INFO L290 TraceCheckUtils]: 30: Hoare triple {190076#(<= ~counter~0 2)} assume true; {190076#(<= ~counter~0 2)} is VALID [2022-04-28 06:08:14,334 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {190076#(<= ~counter~0 2)} {190076#(<= ~counter~0 2)} #96#return; {190076#(<= ~counter~0 2)} is VALID [2022-04-28 06:08:14,334 INFO L290 TraceCheckUtils]: 32: Hoare triple {190076#(<= ~counter~0 2)} assume !(~r~0 > 0); {190076#(<= ~counter~0 2)} is VALID [2022-04-28 06:08:14,336 INFO L290 TraceCheckUtils]: 33: Hoare triple {190076#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {190101#(<= ~counter~0 3)} is VALID [2022-04-28 06:08:14,336 INFO L290 TraceCheckUtils]: 34: Hoare triple {190101#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {190101#(<= ~counter~0 3)} is VALID [2022-04-28 06:08:14,336 INFO L272 TraceCheckUtils]: 35: Hoare triple {190101#(<= ~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)); {190101#(<= ~counter~0 3)} is VALID [2022-04-28 06:08:14,337 INFO L290 TraceCheckUtils]: 36: Hoare triple {190101#(<= ~counter~0 3)} ~cond := #in~cond; {190101#(<= ~counter~0 3)} is VALID [2022-04-28 06:08:14,337 INFO L290 TraceCheckUtils]: 37: Hoare triple {190101#(<= ~counter~0 3)} assume !(0 == ~cond); {190101#(<= ~counter~0 3)} is VALID [2022-04-28 06:08:14,337 INFO L290 TraceCheckUtils]: 38: Hoare triple {190101#(<= ~counter~0 3)} assume true; {190101#(<= ~counter~0 3)} is VALID [2022-04-28 06:08:14,338 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {190101#(<= ~counter~0 3)} {190101#(<= ~counter~0 3)} #98#return; {190101#(<= ~counter~0 3)} is VALID [2022-04-28 06:08:14,338 INFO L290 TraceCheckUtils]: 40: Hoare triple {190101#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {190101#(<= ~counter~0 3)} is VALID [2022-04-28 06:08:14,339 INFO L290 TraceCheckUtils]: 41: Hoare triple {190101#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {190126#(<= ~counter~0 4)} is VALID [2022-04-28 06:08:14,340 INFO L290 TraceCheckUtils]: 42: Hoare triple {190126#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {190126#(<= ~counter~0 4)} is VALID [2022-04-28 06:08:14,340 INFO L272 TraceCheckUtils]: 43: Hoare triple {190126#(<= ~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)); {190126#(<= ~counter~0 4)} is VALID [2022-04-28 06:08:14,340 INFO L290 TraceCheckUtils]: 44: Hoare triple {190126#(<= ~counter~0 4)} ~cond := #in~cond; {190126#(<= ~counter~0 4)} is VALID [2022-04-28 06:08:14,341 INFO L290 TraceCheckUtils]: 45: Hoare triple {190126#(<= ~counter~0 4)} assume !(0 == ~cond); {190126#(<= ~counter~0 4)} is VALID [2022-04-28 06:08:14,341 INFO L290 TraceCheckUtils]: 46: Hoare triple {190126#(<= ~counter~0 4)} assume true; {190126#(<= ~counter~0 4)} is VALID [2022-04-28 06:08:14,341 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {190126#(<= ~counter~0 4)} {190126#(<= ~counter~0 4)} #98#return; {190126#(<= ~counter~0 4)} is VALID [2022-04-28 06:08:14,342 INFO L290 TraceCheckUtils]: 48: Hoare triple {190126#(<= ~counter~0 4)} assume !(~r~0 < 0); {190126#(<= ~counter~0 4)} is VALID [2022-04-28 06:08:14,343 INFO L290 TraceCheckUtils]: 49: Hoare triple {190126#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {190151#(<= ~counter~0 5)} is VALID [2022-04-28 06:08:14,343 INFO L290 TraceCheckUtils]: 50: Hoare triple {190151#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {190151#(<= ~counter~0 5)} is VALID [2022-04-28 06:08:14,344 INFO L272 TraceCheckUtils]: 51: Hoare triple {190151#(<= ~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)); {190151#(<= ~counter~0 5)} is VALID [2022-04-28 06:08:14,344 INFO L290 TraceCheckUtils]: 52: Hoare triple {190151#(<= ~counter~0 5)} ~cond := #in~cond; {190151#(<= ~counter~0 5)} is VALID [2022-04-28 06:08:14,344 INFO L290 TraceCheckUtils]: 53: Hoare triple {190151#(<= ~counter~0 5)} assume !(0 == ~cond); {190151#(<= ~counter~0 5)} is VALID [2022-04-28 06:08:14,344 INFO L290 TraceCheckUtils]: 54: Hoare triple {190151#(<= ~counter~0 5)} assume true; {190151#(<= ~counter~0 5)} is VALID [2022-04-28 06:08:14,345 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {190151#(<= ~counter~0 5)} {190151#(<= ~counter~0 5)} #94#return; {190151#(<= ~counter~0 5)} is VALID [2022-04-28 06:08:14,345 INFO L290 TraceCheckUtils]: 56: Hoare triple {190151#(<= ~counter~0 5)} assume !!(0 != ~r~0); {190151#(<= ~counter~0 5)} is VALID [2022-04-28 06:08:14,347 INFO L290 TraceCheckUtils]: 57: Hoare triple {190151#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {190176#(<= ~counter~0 6)} is VALID [2022-04-28 06:08:14,347 INFO L290 TraceCheckUtils]: 58: Hoare triple {190176#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {190176#(<= ~counter~0 6)} is VALID [2022-04-28 06:08:14,347 INFO L272 TraceCheckUtils]: 59: Hoare triple {190176#(<= ~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)); {190176#(<= ~counter~0 6)} is VALID [2022-04-28 06:08:14,348 INFO L290 TraceCheckUtils]: 60: Hoare triple {190176#(<= ~counter~0 6)} ~cond := #in~cond; {190176#(<= ~counter~0 6)} is VALID [2022-04-28 06:08:14,348 INFO L290 TraceCheckUtils]: 61: Hoare triple {190176#(<= ~counter~0 6)} assume !(0 == ~cond); {190176#(<= ~counter~0 6)} is VALID [2022-04-28 06:08:14,348 INFO L290 TraceCheckUtils]: 62: Hoare triple {190176#(<= ~counter~0 6)} assume true; {190176#(<= ~counter~0 6)} is VALID [2022-04-28 06:08:14,349 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {190176#(<= ~counter~0 6)} {190176#(<= ~counter~0 6)} #96#return; {190176#(<= ~counter~0 6)} is VALID [2022-04-28 06:08:14,349 INFO L290 TraceCheckUtils]: 64: Hoare triple {190176#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {190176#(<= ~counter~0 6)} is VALID [2022-04-28 06:08:14,350 INFO L290 TraceCheckUtils]: 65: Hoare triple {190176#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {190201#(<= ~counter~0 7)} is VALID [2022-04-28 06:08:14,351 INFO L290 TraceCheckUtils]: 66: Hoare triple {190201#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {190201#(<= ~counter~0 7)} is VALID [2022-04-28 06:08:14,351 INFO L272 TraceCheckUtils]: 67: Hoare triple {190201#(<= ~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)); {190201#(<= ~counter~0 7)} is VALID [2022-04-28 06:08:14,351 INFO L290 TraceCheckUtils]: 68: Hoare triple {190201#(<= ~counter~0 7)} ~cond := #in~cond; {190201#(<= ~counter~0 7)} is VALID [2022-04-28 06:08:14,352 INFO L290 TraceCheckUtils]: 69: Hoare triple {190201#(<= ~counter~0 7)} assume !(0 == ~cond); {190201#(<= ~counter~0 7)} is VALID [2022-04-28 06:08:14,352 INFO L290 TraceCheckUtils]: 70: Hoare triple {190201#(<= ~counter~0 7)} assume true; {190201#(<= ~counter~0 7)} is VALID [2022-04-28 06:08:14,352 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {190201#(<= ~counter~0 7)} {190201#(<= ~counter~0 7)} #96#return; {190201#(<= ~counter~0 7)} is VALID [2022-04-28 06:08:14,353 INFO L290 TraceCheckUtils]: 72: Hoare triple {190201#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {190201#(<= ~counter~0 7)} is VALID [2022-04-28 06:08:14,354 INFO L290 TraceCheckUtils]: 73: Hoare triple {190201#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {190226#(<= ~counter~0 8)} is VALID [2022-04-28 06:08:14,354 INFO L290 TraceCheckUtils]: 74: Hoare triple {190226#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {190226#(<= ~counter~0 8)} is VALID [2022-04-28 06:08:14,355 INFO L272 TraceCheckUtils]: 75: Hoare triple {190226#(<= ~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)); {190226#(<= ~counter~0 8)} is VALID [2022-04-28 06:08:14,355 INFO L290 TraceCheckUtils]: 76: Hoare triple {190226#(<= ~counter~0 8)} ~cond := #in~cond; {190226#(<= ~counter~0 8)} is VALID [2022-04-28 06:08:14,355 INFO L290 TraceCheckUtils]: 77: Hoare triple {190226#(<= ~counter~0 8)} assume !(0 == ~cond); {190226#(<= ~counter~0 8)} is VALID [2022-04-28 06:08:14,355 INFO L290 TraceCheckUtils]: 78: Hoare triple {190226#(<= ~counter~0 8)} assume true; {190226#(<= ~counter~0 8)} is VALID [2022-04-28 06:08:14,356 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {190226#(<= ~counter~0 8)} {190226#(<= ~counter~0 8)} #96#return; {190226#(<= ~counter~0 8)} is VALID [2022-04-28 06:08:14,356 INFO L290 TraceCheckUtils]: 80: Hoare triple {190226#(<= ~counter~0 8)} assume !(~r~0 > 0); {190226#(<= ~counter~0 8)} is VALID [2022-04-28 06:08:14,358 INFO L290 TraceCheckUtils]: 81: Hoare triple {190226#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {190251#(<= ~counter~0 9)} is VALID [2022-04-28 06:08:14,358 INFO L290 TraceCheckUtils]: 82: Hoare triple {190251#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {190251#(<= ~counter~0 9)} is VALID [2022-04-28 06:08:14,358 INFO L272 TraceCheckUtils]: 83: Hoare triple {190251#(<= ~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)); {190251#(<= ~counter~0 9)} is VALID [2022-04-28 06:08:14,359 INFO L290 TraceCheckUtils]: 84: Hoare triple {190251#(<= ~counter~0 9)} ~cond := #in~cond; {190251#(<= ~counter~0 9)} is VALID [2022-04-28 06:08:14,359 INFO L290 TraceCheckUtils]: 85: Hoare triple {190251#(<= ~counter~0 9)} assume !(0 == ~cond); {190251#(<= ~counter~0 9)} is VALID [2022-04-28 06:08:14,359 INFO L290 TraceCheckUtils]: 86: Hoare triple {190251#(<= ~counter~0 9)} assume true; {190251#(<= ~counter~0 9)} is VALID [2022-04-28 06:08:14,360 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {190251#(<= ~counter~0 9)} {190251#(<= ~counter~0 9)} #98#return; {190251#(<= ~counter~0 9)} is VALID [2022-04-28 06:08:14,360 INFO L290 TraceCheckUtils]: 88: Hoare triple {190251#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {190251#(<= ~counter~0 9)} is VALID [2022-04-28 06:08:14,361 INFO L290 TraceCheckUtils]: 89: Hoare triple {190251#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {190276#(<= ~counter~0 10)} is VALID [2022-04-28 06:08:14,361 INFO L290 TraceCheckUtils]: 90: Hoare triple {190276#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {190276#(<= ~counter~0 10)} is VALID [2022-04-28 06:08:14,362 INFO L272 TraceCheckUtils]: 91: Hoare triple {190276#(<= ~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)); {190276#(<= ~counter~0 10)} is VALID [2022-04-28 06:08:14,362 INFO L290 TraceCheckUtils]: 92: Hoare triple {190276#(<= ~counter~0 10)} ~cond := #in~cond; {190276#(<= ~counter~0 10)} is VALID [2022-04-28 06:08:14,362 INFO L290 TraceCheckUtils]: 93: Hoare triple {190276#(<= ~counter~0 10)} assume !(0 == ~cond); {190276#(<= ~counter~0 10)} is VALID [2022-04-28 06:08:14,363 INFO L290 TraceCheckUtils]: 94: Hoare triple {190276#(<= ~counter~0 10)} assume true; {190276#(<= ~counter~0 10)} is VALID [2022-04-28 06:08:14,363 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {190276#(<= ~counter~0 10)} {190276#(<= ~counter~0 10)} #98#return; {190276#(<= ~counter~0 10)} is VALID [2022-04-28 06:08:14,364 INFO L290 TraceCheckUtils]: 96: Hoare triple {190276#(<= ~counter~0 10)} assume !(~r~0 < 0); {190276#(<= ~counter~0 10)} is VALID [2022-04-28 06:08:14,366 INFO L290 TraceCheckUtils]: 97: Hoare triple {190276#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {190301#(<= ~counter~0 11)} is VALID [2022-04-28 06:08:14,367 INFO L290 TraceCheckUtils]: 98: Hoare triple {190301#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {190301#(<= ~counter~0 11)} is VALID [2022-04-28 06:08:14,367 INFO L272 TraceCheckUtils]: 99: Hoare triple {190301#(<= ~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)); {190301#(<= ~counter~0 11)} is VALID [2022-04-28 06:08:14,368 INFO L290 TraceCheckUtils]: 100: Hoare triple {190301#(<= ~counter~0 11)} ~cond := #in~cond; {190301#(<= ~counter~0 11)} is VALID [2022-04-28 06:08:14,368 INFO L290 TraceCheckUtils]: 101: Hoare triple {190301#(<= ~counter~0 11)} assume !(0 == ~cond); {190301#(<= ~counter~0 11)} is VALID [2022-04-28 06:08:14,368 INFO L290 TraceCheckUtils]: 102: Hoare triple {190301#(<= ~counter~0 11)} assume true; {190301#(<= ~counter~0 11)} is VALID [2022-04-28 06:08:14,369 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {190301#(<= ~counter~0 11)} {190301#(<= ~counter~0 11)} #94#return; {190301#(<= ~counter~0 11)} is VALID [2022-04-28 06:08:14,369 INFO L290 TraceCheckUtils]: 104: Hoare triple {190301#(<= ~counter~0 11)} assume !!(0 != ~r~0); {190301#(<= ~counter~0 11)} is VALID [2022-04-28 06:08:14,371 INFO L290 TraceCheckUtils]: 105: Hoare triple {190301#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {190326#(<= ~counter~0 12)} is VALID [2022-04-28 06:08:14,372 INFO L290 TraceCheckUtils]: 106: Hoare triple {190326#(<= ~counter~0 12)} assume !!(#t~post7 < 100);havoc #t~post7; {190326#(<= ~counter~0 12)} is VALID [2022-04-28 06:08:14,372 INFO L272 TraceCheckUtils]: 107: Hoare triple {190326#(<= ~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)); {190326#(<= ~counter~0 12)} is VALID [2022-04-28 06:08:14,373 INFO L290 TraceCheckUtils]: 108: Hoare triple {190326#(<= ~counter~0 12)} ~cond := #in~cond; {190326#(<= ~counter~0 12)} is VALID [2022-04-28 06:08:14,373 INFO L290 TraceCheckUtils]: 109: Hoare triple {190326#(<= ~counter~0 12)} assume !(0 == ~cond); {190326#(<= ~counter~0 12)} is VALID [2022-04-28 06:08:14,373 INFO L290 TraceCheckUtils]: 110: Hoare triple {190326#(<= ~counter~0 12)} assume true; {190326#(<= ~counter~0 12)} is VALID [2022-04-28 06:08:14,374 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {190326#(<= ~counter~0 12)} {190326#(<= ~counter~0 12)} #96#return; {190326#(<= ~counter~0 12)} is VALID [2022-04-28 06:08:14,374 INFO L290 TraceCheckUtils]: 112: Hoare triple {190326#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {190326#(<= ~counter~0 12)} is VALID [2022-04-28 06:08:14,375 INFO L290 TraceCheckUtils]: 113: Hoare triple {190326#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {190351#(<= ~counter~0 13)} is VALID [2022-04-28 06:08:14,376 INFO L290 TraceCheckUtils]: 114: Hoare triple {190351#(<= ~counter~0 13)} assume !!(#t~post7 < 100);havoc #t~post7; {190351#(<= ~counter~0 13)} is VALID [2022-04-28 06:08:14,376 INFO L272 TraceCheckUtils]: 115: Hoare triple {190351#(<= ~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)); {190351#(<= ~counter~0 13)} is VALID [2022-04-28 06:08:14,376 INFO L290 TraceCheckUtils]: 116: Hoare triple {190351#(<= ~counter~0 13)} ~cond := #in~cond; {190351#(<= ~counter~0 13)} is VALID [2022-04-28 06:08:14,377 INFO L290 TraceCheckUtils]: 117: Hoare triple {190351#(<= ~counter~0 13)} assume !(0 == ~cond); {190351#(<= ~counter~0 13)} is VALID [2022-04-28 06:08:14,377 INFO L290 TraceCheckUtils]: 118: Hoare triple {190351#(<= ~counter~0 13)} assume true; {190351#(<= ~counter~0 13)} is VALID [2022-04-28 06:08:14,377 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {190351#(<= ~counter~0 13)} {190351#(<= ~counter~0 13)} #96#return; {190351#(<= ~counter~0 13)} is VALID [2022-04-28 06:08:14,378 INFO L290 TraceCheckUtils]: 120: Hoare triple {190351#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {190351#(<= ~counter~0 13)} is VALID [2022-04-28 06:08:14,379 INFO L290 TraceCheckUtils]: 121: Hoare triple {190351#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {190376#(<= ~counter~0 14)} is VALID [2022-04-28 06:08:14,379 INFO L290 TraceCheckUtils]: 122: Hoare triple {190376#(<= ~counter~0 14)} assume !!(#t~post7 < 100);havoc #t~post7; {190376#(<= ~counter~0 14)} is VALID [2022-04-28 06:08:14,380 INFO L272 TraceCheckUtils]: 123: Hoare triple {190376#(<= ~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)); {190376#(<= ~counter~0 14)} is VALID [2022-04-28 06:08:14,380 INFO L290 TraceCheckUtils]: 124: Hoare triple {190376#(<= ~counter~0 14)} ~cond := #in~cond; {190376#(<= ~counter~0 14)} is VALID [2022-04-28 06:08:14,380 INFO L290 TraceCheckUtils]: 125: Hoare triple {190376#(<= ~counter~0 14)} assume !(0 == ~cond); {190376#(<= ~counter~0 14)} is VALID [2022-04-28 06:08:14,380 INFO L290 TraceCheckUtils]: 126: Hoare triple {190376#(<= ~counter~0 14)} assume true; {190376#(<= ~counter~0 14)} is VALID [2022-04-28 06:08:14,381 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {190376#(<= ~counter~0 14)} {190376#(<= ~counter~0 14)} #96#return; {190376#(<= ~counter~0 14)} is VALID [2022-04-28 06:08:14,381 INFO L290 TraceCheckUtils]: 128: Hoare triple {190376#(<= ~counter~0 14)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {190376#(<= ~counter~0 14)} is VALID [2022-04-28 06:08:14,383 INFO L290 TraceCheckUtils]: 129: Hoare triple {190376#(<= ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {190401#(<= ~counter~0 15)} is VALID [2022-04-28 06:08:14,383 INFO L290 TraceCheckUtils]: 130: Hoare triple {190401#(<= ~counter~0 15)} assume !!(#t~post7 < 100);havoc #t~post7; {190401#(<= ~counter~0 15)} is VALID [2022-04-28 06:08:14,383 INFO L272 TraceCheckUtils]: 131: Hoare triple {190401#(<= ~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)); {190401#(<= ~counter~0 15)} is VALID [2022-04-28 06:08:14,384 INFO L290 TraceCheckUtils]: 132: Hoare triple {190401#(<= ~counter~0 15)} ~cond := #in~cond; {190401#(<= ~counter~0 15)} is VALID [2022-04-28 06:08:14,384 INFO L290 TraceCheckUtils]: 133: Hoare triple {190401#(<= ~counter~0 15)} assume !(0 == ~cond); {190401#(<= ~counter~0 15)} is VALID [2022-04-28 06:08:14,384 INFO L290 TraceCheckUtils]: 134: Hoare triple {190401#(<= ~counter~0 15)} assume true; {190401#(<= ~counter~0 15)} is VALID [2022-04-28 06:08:14,385 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {190401#(<= ~counter~0 15)} {190401#(<= ~counter~0 15)} #96#return; {190401#(<= ~counter~0 15)} is VALID [2022-04-28 06:08:14,385 INFO L290 TraceCheckUtils]: 136: Hoare triple {190401#(<= ~counter~0 15)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {190401#(<= ~counter~0 15)} is VALID [2022-04-28 06:08:14,386 INFO L290 TraceCheckUtils]: 137: Hoare triple {190401#(<= ~counter~0 15)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {190426#(<= ~counter~0 16)} is VALID [2022-04-28 06:08:14,387 INFO L290 TraceCheckUtils]: 138: Hoare triple {190426#(<= ~counter~0 16)} assume !!(#t~post7 < 100);havoc #t~post7; {190426#(<= ~counter~0 16)} is VALID [2022-04-28 06:08:14,387 INFO L272 TraceCheckUtils]: 139: Hoare triple {190426#(<= ~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)); {190426#(<= ~counter~0 16)} is VALID [2022-04-28 06:08:14,387 INFO L290 TraceCheckUtils]: 140: Hoare triple {190426#(<= ~counter~0 16)} ~cond := #in~cond; {190426#(<= ~counter~0 16)} is VALID [2022-04-28 06:08:14,388 INFO L290 TraceCheckUtils]: 141: Hoare triple {190426#(<= ~counter~0 16)} assume !(0 == ~cond); {190426#(<= ~counter~0 16)} is VALID [2022-04-28 06:08:14,388 INFO L290 TraceCheckUtils]: 142: Hoare triple {190426#(<= ~counter~0 16)} assume true; {190426#(<= ~counter~0 16)} is VALID [2022-04-28 06:08:14,388 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {190426#(<= ~counter~0 16)} {190426#(<= ~counter~0 16)} #96#return; {190426#(<= ~counter~0 16)} is VALID [2022-04-28 06:08:14,389 INFO L290 TraceCheckUtils]: 144: Hoare triple {190426#(<= ~counter~0 16)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {190426#(<= ~counter~0 16)} is VALID [2022-04-28 06:08:14,390 INFO L290 TraceCheckUtils]: 145: Hoare triple {190426#(<= ~counter~0 16)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {190451#(<= ~counter~0 17)} is VALID [2022-04-28 06:08:14,390 INFO L290 TraceCheckUtils]: 146: Hoare triple {190451#(<= ~counter~0 17)} assume !!(#t~post7 < 100);havoc #t~post7; {190451#(<= ~counter~0 17)} is VALID [2022-04-28 06:08:14,391 INFO L272 TraceCheckUtils]: 147: Hoare triple {190451#(<= ~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)); {190451#(<= ~counter~0 17)} is VALID [2022-04-28 06:08:14,391 INFO L290 TraceCheckUtils]: 148: Hoare triple {190451#(<= ~counter~0 17)} ~cond := #in~cond; {190451#(<= ~counter~0 17)} is VALID [2022-04-28 06:08:14,391 INFO L290 TraceCheckUtils]: 149: Hoare triple {190451#(<= ~counter~0 17)} assume !(0 == ~cond); {190451#(<= ~counter~0 17)} is VALID [2022-04-28 06:08:14,392 INFO L290 TraceCheckUtils]: 150: Hoare triple {190451#(<= ~counter~0 17)} assume true; {190451#(<= ~counter~0 17)} is VALID [2022-04-28 06:08:14,392 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {190451#(<= ~counter~0 17)} {190451#(<= ~counter~0 17)} #96#return; {190451#(<= ~counter~0 17)} is VALID [2022-04-28 06:08:14,392 INFO L290 TraceCheckUtils]: 152: Hoare triple {190451#(<= ~counter~0 17)} assume !(~r~0 > 0); {190451#(<= ~counter~0 17)} is VALID [2022-04-28 06:08:14,394 INFO L290 TraceCheckUtils]: 153: Hoare triple {190451#(<= ~counter~0 17)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {190476#(<= ~counter~0 18)} is VALID [2022-04-28 06:08:14,394 INFO L290 TraceCheckUtils]: 154: Hoare triple {190476#(<= ~counter~0 18)} assume !!(#t~post8 < 100);havoc #t~post8; {190476#(<= ~counter~0 18)} is VALID [2022-04-28 06:08:14,395 INFO L272 TraceCheckUtils]: 155: Hoare triple {190476#(<= ~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)); {190476#(<= ~counter~0 18)} is VALID [2022-04-28 06:08:14,395 INFO L290 TraceCheckUtils]: 156: Hoare triple {190476#(<= ~counter~0 18)} ~cond := #in~cond; {190476#(<= ~counter~0 18)} is VALID [2022-04-28 06:08:14,395 INFO L290 TraceCheckUtils]: 157: Hoare triple {190476#(<= ~counter~0 18)} assume !(0 == ~cond); {190476#(<= ~counter~0 18)} is VALID [2022-04-28 06:08:14,395 INFO L290 TraceCheckUtils]: 158: Hoare triple {190476#(<= ~counter~0 18)} assume true; {190476#(<= ~counter~0 18)} is VALID [2022-04-28 06:08:14,396 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {190476#(<= ~counter~0 18)} {190476#(<= ~counter~0 18)} #98#return; {190476#(<= ~counter~0 18)} is VALID [2022-04-28 06:08:14,396 INFO L290 TraceCheckUtils]: 160: Hoare triple {190476#(<= ~counter~0 18)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {190476#(<= ~counter~0 18)} is VALID [2022-04-28 06:08:14,396 INFO L290 TraceCheckUtils]: 161: Hoare triple {190476#(<= ~counter~0 18)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {190501#(<= |main_#t~post8| 18)} is VALID [2022-04-28 06:08:14,397 INFO L290 TraceCheckUtils]: 162: Hoare triple {190501#(<= |main_#t~post8| 18)} assume !(#t~post8 < 100);havoc #t~post8; {189995#false} is VALID [2022-04-28 06:08:14,397 INFO L290 TraceCheckUtils]: 163: Hoare triple {189995#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {189995#false} is VALID [2022-04-28 06:08:14,397 INFO L290 TraceCheckUtils]: 164: Hoare triple {189995#false} assume !(#t~post6 < 100);havoc #t~post6; {189995#false} is VALID [2022-04-28 06:08:14,397 INFO L272 TraceCheckUtils]: 165: Hoare triple {189995#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)); {189995#false} is VALID [2022-04-28 06:08:14,397 INFO L290 TraceCheckUtils]: 166: Hoare triple {189995#false} ~cond := #in~cond; {189995#false} is VALID [2022-04-28 06:08:14,397 INFO L290 TraceCheckUtils]: 167: Hoare triple {189995#false} assume 0 == ~cond; {189995#false} is VALID [2022-04-28 06:08:14,397 INFO L290 TraceCheckUtils]: 168: Hoare triple {189995#false} assume !false; {189995#false} is VALID [2022-04-28 06:08:14,397 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 42 proven. 854 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 06:08:14,398 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:08:15,582 INFO L290 TraceCheckUtils]: 168: Hoare triple {189995#false} assume !false; {189995#false} is VALID [2022-04-28 06:08:15,583 INFO L290 TraceCheckUtils]: 167: Hoare triple {189995#false} assume 0 == ~cond; {189995#false} is VALID [2022-04-28 06:08:15,583 INFO L290 TraceCheckUtils]: 166: Hoare triple {189995#false} ~cond := #in~cond; {189995#false} is VALID [2022-04-28 06:08:15,583 INFO L272 TraceCheckUtils]: 165: Hoare triple {189995#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)); {189995#false} is VALID [2022-04-28 06:08:15,583 INFO L290 TraceCheckUtils]: 164: Hoare triple {189995#false} assume !(#t~post6 < 100);havoc #t~post6; {189995#false} is VALID [2022-04-28 06:08:15,583 INFO L290 TraceCheckUtils]: 163: Hoare triple {189995#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {189995#false} is VALID [2022-04-28 06:08:15,583 INFO L290 TraceCheckUtils]: 162: Hoare triple {190541#(< |main_#t~post8| 100)} assume !(#t~post8 < 100);havoc #t~post8; {189995#false} is VALID [2022-04-28 06:08:15,584 INFO L290 TraceCheckUtils]: 161: Hoare triple {190545#(< ~counter~0 100)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {190541#(< |main_#t~post8| 100)} is VALID [2022-04-28 06:08:15,584 INFO L290 TraceCheckUtils]: 160: Hoare triple {190545#(< ~counter~0 100)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {190545#(< ~counter~0 100)} is VALID [2022-04-28 06:08:15,584 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {189994#true} {190545#(< ~counter~0 100)} #98#return; {190545#(< ~counter~0 100)} is VALID [2022-04-28 06:08:15,584 INFO L290 TraceCheckUtils]: 158: Hoare triple {189994#true} assume true; {189994#true} is VALID [2022-04-28 06:08:15,584 INFO L290 TraceCheckUtils]: 157: Hoare triple {189994#true} assume !(0 == ~cond); {189994#true} is VALID [2022-04-28 06:08:15,584 INFO L290 TraceCheckUtils]: 156: Hoare triple {189994#true} ~cond := #in~cond; {189994#true} is VALID [2022-04-28 06:08:15,585 INFO L272 TraceCheckUtils]: 155: Hoare triple {190545#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {189994#true} is VALID [2022-04-28 06:08:15,585 INFO L290 TraceCheckUtils]: 154: Hoare triple {190545#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {190545#(< ~counter~0 100)} is VALID [2022-04-28 06:08:15,588 INFO L290 TraceCheckUtils]: 153: Hoare triple {190570#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {190545#(< ~counter~0 100)} is VALID [2022-04-28 06:08:15,589 INFO L290 TraceCheckUtils]: 152: Hoare triple {190570#(< ~counter~0 99)} assume !(~r~0 > 0); {190570#(< ~counter~0 99)} is VALID [2022-04-28 06:08:15,589 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {189994#true} {190570#(< ~counter~0 99)} #96#return; {190570#(< ~counter~0 99)} is VALID [2022-04-28 06:08:15,589 INFO L290 TraceCheckUtils]: 150: Hoare triple {189994#true} assume true; {189994#true} is VALID [2022-04-28 06:08:15,589 INFO L290 TraceCheckUtils]: 149: Hoare triple {189994#true} assume !(0 == ~cond); {189994#true} is VALID [2022-04-28 06:08:15,590 INFO L290 TraceCheckUtils]: 148: Hoare triple {189994#true} ~cond := #in~cond; {189994#true} is VALID [2022-04-28 06:08:15,590 INFO L272 TraceCheckUtils]: 147: Hoare triple {190570#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {189994#true} is VALID [2022-04-28 06:08:15,590 INFO L290 TraceCheckUtils]: 146: Hoare triple {190570#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {190570#(< ~counter~0 99)} is VALID [2022-04-28 06:08:15,591 INFO L290 TraceCheckUtils]: 145: Hoare triple {190595#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {190570#(< ~counter~0 99)} is VALID [2022-04-28 06:08:15,592 INFO L290 TraceCheckUtils]: 144: Hoare triple {190595#(< ~counter~0 98)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {190595#(< ~counter~0 98)} is VALID [2022-04-28 06:08:15,592 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {189994#true} {190595#(< ~counter~0 98)} #96#return; {190595#(< ~counter~0 98)} is VALID [2022-04-28 06:08:15,592 INFO L290 TraceCheckUtils]: 142: Hoare triple {189994#true} assume true; {189994#true} is VALID [2022-04-28 06:08:15,592 INFO L290 TraceCheckUtils]: 141: Hoare triple {189994#true} assume !(0 == ~cond); {189994#true} is VALID [2022-04-28 06:08:15,592 INFO L290 TraceCheckUtils]: 140: Hoare triple {189994#true} ~cond := #in~cond; {189994#true} is VALID [2022-04-28 06:08:15,592 INFO L272 TraceCheckUtils]: 139: Hoare triple {190595#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {189994#true} is VALID [2022-04-28 06:08:15,593 INFO L290 TraceCheckUtils]: 138: Hoare triple {190595#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {190595#(< ~counter~0 98)} is VALID [2022-04-28 06:08:15,594 INFO L290 TraceCheckUtils]: 137: Hoare triple {190620#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {190595#(< ~counter~0 98)} is VALID [2022-04-28 06:08:15,594 INFO L290 TraceCheckUtils]: 136: Hoare triple {190620#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {190620#(< ~counter~0 97)} is VALID [2022-04-28 06:08:15,595 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {189994#true} {190620#(< ~counter~0 97)} #96#return; {190620#(< ~counter~0 97)} is VALID [2022-04-28 06:08:15,595 INFO L290 TraceCheckUtils]: 134: Hoare triple {189994#true} assume true; {189994#true} is VALID [2022-04-28 06:08:15,595 INFO L290 TraceCheckUtils]: 133: Hoare triple {189994#true} assume !(0 == ~cond); {189994#true} is VALID [2022-04-28 06:08:15,595 INFO L290 TraceCheckUtils]: 132: Hoare triple {189994#true} ~cond := #in~cond; {189994#true} is VALID [2022-04-28 06:08:15,595 INFO L272 TraceCheckUtils]: 131: Hoare triple {190620#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {189994#true} is VALID [2022-04-28 06:08:15,595 INFO L290 TraceCheckUtils]: 130: Hoare triple {190620#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {190620#(< ~counter~0 97)} is VALID [2022-04-28 06:08:15,597 INFO L290 TraceCheckUtils]: 129: Hoare triple {190645#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {190620#(< ~counter~0 97)} is VALID [2022-04-28 06:08:15,597 INFO L290 TraceCheckUtils]: 128: Hoare triple {190645#(< ~counter~0 96)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {190645#(< ~counter~0 96)} is VALID [2022-04-28 06:08:15,598 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {189994#true} {190645#(< ~counter~0 96)} #96#return; {190645#(< ~counter~0 96)} is VALID [2022-04-28 06:08:15,598 INFO L290 TraceCheckUtils]: 126: Hoare triple {189994#true} assume true; {189994#true} is VALID [2022-04-28 06:08:15,598 INFO L290 TraceCheckUtils]: 125: Hoare triple {189994#true} assume !(0 == ~cond); {189994#true} is VALID [2022-04-28 06:08:15,598 INFO L290 TraceCheckUtils]: 124: Hoare triple {189994#true} ~cond := #in~cond; {189994#true} is VALID [2022-04-28 06:08:15,598 INFO L272 TraceCheckUtils]: 123: Hoare triple {190645#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {189994#true} is VALID [2022-04-28 06:08:15,598 INFO L290 TraceCheckUtils]: 122: Hoare triple {190645#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {190645#(< ~counter~0 96)} is VALID [2022-04-28 06:08:15,600 INFO L290 TraceCheckUtils]: 121: Hoare triple {190670#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {190645#(< ~counter~0 96)} is VALID [2022-04-28 06:08:15,600 INFO L290 TraceCheckUtils]: 120: Hoare triple {190670#(< ~counter~0 95)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {190670#(< ~counter~0 95)} is VALID [2022-04-28 06:08:15,600 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {189994#true} {190670#(< ~counter~0 95)} #96#return; {190670#(< ~counter~0 95)} is VALID [2022-04-28 06:08:15,600 INFO L290 TraceCheckUtils]: 118: Hoare triple {189994#true} assume true; {189994#true} is VALID [2022-04-28 06:08:15,600 INFO L290 TraceCheckUtils]: 117: Hoare triple {189994#true} assume !(0 == ~cond); {189994#true} is VALID [2022-04-28 06:08:15,601 INFO L290 TraceCheckUtils]: 116: Hoare triple {189994#true} ~cond := #in~cond; {189994#true} is VALID [2022-04-28 06:08:15,601 INFO L272 TraceCheckUtils]: 115: Hoare triple {190670#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {189994#true} is VALID [2022-04-28 06:08:15,601 INFO L290 TraceCheckUtils]: 114: Hoare triple {190670#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {190670#(< ~counter~0 95)} is VALID [2022-04-28 06:08:15,602 INFO L290 TraceCheckUtils]: 113: Hoare triple {190695#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {190670#(< ~counter~0 95)} is VALID [2022-04-28 06:08:15,603 INFO L290 TraceCheckUtils]: 112: Hoare triple {190695#(< ~counter~0 94)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {190695#(< ~counter~0 94)} is VALID [2022-04-28 06:08:15,603 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {189994#true} {190695#(< ~counter~0 94)} #96#return; {190695#(< ~counter~0 94)} is VALID [2022-04-28 06:08:15,603 INFO L290 TraceCheckUtils]: 110: Hoare triple {189994#true} assume true; {189994#true} is VALID [2022-04-28 06:08:15,603 INFO L290 TraceCheckUtils]: 109: Hoare triple {189994#true} assume !(0 == ~cond); {189994#true} is VALID [2022-04-28 06:08:15,603 INFO L290 TraceCheckUtils]: 108: Hoare triple {189994#true} ~cond := #in~cond; {189994#true} is VALID [2022-04-28 06:08:15,603 INFO L272 TraceCheckUtils]: 107: Hoare triple {190695#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {189994#true} is VALID [2022-04-28 06:08:15,604 INFO L290 TraceCheckUtils]: 106: Hoare triple {190695#(< ~counter~0 94)} assume !!(#t~post7 < 100);havoc #t~post7; {190695#(< ~counter~0 94)} is VALID [2022-04-28 06:08:15,605 INFO L290 TraceCheckUtils]: 105: Hoare triple {190720#(< ~counter~0 93)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {190695#(< ~counter~0 94)} is VALID [2022-04-28 06:08:15,605 INFO L290 TraceCheckUtils]: 104: Hoare triple {190720#(< ~counter~0 93)} assume !!(0 != ~r~0); {190720#(< ~counter~0 93)} is VALID [2022-04-28 06:08:15,606 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {189994#true} {190720#(< ~counter~0 93)} #94#return; {190720#(< ~counter~0 93)} is VALID [2022-04-28 06:08:15,606 INFO L290 TraceCheckUtils]: 102: Hoare triple {189994#true} assume true; {189994#true} is VALID [2022-04-28 06:08:15,606 INFO L290 TraceCheckUtils]: 101: Hoare triple {189994#true} assume !(0 == ~cond); {189994#true} is VALID [2022-04-28 06:08:15,606 INFO L290 TraceCheckUtils]: 100: Hoare triple {189994#true} ~cond := #in~cond; {189994#true} is VALID [2022-04-28 06:08:15,606 INFO L272 TraceCheckUtils]: 99: Hoare triple {190720#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {189994#true} is VALID [2022-04-28 06:08:15,606 INFO L290 TraceCheckUtils]: 98: Hoare triple {190720#(< ~counter~0 93)} assume !!(#t~post6 < 100);havoc #t~post6; {190720#(< ~counter~0 93)} is VALID [2022-04-28 06:08:15,608 INFO L290 TraceCheckUtils]: 97: Hoare triple {190745#(< ~counter~0 92)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {190720#(< ~counter~0 93)} is VALID [2022-04-28 06:08:15,608 INFO L290 TraceCheckUtils]: 96: Hoare triple {190745#(< ~counter~0 92)} assume !(~r~0 < 0); {190745#(< ~counter~0 92)} is VALID [2022-04-28 06:08:15,609 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {189994#true} {190745#(< ~counter~0 92)} #98#return; {190745#(< ~counter~0 92)} is VALID [2022-04-28 06:08:15,609 INFO L290 TraceCheckUtils]: 94: Hoare triple {189994#true} assume true; {189994#true} is VALID [2022-04-28 06:08:15,609 INFO L290 TraceCheckUtils]: 93: Hoare triple {189994#true} assume !(0 == ~cond); {189994#true} is VALID [2022-04-28 06:08:15,609 INFO L290 TraceCheckUtils]: 92: Hoare triple {189994#true} ~cond := #in~cond; {189994#true} is VALID [2022-04-28 06:08:15,609 INFO L272 TraceCheckUtils]: 91: Hoare triple {190745#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {189994#true} is VALID [2022-04-28 06:08:15,609 INFO L290 TraceCheckUtils]: 90: Hoare triple {190745#(< ~counter~0 92)} assume !!(#t~post8 < 100);havoc #t~post8; {190745#(< ~counter~0 92)} is VALID [2022-04-28 06:08:15,611 INFO L290 TraceCheckUtils]: 89: Hoare triple {190770#(< ~counter~0 91)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {190745#(< ~counter~0 92)} is VALID [2022-04-28 06:08:15,611 INFO L290 TraceCheckUtils]: 88: Hoare triple {190770#(< ~counter~0 91)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {190770#(< ~counter~0 91)} is VALID [2022-04-28 06:08:15,611 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {189994#true} {190770#(< ~counter~0 91)} #98#return; {190770#(< ~counter~0 91)} is VALID [2022-04-28 06:08:15,611 INFO L290 TraceCheckUtils]: 86: Hoare triple {189994#true} assume true; {189994#true} is VALID [2022-04-28 06:08:15,611 INFO L290 TraceCheckUtils]: 85: Hoare triple {189994#true} assume !(0 == ~cond); {189994#true} is VALID [2022-04-28 06:08:15,612 INFO L290 TraceCheckUtils]: 84: Hoare triple {189994#true} ~cond := #in~cond; {189994#true} is VALID [2022-04-28 06:08:15,612 INFO L272 TraceCheckUtils]: 83: Hoare triple {190770#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {189994#true} is VALID [2022-04-28 06:08:15,612 INFO L290 TraceCheckUtils]: 82: Hoare triple {190770#(< ~counter~0 91)} assume !!(#t~post8 < 100);havoc #t~post8; {190770#(< ~counter~0 91)} is VALID [2022-04-28 06:08:15,613 INFO L290 TraceCheckUtils]: 81: Hoare triple {190795#(< ~counter~0 90)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {190770#(< ~counter~0 91)} is VALID [2022-04-28 06:08:15,614 INFO L290 TraceCheckUtils]: 80: Hoare triple {190795#(< ~counter~0 90)} assume !(~r~0 > 0); {190795#(< ~counter~0 90)} is VALID [2022-04-28 06:08:15,614 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {189994#true} {190795#(< ~counter~0 90)} #96#return; {190795#(< ~counter~0 90)} is VALID [2022-04-28 06:08:15,614 INFO L290 TraceCheckUtils]: 78: Hoare triple {189994#true} assume true; {189994#true} is VALID [2022-04-28 06:08:15,614 INFO L290 TraceCheckUtils]: 77: Hoare triple {189994#true} assume !(0 == ~cond); {189994#true} is VALID [2022-04-28 06:08:15,614 INFO L290 TraceCheckUtils]: 76: Hoare triple {189994#true} ~cond := #in~cond; {189994#true} is VALID [2022-04-28 06:08:15,614 INFO L272 TraceCheckUtils]: 75: Hoare triple {190795#(< ~counter~0 90)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {189994#true} is VALID [2022-04-28 06:08:15,615 INFO L290 TraceCheckUtils]: 74: Hoare triple {190795#(< ~counter~0 90)} assume !!(#t~post7 < 100);havoc #t~post7; {190795#(< ~counter~0 90)} is VALID [2022-04-28 06:08:15,616 INFO L290 TraceCheckUtils]: 73: Hoare triple {190820#(< ~counter~0 89)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {190795#(< ~counter~0 90)} is VALID [2022-04-28 06:08:15,616 INFO L290 TraceCheckUtils]: 72: Hoare triple {190820#(< ~counter~0 89)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {190820#(< ~counter~0 89)} is VALID [2022-04-28 06:08:15,617 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {189994#true} {190820#(< ~counter~0 89)} #96#return; {190820#(< ~counter~0 89)} is VALID [2022-04-28 06:08:15,617 INFO L290 TraceCheckUtils]: 70: Hoare triple {189994#true} assume true; {189994#true} is VALID [2022-04-28 06:08:15,617 INFO L290 TraceCheckUtils]: 69: Hoare triple {189994#true} assume !(0 == ~cond); {189994#true} is VALID [2022-04-28 06:08:15,617 INFO L290 TraceCheckUtils]: 68: Hoare triple {189994#true} ~cond := #in~cond; {189994#true} is VALID [2022-04-28 06:08:15,617 INFO L272 TraceCheckUtils]: 67: Hoare triple {190820#(< ~counter~0 89)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {189994#true} is VALID [2022-04-28 06:08:15,617 INFO L290 TraceCheckUtils]: 66: Hoare triple {190820#(< ~counter~0 89)} assume !!(#t~post7 < 100);havoc #t~post7; {190820#(< ~counter~0 89)} is VALID [2022-04-28 06:08:15,619 INFO L290 TraceCheckUtils]: 65: Hoare triple {190845#(< ~counter~0 88)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {190820#(< ~counter~0 89)} is VALID [2022-04-28 06:08:15,619 INFO L290 TraceCheckUtils]: 64: Hoare triple {190845#(< ~counter~0 88)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {190845#(< ~counter~0 88)} is VALID [2022-04-28 06:08:15,620 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {189994#true} {190845#(< ~counter~0 88)} #96#return; {190845#(< ~counter~0 88)} is VALID [2022-04-28 06:08:15,620 INFO L290 TraceCheckUtils]: 62: Hoare triple {189994#true} assume true; {189994#true} is VALID [2022-04-28 06:08:15,620 INFO L290 TraceCheckUtils]: 61: Hoare triple {189994#true} assume !(0 == ~cond); {189994#true} is VALID [2022-04-28 06:08:15,620 INFO L290 TraceCheckUtils]: 60: Hoare triple {189994#true} ~cond := #in~cond; {189994#true} is VALID [2022-04-28 06:08:15,620 INFO L272 TraceCheckUtils]: 59: Hoare triple {190845#(< ~counter~0 88)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {189994#true} is VALID [2022-04-28 06:08:15,620 INFO L290 TraceCheckUtils]: 58: Hoare triple {190845#(< ~counter~0 88)} assume !!(#t~post7 < 100);havoc #t~post7; {190845#(< ~counter~0 88)} is VALID [2022-04-28 06:08:15,622 INFO L290 TraceCheckUtils]: 57: Hoare triple {190870#(< ~counter~0 87)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {190845#(< ~counter~0 88)} is VALID [2022-04-28 06:08:15,622 INFO L290 TraceCheckUtils]: 56: Hoare triple {190870#(< ~counter~0 87)} assume !!(0 != ~r~0); {190870#(< ~counter~0 87)} is VALID [2022-04-28 06:08:15,622 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {189994#true} {190870#(< ~counter~0 87)} #94#return; {190870#(< ~counter~0 87)} is VALID [2022-04-28 06:08:15,622 INFO L290 TraceCheckUtils]: 54: Hoare triple {189994#true} assume true; {189994#true} is VALID [2022-04-28 06:08:15,622 INFO L290 TraceCheckUtils]: 53: Hoare triple {189994#true} assume !(0 == ~cond); {189994#true} is VALID [2022-04-28 06:08:15,623 INFO L290 TraceCheckUtils]: 52: Hoare triple {189994#true} ~cond := #in~cond; {189994#true} is VALID [2022-04-28 06:08:15,623 INFO L272 TraceCheckUtils]: 51: Hoare triple {190870#(< ~counter~0 87)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {189994#true} is VALID [2022-04-28 06:08:15,623 INFO L290 TraceCheckUtils]: 50: Hoare triple {190870#(< ~counter~0 87)} assume !!(#t~post6 < 100);havoc #t~post6; {190870#(< ~counter~0 87)} is VALID [2022-04-28 06:08:15,625 INFO L290 TraceCheckUtils]: 49: Hoare triple {190895#(< ~counter~0 86)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {190870#(< ~counter~0 87)} is VALID [2022-04-28 06:08:15,625 INFO L290 TraceCheckUtils]: 48: Hoare triple {190895#(< ~counter~0 86)} assume !(~r~0 < 0); {190895#(< ~counter~0 86)} is VALID [2022-04-28 06:08:15,625 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {189994#true} {190895#(< ~counter~0 86)} #98#return; {190895#(< ~counter~0 86)} is VALID [2022-04-28 06:08:15,625 INFO L290 TraceCheckUtils]: 46: Hoare triple {189994#true} assume true; {189994#true} is VALID [2022-04-28 06:08:15,626 INFO L290 TraceCheckUtils]: 45: Hoare triple {189994#true} assume !(0 == ~cond); {189994#true} is VALID [2022-04-28 06:08:15,626 INFO L290 TraceCheckUtils]: 44: Hoare triple {189994#true} ~cond := #in~cond; {189994#true} is VALID [2022-04-28 06:08:15,626 INFO L272 TraceCheckUtils]: 43: Hoare triple {190895#(< ~counter~0 86)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {189994#true} is VALID [2022-04-28 06:08:15,626 INFO L290 TraceCheckUtils]: 42: Hoare triple {190895#(< ~counter~0 86)} assume !!(#t~post8 < 100);havoc #t~post8; {190895#(< ~counter~0 86)} is VALID [2022-04-28 06:08:15,627 INFO L290 TraceCheckUtils]: 41: Hoare triple {190920#(< ~counter~0 85)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {190895#(< ~counter~0 86)} is VALID [2022-04-28 06:08:15,628 INFO L290 TraceCheckUtils]: 40: Hoare triple {190920#(< ~counter~0 85)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {190920#(< ~counter~0 85)} is VALID [2022-04-28 06:08:15,628 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {189994#true} {190920#(< ~counter~0 85)} #98#return; {190920#(< ~counter~0 85)} is VALID [2022-04-28 06:08:15,628 INFO L290 TraceCheckUtils]: 38: Hoare triple {189994#true} assume true; {189994#true} is VALID [2022-04-28 06:08:15,628 INFO L290 TraceCheckUtils]: 37: Hoare triple {189994#true} assume !(0 == ~cond); {189994#true} is VALID [2022-04-28 06:08:15,628 INFO L290 TraceCheckUtils]: 36: Hoare triple {189994#true} ~cond := #in~cond; {189994#true} is VALID [2022-04-28 06:08:15,628 INFO L272 TraceCheckUtils]: 35: Hoare triple {190920#(< ~counter~0 85)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {189994#true} is VALID [2022-04-28 06:08:15,629 INFO L290 TraceCheckUtils]: 34: Hoare triple {190920#(< ~counter~0 85)} assume !!(#t~post8 < 100);havoc #t~post8; {190920#(< ~counter~0 85)} is VALID [2022-04-28 06:08:15,630 INFO L290 TraceCheckUtils]: 33: Hoare triple {190945#(< ~counter~0 84)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {190920#(< ~counter~0 85)} is VALID [2022-04-28 06:08:15,630 INFO L290 TraceCheckUtils]: 32: Hoare triple {190945#(< ~counter~0 84)} assume !(~r~0 > 0); {190945#(< ~counter~0 84)} is VALID [2022-04-28 06:08:15,631 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {189994#true} {190945#(< ~counter~0 84)} #96#return; {190945#(< ~counter~0 84)} is VALID [2022-04-28 06:08:15,631 INFO L290 TraceCheckUtils]: 30: Hoare triple {189994#true} assume true; {189994#true} is VALID [2022-04-28 06:08:15,631 INFO L290 TraceCheckUtils]: 29: Hoare triple {189994#true} assume !(0 == ~cond); {189994#true} is VALID [2022-04-28 06:08:15,631 INFO L290 TraceCheckUtils]: 28: Hoare triple {189994#true} ~cond := #in~cond; {189994#true} is VALID [2022-04-28 06:08:15,631 INFO L272 TraceCheckUtils]: 27: Hoare triple {190945#(< ~counter~0 84)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {189994#true} is VALID [2022-04-28 06:08:15,631 INFO L290 TraceCheckUtils]: 26: Hoare triple {190945#(< ~counter~0 84)} assume !!(#t~post7 < 100);havoc #t~post7; {190945#(< ~counter~0 84)} is VALID [2022-04-28 06:08:15,633 INFO L290 TraceCheckUtils]: 25: Hoare triple {190970#(< ~counter~0 83)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {190945#(< ~counter~0 84)} is VALID [2022-04-28 06:08:15,634 INFO L290 TraceCheckUtils]: 24: Hoare triple {190970#(< ~counter~0 83)} assume !!(0 != ~r~0); {190970#(< ~counter~0 83)} is VALID [2022-04-28 06:08:15,634 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {189994#true} {190970#(< ~counter~0 83)} #94#return; {190970#(< ~counter~0 83)} is VALID [2022-04-28 06:08:15,634 INFO L290 TraceCheckUtils]: 22: Hoare triple {189994#true} assume true; {189994#true} is VALID [2022-04-28 06:08:15,634 INFO L290 TraceCheckUtils]: 21: Hoare triple {189994#true} assume !(0 == ~cond); {189994#true} is VALID [2022-04-28 06:08:15,634 INFO L290 TraceCheckUtils]: 20: Hoare triple {189994#true} ~cond := #in~cond; {189994#true} is VALID [2022-04-28 06:08:15,634 INFO L272 TraceCheckUtils]: 19: Hoare triple {190970#(< ~counter~0 83)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {189994#true} is VALID [2022-04-28 06:08:15,634 INFO L290 TraceCheckUtils]: 18: Hoare triple {190970#(< ~counter~0 83)} assume !!(#t~post6 < 100);havoc #t~post6; {190970#(< ~counter~0 83)} is VALID [2022-04-28 06:08:15,636 INFO L290 TraceCheckUtils]: 17: Hoare triple {190995#(< ~counter~0 82)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {190970#(< ~counter~0 83)} is VALID [2022-04-28 06:08:15,636 INFO L290 TraceCheckUtils]: 16: Hoare triple {190995#(< ~counter~0 82)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {190995#(< ~counter~0 82)} is VALID [2022-04-28 06:08:15,637 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {189994#true} {190995#(< ~counter~0 82)} #92#return; {190995#(< ~counter~0 82)} is VALID [2022-04-28 06:08:15,637 INFO L290 TraceCheckUtils]: 14: Hoare triple {189994#true} assume true; {189994#true} is VALID [2022-04-28 06:08:15,637 INFO L290 TraceCheckUtils]: 13: Hoare triple {189994#true} assume !(0 == ~cond); {189994#true} is VALID [2022-04-28 06:08:15,637 INFO L290 TraceCheckUtils]: 12: Hoare triple {189994#true} ~cond := #in~cond; {189994#true} is VALID [2022-04-28 06:08:15,637 INFO L272 TraceCheckUtils]: 11: Hoare triple {190995#(< ~counter~0 82)} 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)); {189994#true} is VALID [2022-04-28 06:08:15,637 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {189994#true} {190995#(< ~counter~0 82)} #90#return; {190995#(< ~counter~0 82)} is VALID [2022-04-28 06:08:15,637 INFO L290 TraceCheckUtils]: 9: Hoare triple {189994#true} assume true; {189994#true} is VALID [2022-04-28 06:08:15,637 INFO L290 TraceCheckUtils]: 8: Hoare triple {189994#true} assume !(0 == ~cond); {189994#true} is VALID [2022-04-28 06:08:15,638 INFO L290 TraceCheckUtils]: 7: Hoare triple {189994#true} ~cond := #in~cond; {189994#true} is VALID [2022-04-28 06:08:15,638 INFO L272 TraceCheckUtils]: 6: Hoare triple {190995#(< ~counter~0 82)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {189994#true} is VALID [2022-04-28 06:08:15,638 INFO L290 TraceCheckUtils]: 5: Hoare triple {190995#(< ~counter~0 82)} 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; {190995#(< ~counter~0 82)} is VALID [2022-04-28 06:08:15,638 INFO L272 TraceCheckUtils]: 4: Hoare triple {190995#(< ~counter~0 82)} call #t~ret9 := main(); {190995#(< ~counter~0 82)} is VALID [2022-04-28 06:08:15,638 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {190995#(< ~counter~0 82)} {189994#true} #102#return; {190995#(< ~counter~0 82)} is VALID [2022-04-28 06:08:15,639 INFO L290 TraceCheckUtils]: 2: Hoare triple {190995#(< ~counter~0 82)} assume true; {190995#(< ~counter~0 82)} is VALID [2022-04-28 06:08:15,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {189994#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; {190995#(< ~counter~0 82)} is VALID [2022-04-28 06:08:15,639 INFO L272 TraceCheckUtils]: 0: Hoare triple {189994#true} call ULTIMATE.init(); {189994#true} is VALID [2022-04-28 06:08:15,639 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-28 06:08:15,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:08:15,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766944914] [2022-04-28 06:08:15,640 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:08:15,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766254640] [2022-04-28 06:08:15,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [766254640] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:08:15,640 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:08:15,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 42 [2022-04-28 06:08:15,640 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:08:15,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1028865974] [2022-04-28 06:08:15,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1028865974] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:08:15,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:08:15,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 06:08:15,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469803419] [2022-04-28 06:08:15,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:08:15,641 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-28 06:08:15,641 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:08:15,641 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-28 06:08:15,879 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-28 06:08:15,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 06:08:15,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:08:15,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 06:08:15,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=785, Invalid=937, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 06:08:15,880 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-28 06:08:23,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:08:23,551 INFO L93 Difference]: Finished difference Result 1135 states and 1544 transitions. [2022-04-28 06:08:23,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-28 06:08:23,552 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-28 06:08:23,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:08:23,552 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-28 06:08:23,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 396 transitions. [2022-04-28 06:08:23,556 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-28 06:08:23,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 396 transitions. [2022-04-28 06:08:23,559 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 396 transitions. [2022-04-28 06:08:24,286 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-28 06:08:24,344 INFO L225 Difference]: With dead ends: 1135 [2022-04-28 06:08:24,344 INFO L226 Difference]: Without dead ends: 957 [2022-04-28 06:08:24,345 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1409, Invalid=1897, Unknown=0, NotChecked=0, Total=3306 [2022-04-28 06:08:24,346 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 303 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 273 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 273 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-28 06:08:24,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 391 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [273 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-28 06:08:24,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2022-04-28 06:08:28,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 946. [2022-04-28 06:08:28,082 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:08:28,083 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-28 06:08:28,083 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-28 06:08:28,084 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-28 06:08:28,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:08:28,113 INFO L93 Difference]: Finished difference Result 957 states and 1271 transitions. [2022-04-28 06:08:28,113 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1271 transitions. [2022-04-28 06:08:28,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:08:28,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:08:28,115 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-28 06:08:28,115 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-28 06:08:28,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:08:28,147 INFO L93 Difference]: Finished difference Result 957 states and 1271 transitions. [2022-04-28 06:08:28,147 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1271 transitions. [2022-04-28 06:08:28,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:08:28,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:08:28,149 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:08:28,149 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:08:28,150 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-28 06:08:28,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 1260 transitions. [2022-04-28 06:08:28,194 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 1260 transitions. Word has length 169 [2022-04-28 06:08:28,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:08:28,195 INFO L495 AbstractCegarLoop]: Abstraction has 946 states and 1260 transitions. [2022-04-28 06:08:28,195 INFO L496 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-28 06:08:28,195 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 946 states and 1260 transitions. [2022-04-28 06:08:49,920 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1260 edges. 1256 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-28 06:08:49,920 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 1260 transitions. [2022-04-28 06:08:49,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-04-28 06:08:49,922 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:08:49,922 INFO L195 NwaCegarLoop]: 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-28 06:08:49,938 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-28 06:08:50,122 WARN L477 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-28 06:08:50,123 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:08:50,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:08:50,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1121656631, now seen corresponding path program 27 times [2022-04-28 06:08:50,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:08:50,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [374265995] [2022-04-28 06:08:50,127 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:08:50,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1121656631, now seen corresponding path program 28 times [2022-04-28 06:08:50,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:08:50,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992592890] [2022-04-28 06:08:50,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:08:50,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:08:50,143 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:08:50,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [790046216] [2022-04-28 06:08:50,143 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 06:08:50,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:08:50,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:08:50,144 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-28 06:08:50,173 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-28 06:08:50,294 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 06:08:50,294 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:08:50,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-28 06:08:50,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:08:50,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:08:51,353 INFO L272 TraceCheckUtils]: 0: Hoare triple {197157#true} call ULTIMATE.init(); {197157#true} is VALID [2022-04-28 06:08:51,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {197157#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; {197165#(<= ~counter~0 0)} is VALID [2022-04-28 06:08:51,354 INFO L290 TraceCheckUtils]: 2: Hoare triple {197165#(<= ~counter~0 0)} assume true; {197165#(<= ~counter~0 0)} is VALID [2022-04-28 06:08:51,355 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {197165#(<= ~counter~0 0)} {197157#true} #102#return; {197165#(<= ~counter~0 0)} is VALID [2022-04-28 06:08:51,355 INFO L272 TraceCheckUtils]: 4: Hoare triple {197165#(<= ~counter~0 0)} call #t~ret9 := main(); {197165#(<= ~counter~0 0)} is VALID [2022-04-28 06:08:51,355 INFO L290 TraceCheckUtils]: 5: Hoare triple {197165#(<= ~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; {197165#(<= ~counter~0 0)} is VALID [2022-04-28 06:08:51,356 INFO L272 TraceCheckUtils]: 6: Hoare triple {197165#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {197165#(<= ~counter~0 0)} is VALID [2022-04-28 06:08:51,356 INFO L290 TraceCheckUtils]: 7: Hoare triple {197165#(<= ~counter~0 0)} ~cond := #in~cond; {197165#(<= ~counter~0 0)} is VALID [2022-04-28 06:08:51,356 INFO L290 TraceCheckUtils]: 8: Hoare triple {197165#(<= ~counter~0 0)} assume !(0 == ~cond); {197165#(<= ~counter~0 0)} is VALID [2022-04-28 06:08:51,356 INFO L290 TraceCheckUtils]: 9: Hoare triple {197165#(<= ~counter~0 0)} assume true; {197165#(<= ~counter~0 0)} is VALID [2022-04-28 06:08:51,357 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {197165#(<= ~counter~0 0)} {197165#(<= ~counter~0 0)} #90#return; {197165#(<= ~counter~0 0)} is VALID [2022-04-28 06:08:51,357 INFO L272 TraceCheckUtils]: 11: Hoare triple {197165#(<= ~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)); {197165#(<= ~counter~0 0)} is VALID [2022-04-28 06:08:51,357 INFO L290 TraceCheckUtils]: 12: Hoare triple {197165#(<= ~counter~0 0)} ~cond := #in~cond; {197165#(<= ~counter~0 0)} is VALID [2022-04-28 06:08:51,358 INFO L290 TraceCheckUtils]: 13: Hoare triple {197165#(<= ~counter~0 0)} assume !(0 == ~cond); {197165#(<= ~counter~0 0)} is VALID [2022-04-28 06:08:51,358 INFO L290 TraceCheckUtils]: 14: Hoare triple {197165#(<= ~counter~0 0)} assume true; {197165#(<= ~counter~0 0)} is VALID [2022-04-28 06:08:51,358 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {197165#(<= ~counter~0 0)} {197165#(<= ~counter~0 0)} #92#return; {197165#(<= ~counter~0 0)} is VALID [2022-04-28 06:08:51,358 INFO L290 TraceCheckUtils]: 16: Hoare triple {197165#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {197165#(<= ~counter~0 0)} is VALID [2022-04-28 06:08:51,363 INFO L290 TraceCheckUtils]: 17: Hoare triple {197165#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {197214#(<= ~counter~0 1)} is VALID [2022-04-28 06:08:51,364 INFO L290 TraceCheckUtils]: 18: Hoare triple {197214#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {197214#(<= ~counter~0 1)} is VALID [2022-04-28 06:08:51,364 INFO L272 TraceCheckUtils]: 19: Hoare triple {197214#(<= ~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)); {197214#(<= ~counter~0 1)} is VALID [2022-04-28 06:08:51,364 INFO L290 TraceCheckUtils]: 20: Hoare triple {197214#(<= ~counter~0 1)} ~cond := #in~cond; {197214#(<= ~counter~0 1)} is VALID [2022-04-28 06:08:51,365 INFO L290 TraceCheckUtils]: 21: Hoare triple {197214#(<= ~counter~0 1)} assume !(0 == ~cond); {197214#(<= ~counter~0 1)} is VALID [2022-04-28 06:08:51,365 INFO L290 TraceCheckUtils]: 22: Hoare triple {197214#(<= ~counter~0 1)} assume true; {197214#(<= ~counter~0 1)} is VALID [2022-04-28 06:08:51,365 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {197214#(<= ~counter~0 1)} {197214#(<= ~counter~0 1)} #94#return; {197214#(<= ~counter~0 1)} is VALID [2022-04-28 06:08:51,366 INFO L290 TraceCheckUtils]: 24: Hoare triple {197214#(<= ~counter~0 1)} assume !!(0 != ~r~0); {197214#(<= ~counter~0 1)} is VALID [2022-04-28 06:08:51,368 INFO L290 TraceCheckUtils]: 25: Hoare triple {197214#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {197239#(<= ~counter~0 2)} is VALID [2022-04-28 06:08:51,368 INFO L290 TraceCheckUtils]: 26: Hoare triple {197239#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {197239#(<= ~counter~0 2)} is VALID [2022-04-28 06:08:51,368 INFO L272 TraceCheckUtils]: 27: Hoare triple {197239#(<= ~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)); {197239#(<= ~counter~0 2)} is VALID [2022-04-28 06:08:51,369 INFO L290 TraceCheckUtils]: 28: Hoare triple {197239#(<= ~counter~0 2)} ~cond := #in~cond; {197239#(<= ~counter~0 2)} is VALID [2022-04-28 06:08:51,369 INFO L290 TraceCheckUtils]: 29: Hoare triple {197239#(<= ~counter~0 2)} assume !(0 == ~cond); {197239#(<= ~counter~0 2)} is VALID [2022-04-28 06:08:51,369 INFO L290 TraceCheckUtils]: 30: Hoare triple {197239#(<= ~counter~0 2)} assume true; {197239#(<= ~counter~0 2)} is VALID [2022-04-28 06:08:51,370 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {197239#(<= ~counter~0 2)} {197239#(<= ~counter~0 2)} #96#return; {197239#(<= ~counter~0 2)} is VALID [2022-04-28 06:08:51,370 INFO L290 TraceCheckUtils]: 32: Hoare triple {197239#(<= ~counter~0 2)} assume !(~r~0 > 0); {197239#(<= ~counter~0 2)} is VALID [2022-04-28 06:08:51,372 INFO L290 TraceCheckUtils]: 33: Hoare triple {197239#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {197264#(<= ~counter~0 3)} is VALID [2022-04-28 06:08:51,372 INFO L290 TraceCheckUtils]: 34: Hoare triple {197264#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {197264#(<= ~counter~0 3)} is VALID [2022-04-28 06:08:51,373 INFO L272 TraceCheckUtils]: 35: Hoare triple {197264#(<= ~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)); {197264#(<= ~counter~0 3)} is VALID [2022-04-28 06:08:51,373 INFO L290 TraceCheckUtils]: 36: Hoare triple {197264#(<= ~counter~0 3)} ~cond := #in~cond; {197264#(<= ~counter~0 3)} is VALID [2022-04-28 06:08:51,373 INFO L290 TraceCheckUtils]: 37: Hoare triple {197264#(<= ~counter~0 3)} assume !(0 == ~cond); {197264#(<= ~counter~0 3)} is VALID [2022-04-28 06:08:51,374 INFO L290 TraceCheckUtils]: 38: Hoare triple {197264#(<= ~counter~0 3)} assume true; {197264#(<= ~counter~0 3)} is VALID [2022-04-28 06:08:51,374 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {197264#(<= ~counter~0 3)} {197264#(<= ~counter~0 3)} #98#return; {197264#(<= ~counter~0 3)} is VALID [2022-04-28 06:08:51,374 INFO L290 TraceCheckUtils]: 40: Hoare triple {197264#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {197264#(<= ~counter~0 3)} is VALID [2022-04-28 06:08:51,376 INFO L290 TraceCheckUtils]: 41: Hoare triple {197264#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {197289#(<= ~counter~0 4)} is VALID [2022-04-28 06:08:51,377 INFO L290 TraceCheckUtils]: 42: Hoare triple {197289#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {197289#(<= ~counter~0 4)} is VALID [2022-04-28 06:08:51,377 INFO L272 TraceCheckUtils]: 43: Hoare triple {197289#(<= ~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)); {197289#(<= ~counter~0 4)} is VALID [2022-04-28 06:08:51,378 INFO L290 TraceCheckUtils]: 44: Hoare triple {197289#(<= ~counter~0 4)} ~cond := #in~cond; {197289#(<= ~counter~0 4)} is VALID [2022-04-28 06:08:51,378 INFO L290 TraceCheckUtils]: 45: Hoare triple {197289#(<= ~counter~0 4)} assume !(0 == ~cond); {197289#(<= ~counter~0 4)} is VALID [2022-04-28 06:08:51,378 INFO L290 TraceCheckUtils]: 46: Hoare triple {197289#(<= ~counter~0 4)} assume true; {197289#(<= ~counter~0 4)} is VALID [2022-04-28 06:08:51,378 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {197289#(<= ~counter~0 4)} {197289#(<= ~counter~0 4)} #98#return; {197289#(<= ~counter~0 4)} is VALID [2022-04-28 06:08:51,379 INFO L290 TraceCheckUtils]: 48: Hoare triple {197289#(<= ~counter~0 4)} assume !(~r~0 < 0); {197289#(<= ~counter~0 4)} is VALID [2022-04-28 06:08:51,381 INFO L290 TraceCheckUtils]: 49: Hoare triple {197289#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {197314#(<= ~counter~0 5)} is VALID [2022-04-28 06:08:51,381 INFO L290 TraceCheckUtils]: 50: Hoare triple {197314#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {197314#(<= ~counter~0 5)} is VALID [2022-04-28 06:08:51,382 INFO L272 TraceCheckUtils]: 51: Hoare triple {197314#(<= ~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)); {197314#(<= ~counter~0 5)} is VALID [2022-04-28 06:08:51,382 INFO L290 TraceCheckUtils]: 52: Hoare triple {197314#(<= ~counter~0 5)} ~cond := #in~cond; {197314#(<= ~counter~0 5)} is VALID [2022-04-28 06:08:51,382 INFO L290 TraceCheckUtils]: 53: Hoare triple {197314#(<= ~counter~0 5)} assume !(0 == ~cond); {197314#(<= ~counter~0 5)} is VALID [2022-04-28 06:08:51,383 INFO L290 TraceCheckUtils]: 54: Hoare triple {197314#(<= ~counter~0 5)} assume true; {197314#(<= ~counter~0 5)} is VALID [2022-04-28 06:08:51,383 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {197314#(<= ~counter~0 5)} {197314#(<= ~counter~0 5)} #94#return; {197314#(<= ~counter~0 5)} is VALID [2022-04-28 06:08:51,383 INFO L290 TraceCheckUtils]: 56: Hoare triple {197314#(<= ~counter~0 5)} assume !!(0 != ~r~0); {197314#(<= ~counter~0 5)} is VALID [2022-04-28 06:08:51,386 INFO L290 TraceCheckUtils]: 57: Hoare triple {197314#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {197339#(<= ~counter~0 6)} is VALID [2022-04-28 06:08:51,386 INFO L290 TraceCheckUtils]: 58: Hoare triple {197339#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {197339#(<= ~counter~0 6)} is VALID [2022-04-28 06:08:51,387 INFO L272 TraceCheckUtils]: 59: Hoare triple {197339#(<= ~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)); {197339#(<= ~counter~0 6)} is VALID [2022-04-28 06:08:51,387 INFO L290 TraceCheckUtils]: 60: Hoare triple {197339#(<= ~counter~0 6)} ~cond := #in~cond; {197339#(<= ~counter~0 6)} is VALID [2022-04-28 06:08:51,387 INFO L290 TraceCheckUtils]: 61: Hoare triple {197339#(<= ~counter~0 6)} assume !(0 == ~cond); {197339#(<= ~counter~0 6)} is VALID [2022-04-28 06:08:51,387 INFO L290 TraceCheckUtils]: 62: Hoare triple {197339#(<= ~counter~0 6)} assume true; {197339#(<= ~counter~0 6)} is VALID [2022-04-28 06:08:51,388 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {197339#(<= ~counter~0 6)} {197339#(<= ~counter~0 6)} #96#return; {197339#(<= ~counter~0 6)} is VALID [2022-04-28 06:08:51,388 INFO L290 TraceCheckUtils]: 64: Hoare triple {197339#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {197339#(<= ~counter~0 6)} is VALID [2022-04-28 06:08:51,390 INFO L290 TraceCheckUtils]: 65: Hoare triple {197339#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {197364#(<= ~counter~0 7)} is VALID [2022-04-28 06:08:51,391 INFO L290 TraceCheckUtils]: 66: Hoare triple {197364#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {197364#(<= ~counter~0 7)} is VALID [2022-04-28 06:08:51,391 INFO L272 TraceCheckUtils]: 67: Hoare triple {197364#(<= ~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)); {197364#(<= ~counter~0 7)} is VALID [2022-04-28 06:08:51,391 INFO L290 TraceCheckUtils]: 68: Hoare triple {197364#(<= ~counter~0 7)} ~cond := #in~cond; {197364#(<= ~counter~0 7)} is VALID [2022-04-28 06:08:51,392 INFO L290 TraceCheckUtils]: 69: Hoare triple {197364#(<= ~counter~0 7)} assume !(0 == ~cond); {197364#(<= ~counter~0 7)} is VALID [2022-04-28 06:08:51,392 INFO L290 TraceCheckUtils]: 70: Hoare triple {197364#(<= ~counter~0 7)} assume true; {197364#(<= ~counter~0 7)} is VALID [2022-04-28 06:08:51,392 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {197364#(<= ~counter~0 7)} {197364#(<= ~counter~0 7)} #96#return; {197364#(<= ~counter~0 7)} is VALID [2022-04-28 06:08:51,393 INFO L290 TraceCheckUtils]: 72: Hoare triple {197364#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {197364#(<= ~counter~0 7)} is VALID [2022-04-28 06:08:51,395 INFO L290 TraceCheckUtils]: 73: Hoare triple {197364#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {197389#(<= ~counter~0 8)} is VALID [2022-04-28 06:08:51,396 INFO L290 TraceCheckUtils]: 74: Hoare triple {197389#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {197389#(<= ~counter~0 8)} is VALID [2022-04-28 06:08:51,396 INFO L272 TraceCheckUtils]: 75: Hoare triple {197389#(<= ~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)); {197389#(<= ~counter~0 8)} is VALID [2022-04-28 06:08:51,397 INFO L290 TraceCheckUtils]: 76: Hoare triple {197389#(<= ~counter~0 8)} ~cond := #in~cond; {197389#(<= ~counter~0 8)} is VALID [2022-04-28 06:08:51,397 INFO L290 TraceCheckUtils]: 77: Hoare triple {197389#(<= ~counter~0 8)} assume !(0 == ~cond); {197389#(<= ~counter~0 8)} is VALID [2022-04-28 06:08:51,397 INFO L290 TraceCheckUtils]: 78: Hoare triple {197389#(<= ~counter~0 8)} assume true; {197389#(<= ~counter~0 8)} is VALID [2022-04-28 06:08:51,398 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {197389#(<= ~counter~0 8)} {197389#(<= ~counter~0 8)} #96#return; {197389#(<= ~counter~0 8)} is VALID [2022-04-28 06:08:51,398 INFO L290 TraceCheckUtils]: 80: Hoare triple {197389#(<= ~counter~0 8)} assume !(~r~0 > 0); {197389#(<= ~counter~0 8)} is VALID [2022-04-28 06:08:51,401 INFO L290 TraceCheckUtils]: 81: Hoare triple {197389#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {197414#(<= ~counter~0 9)} is VALID [2022-04-28 06:08:51,401 INFO L290 TraceCheckUtils]: 82: Hoare triple {197414#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {197414#(<= ~counter~0 9)} is VALID [2022-04-28 06:08:51,401 INFO L272 TraceCheckUtils]: 83: Hoare triple {197414#(<= ~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)); {197414#(<= ~counter~0 9)} is VALID [2022-04-28 06:08:51,402 INFO L290 TraceCheckUtils]: 84: Hoare triple {197414#(<= ~counter~0 9)} ~cond := #in~cond; {197414#(<= ~counter~0 9)} is VALID [2022-04-28 06:08:51,402 INFO L290 TraceCheckUtils]: 85: Hoare triple {197414#(<= ~counter~0 9)} assume !(0 == ~cond); {197414#(<= ~counter~0 9)} is VALID [2022-04-28 06:08:51,402 INFO L290 TraceCheckUtils]: 86: Hoare triple {197414#(<= ~counter~0 9)} assume true; {197414#(<= ~counter~0 9)} is VALID [2022-04-28 06:08:51,403 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {197414#(<= ~counter~0 9)} {197414#(<= ~counter~0 9)} #98#return; {197414#(<= ~counter~0 9)} is VALID [2022-04-28 06:08:51,403 INFO L290 TraceCheckUtils]: 88: Hoare triple {197414#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {197414#(<= ~counter~0 9)} is VALID [2022-04-28 06:08:51,405 INFO L290 TraceCheckUtils]: 89: Hoare triple {197414#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {197439#(<= ~counter~0 10)} is VALID [2022-04-28 06:08:51,406 INFO L290 TraceCheckUtils]: 90: Hoare triple {197439#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {197439#(<= ~counter~0 10)} is VALID [2022-04-28 06:08:51,406 INFO L272 TraceCheckUtils]: 91: Hoare triple {197439#(<= ~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)); {197439#(<= ~counter~0 10)} is VALID [2022-04-28 06:08:51,406 INFO L290 TraceCheckUtils]: 92: Hoare triple {197439#(<= ~counter~0 10)} ~cond := #in~cond; {197439#(<= ~counter~0 10)} is VALID [2022-04-28 06:08:51,407 INFO L290 TraceCheckUtils]: 93: Hoare triple {197439#(<= ~counter~0 10)} assume !(0 == ~cond); {197439#(<= ~counter~0 10)} is VALID [2022-04-28 06:08:51,407 INFO L290 TraceCheckUtils]: 94: Hoare triple {197439#(<= ~counter~0 10)} assume true; {197439#(<= ~counter~0 10)} is VALID [2022-04-28 06:08:51,407 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {197439#(<= ~counter~0 10)} {197439#(<= ~counter~0 10)} #98#return; {197439#(<= ~counter~0 10)} is VALID [2022-04-28 06:08:51,408 INFO L290 TraceCheckUtils]: 96: Hoare triple {197439#(<= ~counter~0 10)} assume !(~r~0 < 0); {197439#(<= ~counter~0 10)} is VALID [2022-04-28 06:08:51,410 INFO L290 TraceCheckUtils]: 97: Hoare triple {197439#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {197464#(<= ~counter~0 11)} is VALID [2022-04-28 06:08:51,411 INFO L290 TraceCheckUtils]: 98: Hoare triple {197464#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {197464#(<= ~counter~0 11)} is VALID [2022-04-28 06:08:51,411 INFO L272 TraceCheckUtils]: 99: Hoare triple {197464#(<= ~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)); {197464#(<= ~counter~0 11)} is VALID [2022-04-28 06:08:51,411 INFO L290 TraceCheckUtils]: 100: Hoare triple {197464#(<= ~counter~0 11)} ~cond := #in~cond; {197464#(<= ~counter~0 11)} is VALID [2022-04-28 06:08:51,412 INFO L290 TraceCheckUtils]: 101: Hoare triple {197464#(<= ~counter~0 11)} assume !(0 == ~cond); {197464#(<= ~counter~0 11)} is VALID [2022-04-28 06:08:51,412 INFO L290 TraceCheckUtils]: 102: Hoare triple {197464#(<= ~counter~0 11)} assume true; {197464#(<= ~counter~0 11)} is VALID [2022-04-28 06:08:51,412 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {197464#(<= ~counter~0 11)} {197464#(<= ~counter~0 11)} #94#return; {197464#(<= ~counter~0 11)} is VALID [2022-04-28 06:08:51,413 INFO L290 TraceCheckUtils]: 104: Hoare triple {197464#(<= ~counter~0 11)} assume !!(0 != ~r~0); {197464#(<= ~counter~0 11)} is VALID [2022-04-28 06:08:51,415 INFO L290 TraceCheckUtils]: 105: Hoare triple {197464#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {197489#(<= ~counter~0 12)} is VALID [2022-04-28 06:08:51,416 INFO L290 TraceCheckUtils]: 106: Hoare triple {197489#(<= ~counter~0 12)} assume !!(#t~post7 < 100);havoc #t~post7; {197489#(<= ~counter~0 12)} is VALID [2022-04-28 06:08:51,416 INFO L272 TraceCheckUtils]: 107: Hoare triple {197489#(<= ~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)); {197489#(<= ~counter~0 12)} is VALID [2022-04-28 06:08:51,417 INFO L290 TraceCheckUtils]: 108: Hoare triple {197489#(<= ~counter~0 12)} ~cond := #in~cond; {197489#(<= ~counter~0 12)} is VALID [2022-04-28 06:08:51,417 INFO L290 TraceCheckUtils]: 109: Hoare triple {197489#(<= ~counter~0 12)} assume !(0 == ~cond); {197489#(<= ~counter~0 12)} is VALID [2022-04-28 06:08:51,417 INFO L290 TraceCheckUtils]: 110: Hoare triple {197489#(<= ~counter~0 12)} assume true; {197489#(<= ~counter~0 12)} is VALID [2022-04-28 06:08:51,418 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {197489#(<= ~counter~0 12)} {197489#(<= ~counter~0 12)} #96#return; {197489#(<= ~counter~0 12)} is VALID [2022-04-28 06:08:51,418 INFO L290 TraceCheckUtils]: 112: Hoare triple {197489#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {197489#(<= ~counter~0 12)} is VALID [2022-04-28 06:08:51,420 INFO L290 TraceCheckUtils]: 113: Hoare triple {197489#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {197514#(<= ~counter~0 13)} is VALID [2022-04-28 06:08:51,421 INFO L290 TraceCheckUtils]: 114: Hoare triple {197514#(<= ~counter~0 13)} assume !!(#t~post7 < 100);havoc #t~post7; {197514#(<= ~counter~0 13)} is VALID [2022-04-28 06:08:51,421 INFO L272 TraceCheckUtils]: 115: Hoare triple {197514#(<= ~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)); {197514#(<= ~counter~0 13)} is VALID [2022-04-28 06:08:51,422 INFO L290 TraceCheckUtils]: 116: Hoare triple {197514#(<= ~counter~0 13)} ~cond := #in~cond; {197514#(<= ~counter~0 13)} is VALID [2022-04-28 06:08:51,422 INFO L290 TraceCheckUtils]: 117: Hoare triple {197514#(<= ~counter~0 13)} assume !(0 == ~cond); {197514#(<= ~counter~0 13)} is VALID [2022-04-28 06:08:51,422 INFO L290 TraceCheckUtils]: 118: Hoare triple {197514#(<= ~counter~0 13)} assume true; {197514#(<= ~counter~0 13)} is VALID [2022-04-28 06:08:51,422 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {197514#(<= ~counter~0 13)} {197514#(<= ~counter~0 13)} #96#return; {197514#(<= ~counter~0 13)} is VALID [2022-04-28 06:08:51,423 INFO L290 TraceCheckUtils]: 120: Hoare triple {197514#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {197514#(<= ~counter~0 13)} is VALID [2022-04-28 06:08:51,425 INFO L290 TraceCheckUtils]: 121: Hoare triple {197514#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {197539#(<= ~counter~0 14)} is VALID [2022-04-28 06:08:51,425 INFO L290 TraceCheckUtils]: 122: Hoare triple {197539#(<= ~counter~0 14)} assume !!(#t~post7 < 100);havoc #t~post7; {197539#(<= ~counter~0 14)} is VALID [2022-04-28 06:08:51,426 INFO L272 TraceCheckUtils]: 123: Hoare triple {197539#(<= ~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)); {197539#(<= ~counter~0 14)} is VALID [2022-04-28 06:08:51,426 INFO L290 TraceCheckUtils]: 124: Hoare triple {197539#(<= ~counter~0 14)} ~cond := #in~cond; {197539#(<= ~counter~0 14)} is VALID [2022-04-28 06:08:51,426 INFO L290 TraceCheckUtils]: 125: Hoare triple {197539#(<= ~counter~0 14)} assume !(0 == ~cond); {197539#(<= ~counter~0 14)} is VALID [2022-04-28 06:08:51,426 INFO L290 TraceCheckUtils]: 126: Hoare triple {197539#(<= ~counter~0 14)} assume true; {197539#(<= ~counter~0 14)} is VALID [2022-04-28 06:08:51,427 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {197539#(<= ~counter~0 14)} {197539#(<= ~counter~0 14)} #96#return; {197539#(<= ~counter~0 14)} is VALID [2022-04-28 06:08:51,427 INFO L290 TraceCheckUtils]: 128: Hoare triple {197539#(<= ~counter~0 14)} assume !(~r~0 > 0); {197539#(<= ~counter~0 14)} is VALID [2022-04-28 06:08:51,429 INFO L290 TraceCheckUtils]: 129: Hoare triple {197539#(<= ~counter~0 14)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {197564#(<= ~counter~0 15)} is VALID [2022-04-28 06:08:51,430 INFO L290 TraceCheckUtils]: 130: Hoare triple {197564#(<= ~counter~0 15)} assume !!(#t~post8 < 100);havoc #t~post8; {197564#(<= ~counter~0 15)} is VALID [2022-04-28 06:08:51,430 INFO L272 TraceCheckUtils]: 131: Hoare triple {197564#(<= ~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)); {197564#(<= ~counter~0 15)} is VALID [2022-04-28 06:08:51,430 INFO L290 TraceCheckUtils]: 132: Hoare triple {197564#(<= ~counter~0 15)} ~cond := #in~cond; {197564#(<= ~counter~0 15)} is VALID [2022-04-28 06:08:51,431 INFO L290 TraceCheckUtils]: 133: Hoare triple {197564#(<= ~counter~0 15)} assume !(0 == ~cond); {197564#(<= ~counter~0 15)} is VALID [2022-04-28 06:08:51,431 INFO L290 TraceCheckUtils]: 134: Hoare triple {197564#(<= ~counter~0 15)} assume true; {197564#(<= ~counter~0 15)} is VALID [2022-04-28 06:08:51,431 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {197564#(<= ~counter~0 15)} {197564#(<= ~counter~0 15)} #98#return; {197564#(<= ~counter~0 15)} is VALID [2022-04-28 06:08:51,432 INFO L290 TraceCheckUtils]: 136: Hoare triple {197564#(<= ~counter~0 15)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {197564#(<= ~counter~0 15)} is VALID [2022-04-28 06:08:51,434 INFO L290 TraceCheckUtils]: 137: Hoare triple {197564#(<= ~counter~0 15)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {197589#(<= ~counter~0 16)} is VALID [2022-04-28 06:08:51,435 INFO L290 TraceCheckUtils]: 138: Hoare triple {197589#(<= ~counter~0 16)} assume !!(#t~post8 < 100);havoc #t~post8; {197589#(<= ~counter~0 16)} is VALID [2022-04-28 06:08:51,435 INFO L272 TraceCheckUtils]: 139: Hoare triple {197589#(<= ~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)); {197589#(<= ~counter~0 16)} is VALID [2022-04-28 06:08:51,436 INFO L290 TraceCheckUtils]: 140: Hoare triple {197589#(<= ~counter~0 16)} ~cond := #in~cond; {197589#(<= ~counter~0 16)} is VALID [2022-04-28 06:08:51,436 INFO L290 TraceCheckUtils]: 141: Hoare triple {197589#(<= ~counter~0 16)} assume !(0 == ~cond); {197589#(<= ~counter~0 16)} is VALID [2022-04-28 06:08:51,436 INFO L290 TraceCheckUtils]: 142: Hoare triple {197589#(<= ~counter~0 16)} assume true; {197589#(<= ~counter~0 16)} is VALID [2022-04-28 06:08:51,436 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {197589#(<= ~counter~0 16)} {197589#(<= ~counter~0 16)} #98#return; {197589#(<= ~counter~0 16)} is VALID [2022-04-28 06:08:51,437 INFO L290 TraceCheckUtils]: 144: Hoare triple {197589#(<= ~counter~0 16)} assume !(~r~0 < 0); {197589#(<= ~counter~0 16)} is VALID [2022-04-28 06:08:51,440 INFO L290 TraceCheckUtils]: 145: Hoare triple {197589#(<= ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {197614#(<= ~counter~0 17)} is VALID [2022-04-28 06:08:51,440 INFO L290 TraceCheckUtils]: 146: Hoare triple {197614#(<= ~counter~0 17)} assume !!(#t~post6 < 100);havoc #t~post6; {197614#(<= ~counter~0 17)} is VALID [2022-04-28 06:08:51,441 INFO L272 TraceCheckUtils]: 147: Hoare triple {197614#(<= ~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)); {197614#(<= ~counter~0 17)} is VALID [2022-04-28 06:08:51,441 INFO L290 TraceCheckUtils]: 148: Hoare triple {197614#(<= ~counter~0 17)} ~cond := #in~cond; {197614#(<= ~counter~0 17)} is VALID [2022-04-28 06:08:51,441 INFO L290 TraceCheckUtils]: 149: Hoare triple {197614#(<= ~counter~0 17)} assume !(0 == ~cond); {197614#(<= ~counter~0 17)} is VALID [2022-04-28 06:08:51,442 INFO L290 TraceCheckUtils]: 150: Hoare triple {197614#(<= ~counter~0 17)} assume true; {197614#(<= ~counter~0 17)} is VALID [2022-04-28 06:08:51,442 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {197614#(<= ~counter~0 17)} {197614#(<= ~counter~0 17)} #94#return; {197614#(<= ~counter~0 17)} is VALID [2022-04-28 06:08:51,442 INFO L290 TraceCheckUtils]: 152: Hoare triple {197614#(<= ~counter~0 17)} assume !!(0 != ~r~0); {197614#(<= ~counter~0 17)} is VALID [2022-04-28 06:08:51,445 INFO L290 TraceCheckUtils]: 153: Hoare triple {197614#(<= ~counter~0 17)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {197639#(<= ~counter~0 18)} is VALID [2022-04-28 06:08:51,445 INFO L290 TraceCheckUtils]: 154: Hoare triple {197639#(<= ~counter~0 18)} assume !!(#t~post7 < 100);havoc #t~post7; {197639#(<= ~counter~0 18)} is VALID [2022-04-28 06:08:51,446 INFO L272 TraceCheckUtils]: 155: Hoare triple {197639#(<= ~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)); {197639#(<= ~counter~0 18)} is VALID [2022-04-28 06:08:51,446 INFO L290 TraceCheckUtils]: 156: Hoare triple {197639#(<= ~counter~0 18)} ~cond := #in~cond; {197639#(<= ~counter~0 18)} is VALID [2022-04-28 06:08:51,446 INFO L290 TraceCheckUtils]: 157: Hoare triple {197639#(<= ~counter~0 18)} assume !(0 == ~cond); {197639#(<= ~counter~0 18)} is VALID [2022-04-28 06:08:51,446 INFO L290 TraceCheckUtils]: 158: Hoare triple {197639#(<= ~counter~0 18)} assume true; {197639#(<= ~counter~0 18)} is VALID [2022-04-28 06:08:51,447 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {197639#(<= ~counter~0 18)} {197639#(<= ~counter~0 18)} #96#return; {197639#(<= ~counter~0 18)} is VALID [2022-04-28 06:08:51,447 INFO L290 TraceCheckUtils]: 160: Hoare triple {197639#(<= ~counter~0 18)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {197639#(<= ~counter~0 18)} is VALID [2022-04-28 06:08:51,447 INFO L290 TraceCheckUtils]: 161: Hoare triple {197639#(<= ~counter~0 18)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {197664#(<= |main_#t~post7| 18)} is VALID [2022-04-28 06:08:51,448 INFO L290 TraceCheckUtils]: 162: Hoare triple {197664#(<= |main_#t~post7| 18)} assume !(#t~post7 < 100);havoc #t~post7; {197158#false} is VALID [2022-04-28 06:08:51,448 INFO L290 TraceCheckUtils]: 163: Hoare triple {197158#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {197158#false} is VALID [2022-04-28 06:08:51,448 INFO L290 TraceCheckUtils]: 164: Hoare triple {197158#false} assume !(#t~post8 < 100);havoc #t~post8; {197158#false} is VALID [2022-04-28 06:08:51,448 INFO L290 TraceCheckUtils]: 165: Hoare triple {197158#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {197158#false} is VALID [2022-04-28 06:08:51,448 INFO L290 TraceCheckUtils]: 166: Hoare triple {197158#false} assume !(#t~post6 < 100);havoc #t~post6; {197158#false} is VALID [2022-04-28 06:08:51,448 INFO L272 TraceCheckUtils]: 167: Hoare triple {197158#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)); {197158#false} is VALID [2022-04-28 06:08:51,448 INFO L290 TraceCheckUtils]: 168: Hoare triple {197158#false} ~cond := #in~cond; {197158#false} is VALID [2022-04-28 06:08:51,448 INFO L290 TraceCheckUtils]: 169: Hoare triple {197158#false} assume 0 == ~cond; {197158#false} is VALID [2022-04-28 06:08:51,448 INFO L290 TraceCheckUtils]: 170: Hoare triple {197158#false} assume !false; {197158#false} is VALID [2022-04-28 06:08:51,449 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-28 06:08:51,449 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:08:52,794 INFO L290 TraceCheckUtils]: 170: Hoare triple {197158#false} assume !false; {197158#false} is VALID [2022-04-28 06:08:52,794 INFO L290 TraceCheckUtils]: 169: Hoare triple {197158#false} assume 0 == ~cond; {197158#false} is VALID [2022-04-28 06:08:52,794 INFO L290 TraceCheckUtils]: 168: Hoare triple {197158#false} ~cond := #in~cond; {197158#false} is VALID [2022-04-28 06:08:52,794 INFO L272 TraceCheckUtils]: 167: Hoare triple {197158#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)); {197158#false} is VALID [2022-04-28 06:08:52,794 INFO L290 TraceCheckUtils]: 166: Hoare triple {197158#false} assume !(#t~post6 < 100);havoc #t~post6; {197158#false} is VALID [2022-04-28 06:08:52,794 INFO L290 TraceCheckUtils]: 165: Hoare triple {197158#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {197158#false} is VALID [2022-04-28 06:08:52,794 INFO L290 TraceCheckUtils]: 164: Hoare triple {197158#false} assume !(#t~post8 < 100);havoc #t~post8; {197158#false} is VALID [2022-04-28 06:08:52,794 INFO L290 TraceCheckUtils]: 163: Hoare triple {197158#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {197158#false} is VALID [2022-04-28 06:08:52,795 INFO L290 TraceCheckUtils]: 162: Hoare triple {197716#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {197158#false} is VALID [2022-04-28 06:08:52,795 INFO L290 TraceCheckUtils]: 161: Hoare triple {197720#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {197716#(< |main_#t~post7| 100)} is VALID [2022-04-28 06:08:52,795 INFO L290 TraceCheckUtils]: 160: Hoare triple {197720#(< ~counter~0 100)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {197720#(< ~counter~0 100)} is VALID [2022-04-28 06:08:52,796 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {197157#true} {197720#(< ~counter~0 100)} #96#return; {197720#(< ~counter~0 100)} is VALID [2022-04-28 06:08:52,796 INFO L290 TraceCheckUtils]: 158: Hoare triple {197157#true} assume true; {197157#true} is VALID [2022-04-28 06:08:52,796 INFO L290 TraceCheckUtils]: 157: Hoare triple {197157#true} assume !(0 == ~cond); {197157#true} is VALID [2022-04-28 06:08:52,796 INFO L290 TraceCheckUtils]: 156: Hoare triple {197157#true} ~cond := #in~cond; {197157#true} is VALID [2022-04-28 06:08:52,796 INFO L272 TraceCheckUtils]: 155: Hoare triple {197720#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {197157#true} is VALID [2022-04-28 06:08:52,796 INFO L290 TraceCheckUtils]: 154: Hoare triple {197720#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {197720#(< ~counter~0 100)} is VALID [2022-04-28 06:08:52,801 INFO L290 TraceCheckUtils]: 153: Hoare triple {197745#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {197720#(< ~counter~0 100)} is VALID [2022-04-28 06:08:52,801 INFO L290 TraceCheckUtils]: 152: Hoare triple {197745#(< ~counter~0 99)} assume !!(0 != ~r~0); {197745#(< ~counter~0 99)} is VALID [2022-04-28 06:08:52,802 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {197157#true} {197745#(< ~counter~0 99)} #94#return; {197745#(< ~counter~0 99)} is VALID [2022-04-28 06:08:52,802 INFO L290 TraceCheckUtils]: 150: Hoare triple {197157#true} assume true; {197157#true} is VALID [2022-04-28 06:08:52,802 INFO L290 TraceCheckUtils]: 149: Hoare triple {197157#true} assume !(0 == ~cond); {197157#true} is VALID [2022-04-28 06:08:52,802 INFO L290 TraceCheckUtils]: 148: Hoare triple {197157#true} ~cond := #in~cond; {197157#true} is VALID [2022-04-28 06:08:52,802 INFO L272 TraceCheckUtils]: 147: Hoare triple {197745#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {197157#true} is VALID [2022-04-28 06:08:52,802 INFO L290 TraceCheckUtils]: 146: Hoare triple {197745#(< ~counter~0 99)} assume !!(#t~post6 < 100);havoc #t~post6; {197745#(< ~counter~0 99)} is VALID [2022-04-28 06:08:52,805 INFO L290 TraceCheckUtils]: 145: Hoare triple {197770#(< ~counter~0 98)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {197745#(< ~counter~0 99)} is VALID [2022-04-28 06:08:52,805 INFO L290 TraceCheckUtils]: 144: Hoare triple {197770#(< ~counter~0 98)} assume !(~r~0 < 0); {197770#(< ~counter~0 98)} is VALID [2022-04-28 06:08:52,805 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {197157#true} {197770#(< ~counter~0 98)} #98#return; {197770#(< ~counter~0 98)} is VALID [2022-04-28 06:08:52,805 INFO L290 TraceCheckUtils]: 142: Hoare triple {197157#true} assume true; {197157#true} is VALID [2022-04-28 06:08:52,806 INFO L290 TraceCheckUtils]: 141: Hoare triple {197157#true} assume !(0 == ~cond); {197157#true} is VALID [2022-04-28 06:08:52,806 INFO L290 TraceCheckUtils]: 140: Hoare triple {197157#true} ~cond := #in~cond; {197157#true} is VALID [2022-04-28 06:08:52,806 INFO L272 TraceCheckUtils]: 139: Hoare triple {197770#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {197157#true} is VALID [2022-04-28 06:08:52,806 INFO L290 TraceCheckUtils]: 138: Hoare triple {197770#(< ~counter~0 98)} assume !!(#t~post8 < 100);havoc #t~post8; {197770#(< ~counter~0 98)} is VALID [2022-04-28 06:08:52,808 INFO L290 TraceCheckUtils]: 137: Hoare triple {197795#(< ~counter~0 97)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {197770#(< ~counter~0 98)} is VALID [2022-04-28 06:08:52,808 INFO L290 TraceCheckUtils]: 136: Hoare triple {197795#(< ~counter~0 97)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {197795#(< ~counter~0 97)} is VALID [2022-04-28 06:08:52,809 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {197157#true} {197795#(< ~counter~0 97)} #98#return; {197795#(< ~counter~0 97)} is VALID [2022-04-28 06:08:52,809 INFO L290 TraceCheckUtils]: 134: Hoare triple {197157#true} assume true; {197157#true} is VALID [2022-04-28 06:08:52,809 INFO L290 TraceCheckUtils]: 133: Hoare triple {197157#true} assume !(0 == ~cond); {197157#true} is VALID [2022-04-28 06:08:52,809 INFO L290 TraceCheckUtils]: 132: Hoare triple {197157#true} ~cond := #in~cond; {197157#true} is VALID [2022-04-28 06:08:52,809 INFO L272 TraceCheckUtils]: 131: Hoare triple {197795#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {197157#true} is VALID [2022-04-28 06:08:52,810 INFO L290 TraceCheckUtils]: 130: Hoare triple {197795#(< ~counter~0 97)} assume !!(#t~post8 < 100);havoc #t~post8; {197795#(< ~counter~0 97)} is VALID [2022-04-28 06:08:52,812 INFO L290 TraceCheckUtils]: 129: Hoare triple {197820#(< ~counter~0 96)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {197795#(< ~counter~0 97)} is VALID [2022-04-28 06:08:52,812 INFO L290 TraceCheckUtils]: 128: Hoare triple {197820#(< ~counter~0 96)} assume !(~r~0 > 0); {197820#(< ~counter~0 96)} is VALID [2022-04-28 06:08:52,812 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {197157#true} {197820#(< ~counter~0 96)} #96#return; {197820#(< ~counter~0 96)} is VALID [2022-04-28 06:08:52,813 INFO L290 TraceCheckUtils]: 126: Hoare triple {197157#true} assume true; {197157#true} is VALID [2022-04-28 06:08:52,813 INFO L290 TraceCheckUtils]: 125: Hoare triple {197157#true} assume !(0 == ~cond); {197157#true} is VALID [2022-04-28 06:08:52,813 INFO L290 TraceCheckUtils]: 124: Hoare triple {197157#true} ~cond := #in~cond; {197157#true} is VALID [2022-04-28 06:08:52,813 INFO L272 TraceCheckUtils]: 123: Hoare triple {197820#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {197157#true} is VALID [2022-04-28 06:08:52,813 INFO L290 TraceCheckUtils]: 122: Hoare triple {197820#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {197820#(< ~counter~0 96)} is VALID [2022-04-28 06:08:52,816 INFO L290 TraceCheckUtils]: 121: Hoare triple {197845#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {197820#(< ~counter~0 96)} is VALID [2022-04-28 06:08:52,816 INFO L290 TraceCheckUtils]: 120: Hoare triple {197845#(< ~counter~0 95)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {197845#(< ~counter~0 95)} is VALID [2022-04-28 06:08:52,817 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {197157#true} {197845#(< ~counter~0 95)} #96#return; {197845#(< ~counter~0 95)} is VALID [2022-04-28 06:08:52,817 INFO L290 TraceCheckUtils]: 118: Hoare triple {197157#true} assume true; {197157#true} is VALID [2022-04-28 06:08:52,817 INFO L290 TraceCheckUtils]: 117: Hoare triple {197157#true} assume !(0 == ~cond); {197157#true} is VALID [2022-04-28 06:08:52,817 INFO L290 TraceCheckUtils]: 116: Hoare triple {197157#true} ~cond := #in~cond; {197157#true} is VALID [2022-04-28 06:08:52,817 INFO L272 TraceCheckUtils]: 115: Hoare triple {197845#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {197157#true} is VALID [2022-04-28 06:08:52,817 INFO L290 TraceCheckUtils]: 114: Hoare triple {197845#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {197845#(< ~counter~0 95)} is VALID [2022-04-28 06:08:52,819 INFO L290 TraceCheckUtils]: 113: Hoare triple {197870#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {197845#(< ~counter~0 95)} is VALID [2022-04-28 06:08:52,819 INFO L290 TraceCheckUtils]: 112: Hoare triple {197870#(< ~counter~0 94)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {197870#(< ~counter~0 94)} is VALID [2022-04-28 06:08:52,820 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {197157#true} {197870#(< ~counter~0 94)} #96#return; {197870#(< ~counter~0 94)} is VALID [2022-04-28 06:08:52,820 INFO L290 TraceCheckUtils]: 110: Hoare triple {197157#true} assume true; {197157#true} is VALID [2022-04-28 06:08:52,820 INFO L290 TraceCheckUtils]: 109: Hoare triple {197157#true} assume !(0 == ~cond); {197157#true} is VALID [2022-04-28 06:08:52,820 INFO L290 TraceCheckUtils]: 108: Hoare triple {197157#true} ~cond := #in~cond; {197157#true} is VALID [2022-04-28 06:08:52,820 INFO L272 TraceCheckUtils]: 107: Hoare triple {197870#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {197157#true} is VALID [2022-04-28 06:08:52,820 INFO L290 TraceCheckUtils]: 106: Hoare triple {197870#(< ~counter~0 94)} assume !!(#t~post7 < 100);havoc #t~post7; {197870#(< ~counter~0 94)} is VALID [2022-04-28 06:08:52,823 INFO L290 TraceCheckUtils]: 105: Hoare triple {197895#(< ~counter~0 93)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {197870#(< ~counter~0 94)} is VALID [2022-04-28 06:08:52,823 INFO L290 TraceCheckUtils]: 104: Hoare triple {197895#(< ~counter~0 93)} assume !!(0 != ~r~0); {197895#(< ~counter~0 93)} is VALID [2022-04-28 06:08:52,824 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {197157#true} {197895#(< ~counter~0 93)} #94#return; {197895#(< ~counter~0 93)} is VALID [2022-04-28 06:08:52,824 INFO L290 TraceCheckUtils]: 102: Hoare triple {197157#true} assume true; {197157#true} is VALID [2022-04-28 06:08:52,824 INFO L290 TraceCheckUtils]: 101: Hoare triple {197157#true} assume !(0 == ~cond); {197157#true} is VALID [2022-04-28 06:08:52,824 INFO L290 TraceCheckUtils]: 100: Hoare triple {197157#true} ~cond := #in~cond; {197157#true} is VALID [2022-04-28 06:08:52,824 INFO L272 TraceCheckUtils]: 99: Hoare triple {197895#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {197157#true} is VALID [2022-04-28 06:08:52,824 INFO L290 TraceCheckUtils]: 98: Hoare triple {197895#(< ~counter~0 93)} assume !!(#t~post6 < 100);havoc #t~post6; {197895#(< ~counter~0 93)} is VALID [2022-04-28 06:08:52,829 INFO L290 TraceCheckUtils]: 97: Hoare triple {197920#(< ~counter~0 92)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {197895#(< ~counter~0 93)} is VALID [2022-04-28 06:08:52,829 INFO L290 TraceCheckUtils]: 96: Hoare triple {197920#(< ~counter~0 92)} assume !(~r~0 < 0); {197920#(< ~counter~0 92)} is VALID [2022-04-28 06:08:52,830 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {197157#true} {197920#(< ~counter~0 92)} #98#return; {197920#(< ~counter~0 92)} is VALID [2022-04-28 06:08:52,830 INFO L290 TraceCheckUtils]: 94: Hoare triple {197157#true} assume true; {197157#true} is VALID [2022-04-28 06:08:52,830 INFO L290 TraceCheckUtils]: 93: Hoare triple {197157#true} assume !(0 == ~cond); {197157#true} is VALID [2022-04-28 06:08:52,830 INFO L290 TraceCheckUtils]: 92: Hoare triple {197157#true} ~cond := #in~cond; {197157#true} is VALID [2022-04-28 06:08:52,830 INFO L272 TraceCheckUtils]: 91: Hoare triple {197920#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {197157#true} is VALID [2022-04-28 06:08:52,830 INFO L290 TraceCheckUtils]: 90: Hoare triple {197920#(< ~counter~0 92)} assume !!(#t~post8 < 100);havoc #t~post8; {197920#(< ~counter~0 92)} is VALID [2022-04-28 06:08:52,834 INFO L290 TraceCheckUtils]: 89: Hoare triple {197945#(< ~counter~0 91)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {197920#(< ~counter~0 92)} is VALID [2022-04-28 06:08:52,835 INFO L290 TraceCheckUtils]: 88: Hoare triple {197945#(< ~counter~0 91)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {197945#(< ~counter~0 91)} is VALID [2022-04-28 06:08:52,835 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {197157#true} {197945#(< ~counter~0 91)} #98#return; {197945#(< ~counter~0 91)} is VALID [2022-04-28 06:08:52,835 INFO L290 TraceCheckUtils]: 86: Hoare triple {197157#true} assume true; {197157#true} is VALID [2022-04-28 06:08:52,835 INFO L290 TraceCheckUtils]: 85: Hoare triple {197157#true} assume !(0 == ~cond); {197157#true} is VALID [2022-04-28 06:08:52,835 INFO L290 TraceCheckUtils]: 84: Hoare triple {197157#true} ~cond := #in~cond; {197157#true} is VALID [2022-04-28 06:08:52,836 INFO L272 TraceCheckUtils]: 83: Hoare triple {197945#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {197157#true} is VALID [2022-04-28 06:08:52,836 INFO L290 TraceCheckUtils]: 82: Hoare triple {197945#(< ~counter~0 91)} assume !!(#t~post8 < 100);havoc #t~post8; {197945#(< ~counter~0 91)} is VALID [2022-04-28 06:08:52,840 INFO L290 TraceCheckUtils]: 81: Hoare triple {197970#(< ~counter~0 90)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {197945#(< ~counter~0 91)} is VALID [2022-04-28 06:08:52,841 INFO L290 TraceCheckUtils]: 80: Hoare triple {197970#(< ~counter~0 90)} assume !(~r~0 > 0); {197970#(< ~counter~0 90)} is VALID [2022-04-28 06:08:52,841 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {197157#true} {197970#(< ~counter~0 90)} #96#return; {197970#(< ~counter~0 90)} is VALID [2022-04-28 06:08:52,842 INFO L290 TraceCheckUtils]: 78: Hoare triple {197157#true} assume true; {197157#true} is VALID [2022-04-28 06:08:52,842 INFO L290 TraceCheckUtils]: 77: Hoare triple {197157#true} assume !(0 == ~cond); {197157#true} is VALID [2022-04-28 06:08:52,842 INFO L290 TraceCheckUtils]: 76: Hoare triple {197157#true} ~cond := #in~cond; {197157#true} is VALID [2022-04-28 06:08:52,842 INFO L272 TraceCheckUtils]: 75: Hoare triple {197970#(< ~counter~0 90)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {197157#true} is VALID [2022-04-28 06:08:52,842 INFO L290 TraceCheckUtils]: 74: Hoare triple {197970#(< ~counter~0 90)} assume !!(#t~post7 < 100);havoc #t~post7; {197970#(< ~counter~0 90)} is VALID [2022-04-28 06:08:52,847 INFO L290 TraceCheckUtils]: 73: Hoare triple {197995#(< ~counter~0 89)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {197970#(< ~counter~0 90)} is VALID [2022-04-28 06:08:52,848 INFO L290 TraceCheckUtils]: 72: Hoare triple {197995#(< ~counter~0 89)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {197995#(< ~counter~0 89)} is VALID [2022-04-28 06:08:52,848 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {197157#true} {197995#(< ~counter~0 89)} #96#return; {197995#(< ~counter~0 89)} is VALID [2022-04-28 06:08:52,848 INFO L290 TraceCheckUtils]: 70: Hoare triple {197157#true} assume true; {197157#true} is VALID [2022-04-28 06:08:52,848 INFO L290 TraceCheckUtils]: 69: Hoare triple {197157#true} assume !(0 == ~cond); {197157#true} is VALID [2022-04-28 06:08:52,849 INFO L290 TraceCheckUtils]: 68: Hoare triple {197157#true} ~cond := #in~cond; {197157#true} is VALID [2022-04-28 06:08:52,849 INFO L272 TraceCheckUtils]: 67: Hoare triple {197995#(< ~counter~0 89)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {197157#true} is VALID [2022-04-28 06:08:52,849 INFO L290 TraceCheckUtils]: 66: Hoare triple {197995#(< ~counter~0 89)} assume !!(#t~post7 < 100);havoc #t~post7; {197995#(< ~counter~0 89)} is VALID [2022-04-28 06:08:52,853 INFO L290 TraceCheckUtils]: 65: Hoare triple {198020#(< ~counter~0 88)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {197995#(< ~counter~0 89)} is VALID [2022-04-28 06:08:52,853 INFO L290 TraceCheckUtils]: 64: Hoare triple {198020#(< ~counter~0 88)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {198020#(< ~counter~0 88)} is VALID [2022-04-28 06:08:52,854 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {197157#true} {198020#(< ~counter~0 88)} #96#return; {198020#(< ~counter~0 88)} is VALID [2022-04-28 06:08:52,854 INFO L290 TraceCheckUtils]: 62: Hoare triple {197157#true} assume true; {197157#true} is VALID [2022-04-28 06:08:52,854 INFO L290 TraceCheckUtils]: 61: Hoare triple {197157#true} assume !(0 == ~cond); {197157#true} is VALID [2022-04-28 06:08:52,854 INFO L290 TraceCheckUtils]: 60: Hoare triple {197157#true} ~cond := #in~cond; {197157#true} is VALID [2022-04-28 06:08:52,854 INFO L272 TraceCheckUtils]: 59: Hoare triple {198020#(< ~counter~0 88)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {197157#true} is VALID [2022-04-28 06:08:52,854 INFO L290 TraceCheckUtils]: 58: Hoare triple {198020#(< ~counter~0 88)} assume !!(#t~post7 < 100);havoc #t~post7; {198020#(< ~counter~0 88)} is VALID [2022-04-28 06:08:52,857 INFO L290 TraceCheckUtils]: 57: Hoare triple {198045#(< ~counter~0 87)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {198020#(< ~counter~0 88)} is VALID [2022-04-28 06:08:52,857 INFO L290 TraceCheckUtils]: 56: Hoare triple {198045#(< ~counter~0 87)} assume !!(0 != ~r~0); {198045#(< ~counter~0 87)} is VALID [2022-04-28 06:08:52,858 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {197157#true} {198045#(< ~counter~0 87)} #94#return; {198045#(< ~counter~0 87)} is VALID [2022-04-28 06:08:52,858 INFO L290 TraceCheckUtils]: 54: Hoare triple {197157#true} assume true; {197157#true} is VALID [2022-04-28 06:08:52,858 INFO L290 TraceCheckUtils]: 53: Hoare triple {197157#true} assume !(0 == ~cond); {197157#true} is VALID [2022-04-28 06:08:52,858 INFO L290 TraceCheckUtils]: 52: Hoare triple {197157#true} ~cond := #in~cond; {197157#true} is VALID [2022-04-28 06:08:52,858 INFO L272 TraceCheckUtils]: 51: Hoare triple {198045#(< ~counter~0 87)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {197157#true} is VALID [2022-04-28 06:08:52,858 INFO L290 TraceCheckUtils]: 50: Hoare triple {198045#(< ~counter~0 87)} assume !!(#t~post6 < 100);havoc #t~post6; {198045#(< ~counter~0 87)} is VALID [2022-04-28 06:08:52,860 INFO L290 TraceCheckUtils]: 49: Hoare triple {198070#(< ~counter~0 86)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {198045#(< ~counter~0 87)} is VALID [2022-04-28 06:08:52,860 INFO L290 TraceCheckUtils]: 48: Hoare triple {198070#(< ~counter~0 86)} assume !(~r~0 < 0); {198070#(< ~counter~0 86)} is VALID [2022-04-28 06:08:52,861 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {197157#true} {198070#(< ~counter~0 86)} #98#return; {198070#(< ~counter~0 86)} is VALID [2022-04-28 06:08:52,861 INFO L290 TraceCheckUtils]: 46: Hoare triple {197157#true} assume true; {197157#true} is VALID [2022-04-28 06:08:52,861 INFO L290 TraceCheckUtils]: 45: Hoare triple {197157#true} assume !(0 == ~cond); {197157#true} is VALID [2022-04-28 06:08:52,861 INFO L290 TraceCheckUtils]: 44: Hoare triple {197157#true} ~cond := #in~cond; {197157#true} is VALID [2022-04-28 06:08:52,861 INFO L272 TraceCheckUtils]: 43: Hoare triple {198070#(< ~counter~0 86)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {197157#true} is VALID [2022-04-28 06:08:52,861 INFO L290 TraceCheckUtils]: 42: Hoare triple {198070#(< ~counter~0 86)} assume !!(#t~post8 < 100);havoc #t~post8; {198070#(< ~counter~0 86)} is VALID [2022-04-28 06:08:52,863 INFO L290 TraceCheckUtils]: 41: Hoare triple {198095#(< ~counter~0 85)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {198070#(< ~counter~0 86)} is VALID [2022-04-28 06:08:52,863 INFO L290 TraceCheckUtils]: 40: Hoare triple {198095#(< ~counter~0 85)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {198095#(< ~counter~0 85)} is VALID [2022-04-28 06:08:52,864 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {197157#true} {198095#(< ~counter~0 85)} #98#return; {198095#(< ~counter~0 85)} is VALID [2022-04-28 06:08:52,864 INFO L290 TraceCheckUtils]: 38: Hoare triple {197157#true} assume true; {197157#true} is VALID [2022-04-28 06:08:52,864 INFO L290 TraceCheckUtils]: 37: Hoare triple {197157#true} assume !(0 == ~cond); {197157#true} is VALID [2022-04-28 06:08:52,864 INFO L290 TraceCheckUtils]: 36: Hoare triple {197157#true} ~cond := #in~cond; {197157#true} is VALID [2022-04-28 06:08:52,864 INFO L272 TraceCheckUtils]: 35: Hoare triple {198095#(< ~counter~0 85)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {197157#true} is VALID [2022-04-28 06:08:52,864 INFO L290 TraceCheckUtils]: 34: Hoare triple {198095#(< ~counter~0 85)} assume !!(#t~post8 < 100);havoc #t~post8; {198095#(< ~counter~0 85)} is VALID [2022-04-28 06:08:52,866 INFO L290 TraceCheckUtils]: 33: Hoare triple {198120#(< ~counter~0 84)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {198095#(< ~counter~0 85)} is VALID [2022-04-28 06:08:52,866 INFO L290 TraceCheckUtils]: 32: Hoare triple {198120#(< ~counter~0 84)} assume !(~r~0 > 0); {198120#(< ~counter~0 84)} is VALID [2022-04-28 06:08:52,867 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {197157#true} {198120#(< ~counter~0 84)} #96#return; {198120#(< ~counter~0 84)} is VALID [2022-04-28 06:08:52,867 INFO L290 TraceCheckUtils]: 30: Hoare triple {197157#true} assume true; {197157#true} is VALID [2022-04-28 06:08:52,867 INFO L290 TraceCheckUtils]: 29: Hoare triple {197157#true} assume !(0 == ~cond); {197157#true} is VALID [2022-04-28 06:08:52,867 INFO L290 TraceCheckUtils]: 28: Hoare triple {197157#true} ~cond := #in~cond; {197157#true} is VALID [2022-04-28 06:08:52,867 INFO L272 TraceCheckUtils]: 27: Hoare triple {198120#(< ~counter~0 84)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {197157#true} is VALID [2022-04-28 06:08:52,867 INFO L290 TraceCheckUtils]: 26: Hoare triple {198120#(< ~counter~0 84)} assume !!(#t~post7 < 100);havoc #t~post7; {198120#(< ~counter~0 84)} is VALID [2022-04-28 06:08:52,869 INFO L290 TraceCheckUtils]: 25: Hoare triple {198145#(< ~counter~0 83)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {198120#(< ~counter~0 84)} is VALID [2022-04-28 06:08:52,869 INFO L290 TraceCheckUtils]: 24: Hoare triple {198145#(< ~counter~0 83)} assume !!(0 != ~r~0); {198145#(< ~counter~0 83)} is VALID [2022-04-28 06:08:52,870 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {197157#true} {198145#(< ~counter~0 83)} #94#return; {198145#(< ~counter~0 83)} is VALID [2022-04-28 06:08:52,870 INFO L290 TraceCheckUtils]: 22: Hoare triple {197157#true} assume true; {197157#true} is VALID [2022-04-28 06:08:52,870 INFO L290 TraceCheckUtils]: 21: Hoare triple {197157#true} assume !(0 == ~cond); {197157#true} is VALID [2022-04-28 06:08:52,870 INFO L290 TraceCheckUtils]: 20: Hoare triple {197157#true} ~cond := #in~cond; {197157#true} is VALID [2022-04-28 06:08:52,870 INFO L272 TraceCheckUtils]: 19: Hoare triple {198145#(< ~counter~0 83)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {197157#true} is VALID [2022-04-28 06:08:52,870 INFO L290 TraceCheckUtils]: 18: Hoare triple {198145#(< ~counter~0 83)} assume !!(#t~post6 < 100);havoc #t~post6; {198145#(< ~counter~0 83)} is VALID [2022-04-28 06:08:52,872 INFO L290 TraceCheckUtils]: 17: Hoare triple {198170#(< ~counter~0 82)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {198145#(< ~counter~0 83)} is VALID [2022-04-28 06:08:52,872 INFO L290 TraceCheckUtils]: 16: Hoare triple {198170#(< ~counter~0 82)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {198170#(< ~counter~0 82)} is VALID [2022-04-28 06:08:52,873 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {197157#true} {198170#(< ~counter~0 82)} #92#return; {198170#(< ~counter~0 82)} is VALID [2022-04-28 06:08:52,873 INFO L290 TraceCheckUtils]: 14: Hoare triple {197157#true} assume true; {197157#true} is VALID [2022-04-28 06:08:52,873 INFO L290 TraceCheckUtils]: 13: Hoare triple {197157#true} assume !(0 == ~cond); {197157#true} is VALID [2022-04-28 06:08:52,873 INFO L290 TraceCheckUtils]: 12: Hoare triple {197157#true} ~cond := #in~cond; {197157#true} is VALID [2022-04-28 06:08:52,873 INFO L272 TraceCheckUtils]: 11: Hoare triple {198170#(< ~counter~0 82)} 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)); {197157#true} is VALID [2022-04-28 06:08:52,873 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {197157#true} {198170#(< ~counter~0 82)} #90#return; {198170#(< ~counter~0 82)} is VALID [2022-04-28 06:08:52,873 INFO L290 TraceCheckUtils]: 9: Hoare triple {197157#true} assume true; {197157#true} is VALID [2022-04-28 06:08:52,873 INFO L290 TraceCheckUtils]: 8: Hoare triple {197157#true} assume !(0 == ~cond); {197157#true} is VALID [2022-04-28 06:08:52,873 INFO L290 TraceCheckUtils]: 7: Hoare triple {197157#true} ~cond := #in~cond; {197157#true} is VALID [2022-04-28 06:08:52,874 INFO L272 TraceCheckUtils]: 6: Hoare triple {198170#(< ~counter~0 82)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {197157#true} is VALID [2022-04-28 06:08:52,874 INFO L290 TraceCheckUtils]: 5: Hoare triple {198170#(< ~counter~0 82)} 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; {198170#(< ~counter~0 82)} is VALID [2022-04-28 06:08:52,874 INFO L272 TraceCheckUtils]: 4: Hoare triple {198170#(< ~counter~0 82)} call #t~ret9 := main(); {198170#(< ~counter~0 82)} is VALID [2022-04-28 06:08:52,874 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {198170#(< ~counter~0 82)} {197157#true} #102#return; {198170#(< ~counter~0 82)} is VALID [2022-04-28 06:08:52,875 INFO L290 TraceCheckUtils]: 2: Hoare triple {198170#(< ~counter~0 82)} assume true; {198170#(< ~counter~0 82)} is VALID [2022-04-28 06:08:52,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {197157#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; {198170#(< ~counter~0 82)} is VALID [2022-04-28 06:08:52,875 INFO L272 TraceCheckUtils]: 0: Hoare triple {197157#true} call ULTIMATE.init(); {197157#true} is VALID [2022-04-28 06:08:52,875 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-28 06:08:52,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:08:52,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992592890] [2022-04-28 06:08:52,876 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:08:52,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790046216] [2022-04-28 06:08:52,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790046216] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:08:52,876 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:08:52,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 42 [2022-04-28 06:08:52,876 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:08:52,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [374265995] [2022-04-28 06:08:52,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [374265995] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:08:52,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:08:52,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 06:08:52,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532736597] [2022-04-28 06:08:52,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:08:52,877 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-28 06:08:52,877 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:08:52,877 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-28 06:08:53,167 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-28 06:08:53,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 06:08:53,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:08:53,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 06:08:53,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=785, Invalid=937, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 06:08:53,169 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)